• Embed Doc
  • Readcast
  • Collections
  • CommentGo Back
Download
 
Q1.What are positive logic & negative logic?
Ans.When any clock dependent digital ckt. Works on positive edge of clock pulsei.e. logic 1 (+5.v) is called positive logic . When works on negative edge of clock pulse i.e. logic ‘o’(+ov) is called negative logic. Negative logicPositive logic
Q2.Convert (27.10)
10
(11011. 00011)
2
2271= 11 0 1121312602311. 102-----.20 02----.4002----.800.000112----.6012----.2012----.400
Q3. What is race around condition?
Ans.It is concerned with R.S. – flip flop . i.e. When is RS-FF, we have reset one F.F.at same time, which is not possible, means at R=S=1 , output comes in high,state or rapidly changes from 1 to 0 & viceversa at high speed & we are not ableto get stable output, this is called race around condition.
Q4. Realize an AND gate using NOR gate.
Ans.Mathematically A + B = A . B = A.B ( using De morgns thrm.( X +y) = X.y and X = x.
Q5.Realize OR gate using NOR.
OR gate
Q6.Realize OR, AND gate using NAND gate.
Ans.=ABWhich is And gateMathematically
 
 NOR  NOR  NOR (A + B) = A.B=ABA + B = A + BA + BABBA NANDA NANDB NAND NAND NANDABA . B = A + B= A + B
This OR- 
 
Q7.Realize XOR, XNOR, XNOR gates. Draw their truth tables also.
Ans.T . TABY000011101110ABY001010100111
Q8.State & Prove Demorgans theorm using truth table.
Ans.ABABA.BA.B = A + B0011011011001110010111100100 ABABA + B
(A + B)= A . B0011011011010010011001100100
Q9. Discuss R-S flip flop. Also draw D flip flop using R-S flip flop.
Ans.R-S (Reset – Set) flip flop used to set & reset or to store 1 bit at a time. It iscalculated that R-S flip flop, when R=S=o produces “NO CHANGE” in output,which means output remain same as that previous one.CLK SQQ100 No change1010111010XOR gate
      X     O     R
 
ABy
XNOR gate
      X      N     O     R
ABy
Y = A . B + A . B
A . B = A + B
L.H.S= R.H.S(A + B) = A. B
L.H.S = R.H.S  NOR   NOR QSQCLK QQS
 
111undefined.D- Flip Flop: When inputs of R-S F.F are connected to each other by an invertors shownin figure it becomes D-F.F. It is also called buffer as it produces output same as that of Input.
Q10.Convert following
Binary number into Gray code.a. (1011)
2
It’s method is as follows by leaving carry10111110Q11.Convert Binary to Access-3 code. Add decimal.a.(100)
2
 
100(3)
10
or (11)
2
to any binary to have Access-3 code100 4
Q11Convert Gray code to Binary code.
Ans.A. (1110)1110(1011)i.e. gray (1110) = (1011)
2
Q12.Exercise for students.
1.
(1011)
2
= ( )
8
= ( )
16
2.
(100.001)
10
= ( )
2
= ( )
16
3.
(7AB)
16
= ( )
2
= ( )
10
4.Binary to gray code (a) 1010 b 01011
Q13.Simplify expression using Boolean algebra formulas.
1.(x +y) (x + y) = x.x + x.y + x.y + y.y[ As we know 1. A.A = A 2. A.A = 0 ]= x + xy + xy= x(1 + y) + xy[using 1+A =1)=x + x.y(or 1 + A =1)=x(1+y)= x
Q14.Using two 2x4 decoders design 3x8 decoder.
Here using A
2
bit as a chip select.
Q15.Discuss half subtractor?
Ans.XYDifference(D)Borrow (B)0000
QQSCLSCLKDQQ10010013----- + ------111 7D
0
D
1
2
1
Decoder D
3
2
0
2x4D
2
E2
0+
2
1
2 x4Decoder ED
0
D
1
D
2
D
3
A
0
A
1
A
2
of 00

Leave a Comment

You must be to leave a comment.
Submit
Characters: ...
You must be to leave a comment.
Submit
Characters: ...