Home                                                                                                                                                     Back


B.E. Semester - VI (CE)
CE-605 : Elective - I

 

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 Set Theory, Logic, Functions And Relations, Alphabets, Language Definitions, Mathematical Inductions And Recursive Definitions.

 

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 Free Grammar) :--

Introduction to Cfg, Regular grammar, Bacos Naur Form (BNF), Left most & Right most derivations, parse trees, ambiguity, Normal Form – CNF.

 

4.    Pushdown Automata, CFL And NCFL : --

Introduction to PDA, Definition, Picture representation of PDA, PDA Corresponding to CFG, CFG Corresponding to PDA, pumping lemma for CFL, Decisions Problems and CFL. 

 

5.     Turing Machines :--

Introduction, Definition Of Turing Machine, Model Of Computation And Church Turning Thesis, computing functions with TM, Tm And Language Acceptors, Combining TM, Variations Of Tm, Non Deterministic TM, Universal TM, Recursively and Enumerable Languages, Context sensitive languages and Chomsky hierarchy, Halting problem.

 

6.    Computable Functions :--

Partial, total, constant functions, Primitive Recursive Functions, Bounded Minimalisations, Regular function, Recursive Functions.

 

  v    Practical and Term work :--

             §         Practical and Term work should be carried out as per the above syllabus

              §         Minimum 10 exercises should be carried out.

  

  v     TEXT BOOKS :--

            1.   Introduction to Languages and Theory of Computation by John C. Martin, Third Edition, TMH.

          2.  An introduction to automata theory and formal languages By Adesh K. Pandey,Publisher: S.K. Kataria & Sons.

 

  v     REFERENCE BOOK :-

    1.   Introduction to computer theory By Deniel I. Cohen, Joh Wiley & Sons, Inc.

 

v     DIGITAL SIGNAL PROCESSING :-

 

  1. Discrete Time Signals & System :--

Discrete–time signals, Discrete–time systems, Analysis of discrete-time LTI systems, Discrete-time systems described by differential equations, Implementation of discrete-time systems, Correlation of discrete-time systems.

 

  1. Z-Transform­ :--

Definition and Properties of Z-transform, Rational Z-transforms, Inverse Z-transform, one-sided Z-transform, Analysis of LTI systems in Z-domain.

 

  1. Frequency Analysis of Signals and Systems :--

Frequency analysis: Continuous time signals and Discrete-time signals, Properties of the Fourier transform for discrete-time signals, Frequency domain characteristics of LTI systems, LTI system as a frequency selective filter, Inverse systems and deconvolution. 

 

  1. Discrete Fourier Transform :--

Frequency domain sampling, Properties of DFT, Linear filtering method based on DFT, Frequency analysis of signals using DFT, FFT algorithm, Applications of FFT, Goertzel algorithm, Quantisation effects in the computation of DFT.

 

  1. Implementation of Discrete Time Systems :--

Structure of FIR systems, Structure of IIR systems, quantization of filter coefficients, round-off effects in digital filters.

 

  1. Design of Digital Filters :--

Design of FIR filters, Design of IIR filters from analog filters, frequency transformations, Design of digital filters based on least-squares method digital filters from analogue filters, Properties of FIR digital filters, Design of FIR filters using windows, Comparison of IIR and FIR filters, and Linear phase filters.

 

  1. Introduction to DSP co-processors :--  TMS 320C40/50, Analog Devices.

 

  1. Applications :-- Image processing, Control, Speech, Audio, Telecommunication.

  

v     TEXT BOOK :--

     1.  J.G. Proakis, “Introduction to Digital Signal Processing”, PHI Oppenhiem and Schaffer, “Discrete Time Signal Processing”.

 

v     REFERENCES :-- 

         1.  S.K. Mitra, “Digital Signal Processing”, TMH.

         2.  T.J. Cavicchi, “Digital Signal Processing”, John Wiley.

         3.  L.C. Ludeman,” Fundamentals Of Digital Signal Processing”, John Wiley.

         4.  E.C. Ifeachor, B.W. Jervis, “Digital Signal Processing”, Pearson Education.

         5.  S Sallivahanan, “Digital Signal Processing”, TMH.

         6.  Ashok Ambardar, “Analog and Digital Signal Processing”, Thompson Learning.

 


t