Professional Documents
Culture Documents
MATHEMATICAL LOGIC: Prepositions-Logical operator-Equivalence and implication-Laws of logic- Normal forms-prepositional calculus-Quantifiers. (5) RELATIONS: Binary relations-Relation matrix and graph of relation-Partition, covering a set-Equivalence relation-Partial orderingHasse diagram. (5) COMBINATORICS: Counting methods for arrangement and selections-Two basic counting principles-Arrangements and selections with repetition -Generating functions. (6) RECURRENCE RELATIONS: Recurrence relation models-Solution of linear recurrence relations-Solution of non-homogeneous linear relations. (5) GRAPH THEORY: Representation of graphs-Connectivity-Eulerian and Hamiltonian graphs-Trees-Binary tree traversal Expression. (6) GROUP THEORY: Group axioms-Semi groups-Monoids-Applications to generation of codes using parity checks-Error recovery in group codes. (5) FORMAL LANGUAGES: Four classes of grammars-Definitions-Context free grammar-Derivation tree-Ambiguity. (4)
FINITE AUTOMATA: Definition of deterministic finite state automaton (DFA), Non deterministic finite state automaton (NFA) Equivalence of DFA and NFA. (6) Total 42 REFERENCES:
1. 2. 3. 4.
Bernard Kolman, Robert C Busby and Sharan Ross, Discrete Mathematical Structures, Pearson Education/Prentice Hall of India, New Delhi, 2008. Kenneth H Rosen, Discrete Mathematics and its Applications, McGraw Hill Inc, USA, 2007. Alan Tucker, Applied Combinatorics, John Wiley and Sons, USA, 2007.
Doerr Alan and Levasseur Kenneth, Applied Discrete Structures for Computer Science, Galgotia Publication (P) Ltd, New Delhi, 2000.
COMPLEXITY ANALYSIS: Recurrence and Non Recurrence relation - Analysis of algorithms- Asymptotic notations-Time complexity using O notation-Average, best and worst case complexities-analyzing recursive programs. (8) SEARCH TREES: Binary search trees AVL Trees Red-Black trees B-Trees B+ Trees- Applications. GREEDY METHOD: The general method-Knapsack problem- Minimum spanning trees. DYNAMIC PROGRAMMING: The General method- All pairs shortest path- Optimal Binary Search tree. (8) (4) (5)
BACKTRACKING: The General method- Solution space and tree organization- The Eight Queens problem Graph coloring. (5) BRANCH AND BOUND: The General method- 0/1 Knapsack problem- Traveling Salesman problem. REFERENCES: (4) Total 42
1. 2. 3. 4.
Ellis Horowitz, Sartaj Sahni and Sanguthevar Rajasekaran, Fundamentals of Computer Algorithms, Galgotia Publications, New Delhi, 2008.
Chitra A and Rajan P T, Data Structures, Vijay Nicole Imprints Private Limited, Chennai, 2006. Mark Allen Weiss, Data Structures and Problem Solving using Java, Addison Wesley, USA, 2006. Aho A V, Hop craft J E and Ullman J D, Design and Analysis of Algorithms, Pearson Education India, New Delhi, 2003. Thomas H Cormen, Introduction to Algorithms, The MIT Press, USA, 2001.
1. 3. 4.
John L Hennessey and David A Patterson, Computer Architecture A Quantitative Approach, Morgan Kaufmann, USA, 2003. 2. Kai Hwang and Faye Briggs, Computer Architecture and Parallel Processing, McGrawHill International Edition, Singapore, 2000. Sayed Roosta,Parallel Processing and Parallel Algorithms, Springer series, USA, 1999. Sima D, Fountain T and Kacsuk P,Advanced Computer Architectures: A Design Space Approach , Addison Wesley, USA, 2000.
Total 42 REFERENCES:
1.
2. 3. 4.
Roger S Pressman, Software Engineering A Practitioners Approach, McGraw Hill International Edition, USA, 2007. Sommerville I, Software Engineering, Pearson Education India, New Delhi, 2006. Pfleeger, Software Engineering, Pearson Education India, New Delhi, 1999. Watts S Humphrey, Managing the Software Process, Addison Wesley, USA, 1990.
LAN ACCESS TECHNIQUES: Topologies Transmission media polling contention ALOHA CSMA CSMA/CD Token Ring Protocols. (7) INTERNETWORKING: Introduction Network Devices Hubs, Switches, Bridges, Routers, Gateways and Repeaters, Ethernet, FDDI-Routing Algorithms Congestion Control Algorithms Network Monitoring SNMP. (9) NETWORK PROTOCOLS: UDP and TCP- IPV4, IPV6 IP Addressing, HTTP, SMTP, FTP, TELNET, GHOST. (9)
ADVANCED NETWORK ARCHITECTURES: Introduction Integrated Services in the Internet Differentiated Services Wireless LAN-802.11- Introduction to Multimedia Networking, Blue tooth Technology. (9) SIMULATOR: Network Simulator NS2 TCL / TK Simulation Examples. (4)
Total 42 REFERENCES: 1. Kurose J F and Ross K W, Computer Networking A Top Down Approach Featuring the Internet, Pearson Education India, New Delhi, 2007. 2. Behrouz A Forouzan, Data Communications and Networking Tata McGraw-Hill, New Delhi, 2007. 3. Andrew S Tanenbaum, Computer Networks, Prentice Hall of India, New Delhi, 2007. 4. Vijay Ahuja, Design and Analysis of Computer Communication Networks, Tata McGraw Hill Ltd, New Delhi, 2002. 5. Keiser G, Local Area Networks, Tata McGraw Hill Ltd, New Delhi, 2002.
6.
Peterson, Davie and Morgan Kaufman, Computer Networks- A Systems Approach, Harcout Asia, Singapore, 2000.
1.
Ramez Elmasri and Shamkant B Navathe, Fundamentals of Database Systems, Addison Wesley, USA, 2007.
2. 3. 4.
Raghu Ramakrishnan and Johannes Gehrke, Database Management Systems, Tata McGraw-Hill, New Delhi, 2008. Abraham Silberchatz, Henry F Korth and S Sudarshan, Database System Concepts, Tata McGraw-Hill, New Delhi, 2008. Atul Kahate, Introduction to Database Management Systems, Pearson Education, USA, 2004.
1.
2. 3. 4. 5. 6.
Study of Network Simulator (NS) Simple topology creation Binary Exponential Back off Algorithm Sliding Window Protocol Routing Algorithms (Shortest Path, Link State) Simulation of Congestion Control Algorithms using NS
FILE AND I/O MANAGEMENT: I/O functions-I/O devices-Disk Scheduling Algorithms, File Management Systems-File System Architecture-Functions of File Management-File Directories-Secondary Storage Management-File Allocation. (8) INTRODUCTION TO LINUX: History- Architecture and Structure-Process Management-Inter Process Communication-Memory Management-I/O and File Management. (6) LINUX ADMINISTRATION: Basic Commands-Installing and Configuring Linux-Shell Scripting-Users and Groups-Package installation-Network Configuration-Backup and archives-Configuring and using X Windows. (8) VMWARE: Introduction- Virtualization- Virtual Data Center Operating System- Storage Virtualization -Virtual Networking- Virtual Security. (4) Total 42 REFERENCES:
1.
2.
Silberschatz A, Galvin P and Gagne G, Operating System Concepts John Wiley and Sons, Singapore, 2007. Dhamdhere D M, Operating Systems- A Concept based Approach, Tata McGraw Hill, New Delhi, 2006. Daniel P Bovet and Macro Cesati, Understanding the Linux Kernel, Oreilly publications, USA, 2006. William Stallings, Operating Systems, Prentice Hall, New Delhi, 2004. William J Lowe, VMware Infrastructure 3 for dummies, John Wiley and Sons, USA, 2008.
3. 4.
5.
LEXICAL ANALYSIS: The role of the lexical analyzer Input buffering- Specification of tokens-Recognition of tokens - A language for specifying lexical analyzers Finite automata Converting regular expression to DFA - Minimization of DFA Design of a lexical analyzer generator-LEX. (7) SYNTAX ANALYSIS: The role of the parser- Context free grammars -Top down parsing Bottom up parsing - Recursive Descent Parser-Predictive Parser- LL (1) Parser - Shift Reduce Parser - LR Parser - LR (0) item - Construction of SLR Parsing table -Introduction to LALR Parser - Error handling and recovery in syntax analyzer- YACC- Design of a syntax analyzer for a sample language. (10) SYNTAX DIRECTED TRANSLATION: Syntax directed definitions -Construction of syntax trees-Bottom-up evaluation of Sattributed and L-attributed definitions-Top down translation-Bottom up evaluation. (6) INTERMEDIATE CODE GENERATION: Intermediate languages Declarations Assignment statements Boolean expressions Case statements Back patching. (5) CODE OPTIMIZATION AND CODE GENERATION: Principal Sources of Optimization Basic Blocks and Flow Graphs Optimization of basic Blocks Introduction to Global Data Flow Analysis - Issues in the design of code generator The target machine Runtime Storage management Next-use Information A simple Code generator DAG representation of Basic Blocks Peephole Optimization. (10) Total 42 REFERENCES:
1. 2.
Alfred V Aho, Ravi Sethi and Jeffrey D Ullman, "Compilers Principles, Techniques and Tools", Pearson Education, New Delhi, 2008. G Sudha Sadasivam, Compiler Design, Scitech Publications, Chennai, 2008. 3. Dhamdhere D M, "Compiler Construction Principles & Practice", Macmillan India Ltd., New Delhi, 2001.
4. 5.
Jean Paul Tremblay and Paul G Serenson, "The Theory & Practice of Compiler Writing", McGraw Hill, New Delhi, 2001. Dick Grone, Henri E Bal, Ceriel J H Jacobs and Koen G Langendoen, Modern Compiler Design, John Wiley & Sons, USA, 2000.
5. 6.
1.
Delhi, 2006.
Pradeep K Sinha, Distributed Operating Systems: Concepts and Design, PHI / Prentice Hall of India, New
2. 3.
Andrew S Tanenbaum and Marteen van steen Distributed Systems Principles and Paradigms, PHI / Pearson Education, New Delhi, 2006. George Coulouris, Tim Kindberg and Jean Dollimore, Distributed Systems Concept and Design, Pearson Education, New Delhi, 2005. 4. Nancy A Lynch, Distributed Algorithms, Morgan Kaufmann Publishers, New Delhi, 2000.
1. 2. 3. 4.
Sumit Kasera and Nishit Narang, 3G Networks, Architecture, Protocols and procedures, Tata MCGraw Hill Professional networks Series, New Delhi, 2008. Jochen Schiller, Mobile Communications, Pearson Education, New Delhi, 2004. Charles E Perkins, Mobile IP:Design Principles and Practices,Addison Wesley,USA,1998 William C Y Lee, Mobile Cellular Telecommunications MCGraw Hill International Edition, USA, 1995.
1. 2. 3. 4. 5. 6.
William Stallings, Network Security Essentials, Applications and Standards, Dorling Kindersley I P. Ltd, Delhi, 2008. William Stallings, Cryptography and Network Security - Principles and Practice, Pearson Education, Delhi, 2007. Behrouz A Forouzan, Cryptography and Network Security, Tata McGraw Hill Ltd, New Delhi, 2008. Wenbo Mao, Modern Cryptography: Theory and Practice, Prentice Hall, New Delhi, 2003. Atul Kahate, Cryptography and Network Security Tata McGraw Hill Ltd, New Delhi, 2008. David R Mirza, Hack Proofing your Network, Dream Tech (SYNGRESS) Publication, New Delhi, 2002.
1.
2007.
Roger S Pressman, Software Engineering A Practitioners Approach, McGraw Hill International Edition, USA, Bob Hughes and Mike Cotterell,Software Project Management, Tata McGraw Hill Edition, New Delhi, 2006. Pankaj Jalote,Software Project Management in Practice, Pearson Education, New Delhi, 2002. Watts S Humphrey, Managing the Software Process, Addison-Wesley, USA, 1990.
2.
3.
4.
XML: Design of an XML document - Creating well formed XML documents, valid XML documents, DTDs Entities and Attributes, Creating XML schemas, Parsing XML Java and XML DOM, Java and SAX, XSLT, XHTML. (8) JAVA SERVLETS: Servlet basics- Handling Cookies- Session tracking. (5)
JSP: JSP Basics, Integrating Servlets and JSP MVC architecture Struts, Accessing Databases with JDBC, Deploying Web Applications, controlling behavior with web.xml, Servlet and JSP Filters, Tag Libraries - JSTL, AJAX Basics. (10) WEB SERVICES: Overview and Service oriented architecture, SOAP protocol, Describing web services - WSDL, Discovering web services - UDDI. (6) CASE STUDIES: Spring - Hibernate Google Web Toolkit.
(3)
Total 42 REFERENCES:
1. 2. 3. 4. 5. 6. 7. 8.
Cay S Horstmann and Gary Cornell, Core Java 2, Volume I - Fundamentals, Pearson Education, USA, 2005. Cay S Horstmann and Gary Cornell, Core Java 2, Volume II - Advanced Features, Pearson Education, USA, 2005. Nicholas C Zakas, Jeremy McPeak and Joe Fawcett, Professional Ajax, Wrox, USA, 2006. Steve Holzner, Inside XML, Techmedia, New Delhi, 2001. Kathy Sierra and Bryan Basham, Head First Servlets and JSP, Shroff Publishers and Distributors, Mumbai, 2007. Marty Hall and Larry Brown, Core Servlets and JavaServer Pages: volume 1: core technologies, Pearson Education, USA, 2008. Marty Hall, Core Servlets and JavaServer Pages: volume 2 Advanced technologies, Pearson Education, USA, 2008. Steve Graham, Doug Davis, Simeon Simeonov, Glen Daniels, et.al, Building Web Services with Java, Pearson Education, USA, 2004.
2.
Ian Foster and Carl Kesselman, The Grid: Blueprint for a New Computing Infrastructure, Morgan Kaufman, New Delhi, 2006.
3. 4.
Fran Berman, Geoffrey Fox and Anthony Hey J G, Grid Computing Making the Global Infrastructure a Reality, Wiley, USA, 2003. Joshy Joseph and Craig Fallenstein, Grid Computing, Pearson Education, New Delhi, 2004. C S R Prabhu, Grid and Cluster Computing, Prentice Hall, New Delhi, 2008.
5.
Operating System Implementation of the following concepts: 1. CPU Scheduling Algorithms 2. Deadlock 3. Interprocess Communication
4.
5. 6. 7.
Page Replacement algorithm Disk Scheduling Algorithms System Calls Shell Programming
1.
2006.
Jiawei Han and Micheline Kamber, Data Mining Concepts and Techniques, Morgan Kaufmann Publishers, USA,
2. 3. 4. 5.
Berson,DataWarehousing, Data Mining and OLAP, Tata McGraw Hill Ltd, New Delhi, 2004. Arun K Pujari,Data mining techniques, Oxford University Press, London, 2003. Dunham M H,Data mining: Introductory and Advanced Topics. Pearson Education, New Delhi, 2003. Mehmed Kantardzic, Data Mining Concepts, Methods and Algorithms, John Wiley and Sons, USA, 2003.
1.
2.
Robert Spalding, Storage Networks: The Complete Reference Tata McGraw Hill Publishing Company, Delhi, 2003. Gerald J Kowalski and Mark T Mayburk, Information storage and Retrieval Systems, Springer, New Delhi, 2006. Ulf Troppens, Rainer Erkens and Wolfgang Mller, Storage Networks Explained Wiley & Sons, USA, 2004. Marc Farley Osborne, Building Storage Networks, Tata McGraw Hill Publishing Company, New Delhi, 2000.
3.
4.