MA61002: Switching And Automata Theory
| MA61002 | |||||||||||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Course name | Switching and Automata Theory | ||||||||||||||||||||||||||
| Offered by | Mathematics | ||||||||||||||||||||||||||
| Credits | 4 | ||||||||||||||||||||||||||
| L-T-P | 3-1-0 | ||||||||||||||||||||||||||
| Previous Year Grade Distribution | |||||||||||||||||||||||||||
| |||||||||||||||||||||||||||
| Semester | {{{semester}}} | ||||||||||||||||||||||||||
Syllabus
Syllabus mentioned in ERP
Prerequisite : Discrete MathematicsCodes, switching algebra, minimization and decomposition of switching functions, Karnaugh map, digital circuits, logical gates - AND, OR, NAND, NOR etc., combinatorial logic, threshold logic, fault diagnosis, sequential machines : synchronous and asynchronous circuits, basic flip-flops : SR flip-flop, T flip-flop, JK flip-flop, flip-flop, clocked and master-slave flip-flop, decoder, multiplexer circuits, counters: synchronous and asynchronous, sequence detector, parity-bit generator, registers, shift registers, minimization and transformation of sequential machines, Deterministic and Non-deterministic finite state automata , pushdown automata, turing machines.