Cs 1601 Digital Signal Processing

CS 1601 DIGITAL SIGNAL PROCESSING
Module I
Introduction to signals & systems- Discrete time signals and systems- Properties of discretesystemsinearity,timeinvariance-causality-stability.convolution.difference equation representation of discrete systems The Z transform-properties of Z transform- the inverse z transform-System Transfer function.
Module II
Frequency domain representation of discrete time signals. Discrete Fourier series(DFS)-properties Discrete
Time Fourier Transform (DTFT) properties, Discrete Fourier Transform(DFT) properties& Fast Fourier
Transform( FFT) Decimation in Time & Decimation in Frequency algorithms.
Module III
FIR digital Filters: Transfer function. Generalized Difference equation representation. Concept of windowing.
Non Recursive realization structures-direct (Tapped delay line structure) cascade realization- Liner phase
realization.
IIR Digital Filters : - Transfer function. Difference equation representation. Recursive Realizations Direct
form I , Direct form II Cascade Realization-Parallel realization Comparison of IIR & FIR filters in terms
of computational complexity, memory requirement, hardware complexity, stability .
Module IV
Finite word length effects in digital filters- fixed point arithmetic -Floating point arithmetic- Block floating
point arithmetic - Truncation-Rounding - Quantization error in analog to digital conversion-Limit cycles.
General DSP architecture- features _ On chip subsystems- memory organization-Addressing modesInstruction types - TMS320C54X fixed point processor- TMS320C4X floating point processor
Applications of DSP
References:
1. P.Ramesh Babu: Digital signal Processing,SCITEC Pub., 3rd ed
2. Sanjit K. Mithra, : " Digital Signal Processing", Tata Mc- Graw Hill
3. Cristi, Modern Digital Signal Processing, Ed. 1.
4. Ashok Ambardar, Analog and Digital Signal Processing, Edition 2.
5. Avatar Singh, Digital Signal Processing Implementations, Edition 1
6. John G Proakis & Dimitris G Manolakis : "Digital Signal Processing", PHI, New Delhi
7. Oppenheim & Ronald W Schafer : "Digital Signal Processing", Prentice Hall India
8. Sanjit K. Mithra, : " Digital Signal Processing", Tata Mc- Graw Hill
Type of Questions for University Exam.

Q 1. Eight short answer questions of 5 marks each with two questions from each of the four modules. (8 x5
= 40 marks)
Q 2. to Q.5 : Two questions A & B of 15 marks from each modules with option to answer either A or B.(4 x
15 = 60 marks)
CS/IT 1602 COMPILER CONSTRUCTION

Module I
Compiler: Introduction Analysis of the source program phases of a compiler Lexical analysis Role of
the lexical analyser Input Buffering -- Specification of tokens Recognition of tokens Lexical analyser
generators.
Module II
Syntax Analysis Role of the parser Context free grammars Top-down parsing Bottom-up parsing
Operator precedence parsing LR parsers (SLR, Canonical LR, LALR) Parser generators.
Module III
Syntax-directed translation Syntax-directed definitions S-attributed definition
L-attributed
definition Top-down and bottom-up translation Type checking Type systems Specification of a type
checker. Run time environment Source language issues Storage organization Storage allocation
strategies Access to nonlocal names Symbol tables.
Module IV
Intermediate code generation Intermediate languages Declaration Assignment Statement Boolean
expression Procedure calls - Code optimization Introduction Sources of optimization Introduction to
data flow analysis. Code generator Issues in the design of a code generator, the target machine, A simple
code generator.
References:
1. Alfred V. Aho, Ravi Sethi & Jeffrey. D. Ullman, Compilers Principles, Techniques
& Tools, Pearson
2. Kenneth.C.Louden, Compiler Construction:Principles And Practice, Thomson Learning, India
3. Keith D. Cooper & Linda Torczon, Engineering a Compiler, 2nd edition, Elsevier, New Delhi.
4. S.S. Muchnick, Harcourt Asra, Advanced Compiler Design implementation, Morgan Kaufman, 1997
5. Alan Holub, Compiler Design in C, PHI

= 40 marks)
15 = 60 marks)
CS 1603 OPERATING SYSTEM

