Blog

Given: A finite state machine has 21 states.  What is the minimum number of flip-flops required if binary encoding is used to encode the state?

A state transition diagram for a finite state machine is given. The clock input is 100 MHz. Suppose the FSM is currently in state S1 and the inputs are AB = 11.  What will the state be after the next clock edge?  What will the output be?

Given: 01000000101100000000000000000000 is an IEEE-754 single precision floating-point number.  What are the first 6 bits of the mantissa (ex: “0.00000”)?

A circuit that implements a finite state machine is given. The clock input is 100 MHz. Suppose the current state of the FSM is S1:0 = 11 and the inputs are AB = 11.  What will the state be after the next clock edge?  What will the output Y2 be?

Given: A = 10011110. What is the result of A ASR 5 (arithmetic shift right)? Enter your answer in binary (ex: “00110101”).

Select the answer that best completes this sentence: The output of a flip-flop does not change immediately after the clock edge. It is done changing (settled) after the _______________.

A state transition diagram for a finite state machine is given. The clock input is 100 MHz. Suppose the FSM begins in state S3 and AB = 00.  One second later AB = 10, one second after that AB = 11, one second after that AB = 01.  What state is the FSM in at that point?  

Q11-C-8 points Does the following graph have an Euler Circuit? If not, add extra edges to make it an Eulerian Graph. Explain. Set of Vertices V={A,B,C,D,E,F} Set of Edges E={ AB, AE, AD, AC, BC, BD, BE, CD, CF, ED}    

Q10-A-8 points Does the following graph have a Hamilton Circuit? If yes, list the sequence of the vertices of the circuit. If no, state why there is no Hamilton Circuit. Set of Vertices V={A,B,C,D,E,F,G} Set of Edges E={ AB, AD, AF, BD, BE, BC, CE, DE, DF, EF, EG, FG}.    

Q1-C-7 points Determine whether the relation , is reflexive, symmetric, transitive, or none and justify your answer: The relation is defined on (the set of real numbers) as follows: For every