CS302P Final Term Quiz by VU Sparky

Q1. The parallel outputs of a counter circuit represent the _____________

1. Counter modulus
2. Clock frequency
3. Clock count

Q2. Convert the Gray code 1011 to binary.

1. 1010
2. 0111
3. 1011

Q3. An identify comparator is defined as a digital comparator which has ____________

1. No output terminals
2. Three output terminals
3. Two output terminals

Q4. What is the maximum possible range of bit-count specifically in n-bit binary counter consisting of ‘n’ number of flip-flops?

1. 0 to 2n
2. 0 to 2n + 1
3. 0 to 2n+1

Q5. To create a Johnson Counter by using D-flip flops, how flip flops should be connected together?

1. Q' output of previous flip flop should be connected to clock input of second flip flop
2. Q output of previous flip flop should be connected to D input of second flip flop
3. Q' output of previous flip flop should be
4. Q output of previous flip flop should be connected to clock input of second flip flop

Q6. Convert the binary number 1100 to Gray code.

1. 1000
2. 0101
3. 0111

Q7. A counter circuit is usually constructed of

1. A number of latches connected in cascade form
2. A number of NOR gates connected in cascade form
3. A number of flip-flops connected in
4. A number of NAND gates connected in cascade form
5. A decimal counter has ______ states.

Q1. The K-map based Boolean reduction is based on the following Unifying Theorem: A + A’ = 1.

1. Non Impact
2. Complementarity
3. Force
4. Impact

Q2. When implementing a half adder by using gates, which of the following gates is used to return carry bit as an output?

1. AND
2. XOR
3. OR
4. NAND

Q3. How many select lines would be required for an 8x1 multiplexer?

1. 1
2. 2
3. 3
4. 8

Q4. A Karnaugh map (K-map) is an abstract form of ____________ diagram organized as a matrix of squares.

1. Block diagram
2. Venn Diagram
3. Cycle Diagram
4. Triangular Diagram

Q5. Which of the following symbols is used to represent XOR operation?

1. ^
2. x
3. +