Compiler: Introduction – Analysis of the source program – phases of a compiler –Compiler construction tools – Lexical analysis – Role of the lexical analyser –Specification of tokens – Recognition of tokens – Lexical analyser generators.
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.
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– Parameter passing – Symbol tables.
Intermediate code generation – Intermediate languages – Declaration – Assignment Statement – Boolean expression – Procedure calls - Code optimisation – Introduction –Sources of optimisation – Introduction to data flow analysis. Code generator – Issues in the design of a code generator, the target machine, A simple code generator.
1. Kenneth.C.Louden, Compiler Construction:Principles And Practice, Thomson Learning, India 2. Keith D. Cooper & Linda Torczon, Engineering a Compiler, Elsevier, New Delhi.3. S.S. Muchnick, Harcourt Asra, Advanced Compiler Design implementation, Morgan Kaufman, 19974. Modern Compiler Implementation ii C , Cambridge Uty. Press 1997.5. Alan Holub, Compiler Design ii C, PHI6. Kenneth C. Louden, Compiler Construction, Principle and Practice, Thomson Books
Introduction to signals & systems- Discrete time signals and systems- Properties of discrete systems-linearity, time invariance-causality-stability-convolution-difference equation representation of discrete systems -The Z transform-properties of Z transformthe inverse z transform-System Transfer functions.
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.
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 functions. Difference equation representation. Recursive Realizations Direct form I , Direct form II –Cascade Realization-Parallel realization –Comparison of IIR & FIR filters i terms of computational complexity, memory requirement, hardware complexity, stability .
Finite word length effects in digital filters- fixed point arithmetic -Floating point arithmetic- Block floating point arithmetic - Truncation-Rounding - Quantization error i analog to digital conversion-Limit cycles. General DSP architecture- features _ On chip subsystems- memory organization-Addressing modes- Instruction types - TMS320C54X fixed point processor- TMS320C4X floating point processor Applications of DSP
1. P.Ramesh Babu: Digital signal Processing,SCITEC Pub., 3rd edition2. Sanjit K. Mithra, : Digital Signal Processing, Tata Mc- Graw Hill
1. John G Proakis & Dimitris G Manolakis : Digital Signal Processing, PHI, NewDelhi2. Oppenheim & Ronald W Schafer : Digital Signal Processing, Prentice Hall India3. Steven W. Smith, Digital Signal Processing-A practical guide fo Engineers and Scientists , Elsivier India Pvt.Ltd, 2006 4. Avatar Singh, Digital Signal Processing Implementations, Edition 1
Introduction to Operating Systems. Processes - Interprocess Communication - Race Conditions - Critical Sections – Mutual Exclusion - Busy Waiting - Sleep And Wakeup -Semaphores - Event Counters - Monitors - Message Passing. Process Scheduling - Round Robin Scheduling - Priority scheduling -multiple queues - Shortest Job First - Guaranteed scheduling - Two- level scheduling.
Memory management. Multiprogramming. 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.
File systems and I/O 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.
Deadlock - conditions for deadlock. Deadlock detection and recovery. Deadlock avoidance - resource trajectories - safe and unsafe states - bankers algorithm. Deadlock prevention. Two phase locking – non-resource deadlocks - starvation. Case Study: UNIX / LINUX operating system
1. William Stallings, “Operating systems”, Pearson Education, Fifth edition2. D.M.Dhamdhere, Operating Systems, 2nd Edition, Tata McGraw-Hill
1. Garry Nutt, “Operating Systems – A Modern perspective ”, Third Edition, Pearson Education2. Andrew S. Tanenbaum, “Modern Operating Systems”, Prentice Hall3. Bach, M.J., “Design of UNIX Operating System”, Prentice Hall4. Charles Crowley, “Operating systems – A Design Oriented Approach”, Tata McGrawhill, 19975. Michel Palmer “Guide o Operating Systems”, Vikas Thomson Learning Publishing,NewDelhi
Analyzing Algorithms and problems. Classifying functions by their asymptotic growth rate. Recursive procedures. Recurrence equations - Substitution Method, Changing variables, Recursion Tree, Master Theorem. Design Techniques- Divide and Conquer,Dynamic Programming, Greedy, Backtracking
Analysis of searching and sorting. Insertion sort, Quick sort, Merge sort and Heap sort.Binomial Heaps and Fibonacci Heaps, Lower bounds fo sorting by comparison of keys.Comparison of sorting algorithms. Amortized Time Analysis. Red-Black Trees –Insertion & Deletion.
Graphs and graph traversals. Strongly connected components of a Directed graph.Biconnected components of an undirected graph.Transitive closure of a Binary relation. Warshalls algorithm fo Transitive closure. All pair shortest path in graphs. Dynamic programming. Constructing optimal binary search trees.
Complexity Theory - Introduction. P and NP. NP-Complete problems. Approximation algorithms. Bin packing, Graph coloring. Traveling salesperson Problem.
1. T. H. Cormen, C. E. Lieserson, R. L. Rivest, Introduction to Algorithms, Prentice Hall India,2004 2. Allen Van Gelder, Sara Baase, Computer Algorithms - Introduction to Design and Analysis, 3rd Edition,2004
1. Anany Levitin, Introduction to the design and analysis of algorithms, PearsonEducation 2. A.V.Aho, J.E.Hopcroft and J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison Wesley Publishing House, Reading, MA3. E Horowitz and S Sahni, Fundamentals of Computer Algorithms, Computer Science Press, Rockville 4. Jeffrey H.Kingston, Algorithms and Data Structures - Design, Correctness and Analysis , Addison Wesley, Singapore, 1990 5. Knuth, Art of Computer Programming Vol II, Sorting and Searching, Prentice Hall
Basic idea of control systems and their classification - differential equations of systems - linear approximation - Laplace transform and transfer functions of linear system - Model of physical system (Electrical, mechanical and electromechanical)- block diagram -signal flow graph - Mason’s gain formula.
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.
Frequency domain analysis - frequency response - Bode plot, Polar plot, Nicol's chart -closed loop frequency response and frequency domain performance characteristics.Stability in frequency domain. Nyquist criterion.
Root locus method - basic theory and properties of root loci - procedure for the construction of root loci - complete root locus diagram. Design and compensation of feed back control system: approaches to compensation - cascade compensation networks and their design i the frequency domain - simple design in S-plane.
1. Ogata K: “ Modern Control Engineering”, Prentice Hall/Pearson,2002
1. Dorf: Morden Communication Systems ,Pearson Education2. Franklin: Feed back Control Systems, Pearson Education,1994 3. Kuo B. C: “Automatic Control System”, Prentice Hall, 1991 4. Nagoor Kani: Control Systems, R B P,2002 5. Ogata: Discrete Time Control Systems ,Pearson Education,1987 6. Nagarath & Gopal:Control System Engineering, Wiley Eastern,19917. Ramkayan: Control Engineerng, Vikas Publications8. M N Bandyopadhyaya: Control Theory ,PHI9. Glad: Control Theory, Vikas Thomson Publications
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)
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
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
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. Network Performance: Analytical Approaches-Network Traffic Monitoring-simulations
1. Youlu Zheng and Shakil Akhtar, Networks for Computer Scientist and Engineers, Oxford University Press,20062. James F. Kurose and Keith W. Ross, Computer Networking – A Top-Down Approach Featuring the Internet,2/e Pearson Education ,2003
1 S. Keshav, An Engineering Approach to Computer Networking, Pearson education ,20022 F. Halsall, Data Communication, Computer Networks and Open Systems, Addison Wesley, 19963 Andrew S. Tanenbaum, Computer Networks , 4/e, Pearson education, 20034 Behrouz A. Fourouzan ,Data Communications and Networking, 2/e Tat McGrawhill,20005 Leon-Garcia and I. Widjaja, Communication Networks, Tata McGraw Hill, 20006 Bertsekas and Gallagar , Data Networks, 2/e, PHI, 19927 Douglas E Comer ,Computer Networks and Internet’s, 2/e Pearson Education,20045. Gallo, Computer Communication and Networking Technologies, Thomson Learning
1. Identification of components/cards and PC assembling from components 2. Assembly language program fo implementing arithmetic operations 3. Assembly Language programs fo time and date manipulation. 4. Assembly Language programs fo display /video manipulation5. Assembly Language program fo equipment status6. Implementation of a file manager using DOS/BIOS interrupts 7. TSR (Terminate and Stay Resident) Programming8. ADC interfaces9 .Stepper Motor interfaces using DAC10. Parallel Interface: Printer and HEX keyboard. 11. Serial Interface: PC to PC serial interfaces using null modem
The students are expected to develop an application using a standard DBMS package.They have to do a proper system study and prepare SRS and design documents.Each batch comprising of 3 to5 students shall design. Each student shall submit a project report at the end of the semester. The project report should contain the design and engineering documentation including the Bill of Materials and test results. Product has to be demonstrated fo its full design specifications. Innovative design concepts, reliability considerations and aesthetics/ ergonomic aspects taken care of in the project shall be given due weight.
i) Attendance and Regularity 10ii) Work knowledge and Involvement 30iii) End-Semester presentation & Oral examination 20iv) Level of completion and demonstration offunctionality/specifications25v) Project Report 15