Helping Desk for Computer Engineering Students: GATE SYLLABUS-Computer Science and Information Tec...

Helping Desk for Computer Engineering Students: GATE SYLLABUS-Computer Science and Information Tec...: Syllabus for Computer Science and Information Technology (CS) Engineering Mathematics Mathematical Logic: Propositional Logic; Firs...

GATE SYLLABUS-Computer Science and Information Technology (CS)

Syllabus for Computer Science and Information Technology (CS)

Engineering Mathematics

Mathematical Logic:

Propositional Logic; First Order Logic.

Probability:

Conditional Probability; Mean, Median, Mode and Standard Deviation; Random Variables; Distributions; uniform, normal, exponential, Poisson, Binomial.

Set Theory & Algebra:

Sets; Relations; Functions; Groups; Partial Orders; Lattice; Boolean Algebra.

Combinatorics:

Permutations; Combinations; Counting; Summation; generating functions; recurrence relations; asymptotics.

Graph Theory:

Connectivity; spanning trees; Cut vertices & edges; covering; matching; independent sets; Colouring; Planarity; Isomorphism.

Linear Algebra:

Algebra of matrices, determinants, systems of linear equations, Eigen values and Eigen vectors.

Numerical Methods:

LU decomposition for systems of linear equations; numerical solutions of non-linear algebraic equations by Secant, Bisection and Newton-Raphson Methods; Numerical integration by trapezoidal and Simpson's rules.

Calculus:

Limit, Continuity & differentiability, Mean value Theorems, Theorems of integral calculus, evaluation of definite & improper integrals, Partial derivatives, Total derivatives, maxima & minima.

Computer Science and Information Technology

Digital Logic:

Logic functions, Minimization, Design and synthesis of combinational and sequential circuits; Number representation and computer arithmetic (fixed and floating point).

Computer Organization and Architecture:

Machine instructions and addressing modes, ALU and data-path, CPU control design, Memory interface, I/O interface (Interrupt and DMA mode), Instruction pipelining, Cache and main memory, Secondary storage.

Programming and Data Structures:

Programming in C; Functions, Recursion, Parameter passing, Scope, Binding; Abstract data types, Arrays, Stacks, Queues, Linked Lists, Trees, Binary search trees, Binary heaps.

Algorithms:

Analysis, Asymptotic notation, Notions of space and time complexity, Worst and average case analysis; Design: Greedy approach, Dynamic programming, Divide-and-conquer; Tree and graph traversals, Connected components, Spanning trees, Shortest paths; Hashing, Sorting, Searching. Asymptotic analysis (best, worst, average cases) of time and space, upper and lower bounds, Basic concepts of complexity classes  P, NP, NP-hard, NP-complete.

Theory of Computation:

Regular languages and finite automata, Context free languages and Push-down automata, Recursively enumerable sets and Turing machines, Undecidability.

Compiler Design:

Lexical analysis, Parsing, Syntax directed translation, Runtime environments, Intermediate and target code generation, Basics of code optimization.

Operating System:

Processes, Threads, Inter-process communication, Concurrency, Synchronization, Deadlock, CPU scheduling, Memory management and virtual memory, File systems, I/O systems, Protection and security.

Databases:

ER-model, Relational model (relational algebra, tuple calculus), Database design (integrity constraints, normal forms), Query languages (SQL), File structures (sequential files, indexing, B and B+ trees), Transactions and concurrency control.

Information Systems and Software Engineering:

information gathering, requirement and feasibility analysis, data flow diagrams, process specifications, input/output design, process life cycle, planning and managing the project, design, coding, testing, implementation, maintenance.

Computer Networks:

ISO/OSI stack, LAN technologies (Ethernet, Token ring), Flow and error control techniques, Routing algorithms, Congestion control, TCP/UDP and sockets, IP(v4), Application layer protocols (icmp, dns, smtp, pop, ftp, http); Basic concepts of hubs, switches, gateways, and routers. Network security  basic concepts of public key and private key cryptography, digital signature, firewalls.

Web technologies:

HTML, XML, basic concepts of client-server computing.

Engineering Mathematics,microprocessors,cao,alc,dsa,dc(s4)-university 2010 question papers

Engineering Mathematics III (s4)-2008&2009 university question papers

computer architecture organisation(s4)-2009 university question paper

microprocessors(s4)-2008&2009 university question papers

s8 syllabus

