# Winter 2011 Bachelor of Computer Application (BCA) – Semester 1 BC0036 – Digital Systems – 4 Credits

(Book ID: B0680)

Assignment Set – 1 (60 Marks)

Each question carries ten marks 1. Convert the following octal number to decimal a) 64.24(8) b) 2456(8) c) 0.5675(8) d) 5624.87(8)

6 x 10 = 60

2. Use Boolean algebra to simplify the logic function and realize the given function and minimized function using discrete gates. F = a b c + a b c + a c + bc +abc. 3. Prove that a) a + bc = (a+b) . (a+c) b) a + a b = a +b.

4. Reduce the following expression using K map and implement using universal gate. a) f = b) f= 5.

(0,2,3,5,6,7,8,9,11,13,15)
m

 (2,3,5,6,7,9,11,13,14)
m

Describe the operations performed by the following arithmetic circuits. a. Half adder

Full adder c. Explain a basic three bit up/down synchronous counter. Full subtractor 6. .b. Half subtractor d.

15) b.8.DD(16) 2.Winter 2011 Bachelor of Computer Application (BCA) – Semester 1 BC0036 – Digital Systems – 4 Credits (Book ID: B0680) Assignment Set – 2 (60 Marks) Each question carries ten marks 6 x 10 = 60 1.0A(16) d) 456.13. Write the truth table and a Boolean expression for the following conditions: x is 0 if any two of the three variables are 1.012(16) 5.14) c. a.7.9.12. f = ∑(2.14.7.A5(16) e) 6DE.6. Explain Master Slave J-K Flip Flop.3.13.7. a) 8AC8.7. Draw the logic diagram of a divide by 18 Johnson counter. . Represent the following hexadecimal number into binary. Obtain the set of prime implicants for f =  (0. Implement the following SOP expressions.6. Sketch the timing diagram and write the sequence in tabular form.12.14.8. f = ∑(1.15) .11. x is 1 for all other conditions. 6.6.9.15) 4.1. 3. f = ∑(2.10.6.AA7(16) c) 23BC.3. m b) 654. f = ∑(2.14) d.