• Courses
  • Tutorials
  • Jobs
  • Practice
  • Contests

Quiz for Sudo GATE 2021

Question 51

Consider the following option(s) is/are NOT correct regarding Boolean expressions. Note - This question is multiple select questions (MSQ).
  • A + A\'B + A\'B\'C + A\'B\'C\'D = ABCD
  • If f(A, B, C) = B⊕C, then f(A, B, C)\' = B☉C
  • Dual of (A + B + C)(A\'B\')\' = A\'B\'C\' + A + B
  • None

Question 52

A boolean function f(X,Y,Z) is implemented using 3 x 8 decoder. Where X is LSB and Z is MSB in resulting output. The connection of fan-in is depicted below.

Then which of the following option(s) is/are NOT correct? Note - This question is multiple select questions (MSQ).
  • Output function F can be represented by either Σ(1, 2, 4, 5) or π(0, 3, 6, 7)
  • Output function F can be represented by either Σ(0, 3, 6, 7) or π(1, 2, 4, 5)
  • Output function F can be represented by only π(0, 3, 6, 7)
  • Output function F can be represented by only Σ(0, 3, 6, 7)

Question 53

Any set of boolean operators that is sufficient to represent all boolean expression is called complete. Which of the following is/are complete? Note - This question is multiple select questions (MSQ).
  • {→, ↚}
  • {→, ¬}
  • {↑}
  • {^, ∨}

Question 54

Which of the following option is True? Note - This question is multiple select questions (MSQ).
  • If the external clock is not connected to the Flip-flop then it is the asynchronous sequential circuit.
  • If the external clock is common to all then it is called a synchronous circuit.
  • Only a few flip-flops are convertible to any other flip-flop.
  • From truth-table, we read the static input of the flip-flop while in excitation table we read dynamic input.

Question 55

Which of the following count sequence can be generated using 3 bit JK flip-flops ? Note - This question is multiple select questions (MSQ).
  • 0, 0, 0, 1, 1, 1, 2, 2, 2, 3, 3, 3, 0, 0, 0, …
  • 1, 2, 3, 4, 5, 6, 7, 1, 2, 3, 4, 5, 6, 7, ...
  • 0, 4, 6, 7, 3, 2, 0, 0, 4, 6, 7, 3, 2, 0, ...
  • All of the above

There are 55 questions to complete.

Last Updated :
Take a part in the ongoing discussion