Unit 2: Theory of Computation: Syllabus For Competitive Examination For
Unit 2: Theory of Computation: Syllabus For Competitive Examination For
Regular languages and finite automata, Context free languages and Push-down
automata, Recursively enumerable sets and Turing machines, Undecidability;
NPcompleteness.
Unit 3: Digital Logic
Logic Functions, Minimization, Design and synthesis of combinational and sequential
circuits; Number representation and computer arithmetic (fixed and floating point).
Unit 4: Computer Organization and Architecture
Machine instructions and addressing modes, ALU and data-path, CPU control
design, Memory interface, I/O interface (interrupt and DMA mode), Instruction
pipelining, Cache and main memory, Secondary storage.
Unit 5: Programming and Data Structures
Programming in C; Functions, Recursion, Parameter passing, Scope, Binding;
Abstract data types, Arrays, Stacks, Queues, Linked Lists, Trees, Binary search
trees, Binary heaps.
Unit 6: Algorithms
Analysis, Asymptotic notation, Notions of space and time complexity, Worst and
average case analysis; Design: Greedy approach, Dynamic programming, Divideandconquer; Tree and graph traversals, Connected components, Spanning trees,
Shortest paths; Hashing, Sorting, Searching.