06 Digital Circuits
06 Digital Circuits
For
By
www.thegateacademy.com
*Common Subjects
Feel free to share your Suggestion/Feedback/Query
quality@thegateacademy.com
+91 9620666112
GATE QUESTION BANK Contents
Contents
Contents
Topics Page No.
Number Systems, Combinatorial Circuits, Boolean Algebra, Minimization of Functions using Boolean
Identities and Karnaugh Map, Logic Gates and their Static CMOS Implementations, Arithmetic
Circuits, Code Converters, Multiplexers, Decoders and PLAs, Sequential Circuits Latches and
Flip‐Flops, Counters, Shift‐Registers and Finite State Machines, Data Converters, Sample and Hold
Circuits, ADCs and DACs, Semiconductor Memories, ROM, SRAM, DRAM, 8-bit Microprocessor
(8085), Architecture, Programming, Memory and I/O Interfacing.
Year ECE EE IN
ECE-2007 IN-2008
1. X = 01110 and Y = 11001 are two 5-bit 7. The result of (45)10 – (45)16 expressed in
binary numbers represented in two’s 6-bit 2’s complement representation is,
complement format. The sum of X and Y (A) 011000 (C) 101000
represented in two’s complement format (B) 100111 (D) 101001
using 6 bits is,
(A) 100111 (C) 000111 IN-2009
(B) 001000 (D) 101001 8. The binary representation of the decimal
number 1.375 is,
ECE-2008 (A) 1.111 (C) 1.011
2. The two numbers represented in signed (B) 1.010 (D) 1.001
2’s complement form are P = 11101101
and Q = 11100110. If Q is subtracted IN-2011
from P, the value obtained in signed 2’s 9. The base of the number system for the
complement form is addition operation 24 + 14 = 41 to be
(A) 100000111 (C) 11111001 true is
(B) 00000111 (D) 111111001 (A) 8 (C) 6
(B) 7 (D) 5
ECE-2014
3. The number of bytes required to
represent the decimal number 1856357
in packed BCD (Binary Coded Decimal)
form is __________
EE-2007
4. The octal equivalent of the HEX number
AB.CD is
(A) 253.314 (C) 526.314
(B) 253.632 (D) 526.632
EE-2014
5. A cascade of three identical modulo-5
counters has an overall modulus of
(A) 5 (C) 125
(B) 25 (D) 625
ECE 6. [Ans. D]
1. [Ans. C] BCD counter counts up to 1001
= 01110
y = 11001 IN
y( ) = 100111 7. [Ans. C]
Carry discard it ( ) ( ) = ( 2 ) = (101000)
00111 in 6 bits will be 000111
8. [Ans. C]
2. [Ans. B] 0.375 × 2 = 0.750
i ned 2 s complement of 0.750 × 2 = 1.5
P = 11101101 1.5 × 2 = 1.0
o P = 00010011 Hence answer is 1.011
i ned 2 scomplement of
= 11100110 9. [Ans. B]
P = P (2 s complement of ) Let the base is x, Here
= 00010011 (2 ) (1 ) = ( 1)
11100110 ( 2 ) ( 1 )
11111001 =( 1 )
2 s complement of (P ) = 00000111 4 + 2x + 4 + x = 4x + 1
x=7
3. [Ans. *] Range: 3.9 to 4.1
A decimal digit is represented by 4 bit in
BCD format, so for a decimal number with
digits requires 4d bit and
1 byte = 8 bit so
Here d = 7
No. of bits = 28
2
byte = = =
EE
4. [Ans. B]
Hex number (AB.CD)
⏞
1010 ⏞1011 ⏞ 1100 ⏞1101
For finding its octal number, we add one
zero in both extreme and group 3 bit
together
010
⏟ 101
⏟ 011⏟ 110 ⏟ 011
⏟ 010⏟
5. [Ans. C]
Overall modulus = = 12
ECE-2007 ECE-2014
1. The Boolean expression 5. The Boolean expression ( )( ̅)
̅̅ ̅ ̅ ̅ ̅̅ ̅ ̅ can ̅̅̅̅̅̅̅̅̅̅̅
( ̅) ̅ simplifies to
be minimized to (A) X (C) XY
(A) ̅̅ ̅ ̅ ̅ ̅ (B) Y (D) X+Y
(B) ̅̅ ̅ ̅ ̅̅
(C) ̅ 6. Consider the Boolean function, F(w, x, y,
(D) z) = wy + xy + ̅ xyz + ̅ ̅ y + xz + ̅ ̅ ̅.
Which one of the following is the
ECE-2009 complete set of essential prime
2. If X = 1 in the logic equation implicates?
[X+Z{ ( +X ) }] { + ( X + Y)} (A) ̅̅ (C) ̅ ̅̅
=1 then (B) (D) ̅̅
(A) Y = Z (C) Z = 1
(D) Z = 0 7. For an n-variable Boolean function, the
(B) Y =
maximum number of prime implicants is
(A) ( ) (C)
EC/EE/IN -2012
3. In the sum of products function
(B) (D) ( )
( ) ∑( ), the prime implicants
are ECE - 2015
8. The Boolean expression ( )
(A) ̅ ̅
̅ ̅ ̅̅ ̅ ̅ ̅̅ ̅ converted into
(B)
canonical product of sum (POS) form is
(C) ̅ ̅ ̅ ̅
(A) ( )( ̅ )( ̅ ̅)
(D) ̅ ̅ ̅ ̅̅ ̅
(̅ ̅)
(B) ( ̅ )(̅ ̅ )(̅ ̅ )
ECE-2013
( ̅ ̅ ̅ )
4. In the circuit shown below, Q1 has
negligible collector – to – emitter (C) ( )(̅ ̅ )( ̅ )
( ̅ ̅ ̅ )
saturation voltage and the diode drops
(D) ( ̅ ̅ )(̅ )(̅ ̅ )
negligible voltage across it under forward
bias. If Vcc is +5 V, X and Y are digital ( )
signals with 0 V as logic 0 and as logic
1, then the Boolean expression for Z is 9. A 3-input majority gate is defined by the
logic function ( ) .
Which one of the following gate is
R1
Z represented by the function
R2 (̅̅̅̅̅̅̅̅̅̅̅̅
( ), ( ̅ )?
X Q1
Diode
(A) 3-input NAND gate
(B) 3-input XOR gate
(C) 3-input NOR gate
Y (D) 3-input XNOR gate
(A) XY (C) X
(B) (D)
10. In the figure shown, the output Y is 13. A minimized form of the function is
required to be ̅ ̅ . The gates (A) (C)
G1 and G2 must be, respectively. (B) (D)
( ̅) ( ) (C) F
(D) ( ̅ ) (̅ ) (̅ Y
Z
̅ ) (̅ ̅ ) (̅ ̅ ̅ ) X
(D) F
Y
ECE - 2016 X Z
12. Following is the K-map of a Boolean
(D) F
function of five variables P, Q, R, S and X.
Y
The minimum sum-of-product (SOP) X Z
expression for the function is F
EE-2014Y
Z
15. Which of the following logic circuits is a
realization of the function F whose
Karnaugh map is shown in figure
EE-2010
Statement for Linked Answer Q.No. 13 & 14 ( )
The following Karnaugh map represent a
function .
F
YZ
X 00 01 11 10
0 1 1 1 0
F
YZ
1 000 001 1 11 0
X
10 0
0 1 1 1
: 080-617 66 222, info@thegateacademy.com
0 ©Copyright reserved. Web:www.thegateacademy.com 486
1 0 0 1
GATE QUESTION BANK Digital Circuits
EE - 2016
( )
19. The output expression for the
Karnaugh map shown below is
( ) ̅
(A) (C) ̅ ̅
(B) ̅ (D) ̅
IN-2009 IN-2011
24. The minimal sum-of-products expression 25. For the Boolean expression
for the logic function f represented by the ̅ ̅̅ ̅ ̅ ̅̅ ̅, the
given Karnaugh map is minimized Product of Sum (PoS)
PQ expression is
RS (A) ( ̅) ( ̅)
00 01 11 10
(B) ( ̅ ) (̅ )
00 0 1 0 0
0 1 1 1 (C) ( ̅ )( ̅)
01
1 1 1 0 (D) ̅
11
10 0 0 1 0
IN - 2016
(A) QS + 26. The Boolean expression (
(B) + ) is equivalent to
(C) + (A) (C) ( )( )
(D) (B) (D) ( )( )
ECE 3. [Ans. A]
1. [Ans. D] ( ) ∑( )
K-map corresponding to given Boolean
expression ̅̅ ̅ YZ ̅
̅ 1
CD
00 01 11 10
1
AB
1 1
00 1
( ) ̅ ̅
01 1
So prime implicants are ̅ and ̅ .
11 1
10 1 4. [Ans. B]
X Y Z Comments
̅̅ ̅ ̅ ̅̅ 0 0 0 Transistor off diode ON
OR 0 1 1 Transistor off diode rev biases
̅̅ ̅ ̅ ̅ ̅̅ ̅̅ 1 0 0 Transistor ON diode rev biases
1 1 0 Transistor ON diode rev biased
[ ] ̅̅ So, ̅Y=Z
5. [Ans. A]
( )( ̅) ̅̅̅̅̅̅̅̅̅̅̅
( ̅) ̅
2. [Ans. D]
( ̅ ̅) ̅̅̅̅ ̅
[ ( ( ̅))] [ ( )]
̅̅̅̅
̅
By putting X = 1
[ ( ( ))] [ ̅( )]
[ ]
12. [Ans. B]
1 1 PQ PQ
RS 00 01 11 10 RS 00 01 11 10
1 1 00 00 1 1
01 1 1 01
1 1
11 1 1 11
1 1 01 01 1 1
i.e., no grouping at all so
So, ( ) o ( ) ( )
8. [Ans. A] EE
( ) ̅ ̅ ̅̅̅ ̅ 13. [Ans. B]
∑ ( 7) Π ( ) YZ
( )( ̅ )( ̅ ̅ )(̅ ̅) X 00 01 11 10
0 1 1 1 0
9. [Ans. B] 1 0 0 1 0
Three input majority gate F = ̅ ̅ + YZ
M(a,b,c)
(̅̅̅̅̅̅̅̅̅̅̅̅
( ) ( ̅) 14. [Ans. D]
( ) ( ) From the figure it is clear that, two NAND
( ) ( ) gates generate the ̅ ̅ and now two
( )( )( )( AND gates with inputs ̅ ̅ and inputs
) ( )( )( ) Y and Z is used to generate two terms of
( ) SOP form and now OR gate is used to sum
( )( )( ) them and generate the F.
( )( )
15. [Ans. C]
( 7) ̅̅
̅̅ [by consensus theorem]
Odd number in the minterms = XOR
gate
X
F=Y+X
9
22. [Ans. D]
17. [Ans. A] F = 1 if X > Y, so following will be K – map
of function F.
18. [Ans. A]
Given minterm is 00 01 11 10
00 0 0 0 0
∑ ( 7)
Π ( ) 01 1 0 0 0
o o o o
11 1 1 0 1
( ̅ )(̅ )(̅ ̅ )
10 1 0
1 1
19. [Ans. B] ̅ + ̅ ̅̅̅ + ̅̅̅
F=
23. [Ans. A]
̅
By K – map
20. [Ans. D] PQ RS
00 01 11 10
(̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅
̅ ̅) ( ̅) 00 1 0 0 1
(̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅
̅ ̅ ) ̅̅̅̅̅̅̅̅̅
( ̅) 01 0 0 0 0
̅ ̅ ̅ 11 0 0 0 0
10 1 1 1 1
IN
21. [Ans. D]
̅ ̅̅ 24. [Ans. A]
Truth table: PQ
RS 00 01 11 10
Q
X Y Z F S 00 0 1 0 0
0 0 0 0
01 0 1 1 1
0 0 1 0
0 1 0 1 11 1 1 1 0
0 1 1 1
10 0 0 1 0
1 0 0 1
1 0 1 0
1 1 0 x
1 1 1 x
25. [Ans. A]
̅ ̅̅ ̅ ̅ ̅̅ ̅
̅ ̅( ̅ ) ̅̅ ( ̅)
̅̅ ̅ ̅
̅̅ [ ̅ ̅]
̅̅ [( ̅ )( ̅)]
̅̅ ( ̅)
̅̅ ̅
̅( ̅)
̅
(̅ )(̅ )
( ̅)( ̅)
Alternative method:
00 01 11 10
0 1 0 0 1
0 1 0 1 1
( ̅)( ̅)
26. [Ans. C]
(̅ ̅) ̅̅̅̅
( ̅̅̅̅)( )
( )( )
Logic Gates
10
8 bit data bus 12. In the circuit shown diodes , and
E are ideal, and the inputs an are
A0 A9
10 ‘0 ’ for logic ‘0’ an ‘’10 ’’ for logic ‘1’.
E
A10
1
What logic gate does the circuit
A11
A12
11
10 represent?
A13
A14 10
input 01 E
S1 S0 00
A15
(A) ̅ ̅ (C) ̅ ̅
(B) (D)
EE-2009
18. The complete set of only those Logic
Gates designated as Universal Gates is
(A) OR (C) NAND (A) NOT, OR and AND Gates
(B) XOR (D) AND (B) XNOR, NOR and NAND Gate
(C) NOR and NAND Gates
15. The minimum number of 2-input NAND (D) XOR, NOR and NAND Gates
gates required to implement a 2-input
XOR gate is EE-2011
(A) 4 (C) 6 19. The output Y of the logic circuit given
(B) 5 (D) 7 below is
16. For the circuit shown in the figure, the
delays of NOR gates, multiplexers and
inverters are ns, 1. ns and 1 ns, (A) 1 (C) X
respectively. If all the inputs P, Q, R, S and (B) 0 (D) ̅
T are applied at the same time instant, the
maximum propagation delay (in ns) of IN-2007
the circuit is __________ 20. Two square waves of equal period T, but
wi h a ime elay τ are applie o a igi al
circuit whose truth table is shown in the
0 0 following figure.
X Y Output
0 0 1
1 1 0 1 0
1 0 0
1 1 1
X
EE-2007
17. A, B, C and D are input bits, and Y is the 1
output bit in the XOR gate circuit of the
figure below. Which of the following
t
statements about the sum S of A, B, C, D T/2 T
and Y is correct? Y
A
XOR
B
1
XOR Y
τ τ / t
C
XOR
D
function of τ for 0 ( )?
(A) Z
Vav
5V Y
X Z
Y
Y
(A) Z=X + Y (C) Z =̅̅̅̅̅̅̅̅ (A) ̅ ̅ (C) ̅̅̅̅
(B) Z=XY (D) Z=̅̅̅̅ (B) (̅̅̅̅̅̅̅ ) (D) ̅ ̅
1
(A) X is latched, Y toggles continuously
(B) X and Y are both latched
(C) Y is latched, X toggles continuously
(D) X and Y both toggle continuously
IN - 2016
27. In the digital circuit given below, F is
(A) (C)
(B) ̅ (D)
ECE 7. [Ans. A]
1. [Ans. B] In NMOS circuit
A Since are in parallel so those
B
represent ( ) is in sense, so it
AB + CD
represen s ‘ o ’ opera ion an he whole
C
D function should be inverted or it is
complementary logic.
2. [Ans. D] So,
When P = Q = 1, then OUT = 1 ̅̅̅̅̅̅̅̅̅̅̅̅
( ) ̅̅̅̅̅̅̅ ̅ ̅ ̅ ̅
P = Q = 0, then OUT = 0
P = 0, Q = 1, then OUT = 0 8. [Ans. D]
P = 1, Q = 0, then OUT = 0 For RAM #1
So, it is AND gate
⏟0 0 0 0 ⏟1 0 0 0 ⏟ ⏟
0 0 ower a
0 0 0
3. [Ans. D] ⏟
0000 ⏟ 1 0 1 1 ⏟ 1⏟1 ighes a
X= ;Y=P+Q 0
Z = XY = . (P + Q) So range of add for RAM #1 0 00
=( )( ) 0
Which is present only in option D
⊕
∴ ⊕ ⊕
9. [Ans. A]
4. [Ans. D] ( ⊕ )(( ⊕ ) )
For 3 input XNOR for output to be one, ( ⊕ )(( ⊕ ) ( )̅)
two input must be one, and we know that ( ⊕ )
2- input XOR & XNOR gate are (̅ ̅)
complementary & hence only 1(1’s) will ̅ ̅
be generated & C=1 is required
i.e, When A = 0, B = 0 and C = 1, 10. [Ans. A]
then F = 1 C 0 1
A ̅̅̅̅̅̅̅̅ ̅̅̅̅̅̅̅̅
B
5. [Ans. D] 0
P = ̅̅̅̅̅̅̅ = ̅ ̅ = 4 A ̅̅̅̅̅̅̅̅
B AB
Q = ̅̅̅̅ = ̅ + ̅ = 2
y ̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅
̅̅̅̅̅̅̅ ( ) ̅̅̅̅
R = A ⊕ B = A̅ + ̅ B = 3
( ) (̅ ̅)
S = A B = AB + ̅ ̅ = 1
̅ ̅
6. [Ans. B]
The output Y expression in the ckt 11. [Ans. *] Range: 40 to 40
(Majority circuit) All the logic gates have same propagation
o ha wo or more inpu s are ‘1’ is delay = 20 ns
A
always ‘1’.
B Z
1 0 0 1
C
0 1
Hence the correct answer is 40
12. [Ans. C] EE
Case I: If any input is logic 0 (i.e., 0 V) then 17. [Ans. B]
correspon ing io e is “ ” an ue o ⊕ ⊕ ⊕ from the given
ideal diode output voltage 0 as well diagram. We know that sum of any
as if there is any input logic 1 (i.e., 10 V) number of bits is XOR of all bits.
corresponding diode will be OFF. o ⊕ ⊕ ⊕ ⊕
Case II: If all the inputs are high (i.e., 10 V) S=Y⊕Y
then all the diodes are R.B (OFF) and S = either zero or even because LSB is
output voltage 10 zero (always).
So, it is a positive logic 3-inputs AND gate.
18. [Ans. C]
13. [Ans. D] NOR and NAND are designated as
Only NAND and NOR are universal gate, universal logic gates, because using any
but in the question other gates are
one of them we can implement all the
mentioned.
logic gates.
14. [Ans. D]
19. [Ans. A]
.̅ ̅. ̅ ̅ 1
̅ X Y
1 0 1
0 1 1
When 1 is ON and is OFF
ou pu IN
When 0 is OFF and is ON 20. [Ans. C]
ou pu 0 When τ = 0 X and Y will be same and
∴ So the given circuit implement Y = AB out-put will be equal to dc of 5V.
ga e When τ = , X and Y will be complement
15. [Ans. A] of each other and output will be equal to
NAND Gate for EX-OR Gate dc 0.
When τ increases from 0 o , O/P will
⊕ decrease from 5V to 0V linearly.
̅ ̅ 21. [Ans. B]
When any of X or Y is zero, Z = 0. For
Number of NAND Gate = 4 X = Y = 1, Z = 1
16. [Ans. *] Range: 6.0 to 6.0
Case (i) When T = 0 22. [Ans. A]
elay of elay of 1 X y
elay of
1. 1. ns x Z
Case (ii) When T = 1 Y y
y
elay of 1s ga e
elay of 1 elay of Z= y. y = y y =x⊕y
ga e elay of
1 1. 1. ns
So, the maximum delay = 6 ns.
: 080-617 66 222, info@thegateacademy.com ©Copyright reserved. Web:www.thegateacademy.com 498
GATE QUESTION BANK Digital Circuits
̅. )
̅̅̅̅̅̅̅̅̅̅̅̅̅̅
By referring the circuit the upper input y
̅̅̅̅
y̅
. y (y
to the NAND gate is direct test signal.
(̅̅̅̅).
The lower input to NAND gate is TEST ̅̅̅̅
y̅.
but with a delay of 30 nsec.
Assuming the delay of NAND gate is 0. f (̅̅̅̅̅
. y. ). (y̅. ) (̿̿̿̿)
.y ̿̿̿
(y
̅ )
First draw output waveform (ideal y emorgan’s law
case) then shift that by 10 msec. i.e. f y y̅
introduce the delay.
es
0
es
wi h elay
( )
0 n sec 0
Output with
delay = 0
0 0 n sec
Output with
NAND gate
delay = 10 n sec
0 10 n sec 40 n sec
So we can clearly say that initial output
change from high to low, then it changes
from low to high and then finally at
steady state output is 1.
Note: Saying output is high (option A)
will be wrong here. We are not
interested to find steady state
output.
ECE - 2007
1. The circuit diagram of a standard TTL
NOT gate is shown in the figure. When
Vi = 2.5V, the modes of operation of the
transistors will be
(A) 4 V, 3 V, 2 V (C) 4 V, 4 V, 4 V
(B) 5 V, 5 V, 5 V (D) 5 V, 4 V, 3 V
1 4kΩ 100kΩ
R
2
4kΩ
Q4
4. The output (Y) of the circuit shown in the
D figure is
Q2
Q1
Q3
1kΩ
- ̅
(A) Y IN - 2014
7. The figure is a logic circuit with inputs A
and B and output Y. = + 5 V. The
circuit is of type
1
0
t
(B) Y
0
t
(C) Y
Low-pass
X
filter
Y PMOS
NMOS
ECE EE
1. [Ans. B] 5. [Ans. A]
Reverse active, X
Y
Saturation
Saturation,
Cut off A B
2. [Ans. C] 1
TTL - Transistor Transistor Logic X
CMOS - Complementary Metal Oxide 0
Semiconductor A
3. [Ans. C] B
Suppose all NMOS at saturation
≥
For m Y=X B
≥ 1 &
IN
4 i 6. [Ans. C]
For m NOR Gate
( 1)
7. [Ans. D]
(4 )
Given circuit is of the standard 2 input
ow since
NAND gate.
4 (4 )
4 8. [Ans. *] Range: 1 to 1
or m
1
Low-pass
(4 ) 4 filter
4
4. [Ans. A]
The given circuit is CMOS implementation
If the NMOS is connected in series, then
the output expression is product of each
input with complement to the final
product.
o, ̅̅̅̅̅̅̅̅̅
̅ ̅
a e orm
1
11
1
4
1
11
1
[ ( ) ( )]
1
[ ] 1 o
ECE - 2008
4. For the circuit shown in the following
figure, are inputs to the 4:1
multiplexer. R(MSB) and S are control
bits.
(A)
(B)
(C)
(D)
̅
2. The following binary values were applied
to the X and Y inputs of the NAND latch
shown in the figure in the sequence The output Z can be represented by
indicated below: (A) PQ + P ̅ S + ̅ ̅ ̅
(B) P ̅ +PQ̅ +̅ ̅ ̅
X=0, Y=1; X=0, Y=0; X=1, Y=1
(C) P ̅ ̅ + ̅QR +PQRS + ̅ ̅ ̅
The corresponding stable P, Q outputs (D) PQ̅ +PQR̅ +P ̅ ̅S + ̅ ̅ ̅
will be
X P 5. For each of the positive edge – triggered
J-K flip flop used in the following figure,
the propagation delay is T.
1 1
Q CLK
Y 1 1
(D) 1
0
P2 Q2 P2 Q2
4T
Consider p
(i) Push Button pressed/not Pressed in
a equivalent to logic 1/0
respectively.
(ii) A segment glowing / not glowing in
̅ ̅ ̅
the display is equivalent to logic 1/0
respectively.
(A) (C)
10. If segment a to g are considered as (B) (D)
functions of and , then which are of
the following is correct? ECE - 2011
(A) ̅ d e 14. Two D flip – flops are connected as a
(B) d e synchronous counter that goes through
(C) ̅ e b the following sequence
(D) e b
The connections to the inputs and
11. What are the minimum numbers of NOT are
gates and 2-input OR gates required to (A)
design the logic of the driver for this (B)
7-segment display? (C)
(A) a d
(D)
(B) a d
(C) a d
15. When the output Y in the circuit below is
(D) a d
“ ” i i p ies ha da a has
ECE - 2010 Data D Q Y
D Q
12. The Boolean function realized by the logic
circuit shown is Clock
(A) ha ed fr “ ” “ ”
MUX (B) ha ed fr “ ” “ ”
(C) Changed in either direction
(D) Not changed
̅̅̅̅ ̅̅̅̅
(A) (C)
(B) (D)
a h a h
E ̅ E ̅
(A) ̅ ̅ (C) ̅ ̅
(B) ̅ ̅ (D) ̅̅ ̅
̅̅̅̅̅
(A) A modulo-5 binary up counter
(B) A modulo-6 binary down counter
(C) A modulo-5 binary down counter
(A) mod-2 counter (D) A modulo-6 binary up counter
(B) mod-4 counter
(C) mod-5 counter 32. An SR latch is implemented using TTL
(D) mod-6 counter gates as shown in the figure. The set and
reset pulse inputs are provided using the
30. A 1-to-8 demultiplexer with data input push-button switches. It is observed that
, address inputs (with as the circuit fails to work as desired. The SR
the LSB) and ̅ ̅ as the eight latch can be made functional by changing
demultiplexed outputs, is to be designed
using two 2-to-4 decoders (with enable
e
̅ and address inputs
input E and as
shown in the figure. a d are 5
to be connected to P. Q, R and S, but not
necessarily in this order. The respective ̅
input connections to P, Q, R, and S ese
terminals should be (A) NOR gates to NAND gates
(B) Inverters to buffers
(C) NOR gates to NAND gates and
inverters to buffers
(D) 5 V to ground
33. A three bit pseudo random number 36. The functionality implemented by the
generator is shown. Initially the value of circuit below is
output
is set to 111. The value of
output Y after three clock cycles is
e der
(A) 000 (C) 010
(B) 001 (D) 100
E ab e
ECE - 2016
34. The output of the combinational circuit is a ris a e b ffer
given below is (A) 2-to-1 multiplexer
(B) 4-to-1 multiplexer
(C) 7-to-1 multiplexer
(D) 6-to-1 multiplexer
X Q
EE - 2008 T Q
42. A 3 line to 8 line decoder, with active low
outputs, is used to implement a CLK >
(A) (X + Z). (̅ ̅ ̅ ). (Y + Z)
⁄
(B) (̅ ̅ ). (X + Y + Z). (̅ ̅ ).
(C) (̅ ̅+ Z). (̅ + Y + Z). (X + ̅ + Z).
(X +Y + ̅ ) The logic gate represented by the state
(D) (̅ ̅ . (̅ ̅ ). (X +̅ + ). diagram is
( ̅ ̅ ) (A) XOR (C) AND
(B) OR (D) NAND
EE - 2011
43. A two-bit counter circuit is shown below. 46. A 3-bit gray counter is used to control the
output of the multiplexer as shown in the
figure. The initial state of the counter is
J Q J Q
. The output is pulled high. The
K ̅ ̅
output of the circuit follows the sequence
K
CLK
p
̅ ̅
(A)
(B)
(C) The monoshots a d when triggered
(D) produce pulses of width a d
respectively, where . The steady
47. A JK flip flop can be implemented by T state output voltage of the circuit is
flip-flops. Identify the correct
implementation.
f ip f p
f ip f p
f ip f p EE - 2015
49. In the 4 × 1 multiplexer, the output F is
ive by . i d he req ired
̅
input
f ip f p
Y
F
S
1
51. ea f i f Π 5 A B
12, 15) is to be implemented using an 8 × (A) A ⨁ B (C) A + B
1 multiplexer (A is MSB). The inputs ABC
(B) ̅̅̅̅̅̅̅ (D) ̅̅̅̅̅̅̅̅
⨁
are connected to the select inputs
of the multiplexer respectively. 54. The current state of a two JK flip-
0
flop system is 00. Assume that the clock
1 rise-time is much smaller than the delay
2
3 f of the JK flip-flop. The next state of the
4 system is
5
6 5
7
(A) 00 (C) 10
(B) 01 (D) 11
Clock
(A) 011 (C) 100
KCLR KCLR KCLR K CLR
(B) 010 (D) 101
̅̅̅̅̅̅̅̅
rese Count
D Q
(A) 5 ns (C) 20 ns Flip-Flop Down
Up/down Counter
Clock
(B) 10 ns (D) 50 ns ear ̅
̅̅̅̅̅̅̅ Count Up
Clock
IN - 2009
63. The figure below shows a 3-bit ripple Assuming that the initial value of counter
counter, with as the MSB. The flip- output ( as zero, the counter
flops are rising-edge triggered. The output in decimal for 12 clock cycles are
counting direction is (A) 0,1,2,3,4,4,3,2,1,1,2,3,4,
J 1
Q1
1
(B) 0,1,2,3,4,5,0,1,2,3,4,5,0,
1 Q J Q J Q Q2
Clock
(C) 0,1,2,3,4,5,5,4,3,2,1,0,1
CLK CLK CLK (D) 0,1,2,3,4,5,4,3,2,1,0,1,2
1 K ̅ 1 K ̅ 1 K ̅
ECE/EE/IN - 2012
(A) Always down
66. The output Y of a 2-bit comparator is logic
(B) Always up
1 whenever the 2-bit input A is greater
(C) Up or down depending on the initial
than the 2-bit input B.
state of q only
The number of combinations for which
(D) Up or down depending on the initial the output is logic 1, is
states of q q and q (A) 4 (C) 8
(B) 6 (D) 10
64. In the figure shown, the initial state of Q is
0. The output is observed after the 67. Consider the given circuit
application of each clock pulse. The
output sequence at Q is
1 J Q
CLOCK CLK
K ̅ In this circuit, the race around
(A) Does not occur
(B) Occurs when CLK = 0
(C) Occurs when CLK = 1 and A =B =1
(A) 0 0 0 0 . . . (C) 1 1 1 1 . . . (D) Occurs when clk = 1 and A = B = 0
(B) 1 0 1 0 . . . (D) 1 0 0 0 . . .
68. The state transition diagram for the logic
circuit shown is
IN - 2011
65. The circuit below shows as up/down
counter working with a decoder and a
flip-flop. Preset and clear of the flip-flop ̅
ee
are asynchronous active-low inputs
IN - 2015
71. For the circuit shown in the figure, the
rising edge triggered D-flip flop with
asynchronous reset has a clock frequency
of 1 Hz, The NMOS transistor has an ON
resis a e f a d a
resistance of infinity. The nature of the
output waveform is
p ̅
IN - 2013
69. The digital circuit shown below uses two
negative edge- triggered D flip- flops.
Assuming initial condition of and
as zero, the ouput of this circuit is
D1 D0
IN - 2014 ̅̅̅̅̅̅̅̅̅
di i re is er
70. Frequency of an analog periodic signal in
the Range: of 5 kHz - 10 kHz is to be Clock
Generator E⁄̅ E⁄̅ E⁄̅
measured with a resolution of 100Hz by
measuring its period with a counter.
E/̅: Enable/̅̅̅̅̅̅̅
ese Pulse
Assuming negligible signal and transition shaping
delays the minimum clock frequency and
Input pulse
minimum number of bits in the counter
needed, respectively, are:
a d
f f
a d
f f
a d
f f
a d
f f
IN - 2016
73. A 4 to 1 multiplexer to realize a Boolean
function is shown in the figure
below. The inputs Y and Z are connected
to the selectors of the MUX (Y is more
significant). The canonical sum-of-
product expression for is
(A) Σ (C) Σ
(B) Σ 5 (D) Σ 5
Clock
(A)
(B)
(C)
(D)
ECE PQ
RS 00 01 11 10
1. [Ans. B] ̅̅̅
00 1 1
The i/p to first F/F = ̅̅̅̅̅̅̅̅̅̅̅ 1
01 1 1
The i/p to second F/F = P̅ S
11 1 1
10 1 PQ
0 0 0 0 (initially at rest)
1 clk 0 0 1 1
st So option A is correct choice
2nd 1 1 0 0
3rd 0 0 0 0 5. [Ans. B]
So sequence generated At clock will be divide by 4 and will
00, 01, 10, 00 have 2 T delay w.r.t clock.
2. [Ans. C] 6. [Ans. C]
When X = 0, Y = 1 then P = 1 and Q = 0 Initially, when clk is high and D is low,
X = 0, Y = 0 then P = 1 and Q = 1 Q = 0 or 1,
X = 1, Y = 1 then P = 0 and Q = 1 or When clk goes low and D is also low ,
P = 1 and Q = 0 Q = 1,
When clk is low and D goes high, Q = 0.
3. [Ans. A]
Let the output of first MUX is Y 7. [Ans. A]
Y = ̅ B + A̅ = A ⨁ B
X=̅ ̅ ⨁
So X = A ⨁ B ⨁ C 0 0 0 0 0 0
i.e, ̅ ̅ ̅ ̅ ̅̅
1 1 1 1 1 1
0 0 0 1 1 0
4. [Ans. A]
1 1 0 1 0 0
( ) 5 1 1 1 1 1 1
̅̅ ̅ ̅ ̅
So sequence is (00, 11, 10, 00, 11) or
̅̅ ̅̅̅ ̅ ̅
..
s ap
PQ
RS
8. [Ans. C]
00 01 11 10
̅ ̅̅ For NAND latch, when ( ) are (0, 1),
00 1 1 1
( ) will be (1, 0) and when ( )
01 1 1 SP
are (1, 1), ( ) will be (1, 0).
11 1 1
For NOR latch, when ( ) are (0, 1),
10 1 PQ
( ) will be (1, 0) and when ( )
So ̅̅̅ are (1, 1), ( ) will be (0, 0).
Now only option (A) has two similar
terms, we can say that option A is not 9. [Ans. A]
most simplified version of Z it can be
O
obtained as
Y = AB
B
B 14. [Ans. D]
Q(present) Q (next)
Y=A ⨁B
1
0 0 1 1 1 1
0
A
1 1 0 1 0 1
0 1 1 0 1 0
B 1 0 0 0 0 0
10. [Ans. B] ⨀
a b c d e f g ̅̅̅̅ ̅̅̅̅
̅
0 0 1 1 1 1 1 1 0
0 1 1 0 1 1 0 1 1
15. [Ans. A]
1 0 1 1 0 1 1 0 1
Given Y=1, this implies
1 1 1 0 0 1 1 1 1 Both the output of D- flip flop
a should be 1 i.e, input at first flip flop is 1
b ̅̅̅̅ . and for output of 2nd flip flop to be 1,
̅̅̅̅ . inverted output of first flip should be 1 in
d e previous clock, for which input must be 0
e ̅̅̅̅ so data is changing from 0 to 1.
f ̅̅̅̅
16. [Ans. D]
From the CKT
d e 0 is connected to &
d ‘ ’ is e ed and
11. [Ans. D]
a es
a es 17. [Ans. *] Range: 62.4 to 62.6
.5
12. [Ans. D]
̅̅ ̅ ̅̅ ̅̅
̅̅ ̅ ̅ ̅ 18. [Ans. D]
̅ If one input of the gate is kept constant,
̅̅ ̅ ̅̅ [ ] and A is interchanged with ̅, an XNOR
. gate acts as XOR gate.
̅̅ ̅̅ ̅ ̅ ̅ ̅
̅̅ ̅̅̅ ̅̅
19. [Ans. C]
Σ 5
In half subtractor
Difference y y
13. [Ans. D]
y
⨀ = b rr w y
x y Borrow Difference
Initially 0 0 0 0 0 0 0
After first clk 1 0 0 0 1 1 1
After 2 clk
nd 1 1 0 1 0 0 1
After 3rdclk 0 1 1 1 1 0 0
So . . . . . ..
26. [Ans. C]
̅
̅̅ ̅̅ ̅
̅ ̅
34. [Ans. C]
A
C
31. [Ans. A]
Clock is taken from normal output and it
B C
is ve edge triggering. So, it is UP-
counter.
Input of the NAND-gate is taken from AB
a d . So, a d . C
To find the modulus For sake of calculation putting the value
of C = 0
So, it is MOD-5 binary UP-counter. And thus we get x = 0; z = AB; y = AB
So, only possible answer is B(C + A)
36. [Ans. B]
From the given figure
40. [Ans. C]
Y
For State A
0 0 P
X Y Z Present State Next State
0 1 Q
0 0 0 A B
1 0 R
0 0 1 A A
1 1 S
0 1 0 A A
Truth table describes the function ability
0 1 1 A A
of a 4 to 1multiplexer
1 0 0 A C
1 0 1 A C
37. [Ans. B]
1 1 0 A A
1 1 1 A A
38. [Ans. *] Range: 1.45 to 1.55
For State B
CLK
X Y Z Present State Next State
0 0 1 0 1 0 0
0 0 0 B A
1 0 0 1 0 1 1
0 0 1 B C
2 1 0 0 1 0 0
0 1 0 B B
3 0 1 0 0 1 1
0 1 1 B B
4 1 0 1 0 0 1
1 0 0 B A
5 0 1 0 1 0 0
The waveform of the gate output 1 0 1 B B
1 1 0 B B
1 1 1 B B
For State C
5 X Y Z Present State Next State
0 0 0 C C
5
0 0 1 C C
Average power dissipated
0 1 0 C C
5
0 1 1 C B
5 1 0 0 C C
.5
1 0 1 C A
1 1 0 C C
1 1 1 C AB
6 1 1 0 0 0 0 0
If delay of NAND gate is 0 then the given 2T
circuit acts like Mod-6 counter. But here f .5 f
delay of NAND is 2ns so it will count two .5
more clocks before it resets the counter .5
[ peri d s a e de ay s]
the given counter acts like Mod-8 45. [Ans. D]
counter
EE
42. [Ans. A]
∑ 5 ae
[ ( ) ]
46. [Ans. A]
Gray code output
43. [Ans. C]
Clock Input Output
0 0 0
̅
o/p 0 0 1
0 0 0 1 1
0 1 0 1 0
Initial state 1 0
1 1 0 1 1 1 1 0 1 1 0
2 0 1 1 0 0 1 1 1 1 1
3 1 0 0 1 0 1 0 1
1 0 1
44. [Ans. B] When ̅
E p
ee i p s
p
X Q
T Q
47. [Ans. A]
CLK > T-FF to JKFF is given by eq
̅
This is implemented on options [A]
53. [Ans. D]
49. [Ans. B]
AB ̅
̅̅ ̅̅̅̅̅̅̅̅
00 0
01 54. [Ans. C]
10 5V
11 AB
J J
A B
50. [Ans. *] Range: 6 to 6
First flip flop acts as mod-2 counter K K
Second 2 flip flops from mod
Johnson counter = mod counter Next when clock applied toggles as J, K
Overall modulus = mod counter input of A connects to 5 V.
Also, toggles as previous state
51. [Ans. B]
values is J which is the input of J, K of B.
Given maxterm f 5 5
Thus, output of next state is 11
so minterm
f
IN
∑
55. [Ans. B]
̅ Y=
0 2 4 6 8 10 12 14
D(1) 1 3 5 7 9 11 13 15
56. [Ans. B]
̅ 1 ̅ 1 1 1 D ̅
a d
So initially it means
so after one clock cycle
will be 010.
57. [Ans. D] J K ̅ ̅
01 10, both = 1 so and 1 1 0
both will toggle. 1 0 1
1 0 1
58. [Ans. B]
1
65. [Ans. D]
59. [Ans. A]
Initially Q=0 and count up ( ̅ =1) is active
̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅
Y = ̅̅̅̅̅̅̅ . ̅̅̅̅̅̅̅ so it started counting up and when it
= + reaches to 5 then decoder output at pin 5
= becomes 0 and preset will be active and it
will set Q and it will make the counter
60. [Ans. C] mode down and count becomes 4, then 3
Whenever Y=1, then clear input of all the then 2 then 1 then 0, as soon as it reaches
s re eives ‘ ’ a d p s f he 0, decoder output at pin 0 is low and clear
counter will be reset. When count = 1010, is active and Q goes to 0 and ̅ so up
Y=1 and counter will be reset. is active and it counts 1,2,
Q3 Q2 Q1 Q0 So sequence is 0,1,2,3,4,5,4,3,2,1,0,1,2.
1 0 1 0
1 1 0 0 66. [Ans. B]
1 1 1 0 Let A1 A0 be the bits of number A and
B1B0 be the bits of number B and let Y be
61. [Ans. A] the output
A1 A0 B1 B0 Y
( ) ( ) 0 0 0 0 0
( ) 0 0 0 1 0
0 0 1 0 0
0 0 1 1 0
62. [Ans. B] 0 1 0 0 1
0 1 0 1 0
f
0 1 1 0 0
Where N - no. of inverters 0 1 1 1 0
And - Propagation delay of each, so 1 0 0 0 1
se A1 A0 B1 B0 Y
1 0 0 1 1
63. [Ans. A] 1 0 1 0 0
Since triggering in positive edge 1 0 1 1 0
triggering & Q of pervious flip flop is 1 1 0 0 1
input to next hence always down
1 1 0 1 1
1 1 1 0 1
64. [Ans. C]
̅ Also the truth table 1 1 1 1 0
From the truth table we see that the
ber f i es ‘ ’ be es is
5
i
̅
71. [Ans. A]
= . . Before solving the problem, consider the
next
= A.CLK + Q following fact.
Clock is +ve edge triggered and input
next = A.CLK +
to D flip-flop is constant i.e logic 1.
If CLK = 1 and A and B = 1
Reset pin of Flip flip is active high and
then } No race around it can function at any moment of time
If CLK = 1 and A = B = 0 independent to clock. Also note that
reset will be triggered when
} No race around terminal voltage just crosses 0.1 V.
Thus race around does not occur in the N-MOS behave as open switch (off
circuit state, ) when ̅ and it will
behave as a resistance of 1000 when
68. [Ans. D] ̅ (as ON resistance is specified).
State table Now for analysis, assume capacitor is
A D initially uncharged and a +ve edge is
triggered to D-flipflop, as its input is
0 0 1 1
high. Then Q=1 and ̅ .
0 1 0 0
When ̅ , N-MOS is off, assuming
1 0 0 0 the input resistance of comparator
1 1 1 1 infinite. Then the source current can
From State table flow only through the capacitor. Now
A=O we have to see how much time the
capacitor will take to reach 0.1 V. So
Q=O Q=1 that and R will change from 0
A=O to 1 and as the reset terminal will be
A=1 A=1 triggered the state of flip-flop changes
i.e. ̅ . and N-MOS gets ON.
69. [Ans. B] As the integration of step is ramp if we
State table integrate the constant current voltage
Present Next will be ramp.
state state For this use the capacitor voltage
equation.
0 0 0 1 0 1
0 1 1 1 1 1
1 1 1 0 1 0
1 0 0 0 0 0
00, 01, 11, 10, 00
∫i d
5 s
. ∫ d
. . se i i se
p . har i is har i
a p E p e ay
s s
ese
So at t = 0.2sec, N-MOS is ON. Now the
circuit is equivalent to a current source
connected to a parallel combination of RC 72. [Ans. B]
with non-zero initial voltage of capacitor T
(0.1V).
Input
Now the capacitor will discharge from its
pulse
initial voltage with time constant Clock
= RC = 2ms and at 10 it will react pulse
steady state i.e., at 20 m.sec.
The nature of discharge is exponential
decay.
The Resolution (R) is the smallest change
that is detectable.
f
Range: of measurement of input width =T
73. [Ans. A]
So we can conclude from the above y y y y y
analysis that capacitor takes 200 msec to y y y
charge upto 0.1V and 20 msec to Σ
discharge to the steady state value.
So if the +ve edge of clock appeared at 74. [Ans. B]
t = 0 then at 200 msec it completed its Note: OBSERVE is toggling on every
charging and at 220 msec it completed its clock
discharging. This continues in each clock
cycles. can be both connected
This matches with the option given
The following waveform gives further
clarity as f s
AD/DA Convertor
ECE-2007 ECE-2011
Statement for Linked Answer Q.No 1 and 2 5. The output of a 3 – stage Johnson (twisted
In the Digital-to-Analog converter circuit – ring) counter is fed to a digital – to –
shown in the figure below, = 10 V and analog (D/A) converter as shown in the
R = 10kΩ. figure below. Assume all states of the
R R R I 2R counter to be unset initially. The
V
waveform which represents the D/A
R
2R 2R R
2R 2R converter output is
+ V0 D/A
Converter
1. The current I is D D D
(A) 31.25 μA (C) 125 μA
(B) 62.5 μA (D) 250 μA
= 6.2
Clock
ref1
0.5kΩ 1 0 0 0 1 0 0 0
0 1 0 0 1 1 0 0
1.0kΩ
Digital 0 1 1 0 1 1 1 0
1.0kΩ Circuit 0 1 1 1 1 1 1 1
1 0 0 0 1 1 1 1
0.5kΩ
n n
conversion conversion
ECE 4. [Ans. B]
1. [Ans. B] In steady state = 0.5 0 2 = 6.5V
So error = 6.5 6.2 = 0.3V
R R R 16 2R
2
V
R 2R 2R 2R 2R R 5. [Ans. A]
For the Johnson counter sequence
16
A V0 D D D
0 0 0 0
Due to virtual ground, node A can be 1 0 0 4
considered as ground so = 10 1 1 0 6
10 1 1 1 7
o = = 1mA
10 0 1 1 3
o = = 62.5 μA 0 0 1 1
16
0 0 0 0
2. [Ans. C]
6. [Ans. B]
= R[ ]= 3.125 v
16 n a capacitor rop rate in given an
t
v
3. [Ans. D] we know i = C
t
= 2 volts v 1
2 ⇒
t C
Counter will stop when VDAC> 6.2 volt From the above relation it is clear that if
So counter will stop when capacitor value increases then the drop
= 1101 rate decreases because of inversion
o L D will isplay 1101 i.e CD ⇒ 13 relation.
EE 10. [Ans. A]
9. [Ans. A]
The block diagram of SAR type ADC is as 0 0 0 0 0
follows 1 0 0 0 1
tart of
1 1 0 1 0
conversion
Control logic
CL C 1 1 1 1 1
1 C = 2.56
00 01 11 10
2 C = 3. utput Register
0 0
3 C = 3.2
1 1 0 1
it DAC [ ]
Unipolar means all the voltages will be = [ ]
+ve i.e. nothing is ve.
The functionality of SAR type DAC is, it IN
will load a value to output register with 11. [Ans. B]
MSB = 1 and remaining bit = 0, and it will Truth table of ADC is
cross check a logic as follows.
f ⇒ Maintain the loaded bit 0 0 0 0 0
f ⇒ Clear the loaded bit. 0 0 1 0 1
This process continues up to 8 number of 0 1 1 1 0
clock pulses 1 1 1 1 1
The output of DAC = (Resolution) × ⇒ =
(Decimal equivalent of applied binary)
From the given information 12. [Ans. D]
5 8 – it ADC o/p is in 2’s complement form
Resolution = = 20 m
2 1 i.e it represents 12 to 12
When SOC is applied on 1st clock the
i/p voltage Range: = 2 to 2
value located to output register is
i.e 2V 12
(10000000) = (12 ) 1.5
Then = 12 20 m = 2.56 1.5 12 = 6
2
So, 3.5 2.56 ⇒ Maintain the bit
13. [Ans. A]
By characteristics of SAR ADC.
15. [Ans. A]
16. [Ans. A]
Maximum error is equal to step size
which is directly proportional to .
a imum rror =
2 1
Semiconductor Memory
ECE-2014 EE-2009
1. If WL is the Word Line and BL is the Bit 3. The increasing order of speed of data
Line, an SRAM cell is shown in access for the following devices is
i. Cache Memory
̅̅̅̅ ii. CDROM
iii. Dynamic RAM
iv. Processor Registers
v. Magnetic Tape
(A) (v), (ii), (iii), (iv), (i )
(B) (v), (ii), (iii), (i), (iv)
(C) (ii), (i), (iii), (iv), (v)
̅̅̅̅ (D) (v), ( ii), (i) , (iii), (iv)
IN-2011
4. An bit RAM is interfaced to an
8085 microprocessor. In a fully decoded
Scheme if the address of the last memory
location of this RAM is 4FFFH, the address
̅̅̅̅
of the first memory location of the RAM
will be,
(A) 1000 H (C) 3000 H
(B) 2000 H (D) 4000 H
̅̅̅̅
ECE - 2015
2. A 16 Kb (=16,384 bit) memory array is
designed as a square with an aspect ratio
of one (number of rows is equal to the
number of columns). The minimum
number of address lines needed for the
row decoder is ____________
ECE
1. [Ans. B]
For an SRAM construction four MOSFETs
are required (2-PMOS and 2-NMOS) with
interchanged outputs connected to each
CMOS inverter. So option (B) is correct.
2. [Ans. *] Range: 7 to 7
Generally the structure of a memory chip
= Number of Row × Number of column
EE
3. [Ans. B]
Processor registers has highest speed.
Followed by cache memory then dynamic
ram (slower than static ram because of
refreshing required)
IN
4. [Ans. C]
Capacity of chip
= last memory address – First memory
address+1
Introduction to Microprocessors
A11 ̅̅̅̅̅̅
2A
A12
5. An 8085 microprocessor executes “STA
A13 ̅̅̅̅̅̅
2 1234H” with starting address location
A14
A15 1 1FFEH (STA copies the contents of the
̅
accumulator to the 16-bit address
location). While the instruction is fetched
(A) 2000 20FF (C) 2E00 2EFF and executed, the sequence of values
(B) 2D00 2DFF (D) FD00 FDFF written at the address pins A A is
(A) 1FH, 1FH, 20H, 12H
ECE-2011 (B) 1FH, FEH, 1FH, FFH, 12H
3. An 8085 assembly language program is (C) 1FH, 1FH, 12H, 12H
given below. Assume that the carry flag is (D) 1FH, 1FH, 12H, 20H, 12H
initially unset. The content of the
accumulator after the execution of the ECE - 2015
program is 6. In an 8085 microprocessor, the shift
MVI A, 07H registers which store the result of an
RLC addition and the overflow bit are,
MOV B, A respectively
RLC (A) B and F (C) H and F
RLC (B) A and F (D) A and C
ADD B
RRC
IN-2010
25. In an 8085 processor, the main program Address us xt T0
calls the subroutine SUB1 given below. xt T1
rogrammable
When the program returns to the main ata us nterrupt
program after executing SUB1, the value controller
xt T
in the accumulator is T
Address Opcode Mnemonic TA
2000 3E 00 SUB1: MVIA,00h Assuming vectored interrupt, a correct
2002 CD 05 20 CALL SUB2 sequence of operations when a single
2005 3C SUB2: INR A external interrupt (Ext INT1) is received
2006 C9 RET will be :
(A) 00 (C) 02 (A) xt T1→ TA → Data Read → INT
(B) 01 (D) 03 (B) xt T1→ T → INTA → Data Read
(C) Ext INT1 → INT → INTA → Address
26. A 8-bit DAC is interfaced with a Write
microprocessor having 16 address lines (D) Ext INT1 → INT → ata ead →
(A0...A15) as shown in the adjoining Address Write
figure. A possible valid address for this
DAC is IN - 2015
2 line to d d 29. An ADC is interfaced with a
4 line ecoder microprocessor as shown in the figure. All
b
A a A signals have been indicated with typical
b
A a b Analog notations. Acquisition of one new sample
output
A ̅̅̅S b ̅̅̅S of the analog input signal by the
microprocessor Involves.
(A) 3000H (C) AFFFH
(B) 4FFFH (D) C000H Data Bus ata lines 0 to Data
Analog input
0 0Buffers
9. [Ans. D] POP H
A H DAD D
PUSH H
1 0 1 0 0 1 1 1 Normal call operation shown
cx
1 arr lag = 1
CALL SUB
0 1 0 0 1 1 1 1
4
RET
EE
10. [Ans. B] 14. [Ans. B]
Given, (SP) = 2700H To enable decoder
(PC) = 2100 H =1
(HL) = 0000H Output line 2 is selected
2100 H : DAD SP So = 010
(SP) + (HL) → (HL) A A A = 010
2700 H + 0000 H = 2700 H stored in HL =1 A A ̅ =1 A =1 A =0
pair A A A A A A A A
2101 H : PCHL : The content of HL are ⏟0 1 0 1 ⏟0 0 0 0
transferred to (PC) 5 0
A A A A A A A A
So now (PC) = 2700H and (SP) also
⏟0 0 0 0 ⏟ 0 0 0 0
unchanged 0 0
(PC) = 2700 H = 5000
(SP) = 2700 H
15. [Ans. A]
11. [Ans. D] 2000H XRA A → clear accumulator
XRA A A = 00 MVI B,
2001H → B = 04H
MVI B, F0H = 0 04H
SUB B A – B will go MVI A,
2003H → A= 03H
to accumulator 03H
00 – F0 = 10 → Rotate accumulation
2005H RAR to right A =
12. [Ans. D] 10000001
First of all content of PC is loaded into → Decrement B, B=
stack. i.e. address of next instruction to be 200 H DCR B
03
executed is loaded onto stack. i.e. SP is INZ → ump to 2005 when
decremented then PC is loaded by 200 H
2005 =0
address given in call instruction. 200 AH HLT
After 3 rotation
13. [Ans. C] A= 0 1 1 0 0 0 0 0
Call take 3 address locations. RET always = 0H
returns to LP + 3 location, this stored in
SP. So to return to LP + DISP + 3 we have
to add DISP to SP.
27. [Ans. D]
Instructions Content of register
MVI A, 99H A = 99
ADI 11H A = 99 + 11 = AAH
MOV C,A C = AAH
28. [Ans. B]
The correct sequence is external
interrupts occurs at PIC, then it is
transferred to microprocessor, then
interrupt is acknowledge and finally data
is read.
29. [Ans. C]