Category: Syllabus

Anna University Regulation 2021 Study Materials

Tags Important Questions, Notes, Question Paper, Syllabus

Important question Notes question bank Question Paper R-2021 Syllabus

IT3401 Web Essentials [PDF]

Post author By Mr. Padeepz
Post date January 3, 2023
No Comments on IT3401 Web Essentials [PDF]

IT3401 Web Essentials Study Materials

Anna University – IT3401 Web Essentials Regulation 2021 Syllabus , Notes , Important Questions, Question Paper with Answers Previous Year Question Paper.

UNIT I WEBSITE BASICS IT3401 Web Essentials Syllabus

Internet Overview – Fundamental computer network concepts – Web Protocols – URL – Domain
Name- Web Browsers and Web Servers- Working principle of a Website –Creating a Website –
Client-side and server-side scripting

UNIT II WEB DESIGNING IT3401 Web Essentials Notes

HTML – Form Elements – Input types and Media elements – CSS3 – Selectors, Box Model,
Backgrounds and Borders, Text Effects, Animations, Multiple Column Layout, User Interface.

UNIT III CLIENT-SIDE PROCESSING AND SCRIPTING IT3401 Web Essentials Important Questions

JavaScript Introduction – Variables and Data Types-Statements – Operators – Literals-FunctionsObjects-Arrays-Built-in Objects- Regular Expression, Exceptions, Event handling, Validation –
JavaScript Debuggers.

UNIT IV SERVER SIDE PROCESSING AND SCRIPTING – PHP IT3401 Web Essentials Question Bank

PHP – Working principle of PHP – PHP Variables – Constants – Operators – Flow Control and
Looping – Arrays – Strings – Functions – File Handling – File Uploading – Email Basics – Email with
attachments – PHP and HTML – Simple PHP scripts – Databases with PHP

UNIT V SERVLETS AND DATABASE CONNECTIVITY IT3401 Web Essentials Question Paper

Servlets: Java Servlet Architecture – Servlet Life cycle- Form GET and POST actions -Sessions –
Cookies – Database connectivity – JDBC
Creation of simple interactive applications – Simple database applications

Syllabus	Click Here
Notes	Click Here
Important Questions	Click Here
Previous Year Question Paper	Click Here
Question Bank	Click Here

TEXT BOOKS IT3401 Web Essentials Notes

1. Robin Nixon, “Learning PHP, MySQL, JavaScript, CSS & HTML5” Third Edition, O’Reilly
publishers, 2014.
2. Paul Deitel, Harvey Deitel, Abbey Deitel, “Internet & World Wide Web – How to Program”,
5th
edition, Pearson Education, 2012.

REFERENCES: IT3401 Web Essentials Important Questions

1. Jeffrey C. Jackson, “Web Technologies–A Computer Science Perspective”, Pearson
Education, 2006.
2. James F. Kurose, “Computer Networking: A Top-Down Approach”, Sixth Edition, Pearson
Education, 2012
3. Steven Holzener , “PHP – The Complete Reference”, 1st Edition, Mc-Graw Hill, 2017
4. Fritz Schneider, Thomas Powell , “JavaScript – The Complete Reference”, 3rd Edition, McGraw Hill Publishers, 2017
5. Bates, “Developing Web Applications”, Wiley Publishers, 2006

PRACTICAL EXERCISES: 30 PERIODS
1. Creation of interactive web sites – Design using HTML and authoring tools
2. Form validation using JavaScript
3. Creation of simple PHP scripts

Anna University Regulation 2021 Study Materials

Tags Important Questions, Notes, Question Paper, Syllabus

Important question Notes question bank Question Paper R-2021 Syllabus

CS3401 Algorithms [PDF]

CS3401 Algorithms Study Materials

Anna University – CS3401 Algorithms Regulation 2021 Syllabus , Notes , Important Questions, Question Paper with Answers Previous Year Question Paper.