CS 801 SECURITY IN COMPUTING
Module 1
Introduction- Security problem in computing, Security in Networks. Elementary
Cryptography- Introduction- Substitution and Transposition Ciphers.
Review of Number Theory-Modular arithmetic.
Module 2
Encryption Algorithms-Symmetric Key encryption- DES, AES.
Module 3
Public Key encryption. RSA Crypto System. Primality testing-
Miller-Rabin Algorithm. Diffie- Hellman Cryptosystem.
Module 4
Authentication protocols, Digital Signature, Secure e-mail, SSL, IP Security. System
security –Intruders, Malicious Software , Firewalls.
Text book:
1. Stallings W. ,Cryptography and Network Security Principles and Practice 3/e
Pearson Edition Asia 2003.
References:
1. W. Mao Modern cryptography : Theory and Practice , PEA ,2004
2. Handbook of Applied Cryptography, CRC Press 1996.
3. .Calabrese “Information Security Intelligence : Cryptographic
Principles &Applications.” Thomson Learning
Type of questions for University Examination
Question 1 - 8 short answer questions of 5 marks each. 2 questions from each module
Question 2-5 – There will be two choices from each module .Answer one question from each module of
15 marks
CS 802 ARTIFICIAL INTELLIGENCE
Module 1
Introduction - Problem spaces and search - Production systems - Characteristics.
Heuristic search techniques - Generate and Test - Hill climbing -Best fit. Graph search -
A* algorithm. Problem reduction - constraint satisfaction - Means and End analysis.
Game playing - Minimax - Alpha-beta cut-off.
Module 2
Logic and Deduction. Introduction to symbolic logic - Propositional logic - Well Formed
Formula. Predicate Logic - predicates variables and constants - First order logic,
Quantifiers. Forward chaining and Unification. Goal trees. Resolution by refutation.
Module 3
Representing Knowledge. Procedural versus Declarative. Reasoning under uncertainty -
Nonmonotonic reasoning - Statistical reasoning. Bayesian networks.. Fuzzy Logic .
Semantic Nets, Frames, Conceptual Dependency, Scripts, CYC. Natural Language
Processing - Transformational grammar, Case grammar - Semantic grammars. Learning:
Learning by analysing, by explaining experience, by correcting mistakes, by recording
cases
Module 4
Software agents – agent characteristics, agent topology, agent oriented programming,
Java implementation of intelligent agents
Text Book:
1. Elaine Rich and Kevin Knight, “Artificial Intelligence”, Tata McGraw-Hill Publishing
Company Ltd., New Delhi,1990
2. Jeffrey M Bradshaw, “Software Agents”, AAAI Press/ The MIT Press(97)
References:
1. Natural Language Processing - Transformational grammar, Case grammar - Semantic
grammars.
2. Dan W.Patterson, “Introduction to Artificial Intelligence and Expert Systems”,
Prentice Hall India Ltd., New Delhi, 1996
3. Winston, P.H., “Artificial Intelligence”, Addison Wesley Pub. House, Reading, MA
4. Nillson N. J., “Artificial Intelligence: A new Synthesis”, Elsevier, New Delhi
5. Eugene Charmiak, Drew McDermott, “Introduction to Artificial Intelligence”,
Addison Wesley , Reading, Massachusetts, 1985
6. Akshar Bharati, Vineet Chaitanya, Rajeev Sangal, “Natural Language Processing: A
Paninian Perspective”, Prentice Hall India Ltd., New Delhi, 1996
7. Nils J.Nillson, ‘Principles of Artificial Intelligence”, Morgan Kauffman Publishers
Inc., Palo Alto, California
8. Rober J,. Schalkoft, “Artificial Intelligence, An Engineering Approach”, McGraw-
Hill Publishing company, New York 1990
9. Gerhard Weiss, “Multi agent System – A modern approach to distributed AI”, MIT
Press
Type of questions for University Examination
Question 1 - 8 short answer questions of 5 marks each. 2 questions from each module
Question 2-5 – There will be two choices from each module .Answer one question from each module of
15 marks
CS 803 OBJECT ORIENTED MODELLING AND DESIGN
Module 1
Object Oriented Programming and Design Principles: Object Oriented Concepts – Nature
and purpose of models – Object Modeling – Dynamic Modeling – Functional Modeling
System Design- Object Design
Module 2
UML Structural Modeling: Basics of UML based object oriented analysis and design
Classes – Relationships – Interfaces – Roles – Class diagrams – Advanced classes
and relationship – Packages – Instances – Object diagrams
Module 3
UML Behavioral Modeling: Interactions – Use cases – Interaction diagrams – Use case
diagrams – Activity diagrams – Events – Signals – State Machines – Processes – Threads
– State chart diagrams
Module 4
UML Architectural Modeling: Component diagrams – Deployment diagrams –
Collaborations – Unified Processes Introduction to Software Architecture:
Design frameworks – Design pattern – Describing the architecture in Architecture
description language (ADL)
Text Book:
1. James Rambaugh et. al., Object Modelling and Design –PHI
2. Grady Booch, James Rambaugh,Ivar Jacobson .A.WThe Unified Modeling
Language User Guide –
References:
1. Ivan Jacobson, Grady Booch, James Rambaugh A.W The Unified Software
Development Process –
2. Bruegge. Object Oriented Software Engineering using UML patterns and
Java,Pearson Education ,2003 –
3. Rational Unified Process, Third Edition – Kruchten.
Type of questions for University Examination
Question 1 - 8 short answer questions of 5 marks each. 2 questions from each module
Question 2-5 – There will be two choices from each module .Answer one question from each module of
15 marks
CS/EC/EE/EI 804 A DIGITAL IMAGE PROCESSING
Module 1
Digital image fundamentals: representation - elements of visual perception - simple
image formation model - Image sampling and quantization - basic relationships between
pixels – imaging geometry. Review of matrix theory results: Row and column ordering -
Toeplitz, Circulant and Block matrices. Review of Image transforms: 2D-DFT, FFT,
Walsh, Hadamard , Haar, DCT and Wavelet transforms.
Module 2
Image enhancement: Spatial domain methods: point processing - intensity
transformations, histogram processing, image subtraction, image averaging; Spatial
filtering- smoothing filters, sharpening filters. Frequency domain methods: low pass
filtering, high pass filtering, homomorphic filtering. Generation of spatial masks from
frequency domain specifications.
Image segmentation: Detection of discontinuities - point, line and edge and combined
detection , Edge linking and boundary description - local and global processing using
Hough transform – Thresholding - Region oriented segmentation - basic formulation,
region growing by pixel aggregation, region splitting and merging - Use of motion in
segmentation. Fundamentals of Representation and Description.
Module 3
Image restoration: Degradation model - Diagonalization of circulant and Block circulant
matrices - Algebraic approaches - Inverse filtering - Wiener filter - Constrained Least
squares restoration - Interactive restoration - Geometric transformations. Fundamentals of
Colour image processing: colour models - RGB, CMY, YIQ, HIS - Pseudo color image
processing - intensity slicing, gray level to color transformation.
Module 4
Image compression: fundamentals- redundancy: coding, inter pixel, psychovisual, fidelity
criteria, Models, Elements of information theory, Error free compression- variable length,
bit plane, lossless predictive, Lossy compression- lossy predictive, transform coding.
Fundame ntals of JPEG, MPEG, Fractals.
Text Book:
1. Gonzalez and Woods, “Digital Image Processing”, 2 Ed, Pearson Education, 2002.
References:
1. Anil K. Jain, “Fundamentals of Digital Image Processing”, Pearson Education, 2003.
2. Mark Nelson, Jean-Loup Gailly “The Data compression Book” 2 Ed, bpb
Publications.
3. Pratt William K.,”Digital Image Processing”, John Wiley & sons
4. Chanda & Majumdar, “Digital Image Processing and Analysis” , PHI.
5. M.Sonka,V. Hlavac, R. Boyle, “Image Processing, Analysis and Machine Vision”,
Vikas Publishing House
Type of questions for University Examination
Question 1 - 8 short answer questions of 5 marks each. 2 questions from each module
Question 2-5 – There will be two choices from each module .Answer one question from each module of
15 marks
CS/EB/EC/IT 804 B BIOINFORMATICS
Module 1
Basic Concepts of Molecular Biology: Cells - Chromosomes, DNA, RNA, Proteins,
Central dogma of molecular biology, Genomes and Genes - Genetic code, Transcription,
Translation and Protein synthesis. Web based genomic and proteomic data bases: NCBI,
GenBank
Module 2
Sequence alignments – Dot plot-Pair-wise sequence alignments - local and global -
Sequence similarity and distance measures - Smith-Waterman algorithm, Needleman-
Wunch algorithm, Multiple sequence alignment –Sum-of-Pairs measure - Star and tree
alignments – PAM and BLOSUM, Phylogenetic analysis
Module 3
Informational view of Genomic data, Genomic Signal Processing, DNA Spectrograms,
Identification of protein coding regions, Gene expression, Microarrays, Microarray
image analysis
Module 4
Gene structure in Prokaryotes and Eukaryotes: Molecular Structure Prediction: Basic
concepts and terminologies related to molecular structures, Basic molecular
Visualization, RNA secondary structure prediction, Protein folding problem, Protein
Threading, Protein Visualization, Introduction to Drug Discovery.
Case Study
Software Tools: Use of Tools for basic and specialized sequence processing such as:
BLAST, FASTA, RasMol, Phylip, ClustalW
Text Books:
1. Setubal & Meidanis, Introduction to Computational Molecular Biology,
Thomson:Brooks/Cole, International Student Edition, 2003
2. Claverie & Notredame, Bioinformatics - A Beginners Guide, Wiley-Dreamtech India
Pvt Ltd, 2003.
References:
1. Lesk, Introduction to Bioinformatics, Oxford University Press, Indian Edition, 2003
2. Higgins and Taylor, Bioinformatics: Sequence, structure and databanks, Oxford
University Press, Indian Edition, 2003
3. Bergeron, Bioinformatics Computing, Prentice hall of India, 2003
4. Jiang, Xu and Zhang, Current topics in Computational Molecular Biology, Ane
Books, New Delhi, 2004
5. S.C Rastogi & Namitha Mendiratta, Bioinformatics method and application
Genomics,Protinomics & drug discovery
6. Dov Stekel, Microarray Bioinformatics ,Cambridge University Press
Type of questions for University Examination
Question 1 - 8 short answer questions of 5 marks each. 2 questions from each module
Question 2-5 – There will be two choices from each module .Answer one question from each module of
15 marks
CS 804 C SOFTWARE ARCHITECTURE
Module 1
Software Architecture –Introduction-Architectural Styels-Pipes and Filters-Data Abstraction
and Object Oriented Organization-Event based, Implicit Invocation-Layered Systems-
Repositories-Interpreters-Process Control-Process control Paradigms-Software Paradigm for
Process Control-Distributed processes-Main program / subroutine organizations – Domain –
specific software architecture – heterogeneous architectures .
Module 2
Shared Information Systems – Data base integration –Batch sequential – Simple Repository
–Virtual Repository – Hierarchical Layers – Evolution of Shared Information Systems in
BusinessData Processing – Integration in Software Development Environments – Integration
in Design of Buildings- Architectural Structures for Shared Information Systems.
Module 3
Architectural Design Guidance- Guidance for User-Interface Architectures -Design Space
and rules-Design Space for User Inter face Architectures-Design. Rules for User Interface
Architecture applying the Design Space – Example – A Validation Experiment – How the
Design Space Was Prepared .
Module 4
Value of Architectural Formalism – Formalizing the Architecture of a Specific System –
Formalizing an Architectural Style – Formalizing an Architectural Design.Linguistic Issues –
Requirements for Architecture - Description Languages - First Class Connectors – Adding
Implicit Invocation to Traditional Programming Languages .
Tool for Architectural Design – UniCon .
Text Book:
1. Mary Shaw, David Garlan, "Software Architecture", Prentice Hall ,India, 2000
Type of questions for University Examination
Question 1 - 8 short answer questions of 5 marks each. 2 questions from each module
Question 2-5 – There will be two choices from each module .Answer one question from each module of
15 marks
CS/IT 804(D) MOBILE COMPUTING
Module 1
Review of wireless and mobile communication (covered in Advanced Computer
Networks)-Mobile computing architecture-Pervasive Computing-Voice oriented data
Communication, Operating System for Mobile Computing, Mobile Devices, cards and
sensors, Mobile computing applications: messaging-SMS-MMS-GPRS applications-
Mobile agents.
Module 2
Wireless Internet-Mobile IP-wireless web-Web services and mobile web services-
Wireless middleware-wireless gateway and mobile application servers-Wireless Access
Protocol(WAP)-WAP protocol layers. Mobile database management:-data caching,
transaction models, processing queries, Data recovery, QoS .Mobile Transport Layer
Module 3
Cellular network- First Generation Networks-Second generation (2G): GSM-CDMA
network .data over cellular network-2.5G network-GPRS-GPRS System Architecture and
Protocol layers. EDGE. Third generation network(3G) network-MMS-introduction to 4G
and 5G systems-Emerging wireless networks: Ultra wide band(UWB)-Free space
optics(FSO)-Mobile ad-hoc network(MANET)-Wireless sensor networks-OFDM and
Flash OFDM
Module 4
Wireless security-WLAN security-cellular wireless network security-Mobile ad-hoc
network security-Internet security protocols: VPNs and IPSec-Wireless middleware
security-SSL for wireless web security-WAP security and WTLS. Client programming
tools-using XML and UML for mobile computing –J2ME.
Text Book:
1. Raj Kamal, Mobile Computing, Oxford University Press, 2007
References:
1. Amjad Umar, Mobile Computing and Wireless Communications,NGE Solutions,2004
2. Asoke Talukder,Roopa Yavagal, Mobile Computing,McGrawhill,2006
3. Reza Behravanfar, Phillip Lindsay, Reza B'Far, Mobile Computing Principles:
designing and developing mobile applications with UML and XML,Cambridge
University Press,2006.
4. U. HansMann, L Merk, M.S. Nicklous and T. Stober, Principles of Mobile
Computing, 2/e, Spniyer, 2003
5. Schiller J, Mobile Communications, 2/e-Addison Weslay,2003.
Type of questions for University Examination
Question 1 - 8 short answer questions of 5 marks each. 2 questions from each module
Question 2-5 – There will be two choices from each module .Answer one question from each module of
15 marks
CS 805 PROJECT WORK
The project work commencing from the seventh semester shall be completed and the
project report shall be submitted by each student by the end of eighth semester. There
shall be an internal examination of the project that includes a presentation, demonstration
and oral examination of the project work. The evaluation panel shall consist of at least
two faculty members including project guide as appointed by the Head of the department.
Each batch of students shall develop the project designed during the VII semester. The
implementation phase shall proceed as follows:
A detailed algorithm level implementation, test data selection, validation, analysis of
outputs and necessary trial run shall be done.
Integration of hardware and software, if applicable, shall be carried out.
A detailed project report in the prescribed format shall be submitted at the end of the
semester. All test results and relevant design and engineering documentation shall be
included in the report.
The work shall be reviewed and evaluated periodically
The final evaluation of the project shall be done by a team of minimum 3 internal examiners
including the project guide and shall include the following.
 Presentation of the work
 Oral examination
 Demonstration of the project against design specifications
 Quality and content of the project report
