Memory Free - Signals and Systems - Exam, Exams for Signals and Systems Theory. Biju Patnaik University of Technology, Rourkela
rajo
rajo

Memory Free - Signals and Systems - Exam, Exams for Signals and Systems Theory. Biju Patnaik University of Technology, Rourkela

4 pages
1000+Number of visits
Description
Main points of this exam paper are: Memory Free, Characterize, System, Reactive, Discrete Time, Causal, Finite State
20 points
Download points needed to download
this document
Download the document
Preview3 pages / 4
This is only a preview
3 shown on 4 pages
Download the document
This is only a preview
3 shown on 4 pages
Download the document
This is only a preview
3 shown on 4 pages
Download the document
This is only a preview
3 shown on 4 pages
Download the document
y.dvi

EECS  First Midterm Exam

February  

Last name First name

Student ID Lab user ID

Email Lab section

Problem   points

Nats  Nats



B

Delay 

Nats  Nats

If the rst four inputs are     what are the rst four outputs of B

  

Which of the following terms characterize the system B answer Yes or No for each

reactive Yes

discrete time Yes

memory free No

causal Yes

nite state No

deterministic Yes

Complete the following

B Nats  Nats Nats  Nats such that  x  Nats  Nats  y  Nats Bxy 

P zy xz



Problem   points

Draw the transition diagram of a state machine that implements the nondeterministic system A  Nats  Bins Nats  Bins such that  x  Nats  Bins  y  Nats  Bins x y  A i

 y     z  Nats  either yz  xz   or yz   and   z  Nats  if yz   then yz    

Note that A is a lossy channel with unit delay that never drops two inputs in a row

States

 previous input was   previous input was   previous input was dropped





 





 

 



 



Problem   points

Draw a block diagram consisting of and or not and Delay systems to implement the following state machine

false

true

false

true

Solution

Delay true

Delay true



Problem   points

Use minimization to nd the transition diagram of the smallest state machine that is equivalent to the following state machine



d 







 

a b

c

Splitting

ffa b c dgg

ffcg fa b dgg ffcg fag fb dgg

fag



fcg fb dg 





 



no comments were posted
This is only a preview
3 shown on 4 pages
Download the document