Module I
Introduction to Operating Systems. Operating system concepts System calls Operating System Structure.
Processes - Interprocess Communication Race Conditions - Critical Sections Mutual Exclusion - Busy
Waiting - Sleep And Wakeup -Semaphores - Monitors - Message Passing. Process Scheduling First come
First Served - Shortest Job First - Priority scheduling - Round Robin Scheduling - Multiple queues scheduling
Guaranteed scheduling - Two- level scheduling.
Module II
Memory management. Multiprogramming and memory usage - Swapping - multiprogramming with fixed and
variable partitions - Memory management with bit maps, linked lists, Buddy system - Allocation of swap
space. Virtual memory - paging and page tables, Associative memory - Inverted page tables. Page
replacement algorithms Segmentation.
Module III
File systems and Input/output. Files - Directories - File system implementation - Security and Protection
mechanisms.
Principles of I/O hardware - I/O devices - Device controllers - DMA. Principles of I/O software - Interrupt
handlers - Device drivers - Disk scheduling - Clocks and terminals. I/O Buffering - RAID- Disk Cache.
Module IV
Deadlocks - Conditions for deadlock. Deadlock detection and recovery. Deadlock avoidance - resource
trajectories - safe and unsafe states Bankers algorithms. Deadlock prevention. Two phase locking Nonresource deadlocks - Starvation.
Case Study: UNIX / LINUX operating system
References:
1. Andrew S Tanenbaum, Modern Operating Systems , 3 rd Edition, Prentice Hall, 2011. ISBN 97881-203-3904-0.
2. William Stallings, Operating systems, 6th Edition, Pearson Education, 2011. ISBN 978-81-3172528-3.
3. Garry Nutt, Nabendu Chaki, Sarmistha Neogy, Operating Systems, Third Edition,
Pearson Education.
4. D.M.Dhamdhere, Operating Systems, 2nd Edition, Tata McGraw Hill, 2011.
5. Sibsankar Haldar, Alex A Aravind, Operating Systems, Pearson Education.
6. Achyut S Godbole, Atul Kahate, Operating Systems, 3 rd Edition, Tata McGraw Hill,
2011.

= 40 marks)
15 = 60 marks)
CS 1604 COMPUTER NETWORKS

Module I
Evolution of Computer Networks: Types of Networks: Broadcast and Point-to-point, LAN, MAN, WAN,
Wireless networks. Protocols & Standardization, ISO/OSI Reference model, TCP/IP Reference Model.
Application Layer: Application layer protocols:-WWW and HTTP, FTP, DNS, SMTP, SNMP, RPC, P2P File
sharing, Domain Name system (DNS)
Module II
Transport layer and Network Layer : Transport Layer Services, Relationship with Network Layer,
Relationship with Application Layer, Multiplexing and De multiplexing, UDP, TCP: Header ,Segment
Structure, Services, Connection establishment and termination, Flow control and window size advertising,
TCP time out and re-transmission, Congestion Control, TCP Fairness, Delay Modeling.
Network layer Services, Datagram and Virtual circuit services, IP datagram format and Types of Services,
Datagram encapsulation and Fragmentation, Reassembly and fragmentation
Module III
Routing and Datalink Layer: Routing: Link state routing, distant vector routing, hierarchical routing,
multicast routing, Data link layer services: Error detect and correction techniques, Elementary Data link
layer protocols, sliding window protocols, HDLC ,Multiple access protocols, TDM, FDM, CDMA Random
access protocols: ALOHA, CSMA,CSMA/CD,CSMA/CA. Circuit and Packet Switching, Virtual Circuits,
Switching Technology for LAN, Ethernet switches, Virtual LAN
Module IV
Physical Layer, High speed Networks and Network programming: Physical Layer services, Transmission
media, Data encoding schemes. ISDN, BISDN, Frame relay, Fast Ethernet and Gigabit Ethernet, FDDI,
SONET .NETBIOS programming, TCT/IP and Socket programming.
References:
1. James F. Kurose and Keith W. Ross, Computer Networking A Top-Down Approach Featuring the
Internet,5/e Pearson Education ,2010, ISBN:978-0-13-607967-5.
2. Behrouz A. Fourouzan, Firouz Mosharraf, Computer Networks A Top-Down Approach, Tata
McGrawHill, 2012, ISBN: 13978-1-25-900156-7
3. Andrew S. Tanenbaum, Computer Networks , 4/e, Pearson education, 2003, ISBN:978- 8-17-758165-2.
4. S. Keshav, An Engineering Approach to Computer Networking, Pearson education ,2002
5. F. Halsall, Data Communication, Computer Networks and Open Systems, Addison Wesley, 1996
6. Leon-Garcia and I. Widjaja, Communication Networks, Tata McGraw Hill, 2000
7. Bertsekas and Gallagar , Data Networks, 2/e, PHI, 1992
8. Douglas E Comer ,Computer Networks and Internets, 2/e Pearson Education,2004
9. Gallo, Computer Communication and Networking Technologies, Thomson Learning.