UNIT I INTRODUCTION CS3401 Algorithms Syllabus
Algorithm analysis: Time and space complexity – Asymptotic Notations and its properties Best case,
Worst case and average case analysis – Recurrence relation: substitution method – Lower bounds –
searching: linear search, binary search and Interpolation Search, Pattern search: The naïve stringmatching algorithm – Rabin-Karp algorithm – Knuth-Morris-Pratt algorithm. Sorting: Insertion sort –
heap sort

UNIT II GRAPH ALGORITHMS CS3401 Algorithms Notes
Graph algorithms: Representations of graphs – Graph traversal: DFS – BFS – applications – Connectivity,
strong connectivity, bi-connectivity – Minimum spanning tree: Kruskal’s and Prim’s algorithm- Shortest
path: Bellman-Ford algorithm – Dijkstra’s algorithm – Floyd-Warshall algorithm Network flow: Flow
networks – Ford-Fulkerson method – Matching: Maximum bipartite matching

UNIT III ALGORITHM DESIGN TECHNIQUES CS3401 Algorithms Important Questions
Divide and Conquer methodology: Finding maximum and minimum – Merge sort – Quick sort Dynamic
programming: Elements of dynamic programming — Matrix-chain multiplication – Multi stage graph —
Optimal Binary Search Trees. Greedy Technique: Elements of the greedy strategy – Activity-selection
problem –- Optimal Merge pattern — Huffman Trees.

UNIT IV STATE SPACE SEARCH ALGORITHMS CS3401 Algorithms Question Bank
Backtracking: n-Queens problem – Hamiltonian Circuit Problem – Subset Sum Problem – Graph
colouring problem Branch and Bound: Solving 15-Puzzle problem – Assignment problem – Knapsack
Problem – Travelling Salesman Problem

UNIT V NP-COMPLETE AND APPROXIMATION ALGORITHM CS3401 Algorithms Question Paper
Tractable and intractable problems: Polynomial time algorithms – Venn diagram representation – NPalgorithms – NP-hardness and NP-completeness – Bin Packing problem – Problem reduction: TSP – 3-CNF problem. Approximation Algorithms: TSP – Randomized Algorithms: concept and application
– primality testing – randomized quick sort – Finding kth smallest number

Syllabus	Click Here
Notes	Click Here
Important Questions	Click Here
Previous Year Question Paper	Click Here
Question Bank	Click Here

TEXT BOOKS: CS3401 Algorithms Notes

1. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein, “Introduction to
Algorithms”, 3rd Edition, Prentice Hall of India, 2009.
2. Ellis Horowitz, Sartaj Sahni, Sanguthevar Rajasekaran “Computer Algorithms/C++” Orient
Blackswan, 2nd Edition, 2019.

REFERENCES: CS3401 Algorithms Important Questions

1. Anany Levitin, “Introduction to the Design and Analysis of Algorithms”, 3rd Edition, Pearson
Education, 2012.
2. Alfred V. Aho, John E. Hopcroft and Jeffrey D. Ullman, “Data Structures and Algorithms”, Reprint
Edition, Pearson Education, 2006.
3. S. Sridhar, “Design and Analysis of Algorithms”, Oxford university press, 2014.

Anna University Regulation 2021 Study Materials

Tags Important Questions, Notes, Question Paper, Syllabus

Important question Notes question bank Question Paper R-2021 Syllabus

CS3492 Database Management Systems [PDF]

Post author By Mr. Padeepz
Post date January 3, 2023
No Comments on CS3492 Database Management Systems [PDF]

CS3492 Database Management Systems Study Materials

Anna University – CS3492 Database Management Systems Regulation 2021 Syllabus , Notes , Important Questions, Question Paper with Answers Previous Year Question Paper.

UNIT I RELATIONAL DATABASES CS3492 Database Management Systems Syllabus
Purpose of Database System – Views of data – Data Models – Database System Architecture –
Introduction to relational databases – Relational Model – Keys – Relational Algebra – SQL fundamentals
– Advanced SQL features – Embedded SQL– Dynamic SQL

