• No results found

Final exam DITE: Monday , January 12,2015 -- 14:00 to 17:00h

N/A
N/A
Protected

Academic year: 2021

Share "Final exam DITE: Monday , January 12,2015 -- 14:00 to 17:00h"

Copied!
1
0
0

Bezig met laden.... (Bekijk nu de volledige tekst)

Hele tekst

(1)

Final exam DITE: Monday , January 12,2015 -- 14:00 to 17:00h

Task

I:

Design two versions (Version

A

and Version B below) of the combinational

circuit

whose input is a 4-bit number and whose output is the 2's complement

of

the input number:

Version A) -

The

circuit is

a

simplified two-level circuit, plus

inverters as needed for the input variables.

Version B) -

The

circuit is

made

up of four

identical t'wo-input, two-output cells, one

for

each

bit.

Each

cell is

implemented using

only NOR

gates.

The celis

are connected

in

cascade,

with

lines

similar

to

a

carry between them. The value applied to the rightmost carry

bit

is 0.

Important:

Show and explain all the steps you do to implement the

circuit

above.

Task

II:

Implement one

D flip-flop

using the

following

components: one T

flip-flop

and one

Multiplexer

2-to-1.

Important:

Show and explain all the steps you do to implement the

circuit

above.

Thsk III: A

sequential

circuit with two flip-flops A

and

B,

one

input X,

and one

output

Z

is specified by the

following

equations:

A(t+l) : X(r)',A(t)

+

X(t)B(t) B(t+l) :

X(t)',A(t)',

z(t) : x(t)A(t)

+

x(t)'B(t)'

Transform and implement the

circuit

described above as

Moore Finite

State

Machine (FSM)

under the

following

conditions:

1.

Use only

NAND

gates and SR Flip-Flops;

2.

Derive and show the state table of the Moore

FSM;

3.

Derive and show the state diagram of the

Moore FSM;

4.

Draw the logic diagram of the

Moore

FSM.

Important:

Show and explain all the steps you do to implement the

circuit

above.

Referenties

GERELATEERDE DOCUMENTEN

If you write readable, unambiguous, and technically correct, you get one point for free (in particular, do not write “line” if you mean “line segment”, do not write “wedge”

More precisely, the collection of all lines that intersect a line segment dualizes to the collection of all points inside the double wedge that is the dual of that line segment3.

If it does not lie below the current solution, then the new solution is the intersection of the line just added with some line from L p , namely the one that has the

Read every question carefully, make sure you understand it, and be sure to answer the question.. Read the question again after answering it, as

(b) Describe a data structure requiring expected linear storage that allows us to determine the first segment in S intersected by a ray running vertically upward from a query point (

Exam Measure Theoretic Probability 14 January 20091. Formulate and prove the Monotone

(g) Sketch three small pieces of a network that is ruptured, connected, and just connected, and use these configurations to explain in a few words how rupture can be seen as

Hint: Treat the zeroth and first order terms separately. Notice that solving the recurrence. relation is not