
|
Teaching Scheme |
Exam Scheme |
|||||
|
Th. |
Pract. |
Tutorial |
Th. |
Pract. / Viva |
Term Work |
Total |
|
04 Marks |
02 Marks |
-- |
100 Marks |
25 Marks |
25 Marks |
150 Marks |
|
Hrs./Week |
Hrs./Week |
(3 Hrs.) |
(3 Hrs.) |
(3 Hrs.) |
(3 Hrs.) |
|
v THEORY OF COMPUTATION :--
1. CONCEPT OF AUTOMATA :--
Review of Mathematical Terms and Theory. Basic Mathematical Notations And
2. FINITE AUTOMATA : --
Regular Expressions and Finite Automata, Non Determinism, Ù-Transitions, Conversion from NFA to FA, NFA- Ù to NFA and equivalence of three, Kleene’s Theorem, Regular And Non Regular Languages – pumping lemma, Automata with output-Moore machine, Mealy machine.
3. Cfg
(Context
Introduction to Cfg,
4. Pushdown Automata, CFL And NCFL : --
Introduction to PDA, Definition, Picture
5. Turing Machines :--
Introduction,
6. Computable Functions :--
Partial, total, constant functions,
v Practical and
§
Practical and
§
Minimum 10 exercises should
v TEXT BOOKS :--
1. Introduction to
Languages and
2. An
v REFERENCE BOOK :-
1. Introduction
v DIGITAL SIGNAL PROCESSING :-
Discrete
Discrete–time signals, Discrete–time systems,
Z-Transform :--
Definition and Properties of Z-transform,
Frequency analysis: Continuous
Discrete Fourier Transform :--
Frequency
Structure of FIR systems, Structure of IIR systems, quantization of
Design of FIR filters, Design of IIR filters
Applications :--
v TEXT BOOK :--
1. J.G. Proakis, “Introduction
v REFERENCES :--
1. S.K. Mitra, “Digital
2. T.J. Cavicchi, “Digital
3. L.C. Ludeman,” Fundamentals Of Digital
4. E.C. Ifeachor, B.W. Jervis, “Digital
5. S Sallivahanan, “Digital
6. Ashok Ambardar, “Analog and Digital