UNIT II DATABASE DESIGN CS3492 Database Management Systems Notes
Entity-Relationship model – E-R Diagrams – Enhanced-ER Model – ER-to-Relational Mapping – Functional Dependencies – Non-loss Decomposition – First, Second, Third Normal Forms, Dependency Preservation – Boyce/Codd Normal Form – Multi-valued Dependencies and Fourth Normal Form – Join
Dependencies and Fifth Normal Form

UNIT III TRANSACTIONS CS3492 Database Management Systems Important Questions
Transaction Concepts – ACID Properties – Schedules – Serializability – Transaction support in SQL –
Need for Concurrency – Concurrency control –Two Phase Locking- Timestamp – Multiversion –
Validation and Snapshot isolation– Multiple Granularity locking – Deadlock Handling – Recovery
Concepts – Recovery based on deferred and immediate update – Shadow paging – ARIES Algorithm

UNIT IV IMPLEMENTATION TECHNIQUES CS3492 Database Management Systems Question Bank
RAID – File Organization – Organization of Records in Files – Data dictionary Storage – Column
Oriented Storage– Indexing and Hashing –Ordered Indices – B+ tree Index Files – B tree Index Files –
Static Hashing – Dynamic Hashing – Query Processing Overview – Algorithms for Selection, Sorting
and join operations – Query optimization using Heuristics – Cost Estimation.

UNIT V ADVANCED TOPICS CS3492 Database Management Systems Question Paper
Distributed Databases: Architecture, Data Storage, Transaction Processing, Query processing and
optimization – NOSQL Databases: Introduction – CAP Theorem – Document Based systems – Key
value Stores – Column Based Systems – Graph Databases. Database Security: Security issues –
Access control based on privileges – Role Based access control – SQL Injection – Statistical Database
security – Flow control – Encryption and Public Key infrastructures – Challenges

Syllabus	Click Here
Notes	Click Here
Important Questions	Click Here
Previous Year Question Paper	Click Here
Question Bank	Click Here

TEXT BOOKS: CS3492 Database Management Systems Notes

1. Abraham Silberschatz, Henry F. Korth, S. Sudharshan, “Database System Concepts”, Seventh
Edition, McGraw Hill, 2020.
2. Ramez Elmasri, Shamkant B. Navathe, “Fundamentals of Database Systems”, Seventh Edition,
Pearson Education, 2017

REFERENCES: CS3492 Database Management Systems Important Questions

1. C.J.Date, A.Kannan, S.Swamynathan, “An Introduction to Database Systems”, Eighth Edition,
Pearson Education, 2006.

Anna University Regulation 2021 Study Materials

Tags Important Questions, Notes, Question Paper, Syllabus

Important question Notes question bank Question Paper R-2021 Syllabus UG syllabus 2021

CS3491 Artificial Intelligence and Machine Learning [PDF]

Post author By Mr. Padeepz
Post date January 3, 2023
No Comments on CS3491 Artificial Intelligence and Machine Learning [PDF]

CS3491 Artificial Intelligence and Machine Learning Study Materials

Anna University – CS3491 Artificial Intelligence and Machine Learning Regulation 2021 Syllabus , Notes , Important Questions, Question Paper with Answers Previous Year Question Paper.

UNIT I PROBLEM SOLVING CS3491 Artificial Intelligence and Machine Learning Syllabus
Introduction to AI – AI Applications – Problem solving agents – search algorithms – uninformed search
strategies – Heuristic search strategies – Local search and optimization problems – adversarial search
– constraint satisfaction problems (CSP)

UNIT II PROBABILISTIC REASONING CS3491 Artificial Intelligence and Machine Learning Notes
Acting under uncertainty – Bayesian inference – naïve bayes models. Probabilistic reasoning –
Bayesian networks – exact inference in BN – approximate inference in BN – causal networks.