Guidelines for evaluation:
Regularity and progress of work 30
Work knowledge and Involvement 100
End semester presentation and oral examination 50
Level of completion and demonstration of
functionality/specifications 70
Project Report – Presentation style and content 50
Total 300 marks
Note: Points (i) and (ii) to be evaluated by the respective project guide and the project
coordinator based on continuous evaluation. (iii)-(v) to be evaluated by the final evaluation team
comprising of 3 internal examiners including the project guide.
CS 806 VIVA-VOCE
Each student is required to appear for a viva-voce examination, and he/she has to bring
his seminar report and project report for the same. The evaluation panel should contain at
least one external and two internal examiners appointed by the University. There can be
more than one panel in case the number of students is large.

s7 syllabus

CS/EB/EC/EE/EI/IT 701 INDUSTRIAL ORGANIZATION AND MANAGEMENT
Module 1
Organisation: Introduction, definition of organization, system approach applied to
organization, necessity of organization, elements of organization, process of organization,
principles of organization, formal and informal organization, organization structure, types
of organization structure .
Forms of business organization: Concept of ownership organization, types of ownership.
Individual ownership, partnership, joint stock Company, private and public limited
company, co-operative organizations, state ownership, public corporation
Module 2
Basic concept of management: Introduction, definitions of management, characteristics
of management, levels of management, management skills
Management theory: Scientific management, contribution of Gilbreth. Gantt, Neoclassical
theory, modern management theories
Functions of management: Planning, forecasting, organizing, staffing, directing,
motivating, controlling, co-coordinating, communicating, decision making.
Module 3
Personnel management: Introduction, definition, objectives, characteristics, functions,
principles and organization of personnel management
Markets and marketing: Introduction, the market, marketing information, market
segmentation, consumer and indusial markets, pricing, sales, physical distribution,
consumer behaviour and advertisement.
Financial management: the basics , financial accounts, inflation, profitability, budgets and
controls, cost accounting, valuation of stock, allocation of overheads, standard costing
,marginal costing
Module 4
Productivity and production: Measurement of productivity, productivity index
productivity improvement procedure
Materials management and purchasing: Objectives, functions, importance of materials
management. Stores and storekeeping
Inventory control: Classification, functions, inventory models, inventory costs, EOQ,
Materials requirement planning
References:
1. Fraidoon Mazda, Engineering Management-, Addison -Wesley
2. Koontz and O’Donnell, Essentials of Management, Mc Graw Hill
3. Kotlar P, Marketing Management, Prentice Hall India
4. Prsanna Chandra , Finance Management,TMH.5th ed.,
5. Monks J.G Operations Management ,MGH
Type of questions for University Examination
Question 1 - 8 short answer questions of 5 marks each. 2 questions from each module
Question 2-5 – There will be two choices from each module .Answer one question from each module of
15 marks
CS 702 ADVANCED ARCHITECTURE & PARALLEL PROCESSING
Module 1
Introduction to Parallel Processing-Shared Memory Multiprocessing-Distributed
Memory-Parallel Processing Architectures- Introduction-Parallelism in sequential
Machines—Abstract Model of Parallel Computer – Multiprocessor Architecture- Array
Processors.
Module 2
Pipelining and Super Scalar Techniques-Linear Pipeline Processors-Non-Linear Pipeline
processors-Instruction pipeline design-Arithmetic pipeline Design- Super Scalar and
Super pipeline Design.
Module 3
Programmability Issues-An Overview-Operating system support-Types of Operating
Systems-Parallel Programming models-Software Tools-Data Dependency Analysis-
Types of Dependencies-Program Transformations- Shared Memory Programming
Module 4
Thread –based Implementation-thread Management-Attributes of Threads- Mutual
Exclusion with Threads- Mutex Usage of Threads- Thread implementation-Events and
Conditions variables-Deviation Computation with Threads-Java Threads Distributed
Computing –Message Passing Model-General Model-Programming Model- PVMAlgorithms
for Parallel Machines- Debugging Parallel programming –Other Parallelism
Paradigms .
Text Books:
1. Kai Hwang, “Advanced Computer Architecture: Parallelism, Scalability,
Programmability”, McGRawHill International Edition, 1993.
2. M.Sasikumar, et.al., "Introduction to Parallel Processing", PHI, New Delhi, 2000
References:
1. P. Pal Chaudhuri , “Computer Organisation and Design”, PHI, New Delhi, 1994.
2. William Stallings, “Computer Organisation and Architechture”, PHI, New Delhi,
1996.
3. “Proceedings of Third International Conference on High Performance Computing”,
IEEE, Computer Society Press , California, USA, 1996.
4. 4.“Parellel Processing”, Learning Material Series, Indian Society for Technical
Education, New Delhi, 1996.
5. 5.V.Rajaraman, C. Siva Ram Murthy, "Parallel Computers Architecture and
Programming", PHI, New Delhi, 2000
6. Parthasarathi, “Advanced Computer Architecture”, Thomson Learning.
Type of questions for University Examination
Question 1 - 8 short answer questions of 5 marks each. 2 questions from each module
Question 2-5 – There will be two choices from each module .Answer one question from each module of
15 marks
CS/IT 703 ADVANCED COMPUTER NETWORKS
Module 1
Network Technologies : -WAN and LAN - Ethernet Technology: Fast And Gigabit
Ethernet -10/100/1000 Ethernet - Properties of an Ethernet - interoperability &
collision domains – Ethernet Hardware Addresses - Ethernet Frame Format -
Extending An Ethernet With Bridges - Switched Ethernet -VLAN. Classful Internet
Addresses: The Original Classful Addressing Scheme Dotted Decimal Notation - Subnet
And Classless Extensions - IP Multicast Addresses .ARP: Resolution Through Direct
Mapping - Resolution Through Dynamic Binding - ARP Protocol Format- ARP
Implementation . RARP.
Module 2
Internet Routing: Routing Between Peers (BGP)-Routing Within An Autonomous
System (RIP, OSPF).Internet Multicasting : Ethernet Multicast- IP Multicast- IGMPDVMRP-
PIM. Understanding Router Components: Ports-Queueing- Schedulingshaping-
policing-marking. QoS in IP networkk. IPv6: Frame formats-Comparison with
IPv4. Introduction to ICMP,DHCP and NAT. Network Management: SNMP and RMON
models
Module 3
Wireless transmission: Frequencies for radio transmission-Signals-Antennas-Signal
propagation-Multiplexing-Modulation-Spread spectrum-Cellular systems. Medium
access control: SDMA-FDMA-TDMA-CDMA-Comparison of S/T/F/CDMA.
Module 4
Telecommunications systems. GSM,:-System Architecture, Radio Interface, Protocols,
Addressing-Call management and Handover. GGPRS and UMTS networks. Wireless
LAN(WiFi): Infrared vs radio transmission-Infrastructure and ad-hoc network-IEEE
802.11a,b,g, 802.15 and 802.16 protocol standards –Bluetooth - Principle of WiMax .
Mobile IP.
Text Books:
1. Douglas E.Comer, Internetworking With TCP/IP Volume 1: Principles Protocols,
and Architecture, 5/e ,Prentice Hall,2006. (Module I and II)
2. Schiller, Mobile Communication, 2/e , Addison Wesley, 2005 (Module III and IV)
References:
1. Youlu Zheng and Shakil Akhtar, Networks for Computer Scientist and Engineers,
Oxford University Press,2006
2. James.F.Kurose & Keith W.Ross , Computer Networking –A Top Down approach
featuring Internet, 3/e, Pearson Education,2005.
3. Douglas E.Comer, Computer Network and Internets, 2/e, Person education ,2003.
4. Andrew S.Tanenbaum, Computer Networks ,$/e Edition,Pearson education,2003
5. William Stallings, Wireless Communicatuion Networks, 2/e, Pearson Education,2003.
6. Nathan J. Muller, Bluetooth Demystified, McGraw-Hill Professional Publishing,2000
Type of questions for University Examination
Question 1 - 8 short answer questions of 5 marks each. 2 questions from each module
Question 2-5 – There will be two choices from each module .Answer one question from each module of
15 marks
CS/IT 704 DISTRIBUTED COMPUTING
Module 1
Characterization of Distributed systems – Introduction- Examples of Distributed
Systems- Challenges-System Models –Architectural models-Fundamental Models –
Interprocess communication-The API for the Internet protocols-External Data
representation and Marshalling-Client Server Communication- group communication.
Interprocess communication in UNIX. Distributed Objects and Remote Invocation –
Communication between distributed objects-Remote Procedure Call- Events and
Notifications- Java RMI, Case study
Module 2
Operating System Support-The Operating system layer – Protection- Processes and
Threads-Operating System architecture
Distributed file Systems-Introduction-File Service architecture– Case study sun NFS.
Name service SNS and DNS.
Module 3
Time and co-ordination. Synchronizing physical clocks -logical time and logical clocks.
Distributed co-ordination –distributed mutual exclusion – elections. Replication – basic
architectural model –consistency and request ordering.
Module 4
Distributed DBMS Architecture- Distributed Database Design –Query Decomposition
and Data Localization -Distributed transactions – concurrency control in distributed
transactions– distributed deadlocks – transaction recovery.
Text Book
1. George Coulouris, et. al., “Distributed Systems – Concepts and Design”, Third
Edition., Addison Wesely, 2002
References
1. M.Tamer Ozsu,Patrick Valduriez, “Principles of Distributed Database Systems”,
Second Edition ,Pearson Education.
3. C.A.R.Hoare, “Communicating Sequential Processes”, Prentice Hall, 1980
4. Dimitri P.Bertsekas, John N.Tsitiklis, “Parallel and Distributed Computation :
Numerical Methods”,
5. Prentice Hall International, Inc., 1989
6. Douglas Comer and David L.Stevens, “Internetworking with TCP/IP Vol III: Client
server Programming and Applications”, Prentice Hall, New York, 1990
7. Gerard Tel, “Introduction to Distributed Algorithms”, Cambridge University Press,
1994
8. H.S.M.Sedan, “Distributed Computer systems”, Butterworths, London, 1988
9. M.Sasikumar, et.al., "Introduction to Parallel Processing", PHI, New Delhi, 2000
Type of questions for University Examination
Question 1 - 8 short answer questions of 5 marks each. 2 questions from each module
Question 2-5 – There will be two choices from each module .Answer one question from each module of
15 marks
CS 705 A EMBEDDED SYSTEMS
Module 1
Overview of Embedded System:- Embedded System, Categories of Embedded System,
Requirements of Embedded Systems, Challenges and Issues in Embedded Software
Development, Applications of Embedded Systems in Consumer Electronics, Control
System, Biomedical Systems, Handheld computers, Communication devices.
Module 2
Embedded Hardware & Software Development Environment: - Hardware Architecture,
Microcontroller Architecture, Communication Interface Standards, Embedded System
Development Process, Compilers and assemblers, Embedded Operating systems, Types
of Embedded Operating systems.
Module 3
Introduction to Real Time Operating System : Task and task states,task and data,
semaphore and shared data,message queues, mail boxes,pipes,time
functions,events,Memory management,interrupt routines in RTOS environment,
Basic Design Using RTOS: Principle ,encapsulating semaphores and queues,hard realtime
scheduling consideration,saving memory space,saving power,
Embedded software development tools: Host and Target machines, linker/ locator for
embedded software,getting embedded software into a target system
Module 4
Real Time & Database Applications: - Real-Time Embedded Software Development,
Sending a Message over a Serial Link, Simulation of a Process Control System,
Controlling an Appliance from the RTLinux System, Embedded Database Applications
using examples like Salary Survey, Energy Meter Readings.
.
Text Books:
1. K.V.K.K Prasad,Programming for Embedded Systems,Dreamtech Software Team,
Wiley Dreamtech,2005
2. David E. Simon,An Embeded Software Primer, Pearson Education,2005
References:
1. Daniel W Lewis - Fundamentals of Embedded Software where C and Assembly Meet
3. K.V.K.K Prasad, Embedded/RealTime systems: “Concepts, Design and
programming”, Dreamtech Software Team, Wiley Dreamtech
Type of questions for University Examination
Question 1 - 8 short answer questions of 5 marks each. 2 questions from each module
Question 2-5 – There will be two choices from each module .Answer one question from each module of
15 marks
CS/IT 705B INFORMATION RETRIEVAL
Module 1
Introduction – Information versus Data Retrieval. Modeling of Information retrieval.
Formal characterization of Information retrieval – Alternate set theoretic models.
Alternate algebraic models. Alternate probabilistic models. Structured text retrieval
models. Models for Browsing. Retrieval Evaluation
Module 2
Query languages. Text Operations- Document pre processing. Text compression.
Indexing and searching. Inverted files. Suffix trees and suffix arrays. Boolean queries.
Sequential searching. Pattern matching.
Structural queries. User interface and visualization.
Module 3
Parallel and Distributed Information Retrieval. Implementation of inverted files, suffix
arrays and signature files in MIMD architecture. Implementation of Inverted files, suffix
arrays and signature files in SIMD architecture.
Module 4
Searhing the web – modeling the web . Search engines –architecture, user interfaces,
ranking, crawling, indices. Web Directories-Metadata- Metasearchers-Web as graph-
Hubs and Authorities- Case study - google search engine
Text Books:
1. Ricardo Baexa-Yates and Berthier Ribeiro-Neto, “Modern Information Retrieval”,
Addison Wesley Longman, 1999
References
1. Sergey Brin and Lawrence page, The anatomy of large scale hyper textual(Web)
search engine, Computer Networks and ISDN systems, Vol 30,No 1-7
2. J Kleinberg, et. Al, The Web as a graph: Measurements, models and methods,
Lecture notes in computer science , Springer Verlag, 1999
Type of questions for University Examination
Question 1 - 8 short answer questions of 5 marks each. 2 questions from each module
Question 2-5 – There will be two choices from each module .Answer one question from each module of
15 marks
CS/EB/IT 705 C ARTIFICIAL NEURAL NETWORKS
Module 1
Introduction to neural networks. Artificial neural networks. Biological neural networks-
Comparison , Basic building blocks of ANN. Activation functions. McCulloch-Pitts
Neuron Model, Hebb net. Learning Rules-Hebbian Learning Rules, Perceptron, Delta,
Competitive, Boltzmann. Perceptron networks- single layer, multilayer –algorithm.
Module 2
Feedback Networks, Discrete Hopfield nets, Continuous Hopfield nets. Feed Forward
Networks: Back Propagation Networks, Learning Rule, Architecture, training algorithm.
Counter Propagation Network: Full CPN, Forward only CPN, architecture, training
phases.
Module 3
Adaptive Resonance Theory, architecture, learning in ART, Self Organizing feature
maps: Kohonen SOM, Learning Vector Quantization, Max net, Mexican Hat, Hamming
net. Associative memory networks Algorithms for pattern association Hetero associative
networks, Auto associative memory networks Bidirectional associative memory networks
Energy Function.
Module 4
Special networks: Probabilistic neural networks, Cognitron, Simulated Annealing,
Boltzmann machine, Cauchy machine, Support Vector Machine Classifiers. Application
of Neural networks In Image Processing and classification. Introduction to Fuzzy
systems, Neuro fuzzy sytems.
Text books:
1. Laurene Fausett: “Fundamentals of neural networks”, Prentice Hall, New
Jersey,1994.
2. James A. Freeman, David M. Skapure: Neural Networks Algorithms, Applications
and Programming Techniques, Addison-Wesley, 1990.
References:
1. S N Sivanandan: “Introduction to neural networks using “MATLAB”,
TataMcGrawHill, New Delhi.,2004
2. Kevin Gruney: “An Introduction to neural networks”, CRC Press, 1997.
3. D. L.Hudson & M. E. Cohen: “Neural Networks and Artificial Intelligence in
Biomedical Engg.”, Prentice Hall Of India, New Delhi.,1999
4. James A. Anderson, “An Introduction to Neural Networks”, Prentice Hall of
India,1995.
5. Simon Haykin: “Neural Networks”, Pearson Education1998
6. Yegnanarayana: “Artificial Neural Networks”, Prentice Hall of India,2004.
7. Jack M. Zureda, Introduction to Artificial Neural Systems,1992
Type of questions for University Examination
Question 1 - 8 short answer questions of 5 marks each. 2 questions from each module
Question 2-5 – There will be two choices from each module .Answer one question from each module of
15 marks
CS 705D WEB-COMMERCE AND TECHNOLOGIES
Module 1
Introduction to SGML features HTML XML HTML vs XML simple XML documents
XML tags , creating XML DTD s Displaying XML data in HTML Browser as HTML
tables storing XML data in HTML document XML applications converting XML to
HTML with XSL style sheets
Module 2
Java applets, java scripts, Java beans features ,designing Java Beans ,Properties of
beans , creation of events , EJB basics ,types of beans ,development of session beans ,
steps creation and implementing interfaces
Module 3
Electronic payment systems electronic cash, wallets , smart cards ,web auction
strategies , legal environment of e commerce SSL, Firewalls
Module 4
JSP creating JSP pages templating request and response objects, scriptlets .accessing
beans via scriptlets
References
1. XML by Example :Building E Commerce application SEAN Mcgrath Pearson
Education, Asia
2. Joseph L Weber PHI ,Using JAVA 2 Platform Special edition Java2 AWT Swing
XML Java Beans
3. Steven HolznerWiley Dream, Tech Programming Black Book
4. Java Server Pages Larne Pekowsky Pearson asia
5. JSP Barry Burd IDG Books India
6. Mastering Enterprise Java beans and the Java2 platform enterprise Edition EdRoman
(Wiley computer publishing)
7. EJB Design Patterns Floyd Marinescu
8. Raj Kamal TMH ,Internet and Web Technologies
9. Frontiers of E commerce Kalakotia Addison Wesley Publication
10. James T Perry Electronic Commerce By Gary P Schineder and Course Technology
Thomson Learning Cambridge
Type of questions for University Examination
Question 1 - 8 short answer questions of 5 marks each. 2 questions from each module
Question 2-5 – There will be two choices from each module .Answer one question from each module of
15 marks
CS 706 LANGUAGE PROCESSOR LABORATORY
Students are expected to do the following exercises:
- Creation of Single Pass – Two Pass assembler – Macro processor.
- Generation of Lexical Analyzer using tools such as Lex
- Generation of Parser using tools such as YACC.
- Generation of LL(1) Parser
- Generation of intermediate code
- Creation of type checker
- Developing a compiler for a subset of a programming language.
Note: 50% Marks is earmarked for continuous evaluation and 50% marks for end
semester examination to be assessed by two examiners. A candidate shall secure a
minimum of 50% marks separately for the two components to be eligible for a pass
in that subject.
CS 707 NETWORK AND OPERATING SYSTEMS LABORATORY
1. Study of system level calls of a suitable multitasking operating system. Exercises
involving the system calls. (E.g. fork(), exec(), create(), etc. in UNIX.)
2. Inter process communication. Shared memory, messages, Semaphores and
monitors. Implementation of typical problems(E.g. Bounded buffer, Dining
Philosophers. etc.)
3. Study of Communication protocols. TCP/IP or a suitable protocol. Client server
programming. Distributed algorithms. performance modelling of networks.
4. Internet programming using a suitable programming language and Operating
system (E.g. JAVA)
References
1. Douglas E.Comer, Hands on Networking with Internet Technologies, Pearson
Education
2. Bach, M.J., “Design of UNIX Operating System”, Prentice Hall
Note: 50% Marks is earmarked for continuous evaluation and 50% marks for end
semester examination to be assessed by two examiners. A candidate shall secure a
minimum of 50% marks separately for the two components to be eligible for a pass
in that subject.
CS 708 SEMINAR
Each student shall individually prepare and present a seminar on a topic of current
relevance on a stipulated time. He/she should also submit a report of the same. Few
panels consisting of two or three teachers (internal) each, should evaluate the seminar
reoport and the presentation. Marks should be awarded considering report preparation,
presentation, technical content, depth of knowledge, brevity and references and the
participation in the seminar. The time allotted for each presentation is 30 minutes.
Students shall individually prepare and submit a seminar report on a topic of current
relevance related to the field of Computers either hardware or software. The reference
shall include standard journals, conference proceedings, reputed magazines and
textbooks, technical reports and URLs. The references shall be incorporated in the report
following IEEE standards reflecting the state-of-the-art in the topic selected. Each student
shall present a seminar for about 30 minutes duration on the selected topic. The report
and presentation shall be evaluated by a team of internal experts comprising of 3 teachers
based on style of presentation, technical content, adequacy of references, depth of
knowledge and overall quality of the seminar report
CS 709 PROJECT DESIGN
The project work shall commence in the seventh semester shall be completed by the end
of eighth semester. Students are expected to identify a suitable project and complete the
analysis and design phases by the end of seventh semester. For those students who are
doing real life projects in the industry should also have both an external guide in the
industry and an internal guide in the department. The internal guides are responsible for
the continuous evaluation.
Each batch comprising of 3 to 5 students shall identify a project related to the curriculum of
study. At the end of the semester, each student shall submit a project synopsis comprising of the
following.
 Application and feasibility of the project
 Complete and detailed design specifications.
 Block level design documentation
 Detailed design documentation including circuit diagrams and algorithms /
