Test 1 - Digital Circuits | Electronics and Communication (ECE)
Topic wise test for Digital Circuits of Electronics and Communication (ECE)
Questions
Consider the given circuit.
In this circuit, the race around
- does not occur
- occurs when CLK = 0
- occurs when CLK = 1 and A = B = 1
- occurs when CLK = 1 and A = B = 0
When the output Y in the circuit below is ‘1’, it implies that data has
- changed from 0 to 1
- changed from 1 to 0
- changed in either direction
- not changed
Assuming that flip-flops are in reset condition initially, the count sequence observed at QA in the circuit shown is

- 0010111…
- 0001011…
- 0101111…
- 01101..........…
The two numbers represented in signed 2s complement form are P + 11101101 and Q = 11100110. If Q is subtracted from P, the value obtained in signed 2s complement is
- 1000001111
- 00000111
- 11111001
- 111111001
The Boolean function f implemented in figure using two input multiplexers is

- $A\bar BC + AB\bar C$
- $ABC + A\bar B\bar C$
- $\bar ABC + \bar A\bar B\bar C$
- $\bar A\bar BC + \bar AB\bar C$
The point P in the following figure is stuck-at-1. The output f will be

- $\overline{AB\bar C}$
- $\bar A$
- AB$\bar C$
- A
A 4 bit ripple counter and a 4 bit synchronous counter are made using flip-flops having a propagation delay of 10 ns each. If the worst case delay in the ripple counter and the synchronous counter be R and S respectively, then
- R = 10 ns, S = 40 ns
- R = 40 ns, S = 10 ns
- R = 10 ns, S = 30 ns
- R = 30 ns, S = 10 ns
The minimum number of 2- to -1 multiplexers required to realize a 4- to -1 multiplexers is
- 1
- 2
- 3
- 4
In the circuit shown
- Y = $\bar A\bar B + \bar C$
- Y = (A +B)
- Y = $(\bar A + \bar B) \bar C$
- Y = AB + C
The logic function implemented by the circuit below is (ground implies logic 0)
- F = AND (P,Q)
- F = OR (P,R)
- F = OR (P,Q)
- F = XOR (P,Q
The Boolean function Y = AB + CD is to be realized using only 2-input NAND gates. The minimum number of gates required is
- 2
- 3
- 4
- 5
Directions : Two products are sold from a vending machine, which has two push buttons P1 and P2.
When a button is pressed, the price of the corresponding product is displayed in a 7 - segment display. If no
buttons are pressed, '0' is displayed signifying 'Rs 0'.
If only P1 is pressed, '2' is displayed, signifying 'Rs. 2'.
If only P2 is pressed, '5' is displayed, signifying 'Rs. 5'.
If both P1 and P2 are pressed, 'E' is displayed, signifying 'Error'
The names of the segments in the 7 - segment display, and the glow of the display for '0', '2', '5' and 'E' are shown below.

Consider
(1) push buttons pressed/not pressed in equivalent to logic 1/0 respectively.
(2) a segment glowing/not glowing in the display is equivalent to logic 1/0 respectively.
What are the minimum numbers of NOT gates and 2 - input OR gates required to design the logic of the driver for this 7 - Segment display?
- 3 NOT and 4 OR
- 2 NOT and 4 OR
- 1 NOT and 3 OR
- 2 NOT and 3 OR
The figure the internal schematic of a TTL AND-OR-OR-Invert (AOI) gate. For the inputs shown in the figure, the output Y is
- 0
- 1
- AB
- $\overline{AB}$
The output of the 74 series of TTL gates is taken from a BJT in
- totem pole and common collector configuration
- either totem pole or open collector configuration
- common base configuration
- common collector configuration
If X = 1 in logic equation $[X+Z{\bar Y+(\bar Z + X \bar Y ) }] \ [\bar X + \bar Z(X+Y)]$ = 1 then
- Y = Z
- Y = $\bar Z$
- Z = 1
- Z = 0
A new Binary Coded Pentary (BCP) number system is proposed in which every digit of a base-5 number is represented by its corresponding 3-bit binary code. For example, the base-5 number 24 will be represented by its BCP code 010100. In this numbering system, the BCP code 100010011001 corresponds to the following number in base-5 system
- 423
- 1324
- 2201
- 4231
Directions : Two products are sold from a vending machine, which has two push buttons P1 and P2.
When a button is pressed, the price of the corresponding product is displayed in a 7 - segment display. If no
buttons are pressed, '0' is displayed signifying 'Rs 0'.
If only P1 is pressed, '2' is displayed, signifying 'Rs. 2'
If only P2 is pressed '5' is displayed, signifying 'Rs. 5'
If both P1 and P2 are pressed, 'E' is displayed, signifying 'Error'
The names of the segments in the 7 - segment display, and the glow of the display
for '0', '2', '5' and 'E' are shown below.

Consider
(1) push buttons pressed/not pressed in equivalent to logic 1/0 respectively.
(2) a segment glowing/not glowing in the display is equivalent to logic 1/0 respectively.
If segments a to g are considered as functions of P1 and P2, which of the following is correct?
- g = $\overline P_1$+ P2, d = c + e
- g = P1+ P2, d = c + e
- g = $\overline P_1$+ P2, e = b + c
- g = P1+ P2, e = b + c
An 8085 assembly language program is given below.
Line 1: MVI A, B5H
2: MVI B, 0EH
3: XRI 69H
4: ADD B
5: ANI 9BH
6: CPI 9FH
7: STA 3010H
8: HLT
The contents of the accumulator just after execution of the ADD instruction in line 4 will be
- C3H
- EAH
- DCH
- 69H
An 8085 assembly language program is given below.
Line 1: MVI A, B5H
2: MVI B, 0EH
3: XRI 69H
4: ADD B
5: ANI 9BH
6: CPI 9FH
7: STA 3010H
8: HLT
After execution of line 7 of the program, the status of the CY and Z flags will be
- CY = 0, Z = 0
- CY = 0, Z = 1
- CY = 1, Z = 0
- CY = 1, Z = 1
The transistors used in a portion of the TTL gate shown in figure have $\beta$ = 100 ,the base-emitter voltage is 0.7 V for a transistor in active region and 0.75 V for a transistor in saturation. If the sink current I = 1 mA and the output is at logic 0, then the current IR will be equal to

- 0.65 mA
- 0.70 mA
- 0.75 mA
- 1.00 mA
Two D flip-flops are connected as a synchronous counter that goes through the following QBQA sequence 00$\rightarrow$11$\rightarrow$01$\rightarrow$10$\rightarrow$00$\rightarrow$…
The combination to the inputs DA and DB are
- DA = QB ; DB = QA
- DA = $\overline Q_A$; DB = $\overline Q_B$
- DA = $(Q_A \bar Q_B + \bar Q_A Q_B)$; DB = $\bar Q_A$
- DA = $(Q_A Q_B + \overline {Q_A Q_B})$; DB = $\overline Q_B$
In the sum of products function f(X, Y, Z) = $\sum (2,3,4,5)$, the prime implicants are
- $\bar XY, X\bar Y$
- $\bar XY, X\bar Y \bar Z, X\bar YZ$
- $\bar XY\bar Z, \bar XYZ, X\bar Y$
- $\bar XY\bar Z, \bar XYZ, X\overline {YZ}, X\bar YZ$
The state transition diagram for the logic circuit shown is

The circuit shown in figure has 4 boxes each described by inputs P, Q, R and outputs Y, Z with
Y = P $\oplus$Q $\oplus$R
Z = RQ + $\bar P R + Q\bar P$

The circuit acts as a
- 4 bit adder giving P + Q
- 4 bit subtractor-giving P - Q
- 4 bit subtractor-giving Q - P
- 4 bit adder giving P + Q + R
In a microprocessor, the service routine for a certain interrupt starts from a fixed location of memory which cannot be externally set, but the interrupt can be delayed or rejected. Such an interrupt is
- non-maskable and non-vectored
- maskable and non-vectored
- non-maskable and vectored
- maskable and vectored