UNIT III SUPERVISED LEARNING CS3491 Artificial Intelligence and Machine Learning Important Questions
Introduction to machine learning – Linear Regression Models: Least squares, single & multiple variables,
Bayesian linear regression, gradient descent, Linear Classification Models: Discriminant function –
Probabilistic discriminative model – Logistic regression, Probabilistic generative model – Naive Bayes,
Maximum margin classifier – Support vector machine, Decision Tree, Random forests

UNIT IV ENSEMBLE TECHNIQUES AND UNSUPERVISED LEARNING CS3491 Artificial Intelligence and Machine Learning Question Bank
Combining multiple learners: Model combination schemes, Voting, Ensemble Learning – bagging,
boosting, stacking, Unsupervised learning: K-means, Instance Based Learning: KNN, Gaussian mixture
models and Expectation maximization

UNIT V NEURAL NETWORKS CS3491 Artificial Intelligence and Machine Learning Question Paper
Perceptron – Multilayer perceptron, activation functions, network training – gradient descent
optimization – stochastic gradient descent, error backpropagation, from shallow networks to deep
networks –Unit saturation (aka the vanishing gradient problem) – ReLU, hyperparameter tuning, batch
normalization, regularization, dropout.

Syllabus	Click Here
Notes	Click Here
Important Questions	Click Here
Previous Year Question Paper	Click Here
Question Bank	Click Here

TEXT BOOKS: CS3491 Artificial Intelligence and Machine Learning Notes

1. Stuart Russell and Peter Norvig, “Artificial Intelligence – A Modern Approach”, Fourth Edition,
Pearson Education, 2021.
2. Ethem Alpaydin, “Introduction to Machine Learning”, MIT Press, Fourth Edition, 2020.

REFERENCES: CS3491 Artificial Intelligence and Machine Learning Important Questions