= 40 marks)
15 = 60 marks)
CS/EB 1605 MODERN CONTROL SYSTEMS
Module I
Basic idea of control systems and their classification - differential equations of systems - linear approximation
- Laplace transform and transfer function of linear system - Model of physical system (Electrical, mechanical
and electromechanical)- block diagram - signal flow graph - Masons gain formula.
Module II
Time domain analysis - Representation of deterministic signals - First order system response - S-plane root
location and transient response - impulse and step response of second order systems - performance characteristics in the time domain - effects of derivative and integral control - steady state response - error
constant - generalised definition of error coefficients - concepts of stability - Routh - Hurwitz criterion.
Module III
Frequency domain analysis - frequency response, frequency domain performance characteristics. Stability in
frequency domain - Bode plot, Polar plot, closed loop frequency response - Nyquist Plot.
Root locus method - basic theory and properties of root loci - procedure for the construction of root loci Design and compensation of feed back control system lead,lag and lag-lead compensation - simple design
in S-plane.
Module IV
Basic elements of a discrete time control system - sampling - sample and hold - Examples of sampled data
systems pulse transfer function - Review of Z-transforms - system function - mapping between s plane and
z plane - analysis of discrete time systems - examples - stability - Jury's criterion.
Introduction to the state variable concept - state space models - solution of state equations - homogenous case
- properties of state transition matrix - state space representation of discrete time systems.
References:
1. Ogata K, Modern Control Engineering, 4th Ed., Prentice-Hall India Ltd /Pearson Education
2. Ogata, Discrete Time Control Systems, 2nd edn., Pearson Education/ Prentice-Hall India Ltd
3. Nagarath & Gopal, Control System Engineering, Wiley Eastern, 2nd ed.
4. Dorf , Modern Control system, Pearson Education, 8th ed.
5. Franklin, Feed back Control Systems, Pearson Education
6. Kuo B. C, Automatic Control System, Prentice-Hall India Ltd, 8th ed.
7. Nagoor Kani, Control Systems, RB Publishers,1998
8. Ogata, Discrete Time Control Systems, 2nd edn., Pearson Education/ Prentice-Hall India Ltd
9. Ramkalyan, Control Engineering, Vikas Publications, 2007
10. M N Bandyopadhyaya, Control Engineering- Theory& Practice , Prentice-Hall India Ltd, 2003

= 40 marks)
15 = 60 marks)
CS1606 E1 SOFTWARE TESTING
Module I
Introduction: Faults, Errors and Failures, Basics of software testing, Testing objectives, Principles of testing,
Requirements, behavior and correctness, Testing and debugging, Test metrics and measurements,
Verification, Validation and Testing, Types of testing, Software Quality and Reliability, Software defect
tracking.
Module II
White Box And Black Box Testing: White box testing, static testing, static analysis tools, Structural testing:
Unit/Code functional testing, Code coverage testing, Code Complexity testing, Black Box testing,
Requirements based testing, Boundary value analysis, Equivalence partitioning, state/graph based testing,
Model based testing and model checking, Differences between white box and Black box testing.
Module III
Integration, System, And Acceptance Testing: Top down and Bottom up integration, Bi-directional
integration, System integration, Scenario Testing, Defect Bash, Functional versus Non-functional testing,
Design/Architecture verification, Deployment testing, Beta testing, Scalability testing, Reliability testing,
Stress testing, Acceptance testing: Acceptance criteria, test cases selection and execution.
Module IV
Test Selection & Minimization For Regression Testing: Regression testing, Regression test process, Initial
smoke or Sanity test, Selection of regression tests, Execution Trace, Dynamic slicing, Test Minimization,
tools for regression testing, Ad hoc Testing: Pair testing, Exploratory testing, Iterative testing, Defect seeding,
Test planning, Management, Execution and Reporting, Software Test Automation: Scope of automation,
Design & Architecture for automation, Generic requirements for test tool frame work, Test tool selection,
Testing in Object Oriented systems.
References:
1. S.Desikan and G. Ramesh, Software Testing: Principles and Practices, First edition, Pearson
Education, ISBN: 978-8-17-758121-8.
2. Aditya P. Mathur, Fundamentals of Software Testing, First edition, Pearson Education, ISBN: 81-3170795-4.
3. Naik and Tripathy, Software Testing and Quality Assurance, First edition, Wiley, ISBN: 978-0-47178911-6.
4. K.K.Aggarwal and Yogesh Singh, Software Engineering, Revised second edition, New Age
International Publication, ISBN: 978-8-12-241638-1.

= 40 marks)
15 = 60 marks)

Cs 1601 Digital Signal Processing

Uploaded by

Copyright:

Available Formats

Cs 1601 Digital Signal Processing

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Cs 1601 Digital Signal Processing

Uploaded by

Copyright:

Available Formats

CS 1601 DIGITAL SIGNAL PROCESSING

Type of Questions for University Exam.

CS/IT 1602 COMPILER CONSTRUCTION

Type of Questions for University Exam.

CS 1603 OPERATING SYSTEM

Type of Questions for University Exam.

CS 1604 COMPUTER NETWORKS

Type of Questions for University Exam.

CS/EB 1605 MODERN CONTROL SYSTEMS

Type of Questions for University Exam.

CS1606 E1 SOFTWARE TESTING

Type of Questions for University Exam.

You might also like