Digital principles and computer organizations

Arulmigu Meenakshi Amman college of Engineering
Vadamavandal-604410.
Prepared by,
V.Umapathy,
Prof./Mech.
Imortant Questions and Answers
CS25C06- Digital Principles and Computer Organization
Syllabus
1. Digital Logic: Digital Systems, Integer Arithmetic, Addition and Subtraction of Signed
Numbers, Boolean Algebra, Theorems and Postulates, Functions, Truth Table, Canonical
and Standard Forms, Simplification using K-Maps, Digital Logic Gates, Universal gates,
Implementation of Logic Gates, Integrated Circuits.
Activities: • Assignment on Karnaugh Map. • Build logic circuits. • Virtual demonstration of
logical gates.
2. Computer System: Basic structure of a computer, Classes of Computer, Functional units -
Interconnection of components, Von Neumann architecture and Harvard architecture -
Instruction execution cycle, Performance metrics: MIPS, MFLOPS, CPI, throughput.
Activities: • MIPS, MFLOPS, and CPI calculations. • Preparations of report on comparison
of two CPU from different manufacturing.
3. Arithmetic and Logic Unit: Combinational Circuits: Adders, Binary Adder, Binary Parallel
Adder, Subtractor, Multiplexers, Decoders, Design of Fast Adder, Multiplication of Signed
and Unsigned Numbers, Fast Multiplication - Integer Division, Floating Point Numbers and
V.




Operations, Booth’s algorithm for signed multiplication, Sequential Circuits: Flip-Flops,
U




Registers, Counters.
m




Activities: • Virtual demonstration on Binary adder. • Build a parallel order.
ap




4. Processing and Pipelining: Instruction Set Architecture: RISC vs CISC, Addressing modes,
at




Hardwired control and Micro programmed control unit, Concepts of Pipelining, Pipeline
hy




stages and Timing diagram, Hazards: Structural, Data and Control Hazards, Instruction-level
parallelism, Parallel processing concepts: SIMD, MIMD, Superscalar processors, Vector and
,P




Array Processor.
ro




Activities: • Comparison of RISC-V and x86 ISAs; present findings on their relevance to AI
accelerators. • Spot and resolve different types of pipeline hazards in given scenarios.
f./
M
ec
h.

, 5. Memory: Memory hierarchy: Registers, Cache, Main Memory- RAM- ROM: PROM,
EPROM, EEPROM-Secondary storage, HDD, SSD, Cache Organization, Cache replacement
policies, NUMA- DMA- ECC.
6. I/O Systems I/O Techniques: Programmed, Interrupt-Driven, DMA, I/O Devices and
Interface Standards: PCI, USB, SATA, Interrupt Types and Priority Handling, Buses and
Bus Arbitration, Peripheral Communication.
Activities: ● Virtual demonstration of DMA. ● I/O in Real AI Systems.
7.

S.No. Description
Unit-I
Digital Logic
Introduction
_Introduction to Digital Logic_
1. What: Deals with binary data (0s and 1s)
2. Why: Foundation of digital systems (computers, etc.)
3. Key concepts: Binary arithmetic, Boolean algebra, logic gates

_Integer Arithmetic
1. Binary numbers: Base-2 representation
2. Signed numbers:
- Sign-magnitude
- 1's complement
- 2's complement (most common)
3. Operations: Addition, subtraction using 2's complement

_Addition and Subtraction of Signed Numbers_
V.




1. 2's complement method:
U




- Add for addition
m




- Add 2's complement for subtraction
2. Example:
ap




- 5 + (-3) = 5 + 2's(3) = 0101 + 1101 = 0010 (2)
at
hy




_Boolean Algebra
,P




1. What: Algebra for binary variables (0, 1)
2. Operations: AND, OR, NOT
ro




3. Postulates:
f./




- Commutative, associative, distributive laws
M
ec
h.

, - Identity, complement laws
_Boolean Functions and Truth Tables
1. Truth table: Lists all input-output combinations
2. Example: F(A,B) = A AND B




_Canonical and Standard Forms_
1. *SOP (Sum of Products) *: e.g., AB + A'B'
2. *POS (Product of Sums) *: e.g., (A+B)(A'+B')

_Simplification using K-Maps_
1. What: Graphical method to simplify Boolean functions
2. How: Group 1s (for SOP) or 0s (for POS)

_Digital Logic Gates_
1. Basic gates: AND, OR, NOT
2. Universal gates: NAND, NOR (can implement any logic)
3. Implementation: Using transistors (ICs)

_Integrated Circuits (ICs)_
1. What: Chips with logic gates
V.




2. Types: SSI, MSI, LSI, VLSI
3. Why: Compact, efficient digital systems
U
m




Want more details or examples?
ap
at




Example (K-Map Simplification)_F(A,B) = A'B' + A'B + AB
hy




K-Map:
,P




| B' | B
ro




A'| 1 | 1
A|0 |1
f./
M
ec
h.

, Simplified: A' + B


- AND: ∧
Logic Gate Symbols

- OR: ∨
- NOT: ¬
Basic Concepts
Basics Concepts_
1. Binary numbers: 0s and 1s
2. Logic levels: 0 (low), 1 (high)
3. Boolean algebra: Rules for binary operations

_Digital Systems_
1. What: Systems processing binary data
2. Examples: Computers, calculators, digital clocks

_Integer Arithmetic_
1. Binary addition: 0+0=0, 0+1=1, 1+1=10
2. Signed numbers:
- Sign-magnitude
- 2's complement (most common)

_Addition and Subtraction of Signed Numbers_
1. 2's complement method:
- Add for addition
- Add 2's complement for subtraction
2. Example:
- 5 + (-3) = 5 + 2's(3) = 0101 + 1101 = 0010 (2)
V.
U




_Boolean Algebra_
m




1. Operations:
ap




- AND (⋅)
at




- OR (+)
hy




- NOT (¬)
2. Laws:
,P




- Commutative: A+B = B+A
ro




- Associative: (A+B)+C = A+(B+C)
- Distributive: A(B+C) = AB + AC
f./
M
ec
h.