Quick Links
| University Papers | University Syllabus | Entrance Exam |
| PSU Papers | Bank Papers | Placement Papers |
| VTU | Anna Univerity Syllabus | Anna Univerity Papers |
Anna University Question Paper Code :57010
B.E./B.Tech. DEGREE EXAMINATION, MAY/JUNE 2014..
Second Semester
Computer Science and. Engineering
CS 6201 — DIGITAL PRINCIPLES AND SYSTEM DESIGN.
(Common to Information Technology and Compiler and Communication Engineering)
(Regulation 2013)
Download PDF File - CLICK HERE
For More 1st Year Question Papers
For More Question paper of CSE
For More Question paper of IT
PART A — (10 x 2 = 20 marks)
1. Find the octal equivalent of hexadecimal numbers AB.CD.-
2. State and prove the consensus theorem.
3. Implement the function G = Erna 3) using a 2 x 4 decoder.
4. Draw the circuit for 2-to-1 line multiplexer.
5. Write the Characteristic table and equation of JK flip flop.
6. Write any two applications of shift register.
7. Define Race condition.
8. What are the types of hazards?
9. What is memory decoding?
10. Define ASIC.
PART B (5 x 16 = 80 marks)
11. (a) Simplify the following functions, using K-Map technique (i) G =HM(9, 1, 7, 9, 11) f(W,X7Y,Z) = Em(0,7,8, 9, 10, 12)+ Ec42,5, 13)
Or
(b) Minimize the expression using Quine McCluskey (Tabulation) method F, = Erna 1, 9,15,24, 29, 30)+ Id (8,-11,31)
CS6201 Digital Principle And System Design syllabus
OBJECTIVES:
The student should be made to:
- Learn the various number systems.
- Learn Boolean Algebra
- Understand the various logic gates.
- Be familiar with various combinational circuits.
- Be familiar with designing synchronous and asynchronous sequential circuits.
- Be exposed to designing using PLD
UNIT I BOOLEAN ALGEBRA AND LOGIC GATES 9
Review of Number Systems – Arithmetic Operations – Binary Codes – Boolean Algebra and Theorems – Boolean Functions – Simplification of Boolean Functions using Karnaugh Map and Tabulation Methods – Logic Gates – NAND and NOR Implementations.
UNIT II COMBINATIONAL LOGIC 9
Combinational Circuits – Analysis and Design Procedures – Circuits for Arithmetic Operations, Code Conversion – Decoders and Encoders – Multiplexers and Demultiplexers – Introduction to HDL – HDL Models of Combinational circuits.
UNIT III SYNCHRONOUS SEQUENTIAL LOGIC 9
Sequential Circuits – Latches and Flip Flops – Analysis and Design Procedures – State Reduction and State Assignment – Shift Registers – Counters – HDL for Sequential Logic Circuits.
UNIT IV ASYNCHRONOUS SEQUENTIAL LOGIC 9
Analysis and Design of Asynchronous Sequential Circuits – Reduction of State and Flow Tables – Race-free State Assignment – Hazards.
UNIT V MEMORY AND PROGRAMMABLE LOGIC 9
RAM and ROM – Memory Decoding – Error Detection and Correction – Programmable Logic Array – Programmable Array Logic – Sequential Programmable Devices – Application Specific Integrated Circuits.
TOTAL: 45 PERIODS
OUTCOMES:
At the end of this course, the student will be able to:
- Perform arithmetic operations in any number system.
- Simplify the Boolean expression using K-Map and Tabulation techniques.
- Use boolean simplification techniques to design a combinational hardware circuit.
- Design and Analysis of a given digital circuit – combinational and sequential.
- Design using PLD.
TEXT BOOK:
1. Morris Mano M. and Michael D. Ciletti, “Digital Design”, IV Edition, Pearson Education, 2008.
REFERENCES:
1. John F. Wakerly, “Digital Design Principles and Practices”, Fourth Edition, Pearson Education, 2007.
2. Charles H. Roth Jr, “Fundamentals of Logic Design”, Fifth Edition – Jaico Publishing House, Mumbai, 2003.
3. Donald D. Givone, “Digital Principles and Design”, Tata Mcgraw Hill, 2003.
4. Kharate G. K., “Digital Electronics”, Oxford University Press, 2010.
The student should be made to:
- Learn the various number systems.
- Learn Boolean Algebra
- Understand the various logic gates.
- Be familiar with various combinational circuits.
- Be familiar with designing synchronous and asynchronous sequential circuits.
- Be exposed to designing using PLD
UNIT I BOOLEAN ALGEBRA AND LOGIC GATES 9
Review of Number Systems – Arithmetic Operations – Binary Codes – Boolean Algebra and Theorems – Boolean Functions – Simplification of Boolean Functions using Karnaugh Map and Tabulation Methods – Logic Gates – NAND and NOR Implementations.
UNIT II COMBINATIONAL LOGIC 9
Combinational Circuits – Analysis and Design Procedures – Circuits for Arithmetic Operations, Code Conversion – Decoders and Encoders – Multiplexers and Demultiplexers – Introduction to HDL – HDL Models of Combinational circuits.
UNIT III SYNCHRONOUS SEQUENTIAL LOGIC 9
Sequential Circuits – Latches and Flip Flops – Analysis and Design Procedures – State Reduction and State Assignment – Shift Registers – Counters – HDL for Sequential Logic Circuits.
UNIT IV ASYNCHRONOUS SEQUENTIAL LOGIC 9
Analysis and Design of Asynchronous Sequential Circuits – Reduction of State and Flow Tables – Race-free State Assignment – Hazards.
UNIT V MEMORY AND PROGRAMMABLE LOGIC 9
RAM and ROM – Memory Decoding – Error Detection and Correction – Programmable Logic Array – Programmable Array Logic – Sequential Programmable Devices – Application Specific Integrated Circuits.
TOTAL: 45 PERIODS
OUTCOMES:
At the end of this course, the student will be able to:
- Perform arithmetic operations in any number system.
- Simplify the Boolean expression using K-Map and Tabulation techniques.
- Use boolean simplification techniques to design a combinational hardware circuit.
- Design and Analysis of a given digital circuit – combinational and sequential.
- Design using PLD.
TEXT BOOK:
1. Morris Mano M. and Michael D. Ciletti, “Digital Design”, IV Edition, Pearson Education, 2008.
REFERENCES:
1. John F. Wakerly, “Digital Design Principles and Practices”, Fourth Edition, Pearson Education, 2007.
2. Charles H. Roth Jr, “Fundamentals of Logic Design”, Fifth Edition – Jaico Publishing House, Mumbai, 2003.
3. Donald D. Givone, “Digital Principles and Design”, Tata Mcgraw Hill, 2003.
4. Kharate G. K., “Digital Electronics”, Oxford University Press, 2010.
0 Comments