The number of states in the state transition diagram of the circuit that have a transition back to the same state on some value of “in” is __________.

Note – Numerical Type question

- Option : A
- Explanation :

State Table:

State Transition Diagram:P.S Input FF input N.S Q1 Q _{0}x D _{1}= xD _{1}= Q_{1}Q _{1}Q _{0}Out = Q _{0}0 0 0 0 0 0 0 0 0 0 1 1 0 1 0 0 0 1 0 0 0 0 0 0 0 1 1 1 0 1 0 0 1 0 0 0 1 0 1 1 1 0 1 1 1 1 1 1 1 1 0 0 1 0 1 1 1 1 1 1 1 1 1 1

self-loop states are 00 and 11.

Hence answer is 2.

You must be logged in to post a comment.

- Option : C
- Explanation :

1 sec = 10^{9}bits

(2^{32}x 8)/10^{9}= bytes

⇒ 34.35 sec

You must be logged in to post a comment.

You must be logged in to post a comment.

- Option : A
- Explanation :

Given, size of instruction format is 2 byte (= 16 bits), therefore number of instruction encoding = 216

Also, total number of bits in integer operand = log2(16 integer registers) = 4

Total number of bits in floating point operand = log2(64 floating point registers) = 6

So, number of encoding consumed:

By type 1 instructions = 4×23×4 = 214

By type 2 instructions = 8×22×6 = 215

By type 3 instructions = 14×2(4+6) = 14336

Now, number of encoding left for type 4 instructions = 216 − (214 + 215 + 14336) = 2048

Therefore, total number of different instructions of type 4 instructions = 2048 /64 = 32 Please note that there is difference between number of different instructions and number of different encoding, a single instruction can have different encodings when the address part differs. So, answer is 32.

You must be logged in to post a comment.

You must be logged in to post a comment.

55. Consider the following undirected graph G:

Choose a value of x that will maximize the number of minimum weight spanning trees (MWSTs) of G. The number of MWSTs of G for this value of x is ___________.Note – Numerical Type question

- Option : A
- Explanation :

ü Edges with weights 1 and 3 will be selected first,

ü Now bottom edge with weight 4 will not be selected as will cause cycle on MST,

ü both corner vertices have two-two choices to select the vertices, so these corner edges with weights 4 and 5 will resultant 2*2 = 4 MSTs.

So, total number of MSTs are 2*2 = 4, which is answer.

Option (A) is correct.

You must be logged in to post a comment.

You must be logged in to post a comment.

You must be logged in to post a comment.