circuits
 Bill of materials in standard format and cost model, if applicable
 Project implementation action plan using standard presentation tools
Guidelines for evaluation:
i) Attendance and Regularity 10
ii) Quality and adequacy of design documentation 10
iii) Concepts and completeness of design 10
iv) Theoretical knowledge and individual involvement 10
v) Quality and contents of project synopsis 10
Total 50 Marks
Note: Points (i)-(iii) to be evaluated by the respective project guides and project coordinator
based on continuous evaluation. (iv)-(v) to be evaluated by the final evaluation team comprising
of 3 internal examiners including the project guide.

s6 syllabus

CS 601 COMPILER CONSTRUCTION
Module 1
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.
Module 2
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 3
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.
Module 4
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.
Text Books:
1. Alfred V. Aho, Ravi Sethi & Jeffrey. D. Ullman, “Compilers Principles, Techniques
& Tools”.
References :
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, 1997
4. Modern Compiler Implementation in C , Cambridge Uty. Press 1997.
5. Alan Holub, Compiler Design in C, PHI
6. Kenneth C. Louden, Compiler Construction, Principle and Practice, Thomson Books
Type of questions for University Examination
Question 1 - 8 short answer questions of 5 marks each. 2 questions from each module
Question 2-5 – There will be two choices from each module .Answer one question from each module of
15 marks
CS/EE 602 DIGITAL SIGNAL PROCESSING
Module 1
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 function.
Module 2
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 3
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 4
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 modes- Instruction types - TMS320C54X
fixed point processor- TMS320C4X floating point processor
Applications of DSP
Text:
1. P.Ramesh Babu: Digital signal Processing,SCITEC Pub., 3rd ed
2. Sanjit K. Mithra, : " Digital Signal Processing", Tata Mc- Graw Hill
References:
1. John G Proakis & Dimitris G Manolakis : "Digital Signal Processing", PHI, New
Delhi
2. Oppenheim & Ronald W Schafer : "Digital Signal Processing", Prentice Hall India
3. Steven W. Smith, Digital Signal Processing-A practical guide for Engineers and
Scientists , Elsivier India Pvt.Ltd, 2006
4. Avatar Singh, Digital Signal Processing Implementations, Edition 1
Type of questions for University Examination
Question 1 - 8 short answer questions of 5 marks each. 2 questions from each module
Question 2-5 – There will be two choices from each module .Answer one question from each module of
15 marks
CS/IT 603 OPERATING SYSTEMS
Module I
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.
Module II
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.
Module III
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.
Module IV
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
Text Book
1. William Stallings, “Operating systems”, Pearson Education, Fifth edition
2. D.M.Dhamdhere, “Operating Systems”, 2nd Edition, Tata McGraw-Hill
Reference
1. Garry Nutt, “Operating Systems – A Modern perspective ”, Third Edition, Pearson
Education
2. Andrew S. Tanenbaum, “Modern Operating Systems”, Prentice Hall
3. Bach, M.J., “Design of UNIX Operating System”, Prentice Hall
4. Charles Crowley, “Operating systems – A Design Oriented Approach”, Tata
McGrawhill, 1997
5. Michel Palmer “Guide o Operating Systems”, Vikas Thomson Learning Publishing,
NewDelhi
Type of questions for University Examination
Question 1 - 8 short answer questions of 5 marks each. 2 questions from each module
Question 2-5 – There will be two choices from each module .Answer one question from each module of
15 marks
CS /IT 604 ANALYSIS AND DESIGN OF ALGORITHMS
Module 1
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
Module 2
Analysis of searching and sorting. Insertion sort, Quick sort, Merge sort and Heap sort.
Binomial Heaps and Fibonacci Heaps, Lower bounds for sorting by comparison of keys.
Comparison of sorting algorithms. Amortized Time Analysis. Red-Black Trees –
Insertion & Deletion.
Module 3
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 for Transitive closure. All
pair shortest path in graphs. Dynamic programming. Constructing optimal binary search
trees.
Module 4
Complexity Theory - Introduction. P and NP. NP-Complete problems. Approximation
algorithms. Bin packing, Graph coloring. Traveling salesperson Problem.
Text Books:
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
References:
1. Anany Levitin, "Introduction to the design and analysis of algorithms", Pearson
Education
2. A.V.Aho, J.E.Hopcroft and J.D. Ullman, "The Design and Analysis of Computer
Algorithms", Addison Wesley Publishing House, Reading, MA
3. 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
Type of questions for University Examination
Question 1 - 8 short answer questions of 5 marks each. 2 questions from each module
Question 2-5 – There will be two choices from each module .Answer one question from each module of
15 marks
CS/EB/EC/EI 605 CONTROL SYSTEMS ENGINEERING
Module 1
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 - Mason’s gain formula.
Module 2
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 3
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.
Module 4
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 in the frequency domain - simple design in S-plane.
Text Book:
1. Ogata K: “ Modern Control Engineering”, Prentice Hall/Pearson,2002
References:
1. Dorf: Morden Communication Systems ,Pearson Education
2. 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,1991
7. Ramkayan: Control Engineerng, Vikas Publications
8. M N Bandyopadhyaya: Control Theory ,PHI
9. Glad: Control Theory, Vikas Thomson Publications
Type of questions for University Examination
Question 1 - 8 short answer questions of 5 marks each. 2 questions from each module
Question 2-5 – There will be two choices from each module .Answer one question from each module of
15 marks
CS/IT 606 COMPUTER NETWORKS
Module 1
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 2
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 3
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 4
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
Text Book:
1. Youlu Zheng and Shakil Akhtar, Networks for Computer Scientist and Engineers, Oxford
University Press,2006
2. James F. Kurose and Keith W. Ross, Computer Networking – A Top-Down Approach
Featuring the Internet,2/e Pearson Education ,2003
References:
1 S. Keshav, An Engineering Approach to Computer Networking, Pearson education ,2002
2 F. Halsall, Data Communication, Computer Networks and Open Systems, Addison
Wesley, 1996
3 Andrew S. Tanenbaum, Computer Networks , 4/e, Pearson education, 2003
4 Behrouz A. Fourouzan ,Data Communications and Networking, 2/e Tat McGrawhill,2000
5 Leon-Garcia and I. Widjaja, Communication Networks, Tata McGraw Hill, 2000
6 Bertsekas and Gallagar , Data Networks, 2/e, PHI, 1992
7 Douglas E Comer ,Computer Networks and Internet’s, 2/e Pearson Education,2004
5. Gallo, Computer Communication and Networking Technologies, Thomson Learning
Type of questions for University Examination
Question 1 - 8 short answer questions of 5 marks each. 2 questions from each module
Question 2-5 – There will be two choices from each module .Answer one question from each module of
15 marks
CS 607 SYSTEMS PROGRAMMING AND HARDWARE LAB
1. Identification of components/cards and PC assembling from components
2. Assembly language program for implementing arithmetic operations
3. Assembly Language programs for time and date manipulation.
4. Assembly Language programs for display /video manipulation
5. Assembly Language program for equipment status
6. Implementation of a file manager using DOS/BIOS interrupts
7. TSR (Terminate and Stay Resident) Programming
8. ADC interface
9 .Stepper Motor interface using DAC
10. Parallel Interface: Printer and HEX keyboard.
11. Serial Interface: PC to PC serial interface using null modem
Note: Programs can be implemented using MASM /TASM
References:
1. H. P. Messmer, The Indispensable PC Hardware Book, 3/e, Addison Wesley, 1997
2. S. J. Bigelow, Troubleshooting, Maintaining, and Repairing PCs, 2/e, Tata McGraw
Hill, New Delhi, 1999
3. Douglas V. Hall, Microprocessors and Interfacing, 2/e, Tata McGraw Hill, 1988
4. Ytha Yu and Charles Marut , Assembly Language Programming and Organisation of
IBM PC, International Edition , McGrawhill Inc , 1992
6. Barry B. Brey , The Intel Microprocessors 8086 to Pentium 4- Architecture
Programming and Interfacing, 6/e Pearson Education ,2003
Note: 50% Marks is earmarked for continuous evaluation and 50% marks for end
semester examination to be assessed by two examiners. A candidate shall secure a
minimum of 50% marks separately for the two components to be eligible for a pass
in that subject.
CS 608 MINI PROJECT
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 for
its full design specifications. Innovative design concepts, reliability considerations and aesthetics
/ ergonomic aspects taken care of in the project shall be given due weight.
Guidelines for evaluation:
i) Attendance and Regularity 10
ii) Work knowledge and Involvement 30
iii) End-Semester presentation & Oral examination 20
iv) Level of completion and demonstration of
functionality/specifications 25
v) Project Report 15
Total 100 marks
Note: External projects and R&D projects need not be encouraged at this level. Points (i) & (ii)
to be evaluated by the project guide & co-ordinator and the rest by the final evaluation team
comprising of 3 teachers including the project guide.

