CS3352 DIGITAL PRINCIPLES AND COMPUTER ORGANIZATION SYLLABUS
CS3352 DIGITAL PRINCIPLES AND COMPUTER ORGANIZATION L T P C 3 0 2 4
COURSE OBJECTIVES:
• To analyze and design combinational circuits.
• To analyze and design sequential circuits
• To understand the basic structure and operation of a digital computer.
• To study the design of data path unit, control unit for processor and to familiarize with the hazards.
• To understand the concept of various memories and I/O interfacing.
UNIT I COMBINATIONAL LOGIC 9
Combinational Circuits – Karnaugh Map – Analysis and Design Procedures – Binary Adder – Subtractor
– Decimal Adder – Magnitude Comparator – Decoder – Encoder – Multiplexers – Demultiplexers
UNIT II SYNCHRONOUS SEQUENTIAL LOGIC 9
Introduction to Sequential Circuits – Flip-Flops – operation and excitation tables, Triggering of FF, Analysis and design of clocked sequential circuits – Design – Moore/Mealy models, state minimization, state assignment, circuit implementation – Registers – Counters.
UNIT III COMPUTER FUNDAMENTALS 9
Functional Units of a Digital Computer: Von Neumann Architecture – Operation and Operands of Computer Hardware Instruction – Instruction Set Architecture (ISA): Memory Location, Address and Operation – Instruction and Instruction Sequencing – Addressing Modes, Encoding of Machine Instruction – Interaction between Assembly and High Level Language.
UNIT IV PROCESSOR 9
Instruction Execution – Building a Data Path – Designing a Control Unit – Hardwired Control, Microprogrammed Control – Pipelining – Data Hazard – Control Hazards.
UNIT V MEMORY AND I/O 9
Memory Concepts and Hierarchy – Memory Management – Cache Memories: Mapping and Replacement Techniques – Virtual Memory – DMA – I/O – Accessing I/O: Parallel and Serial Interface
– Interrupt I/O – Interconnection Standards: USB, SATA
45 PERIODS
PRACTICAL EXERCISES: 30 PERIODS
- Verification of Boolean theorems using logic gates.
- Design and implementation of combinational circuits using gates for arbitrary functions.
- Implementation of 4-bit binary adder/subtractor circuits.
- Implementation of code converters.
- Implementation of BCD adder, encoder and decoder circuits
- Implementation of functions using Multiplexers.
- Implementation of the synchronous counters
- Implementation of a Universal Shift register.
- Simulator based study of Computer Architecture
COURSE OUTCOMES:
At the end of this course, the students will be able to:
CO1 : Design various combinational digital circuits using logic gates
CO2 : Design sequential circuits and analyze the design procedures
CO3 : State the fundamentals of computer systems and analyze the execution of an instruction
CO4 : Analyze different types of control design and identify hazards
CO5 : Identify the characteristics of various memory systems and I/O communication
TOTAL: 75 PERIODS
TEXT BOOKS:
- M. Morris Mano, Michael D. Ciletti, “Digital Design : With an Introduction to the Verilog HDL, VHDL, and System Verilog”, Sixth Edition, Pearson Education, 2018.
- David A. Patterson, John L. Hennessy, “Computer Organization and Design, The Hardware/Software Interface”, Sixth Edition, Morgan Kaufmann/Elsevier, 2020.
REFERENCES:
- Carl Hamacher, Zvonko Vranesic, Safwat Zaky, Naraig Manjikian, “Computer Organization and Embedded Systems”, Sixth Edition, Tata McGraw-Hill, 2012.
- William Stallings, “Computer Organization and Architecture – Designing for Performance”, Tenth Edition, Pearson Education, 2016.
- M. Morris Mano, “Digital Logic and Computer Design”, Pearson Education, 2016.