Theory of Computation/Compiler
Regular expressions and finite automata(DFA and NFA). Context-free grammars and push-down automata. Regular and contex-free languages, pumping lemma. Turing machines and undecidability.Architecture /Digital logic
Boolean algebra. Combinational and sequential circuits. Minimization.Number representations and computer arithmetic.
Machine instructions and addressing modes.
ALU, data‐path and control unit. Instruction pipelining, Memory hierarchy: cache, main memory and secondary storage; I/O interface