s5 syllabus

EB/EC/EE/EI/CE/CS/IT/ME/SE 501 ENGINEERING MATHEMATICS IV
Module 1
Probability distributions: random variables (discrete & continuous), probability density,
mathematical expectation, mean and variance of a probability distribution, binomial
distribution, Poisson approximation to the binomial distribution, uniform distribution ,
normal distribution. Curve fitting: method of least squares, correlation and regression,
lines of regression.
Module 2
Sampling distributions: population and samples, the sampling distribution of the mean
unknown), known), the sampling distribution of the mean (( the sampling distribution
of the variance, point estimation, interval estimation, tests of hypotheses, null hypotheses
and significance tests, hypothesis concerning one mean, type I and type II errors,
hypotheses concerning two means. The estimation of variances : Hypotheses concerning
one variance - Hypotheses concerning two variances.
Module 3
Finite difference Operators: , , , ,  , x(n) .Newton’s Forward and Backward
differences interpolation polynomials, central differences, Stirlings central differences
interpolation polynomial. Lagrange interpolation polynomial, divided differences,
Newton’s divided differences interpolation polynomial. Numerical differentiation:
Formulae for derivatives in the case of equally spaced points. Numerical integration:
Trapezoidal and Simpson’s rules, compounded rules, errors of interpolation and
integration formulae. Gauss quadrature formulae (No derivation for 2 point and 3 point
formulae)
Module 4
Numerical solution of ordinary differential equations: Taylor series method, Euler’s
method, modified Euler’s method, Runge-Kutta formulae 4th order formula. Numerical
solution of boundary value problems: Methods of finite differences, finite differences
methods for solving Laplace’s equation in a rectangular region, finite differences
methods for solving the wave equation and heat equation.
Text Books:
1. Irvrin Miller & Freind : Probability And Statistics For Engineers, Prentice Hall Of
India
2. S.S.Sastry: Numerical Methods, PHI Publishers.
References:
1. P.Kandaswamy K.Thilagavathy, K.Gunavathy: Numerical Mehtods, S.Chand & Co.
2. A.Papoulis: Probability,Random Variables And Stochastic Processes,MGH
Publishers
Type of questions for University Examination
Question 1 - 8 short answer questions of 5 marks each. 2 questions from each module
Question 2-5 – There will be two choices from each module .Answer one question from each module of
15 marks
Type of questions for University Examination
Question 1 - 8 short answer questions of 5 marks each. 2 questions from each module
Question 2-5 – There will be two choices from each module .Answer one question from each module of
15 marks
CS/IT 502 SYSTEM PROGRAMMING
Module 1
Assemblers: Overview of the assembly process - Machine dependent assembler features-
Machine independent assembler features-Design of two pass assembler-single pass
assembler.
Module 2
Loaders and linkers -Loader functions-program relocatability- absolute and bootstrap loader-
Overview of linkage editing-linking loader-Dynamic linking-Design of the linkage editor.
Module 3
Macroprocessors - macro definition and usage-Schematics for Macro expansion-
Generation of unique labels- Conditional macro expansion- Recursive macro expansion-
Design of a Macro pre-processor-Design of a Macro assembler.
Module 4
Operating Systems – Basic Operating Systems functions – Types of Operating Systems –
User Interface – Run-time Environment. Operating Systems Design Options –
Hierarchical Structures – Virtual Machines – Multiprocessor Operating Systems –
Distributed Operating Systems – Object Oriented Operating Systems.
Text Books:
1. Leland L.Beck, “System Software - An Introduction to System Programming”,
Addison Wesely
References:
1. D.M.Dhamdhere, "System Programming and Operating Systems”, 2nd Ed., Tata
Mcgrawhill
2. John J. Donovan, “Systems Programming”, McGraw Hill.
Type of questions for University Examination
Question 1 - 8 short answer questions of 5 marks each. 2 questions from each module
Question 2-5 – There will be two choices from each module .Answer one question from each module of
15 marks
CS/IT 503 SOFTWARE ENGINEERING
Module 1
Software Life Cycle - Water fall model – Prototyping – Spiral model – pros and cons of
each model .
Requirements Analysis - SRS – DFD – ER Diagrams – Decision tables – Decision Trees
– Formal specification techniques: Axiomatic and Algebraic specifications - Petrinets
Module 2
Software Design: Design Heuristics – Cohesion and Coupling
Design Methodologies - Structured analysis and design, Architectural Design, Interface
design, Component Level design.
Software Reuse and Software Maintenance issues.
Module 3
Introduction to Software Quality Management - Software Testing - Objectives of testing
– Functional and Structural testing –Generation of test data - Test Plan - Unit testing –
Integration testing – System testing – Test reporting.
Overview of SQA Planning – Reviews and Audits – Software configuration
management - Quality Standards - Study of ISO9000 & CMM
Module 4
Software Project Management - Brief study of various phases of Project Management –
Planning – Organizing – Staffing – Directing and Controlling
Software Project Cost Estimation – COCOMO model – Software Project Scheduling
CASE tools: CASE definitions – CASE Classifications – Analysis and Design
Workbenches, Testing Workbenches
Text Book:
1. Rajib Mall - Fundamentals of Software Engineering –, PHI.
2. Pankaj Jalote - Software Engineering –Narosa Publications
References:
1. Ali Behferooz and Frederick J. Hudson - Software Engineering Fundamentals -,
Oxford University Press India.
2. Roger S. Pressman - Software Engineering – Mc GrawHill International Edition
3. Ian Somerville - Software Engineering – Pearson Education
4. Alka Jarvis & V. Crandall - In roads to Software quality –
5. Richard Thayer - Software Project Management –
6. Bass, Software Architecture Interactives - Pearson Education ,2003
Type of questions for University Examination
Question 1 - 8 short answer questions of 5 marks each. 2 questions from each module
Question 2-5 – There will be two choices from each module .Answer one question from each module of
15 marks
CS 504 COMPUTER GRAPHICS
Module 1
Graphic hardware. Graphic software Output primitives –points and lines. Line drawing
algorithms - circle generating algorithms - polygon filling algorithms – Filling arcs –
pattern filling Output attributes - Bundled attributes. Antialiasing. Graphical user
interface - Logical classification of input devices.
Module 2
Two dimensional transformations. basic transformations - translation - rotation - scaling.
Matrix representation and homogeneous coordinates - composite transformations.
Transformation between coordinate systems - Affine transformations. Two dimensional
viewing - viewing pipeline - Windows to viewport transformations - clipping operations -
point clipping - line clipping - polygon clipping.
Module 3
Three dimensional object representations. polygon surfaces - curved surfaces. Spline
representations - Hermite polynomials - Cubic splines - Bezier curves - B-splines.
Octrees and BSP trees. Fractal geometry methods. Three dimensional transformations..
Three dimensional viewing. Projections.
Modula 4
Visible surface detection. Classification of visible surface detection algorithms. Back face
detection - Depth buffer - A-buffer. Scan line algorithms- Depth sorting - Area
subdivision methods octrees - BSP trees - octrees - Shading . Illumination models - light
sources. Basic Illumination models. Polygon rendering - constant intensity - Goraud
shading - Phong shading - Animation techniques.
Text Book:
1. Donald Hearn ,M Pauline Baker, Computer Graphics C version, 2/E Pearson
Education ,2003 .
References:
1. James D.Foley et.al., Introduction to Computer Graphics, Addison Wesley
Publishing Company, 1994
2. Alan Watt, Mark Watt, Introduction to Animation and Rendering,, Addison Wesley
Publishing Company, 1994
3. Newmann W and Sproull R.F., Principles of Interactive Computer Graphics,
McGraw-Hill,1980
4. Rogers D.F., Procedural Elements for Computer Graphics, McGraw-Hill, 1985
Type of questions for University Examination
Question 1 - 8 short answer questions of 5 marks each. 2 questions from each module
Question 2-5 – There will be two choices from each module .Answer one question from each module of
15 marks
CS/IT 505 DATABASE MANAGEMENT SYSTEMS
Module 1
Introduction: Characteristics of the Database approach – Data models, schemas and
instances – DBMS architecture – Data independence – Database languages and interfaces
– Database administrator – Data modeling using Entity - Relationship (ER), Entity sets,
attributes and keys - Relationships, Relationship types, roles and structural constraints -
Weak Entity types - Enhanced Entity-Relationship (EER) and object modeling. Sub
classes, super classes and inheritance - Specialization and generalization.
Module 2
Record storage and file organizations: Placing file records on disks – Fixed length and
variable length records - Spanned Vs Unspanned records – Allocating file records on
disk– Files of unordered records(Heap files), Files of ordered records(Sorted files).-
Hashing Techniques. Indexed structures for files – Types of single level ordered index,
multi- level indexes.
Module 3
The Relational model: Relational model concepts – Relational model constraints - The
Relational Algebra – Relational calculus – Tuple Relational calculus, Domain Relational
calculus. - SQL. Database Design: Functional dependencies – Basic definitions – Trivial
and non trivial dependencies –Closure of a set of dependencies – Closure of a set of
attributes – Irreducible sets of dependencies – Nonloss decomposition and Functional
dependencies. First, Second and Third normal forms – Boyce-codd normal form.
Module 4
Transaction Management- Concurrency Control-Lost Updates- Uncommited Data-
Inconsistent Retrievals-The Scheduler-Concurrency Control with Locking Methods –
Concurrency Control with Time Stamping- Concurrency Control with Optimistic
Methods- Database Recovery Management.
Introduction to object oriented databases, Active databases. Data warehouses – Data
mining
Text Books:
1. Elmasri and Navathe, “Fundamentals of Database Systems” , 3/e, Addison - Wesley, 2001.
2. Peter Rob Carlos Coronel, Database Systems , Design, Implementation &Management ,
5/e,Thomson Course Technology
3. A Silberschatz, H. F. Korth, and S Sudarshan, “Database System Concepts”, 3/e,Tata
McGraw Hill,1997
References:
1. Thomas Connoly ,Carolyn Begg “ Database Systems”,3/e,Pearson Education.
2. C.J Date, “ An Introduction to Database Systems “, Addison-Wesley
3. Margaret.H.Dunham ,”Data Mining. Introductory and advanced topics”, Pearson
Education,2003.
4. Hector Garcia-Molina,Jeffret D. Ullman, Jenniffer Widom ,”Database System
implementation”, Prentice Hall International, Inc, 2000.
Type of questions for University Examination
Question 1 - 8 short answer questions of 5 marks each. 2 questions from each module
Question 2-5 – There will be two choices from each module .Answer one question from each module of
15 marks
CS/EB 506 MICROPROCESSOR BASED SYSTEM DESIGN
Module 1
Architecture of 16 bit microprocessors: Intel 8086 Architecture –– Segment registers and
memory segmentation – memory address space and data organization, addressing modes,
instruction set, instruction template examples, instruction execution timing. Assembly
Language programming, programming examples;
Modular programming-Assembler instruction format, assembler directives and operators,
assembly process, linking and relocation, debugging, stacks, procedures, interrupt
routines, macros
Module 2
8086 hardware design:minimum mode and maximum mode configurations, pin
configuration of 8086, comparison with 8088; Bus structure, bus buffering, latching,
system bus timing with diagram,
Peripherals and their interfacing:Dynamic RAM interfacing, interfacing I/O ports,,
interfacing with programmable interrupt controller 8259,programmable DMA interface
8237, DMA transfer and operations
Multiprocessor Systems:Interconnection topologies-interfacing with 8087- architecture of
8087 and configuration- Design of a PC based multimicroprocessor system
Module 3
Architecture of 32 bit Microprocessors: Intel 80386 Architecture, Block Diagram,
Addressing modes,Data Types 80386,Real address mode of 80386 protected mode of
80386, segmentation,paging and Virtual modes
Recent advances in microprocessor architectures-Pentium families-salient features of
Pentium II Pentium III and Pentium IV- a few relevant concepts of computer architecurepipelining,
CISC and RISC Architecture-Introduction to dual-Core Architecture.
Module 4
Introduction to micro controllers - comparison with microprocessors Study of micro
controller (MCS 51 family- 8051) - Architecture, instruction set, addressing modes and
programming - Comparison of various families of 8bit micro controllers. Interfacing with
sensors and actuators
Text books:
1. Ajoy Kumar Ray, Kishor M.Bhurchandi, Advanced Microprocessors and
Peripherals,TMH, New Delhi,2000
2. Kenneth Ayala The 8086 Microprocessor :programming and interfacing the PC
Thomson Learning
3. Mazidi, “The 8051 Microcontrollers & Embedded Systems”, Pearson Education.
References:
1. Kenneth Ayala“, The 8051 Microcontroller”, West Publishing Company.
2. Douglas V Hall,” Microprocessors & Interfacing-Programming and Hardware”
TMH
3. Avtar Singh , “ The 8088 and 8086 Microprocessors_programming, Interfacing,
Software, Hardware and Applications” PHI
4. Barry B. Brey, "The INTEL Microprocessors - 8086/8088, 80186/80188, 80286,
80386, 80486 Pentium and Pentium pro processor, Pentium II, Pentium III and
Pentium IV - Architecture, Programming and interfacing", PHI , 6 Ed, 2003.
5. YU-Cheng Liu & Glenn A Gibson,” Microprocessor System , Architecture
Programming & Design”
6. Kenneth Hintz & Daniel Tabak “Microcontroller architecture implementation and
programming” , Mc Graw Hill.
7. Intel Users manual for 8086, 80386 & 80486, Pentium & Pentium pro
8. “Microprocessor Systems”, Learning Material Series, ISTE, NewDelhi,1997
9. John B. Peatman, "Design with microcontrollers" McGraw Hill, Singapore.
Type of questions for University Examination
Question 1 - 8 short answer questions of 5 marks each. 2 questions from each module
Question 2-5 – There will be two choices from each module .Answer one question from each module of
15 marks
CS/EB/EC/EI 507 MICROPROCESSOR LABORATORY
PART I – 3 Lab sessions
Part I A (Compulsory)
1. Study of a typical microprocessor trainer kit and its operation
2. Interfacing and programming of 8255.(eg: traffic light control, burglar alarm, stop
watch)
3. Interfacing and programming of 8253/ 8254.
4. Interfacing and programming of 8279.
Part I B*
1. A/D and D/A converter interface
2. Stepper motor interface
3. Display interface
4. Programming of different types of EPROM 2716, 2732 etc
(* At least two topics from part B has to be covered.)
PART II – 7 Lab sessions
(Compulsory)
1. Introduction to IBM/PC and its DEBUG program commands
- Examining and modifying the contents of the memory
- Assembling 8086 instructions with the ASSEMBLER commands
- Executing 8086 instructions and programmes with the Trace and GO Command.
- Debugging a program
2. Assembly language program development using IBM/PC Macro assembler
- Creating an Assembler source file
- Assembling source program with MASM
- The link program - creating a RUN module
- Typical programming examples.
3.Interfacing Experiments with micro controllers
Note: 50% Marks is earmarked for continuous evaluation and 50% marks for end
semester examination to be assessed by two examiners. A candidate shall secure a
minimum of 50% marks separately for the two components to be eligible for a pass
in that subject.
CS 508 COMPUTER GRAPHICS LAB
1. Implementing Line ,Circle and Ellipse drawing algorithms
2. Implementing scan line polygon filling algorithm
3. Implementing seed filling algorithms –flood fill, Boundary fill ( recursive and non
recursive)
4. Implementing line clipping methods
5. Implementing polygon clipping methods
6. Generation of different 2D patterns and images.
7. 2D transformations using homogeneous coordinates
8. Generating Beizier and B-spline curves
9. Implementation of Hidden surface elimination techniques of 3D objects
10. Implementation of Shading methods for 3D objects
11. Implementation of animation methods.
12. Programming using Open GL
(Can be done as a development of a small 2D/3D graphics package or Game using
OpenGL)
References:
1. Donald Hearn ,M Pauline Baker, Computer Graphics C version, 2/E
2. Pearson Education ,2003
3. James D.Foley ct.al., Introduction to Computer Graphics, Addison Wesley
Publishing
4. Company, 1994.
5. Mason Woo et.al, OpenGL Programming Guide – The official guide to OpenGL, 3rd
6. Edition, OpenGL Architecture Review board
7. Noman Lin, Linux 3D Graphics Programming, Worldwide Game Development
8. Library.
9. Ron Fosner, OpenGL programming for Windows 95 and Windows NT
Note: 50% Marks is earmarked for continuous evaluation and 50% marks for end
semester examination to be assessed by two examiners. A candidate shall secure a
minimum of 50% marks separately for the two components to be eligible for a pass
in that subject.