(PCC-06) Computer Organization
Teaching Scheme Evaluation Scheme
Lectures: 2Hrs/ Week Theory: MES:30 Marks, TA:10 Marks ESE:60
Marks
Course Outcomes
Students will be able to:
1. Analyze Performance aspects, Instruction set architecture, and Functional Units.
2. Apply different computer arithmetic principles for implementation of functional units.
3. Interpret the working of memory hierarchy of computer system.
4. Justify the need of paging in virtual memory and secondary storage with its advantages.
5. Measure and analyze features of multiprocessor systems like bus arbitration,
Instruction pipelining, and RISC & CISC.
6. Examine Input/Output including interfaces, buses, interrupt handling mechanisms,
and I/O controllers
Course Contents
CPU Architecture: Performance understanding, Amdahl’s Law, Benchmarking, Flynn’s
Classification, Instruction format, control signals in CPU, micro program control unit and hardwired
control unit, ALU & sequencer, look ahead carry generator, MIPS ISA
[6Hrs]
Arithmetic: Integer Arithmetic-multiplication, Booth’s Algorithm, division algorithm; Floating point
number representation, and floating-point arithmetic
[6Hrs]
Memory: Dynamic RAM organization, Cache memory &basic cache optimizations, cache coherence
& MESI protocol, virtual memory, secondary storage, MBR and GPT hard disks, RAID, File system
FAT
[8Hrs]
System and memory map: Closely coupled and loosely coupled multiprocessor systems, bus
arbitration, co-processor, lower 1MB memory map
[7Hrs]
Instruction Pipelining: Basic concepts and issues, Introduction to the basic features &
architecture of RISC & CISC processors, super scalar processor, MIPS pipeline
[7Hrs]
Multiprocessing: Symmetricmultiprocessing (SMP), Asymmetric multiprocessing (AMP), Hardwired
based multithreading approaches and examples, Different examples of computer organization as per
Flynn’s Classification
[5Hrs]
Self Study
Closely coupled and loosely coupled multiprocessor systems, Differences in RISC & CISC approaches,
Differences in FAT and NTFS, Programs exhibiting Locality of Reference, Dependence analysis and
hazard detection using different resources. [12Hrs]
Page 20/30
Text Books
• William Stallings, Computer Organization and Architecture, 11/E ISBN- 9781292420103/
9781292420080, Pearson Education, Global Edition, 2021-22.
• Carl Hamacher, Zvonko Vranesic, Safwat Zaky, and Naraig Manjikian, Computer Organisation,
6th Edition, ISBN- 978-0-07-338065-0/ 0-07-338065-2, McGrawHill, 2011-12.
Reference Books
• D. Patterson, J. Hennessy, Computer Organization and Design: The Hardware Software
Interface, RISC V Edition, ISBN- 978-0-12-812275-4, Morgan Kauffman, 2018.
• Liu & Gibson, Microcomputer Systems, Second Edition, ISBN: 978-81-203-0409-3, PHI, 1985.
• John Uffenbeck, THE 8086/ 8088 FAMILY: Design, Programming, and Interfacing, EEE, ISBN-
0132467526/ 9780132467520, PHI, 1987.
(PCC-06) Theory of Computation
Teaching Scheme Evaluation Scheme
Lectures: 2Hrs/ Week Theory: MSE: 30 Marks, TA: 10 marks
Tutorial: 1 Hr / Week ESE: 60 Marks
Self-Study: 1 Hr / Week
Course Outcomes
Students will be able to:
1. Design appropriate automata for modeling the solution for various computational problems.
2. Apply transformation between multiple representations of automata/machines.
3. Make use of the pumping lemma to show that a language is not regular/context-free.
4. Distinguish different formal computing languages and classify their respective types.
5. Describe the limitations of a computing machine in terms of language recognition.
Course Contents
Finite Automata: Computability, and Complexity, Strings and Languages: symbol, alphabet, string,
formal languages, Formal definition of a finite automaton, Designing finite automata, Non-
determinism: Formal definition, Equivalence of NFAs and DFAs, Minimization of
DFA.
[10 Hrs]
Regular Expressions: Regular Expressions: Formal definition of a regular expression, Equivalence
with finite automata, Closure properties of regular languages, the pumping lemma for regular
languages.
[4 Hrs]
Context-Free Languages: Context-free Grammars: Formal definition, Designing context-free
grammars, Parse Trees, Ambiguity, Chomsky Normal Form. Pushdown Automata: Formal definition,
Examples.
[6 Hrs]
Turing Machines and Undecidability: Turing Machines Formal definition, Examples, Decidability
and Undecidability:Decidable Languages: Decidable problems concerning regular languages,
Decidable problems concerning context-free languages, Undecidable problems, The Halting
Problem.
[6 Hrs]
Page 21/30