Digital Logic Fundamentals B.C.A Question Paper : ideunom.ac.in

University : University of Madras
Degree : B.C.A
Department : Computer Application
Subject : Digital Logic Fundamentals
Document type : Question Paper
Website : ideunom.ac.in

Download Previous/ Old Question Paper :
OCT 2013 :https://www.pdfquestion.in/uploads/ideunom.ac.in/6806-._DEC2013_uid46432%20UCCB.pdf
OCT 2012 :https://www.pdfquestion.in/uploads/ideunom.ac.in/6806-._DEC12_uid14672%20NCJ.pdf
May 2013 :https://www.pdfquestion.in/uploads/ideunom.ac.in/6806-._MAY2013_uid14672%20NCJ.pdf
OCT 2011 :https://www.pdfquestion.in/uploads/ideunom.ac.in/6806-d11._QBNEW_uid14672%20NCJ.pdf
May 2011 :https://www.pdfquestion.in/uploads/ideunom.ac.in/6806-._MAY2011_uid14672-NCJ.pdf

IDEUNOM B.C.A Digital Logic Question Paper

 U/ID 14672/NCJ
Time : Three hours
Maximum : 100 marks
PART A — (5 ´ 8 = 40 marks)
Answer any FIVE questions.
All questions carry equal marks.

Related / Similar Question Paper :
IDEUNOM BCA System Analysis & Design Question Paper

OCTOBER 2011

1. Explain the following conversion with example.
(a) Binary to Decimal
(b) Hexadecimal to Binary.

2. Write short note on :
(a) ASCII code
(b) Excess 3 code.

3. Discuss about Associative law and commutative law.
4. Draw the gate circuit of RS flip flop and obtain its truth table.
5. Explain in detail about the full sub tractor.
6. Discuss in detail about the Encoder.
7. Explain in detail about Status register.
8. Discuss in detail about designing circuit using PLA.

PART B — (3 ´ 20 = 60 marks)
Answer any THREE questions.
All questions carry equal marks.
9. Draw AND, OR, NOT and NAND gate using NOR gate and explain.
10. Explain Karnaugh map method of simplification with example.
11. Draw a ripple counter circuit and explain its operation.
12. Draw the 8 to 1 Multiplexer circuit and explain.
13. Explain in detail about design of accumulator.

OCTOBER 2012

U/ID 14672/NCJ
Time : Three hours
Maximum : 100 marks
PART A — (10 ´ 3 = 30 marks)
Answer any TEN questions.
All questions carry equal marks.
1. Find A,B . ( ) ( )8 10 237 – A ( ) ( )16 2 2D6 – B .
2. What are Logic gates?
3. Simplify the boolean expression Y = ABC + AB + A .
4. Define the boolean algebra.
5. Write down the MC-clausky tabulation method steps.
6. What is sequential Logic circuit? Give an example.
7. What are flip-flops? Given example.
8. Define counters. Give an example.
9. What is meant by encoder?
10. Define : multiplexer. Multiplexer
11. Define – Accumulator. Accumulator
12. What is meant by Register?

PART B — (5 ´ 6 = 30 marks)
Answer any FIVE questions.
All questions carry equal marks.
13. Convert the following and find p, q,r,s .
(a) ( ) ( )2 10 10001101 = p
(b) ( ) ( )8 10 574 = q
(c) ( ) ( )10 8 919 = r
(d) ( ) ( )16 10 E5 = s .

14. List the boolean algebra postulates and prove them.
15. Simplify the following Boolean expression by using Karnaugh map F(A,B,C,D) = A B C + B C D + ABCD + AB C .
16. Describe about the Shift Registers with diagram. Shift Register with diagram.
17. Explain about the synchronous counters with neat diagram and truth table.
18. Discuss about the Half-subtractors with suitable diagram.
19. Write note on ALU with details.

PART C — (4 ´ 10 = 40 marks)
Answer any FOUR questions.
All questions carry equal marks.
20. Briefly explain about the NAND, NOR and EX-OR gates with detail.
21. Reduce the following equation (0,2,3,5,8,10,11,13) m f = S using the Mc Cluskey method.
22. Simplify the following Boolean expression by using Karnaugh map Y(A,B,C,D) = ABCD + AB C D + ABC + AB .
23. Briefly explain about the JK flip-flop with circuit and truth table.
24. Discuss about the Full adder with suitable diagram.
25. Briefly explain about the design of status register.

MAY 2013

U/ID 14672/NCJ
Time : Three hours
Maximum : 100 marks
SECTION A : (10 ´ 3 = 30 marks)
Answer any TEN questions.
All questions carry equal marks.
1. What is meant by Excess three codes? Give example.
2. State Demorgan’s theorem.
3. List any three number representation in binary.
4. What is Karnaugh map?
5. Write any two characteristics of Flip-flops.
6. What is decoder? Explain.
7. What is meant by shift registers?
8. What is asynchronous counter? Give example.
9. List out the operations of ALU.
10. Describe the functions of the ROM memories.
11. With an example, define registers.
12. What is meant by 2’s complement representation?
Give example.

SECTION B : (5 ´ 6 = 30 marks)
Answer any FIVE questions.
All questions carry equal marks.
13. Convert the following numbers :
(a) (253.23)10 = (?)8
(b) (10001.10001)2 = (?)16
(A) (253.23)10 = (?)8
(B) (10001.10001)2 = (?)16
14. Discuss the basic theorems of Boolean algebra.
15. Design a synchronous RS flip flop with logic circuit.
16. Explain a 1*16 bit multiplexer with truth table.
17. Explain the micro operations of the accumulator.
18. Discuss the programmable logic arrays.
19. Discuss briefly the 4-bit input shift register with timing diagram.

SECTION C : (4 ´ 10 = 40 marks)
Answer any FOUR questions.
All questions carry equal marks.
20. Explain the basic and universal logic gates with circuit diagram and truth table.
21. Minimize four variables Boolean equation using K-map method
22. Describe the design of the synchronous counter and explain with truth table.
23. Construct a three bit full subtractor using logic gates.
24. Discuss the design of the circuit using PLA with four inputs and four outputs.
25. Describe the design of arithmetic logic unit and their functions.