1. Dan W. Patterson, “Introduction to Artificial Intelligence and Expert Systems”, Pearson
Education,2007
2. Kevin Night, Elaine Rich, and Nair B., “Artificial Intelligence”, McGraw Hill, 2008
3. Patrick H. Winston, “Artificial Intelligence”, Third Edition, Pearson Education, 2006
4. Deepak Khemani, “Artificial Intelligence”, Tata McGraw Hill Education, 2013
(http://nptel.ac.in/)
5. Christopher M. Bishop, “Pattern Recognition and Machine Learning”, Springer, 2006.
6. Tom Mitchell, “Machine Learning”, McGraw Hill, 3rd Edition,1997.
7. Charu C. Aggarwal, “Data Classification Algorithms and Applications”, CRC Press, 2014
8. Mehryar Mohri, Afshin Rostamizadeh, Ameet Talwalkar, “Foundations of Machine Learning”,
MIT Press, 2012.
9. Ian Goodfellow, Yoshua Bengio, Aaron Courville, “Deep Learning”, MIT Press, 2016

Anna University Regulation 2021 Study Materials

Tags Important Questions, Notes, Question Paper, Syllabus

Important question Notes question bank Question Paper R-2021 Syllabus

CS3452 Theory of Computation [PDF]

Post author By Mr. Padeepz
Post date January 3, 2023
No Comments on CS3452 Theory of Computation [PDF]

CS3452 Theory of Computation Study Materials

Anna University – CS3452 Theory of Computation Regulation 2021 Syllabus , Notes , Important Questions, Question Paper with Answers Previous Year Question Paper.

UNIT I AUTOMATA AND REGULAR EXPRESSIONS CS3452 Theory of Computation Syllabus

Need for automata theory – Introduction to formal proof – Finite Automata (FA) – Deterministic Finite
Automata (DFA) – Non-deterministic Finite Automata (NFA) – Equivalence between NFA and DFA –
Finite Automata with Epsilon transitions – Equivalence of NFA and DFA- Equivalence of NFAs with and
without ε-moves- Conversion of NFA into DFA – Minimization of DFAs.

UNIT II REGULAR EXPRESSIONS AND LANGUAGES CS3452 Theory of Computation Notes

Regular expression – Regular Languages- Equivalence of Finite Automata and regular expressions –
Proving languages to be not regular (Pumping Lemma) – Closure properties of regular languages.

UNIT III CONTEXT FREE GRAMMAR AND PUSH DOWN AUTOMATA CS3452 Theory of Computation Important Questions

Types of Grammar – Chomsky‘s hierarchy of languages -Context-Free Grammar (CFG) and Languages
– Derivations and Parse trees – Ambiguity in grammars and languages – Push Down Automata (PDA):
Definition – Moves – Instantaneous descriptions -Languages of pushdown automata – Equivalence of
pushdown automata and CFG-CFG to PDA-PDA to CFG – Deterministic Pushdown Automata.

UNIT IV NORMAL FORMS AND TURING MACHINES CS3452 Theory of Computation Question Bank

Normal forms for CFG – Simplification of CFG- Chomsky Normal Form (CNF) and Greibach Normal
Form (GNF) – Pumping lemma for CFL – Closure properties of Context Free Languages –Turing
Machine : Basic model – definition and representation – Instantaneous Description – Language
acceptance by TM – TM as Computer of Integer functions – Programming techniques for Turing
machines (subroutines).

UNIT V UNDECIDABILITY CS3452 Theory of Computation Question Paper

Unsolvable Problems and Computable Functions –PCP-MPCP- Recursive and recursively enumerable
languages – Properties – Universal Turing machine -Tractable and Intractable problems – P and NP
completeness – Kruskal’s algorithm – Travelling Salesman Problem- 3-CNF SAT problems.

Syllabus	Click Here
Notes	Click Here
Important Questions	Click Here
Previous Year Question Paper	Click Here
Question Bank	Click Here

TEXT BOOKS: CS3452 Theory of Computation Notes

1. Hopcroft J.E., Motwani R. & Ullman J.D., “Introduction to Automata Theory, Languages and
Computations”, 3rd Edition, Pearson Education, 2008.
2. John C Martin , “Introduction to Languages and the Theory of Computation”, 4th Edition, Tata
McGraw Hill, 2011.

REFERENCES: CS3452 Theory of Computation Important Questions

1. Harry R Lewis and Christos H Papadimitriou , “Elements of the Theory of Computation”, 2nd
Edition, Prentice Hall of India, 2015.
2. Peter Linz, “An Introduction to Formal Language and Automata”, 6th Edition, Jones & Bartlett,
2016.
3. K.L.P.Mishra and N.Chandrasekaran, “Theory of Computer Science: Automata Languages and
Computation”, 3rd Edition, Prentice Hall of India, 2006.

Anna University Regulation 2021 Study Materials

Tags Important Questions, Notes, Question Paper, Syllabus

Important question Notes question bank Question Paper R-2021 Syllabus

EC3462 Linear Integrated Circuits Laboratory

Post author By Mr. Padeepz
Post date December 24, 2022
No Comments on EC3462 Linear Integrated Circuits Laboratory

EC3462 Linear Integrated Circuits Laboratory Study Materials

Anna University – EC3462 Linear Integrated Circuits Laboratory Regulation 2021 Syllabus , Notes Lab Manual , Viva Important Questions, Question Paper with Answers Previous Year Question Paper.

LIST OF EXPERIMENTS: EC3462 Linear Integrated Circuits Laboratory Lab Manual Viva

DESIGN AND ANALYSIS OF THE FOLLOWING CIRCUITS

1. Series and Shunt feedback amplifiers-Frequency response, Input and output impedance
2. RC Phase shift oscillator and Wien Bridge Oscillator
3. Hartley Oscillator and Colpitts Oscillator
4. RC Integrator and Differentiator circuits using Op-Amp
5. Clippers and Clampers
6. Instrumentation amplifier
7. Active low-pass, High pass & Band pass filters
8. PLL Characteristics and its use as frequency multiplier, clock synchronization
9. R-2R ladder type D-A converter using Op-Amp

SIMULATION USING SPICE (Using Transistor): Lab Manual EC3462 Linear Integrated Circuits Laboratory

1. Tuned Collector Oscillator
2. Twin -T Oscillator / Wein Bridge Oscillator
3. Double and Stagger tuned Amplifiers
4. Bistable Multivibrator
5. Schmitt Trigger circuit with Predictable hysteresis
6. Analysis of power amplifier

COURSE OBJECTIVES: Lab Manual Viva
● To gain hands on experience in designing electronic circuits
● To learn simulation software used in circuit design

o learn the fundamental principles of amplifier circuits
● To differentiate feedback amplifiers and oscillators.
● To differentiate the operation of various multivibrators

Syllabus	Click Here
Notes	Click Here
Important Questions	Click Here
Previous Year Question Paper	Click Here
Question Bank	Click Here

COURSE OUTCOMES: Lab Manual Viva
At the end of the course the students will be able to
 Analyze various types of feedback amplifiers
 Design oscillators, tuned amplifiers, wave-shaping circuits and multivibrators
 Design and simulate feedback amplifiers,oscillators, tuned amplifiers, waveshaping circuits and multivibrators, filters using SPICE Tool.
 Design amplifiers, oscillators, D-A converters using operational amplifiers.
 Design filters using op-amp and perform an experiment on frequency response

Anna University Regulation 2021 Study Materials

Tags Important Questions, Notes, Question Paper, Syllabus

Important question Notes question bank Question Paper R-2021 Syllabus

EC3461 Communication Systems Laboratory

Post author By Mr. Padeepz
Post date December 24, 2022
No Comments on EC3461 Communication Systems Laboratory

EC3461 Communication Systems Laboratory Study Materials

Anna University – EC3461 Communication Systems Laboratory Regulation 2021 Syllabus , Notes Lab Manual , Viva Important Questions, Question Paper with Answers Previous Year Question Paper.

LIST OF EXPERIMENTS EC3461 Communication Systems Laboratory Lab Manual
1. AM- Modulator and Demodulator
2. FM – Modulator and Demodulator
3. Pre-Emphasis and De-Emphasis.
4. Signal sampling and TDM.
5. Pulse Code Modulation and Demodulation.
6. Pulse Amplitude Modulation and Demodulation.
7. Pulse Position Modulation and Demodulation and Pulse Width Modulation and Demodulation.
8. Digital Modulation – ASK, PSK, FSK.
9. Delta Modulation and Demodulation.
10. Simulation of ASK, FSK, and BPSK Generation and Detection Schemes.
11. Simulation of DPSK, QPSK and QAM Generation and Detection Schemes.
12. Simulation of Linear Block and Cyclic Error Control coding Schemes.

COURSE OUTCOMES : EC3461 Communication Systems Laboratory
At the end of the laboratory course, the student will be able to understand the:
1. Design AM, FM & Digital Modulators for specific applications.
2. Compute the sampling frequency for digital modulation.
3. Simulate & validate the various functional modules of Communication system.
4. Demonstrate their knowledge in base band signaling schemes through
implementation of digital modulation schemes.
5. Apply various channel coding schemes & demonstrate their capabilities towards the
improvement of the noise performance of Communication system.

Syllabus	Click Here
Notes	Click Here
Important Questions	Click Here
Previous Year Question Paper	Click Here
Question Bank	Click Here

COURSE OBJECTIVES : EC3461 Communication Systems Laboratory Lab Manual
● To study the AM & FM Modulation and Demodulation.
● To learn and realize the effects of sampling and TDM.
● To understand the PCM & Digital Modulation.
● To Simulate Digital Modulation Schemes.
● To Implement Equalization Algorithms and Error Control Coding Schemes.

Anna University Regulation 2021 Study Materials

Tags Important Questions, Notes, Question Paper, Syllabus

Important question Notes question bank Question Paper R-2021 Syllabus

EC3491 Communication Systems

Post author By Mr. Padeepz
Post date December 24, 2022
No Comments on EC3491 Communication Systems

EC3491 Communication Systems Study Materials

Anna University – EC3491 Communication Systems Regulation 2021 Syllabus , Notes , Important Questions, Question Paper with Answers Previous Year Question Paper.

UNIT I AMPLITUDE MODULATION EC3491 Communication Systems Syllabus

Review of signals and systems, Time and Frequency domain representation of signals, Principles of
Amplitude Modulation Systems- DSB, SSB and VSB modulations. Angle Modulation, Representation
of FM and PM signals, Spectral characteristics of angle modulated signals. SSB Generation – Filter
and Phase Shift Methods, VSB Generation – Filter Method, Hilbert Transform, Pre-envelope &
complex envelope AM techniques, Superheterodyne Receiver.

UNIT II RANDOM PROCESS & SAMPLING EC3491 Communication Systems Notes

Review of probability and random process. Gaussian and white noise characteristics, Noise in
amplitude modulation systems, Noise in Frequency modulation systems. Pre-emphasis and Deemphasis, Threshold effect in angle modulation.
Low pass sampling – Aliasing- Signal Reconstruction-Quantization – Uniform & non-uniform
quantization – quantization noise – Nyquist criterion- Logarithmic Companding –PAM, PPM, PWM,
PCM – TDM, FDM

UNIT III DIGITAL TECHNIQUES EC3491 Communication Systems Important Questions

Pulse modulation Differential pulse code modulation. Delta modulation, Noise considerations in
PCM,, Digital Multiplexers, Channel coding theorem – Linear Block codes – Hamming codes – Cyclic
codes – Convolutional codes – Viterbi Decoder

UNIT IV DIGITAL MODULATION SCHEME EC3491 Communication Systems Question Bank

Geometric Representation of signals – Generation, detection, IQ representation, PSD & BER of
Coherent BPSK, BFSK, & QPSK – QAM – Carrier Synchronization – Structure of Non-coherent
Receivers Synchronization and Carrier Recovery for Digital modulation, Spectrum Analysis –
Occupied bandwidth – Adjacent channel power, EVM, Principle of DPSK

UNIT V DEMODULATION TECHNIQUES EC3491 Communication Systems Question Paper

Elements of Detection Theory, Optimum detection of signals in noise, Coherent communication with
waveforms- Probability of Error evaluations. Baseband Pulse Transmission- Inter symbol
Interference, Optimum demodulation of digital signals over band-limited channels.

Syllabus	Click Here
Notes	Click Here
Important Questions	Click Here
Previous Year Question Paper	Click Here
Question Bank	Click Here

TEXTBOOKS : EC3491 Communication Systems Notes

1. Simon Haykins,” Communication Systems”, Wiley, 5th Edition, 2009.(Unit I – V)
2. B.P.Lathi, “Modern Digital and Analog Communication Systems”, 4th Edition, Oxford
University Press, 2011.

REFERENCES : EC3491 Communication Systems Important Questions

1. Wayner Tomasi, Electronic Communication System, 5th Edition, Pearson Education,2008.
2. D.Roody, J.Coolen, Electronic Communications, 4th edition PHI 2006
3. A.Papoulis, “Probability, Random variables and Stochastic Processes”, McGraw Hill, 3rd
edition, 1991.
4. B.Sklar, “Digital Communications Fundamentals and Applications”, 2nd Edition Pearson
Education 2007
5. H P Hsu, Schaum Outline Series – “Analog and Digital Communications” TMH 2006
6. Couch.L., “Modern Communication Systems”, Pearson, 2001

Anna University Regulation 2021 Study Materials

Tags Important Questions, Notes, Question Paper, Syllabus

Important question Notes question bank Question Paper R-2021 Syllabus

EC3492 Digital Signal Processing

Post author By Mr. Padeepz
Post date December 24, 2022
No Comments on EC3492 Digital Signal Processing

EC3492 Digital Signal Processing Study Materials

Anna University – EC3492 Digital Signal Processing Regulation 2021 Syllabus , Notes , Important Questions, Question Paper with Answers Previous Year Question Paper.

UNIT I DISCRETE FOURIER TRANSFORM EC3492 Digital Signal Processing Syllabus

Sampling Theorem, concept of frequency in discrete-time signals, summary of analysis & synthesis
equations for FT & DTFT, frequency domain sampling, Discrete Fourier transform (DFT) – deriving
DFT from DTFT, properties of DFT – periodicity, symmetry, circular convolution. Linear filtering using
DFT. Filtering long data sequences – overlap save and overlap add method. Fast computation of
DFT – Radix-2 Decimation-in-time (DIT) Fast Fourier transform (FFT), Decimation-in-frequency (DIF)
Fast Fourier transform (FFT). Linear filtering using FFT.

UNIT II INFINITE IMPULSE RESPONSE FILTERS EC3492 Digital Signal Processing Notes

Characteristics of practical frequency selective filters. characteristics of commonly used analog filters
– Butterworth filters, Chebyshev filters. Design of IIR filters from analog filters (LPF, HPF, BPF, BRF)
– Approximation of derivatives, Impulse invariance method, Bilinear transformation. Frequency
transformation in the analog domain. Structure of IIR filter – direct form I, direct form II, Cascade,
parallel realizations.

UNIT III FINITE IMPULSE RESPONSE FILTERS EC3492 Digital Signal Processing Important Questions

Design of FIR filters – symmetric and Anti-symmetric FIR filters – design of linear phase FIR filters
using Fourier series method – FIR filter design using windows (Rectangular, Hamming and Hanning
window), Frequency sampling method. FIR filter structures – linear phase structure, direct form
realizations

UNIT IV FINITE WORD LENGTH EFFECTS EC3492 Digital Signal Processing Question Bank

Fixed point and floating point number representation – ADC – quantization – truncation and rounding
– quantization noise – input / output quantization – coefficient quantization error – product quantization
error – overflow error – limit cycle oscillations due to product quantization and summation – scaling to
prevent overflow.

UNIT V DSP APPLICATIONS EC3492 Digital Signal Processing Question Paper

Multirate signal processing: Decimation, Interpolation, Sampling rate conversion by a rational factor
– Adaptive Filters: Introduction, Applications of adaptive filtering to equalization-DSP ArchitectureFixed and Floating point architecture principles

Syllabus	Click Here
Notes	Click Here
Important Questions	Click Here
Previous Year Question Paper	Click Here
Question Bank	Click Here

TEXT BOOKS: EC3492 Digital Signal Processing Notes

1. 1.John G. Proakis and Dimitris G.Manolakis, Digital Signal Processing – Principles,
Algorithms and Applications, Fourth Edition, Pearson Education / Prentice Hall, 2007.
2. 2.A. V. Oppenheim, R.W. Schafer and J.R. Buck, ―Discrete-Time Signal Processing‖, 8th
Indian Reprint, Pearson, 2004.

REFERENCES EC3492 Digital Signal Processing Important Questions

1. Emmanuel C. Ifeachor& Barrie. W. Jervis, “Digital Signal Processing”, Second Edition,
Pearson Education / Prentice Hall, 2002.

2. 2.Sanjit K. Mitra, “Digital Signal Processing – A Computer Based Approach”, Tata Mc Graw
Hill, 2007.
3. 3.Andreas Antoniou, “Digital Signal Processing”, Tata Mc Graw Hill, 2006.