Scribd
Upload
37 views

CS3351 Set2

This document outlines the practical end semester examinations for the third semester of a B.E/B.Tech program in the subjects of Digital Principles and Computer Organization. It provides 20 examination questions related to designing and implementing various combinational logic circuits using logic gates. The circuits include designs for Boolean theorem verification, half/full adders and subtractors, binary-to-gray code converters, demuxes, muxes, counters, and other digital logic components. Students must answer one of the 20 questions in a 3 hour exam worth a total of 100 marks.

Uploaded by

shamrithaa.priya
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
37 views

CS3351 Set2

This document outlines the practical end semester examinations for the third semester of a B.E/B.Tech program in the subjects of Digital Principles and Computer Organization. It provides 20 examination questions related to designing and implementing various combinational logic circuits using logic gates. The circuits include designs for Boolean theorem verification, half/full adders and subtractors, binary-to-gray code converters, demuxes, muxes, counters, and other digital logic components. Students must answer one of the 20 questions in a 3 hour exam worth a total of 100 marks.

Uploaded by

shamrithaa.priya
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

B.E / B.Tech.

PRACTICAL END SEMESTER EXAMINATIONS, NOVEMBER/DECEMBER 2022

Third Semester

CS3351 - DIGITAL PRINCIPLES AND COMPUTER ORGANIZATION

(Regulations 2021)

Time : 3 Hours Answer any one Question Max. Marks 100

Aim/Principle/Apparatus Tabulation/Circuit/ Calculation Viva-Voce Record Total


required/Procedure Program/Drawing & Results
20 30 30 10 10 100

1. Design a combinational circuit for verifying Boolean theorems and implement it using digital logic
gates. (100)

2. Design and implement a combinational circuit using basic gates for arbitrary function like half
adder and half subtractor. (100)

3. Design a full adder and full subtractor circuit using logic gates. Construct the circuit and read
output sum and carry. Verify its truth table. (100)

4. Design and construct a 4-bit binary adder using suitable logic gates and verify its truth table (100)

5. Design and Implement a combinational circuit for 4 bit binary subtractor using MSI

Devices (100)

6. Design and implement a combinational circuit using basic gates for binary to gray code convertor.
(100)

7. Design and implement excess-3 to BCD converter. (100)

8. Validate a combinational circuit that converts a four bit gray code to binary code. (100)

9. Design and implement a combinational circuit for 1 x 4 demux using basic gates. (100)

Page 1 of 2
10. Design and construct a combinational circuit for 4 x 1 mux using basic gates. (100)

11. Design and implement a combinational circuit using basic gates for BCD to Excess – 3 code

Convertor. (100)

12. Design a combinational circuit with minimum number of inputs using K map reduction technique
for the given function F = Σm (0, 2, 5, 6, 8, 10, 13, 14) (100)

13. Design and construct a 4 bit Synchronous down counter using JK flip flops

14. Design and implement of a Universal shift register (100)

15. i) Verify the following Boolean algebra using logic gates (a)X+Y=Y+X (b)X+XY=X (50)

ii) Write the Simulator based study experiment of Computer architecture (50)

16. Design a combinational circuit for verifying Demorgan’s theorems and implement it using digital
logic gates. (100)

17. Design and implement a combinational circuit for encoder using logic gates. (100)

18. Design and construct a combinational circuit for decoder using basic gates. (100)

19. Design and implement a combinational circuit for BCD adder. (100)

20. Design and construct a 4 bit Synchronous up counter using JK flip flops (100)

Page 2 of 2

You might also like