Text books and References 1 Varshney R.L & Maheshwari K.L , Managerial economics, S Chand & Co. Ltd. 2 Dwiivedi D.N, Managerial Economics, Vikas Publishing House Pvt Ltd 3. Dewett K.K, Modern Economic theory, S Chand & company Ltd. 4. Barthwal A.R ,Industrial Economics, New Age International Publishers 5. Benga T.R & Sharma S.C, Industrial Organization and Engineering Economics , Khanna Publishers 6. Ahuja H.L Modern Micro Economics Theory and Applications , S Chand & Co. Ltd 7. Koutsoyiannis A , Modern Microeconomics, Macmillan Press Ltd. 8. Joel Dean, managerial Economics Prentice-Hall of India Pvt Ltd. 9. Dewett.K.K& Verma J.D,Elementary Economic Theory , S Chand & Co. Ltd. 10. Jhingan M.L., Macro Economic theory , Vrinda Publications Pvt.Ltd.
Sessional work assessment Two tests Two assignments Total
University examination pattern Q I - 8 short answer type questions of 5 marks, 2 from each module. Q II - 2 questions A and B of 15 marks from module I with choice to answer any one. Q III - 2 questions A and B of 15 marks from module II with choice to answer any one. Q IV - 2 questions A and B of 15 marks from module III with choice to answer any one. Q V - 2 questions A and B of 15 marks from module IV with choice to answer any one
2K6 CS 503: THEORETICAL FOUNDATION OF COMPUTATION
3 hours lecture and 1 hour tutorial per week

Module I (14 hours)

Introduction; alphabets, Strings and Languages; Automata and Grammars -Finite automata (FA) -DFA-NFA Finite Automata with epsilon-transitions-Equivalence of DFAs and NFAs -Regular expressions (RE) -Definition, RE to FA, FA to RE, algebraic laws for RE, applications of REs. -Regular grammars and FA -Proving languages to be non-regular -Pumping Lenma Applications. Closure properties of Regular languages -Closure under Boolean operations, reversal, homomorphism, inverse homomorphism, etc. Myhill-Nerode theorem-DFA Minimization Decision properties of Regular languages - Two-way finite automata, Finite automata with output.

Module II (13 hours)

Context-free Grammars (CFG) -Parse tree - Ambiguity in grammars and Languages-Applications of CFGPushdown Automata (PDA) -Equivalence of PDAs and CFGs -DPDAs -Definition, DPDAs and Regular Languages,-DPDA and Ambiguous grammars--CYK algorithm -Simplification of CFGs -Normal forms -CNF and GNF --Pumping lemma for CFLs,Closure properties of CFLs - Decision properties of CFL.

Module III (13 hours)

Turing Machines -Formal definition and behavior - TM as a computer of integer functions -Programming techniques for TMs -Storage in state, multiple tracks, subroutines, etc.-Computing a partial function with Turing machineVariants of TMs Multitape TMs, Nondeterministic TMs. -TMs with semi-infinite tapes, multistack machines.universal Turing Machines-Equivalence of the various variants with the basic model- Models of computation and Church-Turing Thesis.

Module IV (13 hours)

Computability Closure properties of recursive and recursively enumerable language. Undecidability- A language that is not RE An undecidable problem that is RE Undecidable problems about TM-Halting problem Post Correspondence Problem The Chomsky hierarchy Context sensitive language and LBA Equivalence of LBA and CSG.

Text books

1. 2. J E Hopcroft And J D Ullman : Introduction to Automata Theory and Computation, Addison Wesley John C Martin : Introduction to Languages and the Theory of Computation(3 rd Edition) , TMH

Reference books

1. 2. 3. H R Lewis and C H Papadimitriou : Elemnts of Theory of Computation Sipser : Introduction to theory of Computation, CENAGE LEARNING Indian Edition Linz P : An Introduction to Formal Languages and Automata, Narosa
Sessional work assessment
Assignments 2 tests Total marks 2x10 = 20 2x15 = 30 = 50
University examination pattern Q I - 8 short answer type questions of 5 marks, 2 from each module Q II - 2 questions A and B of 15 marks from module I with choice to answer any one Q III - 2 questions A and B of 15 marks from module II with choice to answer any one Q IV - 2 questions A and B of 15 marks from module III with choice to answer any one Q V - 2 questions A and B of 15 marks from module IV with choice to answer any one
2K6 CS 504: PROGRAMMING LANGUAGE CONCEPTS

Module I (12 hours)

Preliminaries Reasons for studying concept of programming languages- Programming Domains-Language evaluation criteria- influence on language design-language categories-Implementation methods-Programming environments Evolution of programming languages- Describing Syntax and semantics-Formal methods of describing syntax- attribute grammars- Dynamic semantics-Names, variables-concept of binding-type checkingstrong typing-type compatibility-Scope and lifetime-referencing environments-Named constants.

Module II (15 hours)

Data types-Primitive-Character strings-Array types-Associative arrays-record and union types-Pointer and reference types-Expression and assignment statements-arithmetic expressions-Overloaded operators-type conversionsrelational and Boolean expressions-short circuit evaluation-assignment statements-mixed mode assignmentstatement level control structures-selection and iterative statements- unconditional branching and guarded commands- subprograms-Design issues parameter passing methods-over loaded subprograms-Implementing subprograms-blocks-implementing dynamic scope

2K6 CS 506: SOFTWARE ENGINEERING
Introduction- The software process, Software process models-Waterfall model, RAD model, Prototyping model, Spiral model, Component based development, Aspect-oriented software development System modeling, System engineering process, System models-Data models, Object oriented model, Scenario based model, Flow oriented model, Class-based model, Behavioral model Software requirements- Functional and Non-functional requirementsSRS- Requirement Engineering Process
Design Engineering- Design concepts, design model, pattern based software design Architectural Design-system structuring, control models, modular decomposition, Object oriented Design, Component based design, User Interface Design
Software Testing- Testing process, Testing strategies- Verification and validation, Software inspection, Unit testing and Integration Testing, Validation testing, System testing Testing tactics- Software Testing Fundamentals, Black box testing, White box testing, Object-oriented testing, Clean room engineering process

Module IV (14 hours)

Project Management- Metrics for process and projects, Estimation- Project planning process, Software scope and feasibility, Resources, software project estimation, Decomposition techniques, Project scheduling, Risk Management- Risk identification, Risk projection, Risk refinement, RMMM Quality management-Product metrics, Quality-Quality control, Quality assurance, Cost of Quality, Change Management-Configuration Management, Software re-engineering, Reverse Engineering, CBSE process.
Text books 7. Pressman S. Roger, Software Engineering, Tata Mac Graw Hill 8. Sommerville Ian, Software Engineering 6th Addition, Addition Wesley 2002 Reference books 1. 2. Jalot Pankaj, An Integrated Approach to S/W Engg.Narosa Publishing House Rajib Mall
Sessional work assessment Assignments 2 tests Total marks 2x10 = 20 2x15 = 30 = 50
2K6 CS 507(P): Programming Environment Lab
3 hours practical per week
Object-oriented programming in Java/C++
1. Define a base class Shape and derived classes for Rectangle, Square, Ellipse and Circle with proper class hierarchy. 2. Implement operator and function overloading. 3. Design and implement an interface. 4. Design and implement a Generic class

FIELD WORK ( 5 HOURS) Visit to a local area to document environmental assets river / forest / grassland / hill / mountain
Visit to local polluted site urban / rural / industrial / agricultural Study of common plants, insects , birds Study of simple ecosystems pond, river, hill slopes, etc.
Text book 1. Clarke. R.S. Marine Pollution. Clanderson Oress Oxford.` 2. Mhaskar A.K. Matter Hazardous. Techno-Science Publications. 3. Townsend. C., Harper. J. and Michael Begon, Essential of Ecology. Blackwell Science. 4. S. Deswal & A. Deswal, A Basic Course in Environmental Studies, Dhanpat Rai & Co 5. Environmental Studies Dr. B. S. Chauhan, University Science Press. 6. Kurien Joseph & R. Nagendran, Essentials of Environmental Studies, Pearson Education. 7. Trivedi. R.K. and Goel. P.K. Introduction to air pollution. Techno-Science Publications. Reference Books 1. Agarwal.K.C. Environmental biology. Nidi Publ.Ltd. Bikaner. 2. Bharucha erach, Biodiversity of India, Mapin Publishing Pvt.Ltd.,. 3. Brunner,R.C. Hazardous Waste Incineration. McGraw Hill Inc. 4. Cunningham W.P. , Cooper T.H., Gorhani E. & Hepworth M.T. Environmental Encyclopedia ,Jaico Publ.House ,. 5. De A.K. Environmental Chemistry.Wiley Eastern Ltd. 6. Hawkins R.E. Encyclopediaof Indian Natural History, Bombay Natural History Society ,. 7. Heywood V.H. & Watson R.T. Global Biodiversity Assessment. Cambridge Univ. Press. 8. Jadhav H. & Bhosale V.M. Environmental Protection and Laws. Himalaya Pub. House, 9. Odum E.P. Fundamentals of Ecology W.B. Saunders Co. 10. Rao M.N. & Datta A.K. Waste Water Treatment. Oxford & IBH Publ. Co. Pvt. Ltd. 11. Sharma B.K. Environmental Chemistry Goel Publ. House, Meerut 12. Trivedi R.K., Handbook of Environmental Laws, Rules, Guidelines, Compliances and Standards, Vol.I & II.Enviro Media. 13. Wagner K.D. Environmental Management. W.B. Saunders Co.
University Examination Pattern Q I 8 short answer type questions of 5 marks, 2 from each module. Q II- 2 questions of 15 marks each from module I with choice to answer any one. Q III- 2 questions of 15 marks each from module II with choice to answer any one. Q IV- 2 questions of 15 marks each from module III with choice to answer any one. Q V- 2 questions of 15 marks each from module IV with choice to answer any one.

2K6 CS 602: GRAPH THEORY & COMBINATORICS

Module I (13 hours)

Introduction to graphs-definitions and examples-subgraphs-complements-isomorphism-vertex degree-Euler trails and circuits-.Planar Graphs-Kuratowski's theorem(without proof).Graph coloring and chromatic polynomials
Trees-Definitions and properties-examples-Weighted Trees-Dijkstra's shortest path algorithm-Spanning trees Kruskal and Prim's algorithms. Module III (13 hours) Fundamental principles of counting-The rules of sum and product -permutations and combinations-binomial theorem-principle of inclusion and exclusion-derangements.-Rook polynomials
Generating functions-definitions and examples-calculational and techniques.-partitions of integers-exponential generating functions-recurrence relations-first order linear recurrence relation-second order linear homogeneous recurrence relation with constant coefficients-Non homogeneous recurrence relation-method of generating function
Text Books 1. Grimaldi R P ,"Discrete and Combinatorial Mathematics".4 th Edn Pearson education Asia
1. Joe L Mott Abraham Kandel Theodore P Baker,"Discrete Mathematics for Computer Scientist and Mathematicians ,2 nd Edn PHI 2.Rose K H '"Discrete Mathematics and its Applications",6th Edn McGrawHill 3.Kolman Busby Ross ,"Discrete Mathematical Structures",PHI 4.Corman ,Leserson and Rivest,"Introduction to Algorithms",PHI 5. Fred Buckley and Frank Harry, Distance in graphs, Addison Wesley
2K6 CS 603: DATABASE MANAGEMENT SYSTEMS
Introduction - Characteristics of Database approach - Advantages of using DBMS approach - Data models schemas and instances - Three-schema architecture and data independence - Database languages and interfaces - The database system environment - Centralized and client-server architectures - Classification of Database Management systems. Entity-Relationship Model - Entity Types, Entity Sets, Attributes and Keys - Relationship types, Relationship Sets, Roles and Structural Constraints - Weak Entity Types - Refining the ER Design - ER Diagrams and Naming Conventions - Example of Other Notation: UML Class Diagrams

Module II (16 hours)

Relational Model and Relational Algebra - Relational Model Concepts - Constraints - Relational Database Schemas Relational Algebra: Unary Operations - Set Theoretic operations - Binary Operations - Aggregate functions and grouping Outer Join and Outer Union - Examples of Queries - The Tuple Relational Calculus - The Domain Relational Calculus SQL - Data Definition and Data Types - Specifying constraints - Schema change statements - Basic queries Aggregate functions and grouping - Insert, Delete and Update statements - Assertions and Triggers - Views Database Design - Informal Design Guidelines for Relation Schemas - Functional Dependencies - Normal Forms Based on Primary Keys (Up to BCNF) - Properties of Relational Decompositions - Algorithms for Relational Database Schema Design - The Database Design and Implementation Process - Use of UML Diagrams in database design. Module III (12 hours) Disk Storage, Basic File Structures, and Hashing - Secondary Storage Devices Placing File Records on Disk Operations on Files - Heap Files - Sorted Files - Hashing Techniques - Parallelizing Disk Access Using RAID Technology - New Storage Systems Indexing Structures for Files - Types of Single-Level Ordered Indexes - Multilevel Indexes - Dynamic Multilevel Indexes Using B-Trees and B+ Trees - Indexes on Multiple Keys

Transaction Management - Transaction and System Concepts ACID Properties - Schedules - Characterizing Schedules Based on Recoverability and Serializability - Transaction Support in SQL Concurrency Control Techniques - Locking Techniques - Timestamp Ordering - Multiversion Concurrency Control - Optimistic Concurrency Control - Using Locks for Concurrency Control in Indexes Database Recovery Techniques - Recovery Concepts - Recovery Techniques Based on Deferred and Immediate Updates - Shadow Paging - Recovery in Multidatabase Systems - Backup and Recovery from Catastrophic Failures. Text books 1. R. Elmasri and S. B. Navathe: Fundamentals of Database Systems, 5th Edition, Addison-Wesley, 2007
Reference books 1. A. Silberschatz, H. F. Korth and S. Sudarshan: Database System Concepts, 5/E, Mc-Graw Hill, 2006. 2. Database systems, a practical approach to design implementation and management Thomas Connolly and Carolyn Begg, Pearson Education, 3. Raghu Ramakrishnan and Johannes Gehrke: Database Management Systems, McGraw-Hill 4.C.J. Date, A. Kannan, S. Swamynatham: An Introduction to Database Systems, Pearson education 5. Jeffrey D Ullman: Principles of Database Systems, Galgotia Publications
2K6 CS 604: COMPILER DESIGN
3 hours lecture and 1 hour tutorial per week Module 1 (12Hrs) Introduction to compilers:-Phases of a compiler-Analysis and synthesis phases-Lexical analysis and its roleReview of finite automation and Regular Expressions-Specification of tokens using regular expressionsImplementing lexical analyzer using finite automation-Design of lexical analyzer using LEX Module 2 (14 Hrs) Syntax analyzer-Role of syntax analyzer-Review of context free grammar-derivation and parse trees-Basic parsing approaches-Top down parsing-Recursive Descent parsing LL(1) parsing-Bottom up parsing-Shift reduce parsingOperator precedence parsing-LR parsing-Simple LR, Canonical LR and LALR parsers- Design of syntax analyzer using YACC Module 3 (15 Hrs) Semantic analysis-Need for semantic analysis-Syntax directed definitions-S attributed definitions- L- attributed definitions-Translation schemes-Type system and Type checking-Design of a simple type checker Storage Management:-Memory allocation strategies (static, stack and heap allocations)-Memory allocation in block structured languages-Accessing local and non local data-Array allocation and access-Procedure callsParameter passing methods-Runtime stack and storage management Synthesis phase:-Intermediate Code Generation (ICG)-Need for ICG-IC Formats-3 Address code-Triples and quadruples Module 4(14 Hrs) Code optimization:-Need for code optimizer-Basic blocks and program flow graph-Machne dependent and machine independent optimizations-Optimization transformations-Local and global optimizations Code GenerationBasic issues in code generation-Data descriptors-Expression trees-Generating target code from expression treesSymbol table handling-Symbol table requirements and organization. Error handling-Types of errors-Compile time errors and recovery-Runtime errors-Runtime Error Handling Text books 1.Aho A Ravi Sethi and J D Ullman, Compilers Principles Techniques and Tools,Addison Wesley

Reference books 1. Kenneth C Louden, Compiler Construction Principles and Practice, Cenage Learning Indian Edition 2.D M Dhamdhare, System programming and operating system,TMH 3.Tremblay and Sorenson,The theory and practice of Compiler writing,TMH 3Allen T Hollub , Compiler design in C ,PHI Sessional work assessment Assignments 2x10 = tests 2x15 = 30 Total marks = 50 University examination pattern Q I - 8 short answer type questions of 5 marks, 2 from each module Q II - 2 questions A and B of 15 marks from module I with choice to answer any one Q III - 2 questions A and B of 15 marks from module II with choice to answer any one Q IV - 2 questions A and B of 15 marks from module III with choice to answer any one Q V - 2 questions A and B of 15 marks from module IV with choice to answer any
2K6 CS 605: DATA COMMUNICATION & COMPUTER NETWORKS
Components Direction of Data flow networks Components and Categories types of Connections Topologies Protocols and Standards ISO / OSI model Transmission Media Line Coding Modems RS232 Interfacing sequences-Modulation-Multiplexing-TDM FDM WDM OFDM
Data link layer services - Error detection and correction Parity LRC CRC Hamming code.HDLC. - Multiple Access Protocols - Link Layer addressing - Hub and Switches -PPP. LAN - Ethernet IEEE 802.3 - IEEE 802.4 IEEE 802.5 - FDDI - SONET Bridges. Module III (13 hours) Network layer: Introduction - Virtual circuit and datagram networks - Router - Internet Protocol -Forwarding and addressing in the Internet - Routing Algorithms -LS -DV -Hierarchial routing -Routing in the Internet -Broadcast and Multicast routing.
Transport layer : Introduction and services-multiplexing and demultiplexing -Connectionless transport UDP Principles of Reliable data transfer - Connection oriented transport TCP - Principles of Congestion Control - TCP congestion control. Application Layer -Principles -HTTP FTP -SMTP -DNS. Text books 1. Behrouz A. Forouzan, Data communication and Networking, Tata McGraw-Hill, 2004. 2. Kurose and Ross, "Computer Networking", Third Edition,Pearson
Reference books 1. Crowley C.,Operating Systems - A Design Oriented Approach, TMH 2. Tanenbaum A S, Computer Networks, PHI 3. William Stallings, Data and Computer Communication, Pearson EducationI
2K6 CS 606 (A): DISTRIBUTED COMPUTING

Module I (16 hours)

Characterization of Distributed Systems: Introduction, Examples of distributed Systems,Issues in Distributes Operating Systems, Resource sharing and the Web Challenges. System Models: Architectural models, Fundamental Models Theoretical Foundation for Distributed System: Limitation of Distributed system, absence of global clock, shared memory, Logical clocks, Lamports & vectors logical clocks, Causal ordering of messages, global state, termination detection. Distributed Mutual Exclusion: Classification of distributed mutual exclusion, requirement of mutual exclusion theorem, Token based and non token based algorithms, performance metric for distributed mutual exclusion algorithms.

Module II (14 hours)

Distributed Deadlock Detection: system model, resource Vs communication deadlocks, deadlock prevention, avoidance, detection & resolution, centralized dead lock detection, distributed dead lock detection, path pushing algorithms, edge chasing algorithms. Agreement Protocols: Introduction, System models, classification of Agreement Problem-Interactive consistency Problem, Applications of Agreement algorithms.
Distributed Objects and Remote Invocation: Communication between distributed objects, Remote procedure call, Events and notifications, Java RMI case study. Transactions and Concurrency Control: Transactions, Nested transactions, Locks, Optimistic Concurrency control, Timestamp ordering, Comparison of methods for concurrency control
Distributed Transactions: Introduction, Flat and nested distributed transactions, Atomic commit protocols, concurrency control in distributed transactions, Distributed deadlocks, Transaction recovery. Distributed shared memory Design and Implementation issues, consistency models.CORBA Case Study: CORBA RMI, CORBA services. Text books 1. Mukesh Singhal And Niranjan G Shivaratri, "Advanced Concept in Operating Systems",Tata McGraw Hill. 2. Coulouris, Dollimore, Kindberg: "Distributed System: Concepts and Design, Pearson Education Reference books 1. 2. Tanenbaum S , Distributed Operating Systems,Pearson Education. P K Sinha, "Distributed System: Concepts and Design, PHI
Sessional work assessment Assignments 2x10 = tests 2x15 = 30 Total marks = 50 University examination pattern Q I - 8 short answer type questions of 5 marks, 2 from each module Q II - 2 questions A and B of 15 marks from module I with choice to answer any one Q III - 2 questions A and B of 15 marks from module II with choice to answer any one Q IV - 2 questions A and B of 15 marks from module III with choice to answer any one Q V - 2 questions A and B of 15 marks from module IV with choice to answer any one
2K6 CS 606 (B) BIOINFORMATICS
The Central Dogma Killer Application Parallel Universes Watsons Definition Top Down Vs Bottom Up Approach Information Flow Conversance Communications.
Definition Data Management Data Life Cycle Database Technology Interfaces Implementation Networks: Communication Models Transmission Technology Protocols Bandwidth Topology Contents Security Ownership Implementation. Search Process Technologies Searching And Information Theory Computational Methods Knowledge Management Sequence Visualizations Structure Visualizations User Interfaces Animation Vs Simulation Module III (16 hours) Statistical Concepts Micro Arrays Imperfect Data Basics Quantifying Randomness Data Analysis Tools Selection Alignment Clustering Classification Data Mining Methods Technology Infrastructure Pattern Recognition Discovery Machine Learning Text Mining Pattern Matching Fundamentals Dot Matrix Analysis Substitution Matrix Dynamic Programming Word Method Bayesian Method Multiple Sequence Alignment Tools.

Module IV (10 hours)

Drug Discovery Fundamentals Protein Structure System Biology Tools Collaboration And Communication Standards Issues Case Study.
Reference books 1. Bryan Bergeron, Bio Informatics Computing , Prentice Hall, 2003. 2. T.K. Affward, D.J. Parry Smith, Introduction To Bio Informatics, Pearson Education, 2001. 3. Pierre Baldi, Soren Brunak, Bio Informatics The Machine Learning Approach, 2nd Edition, First East West Press, 2003 Sessional work assessment Assignments 2 tests Total marks 2x10 = 20 2x15 = 30 = 50
2K6 CS 606(C): SOFTWARE PROJECT MANAGEMENT
Introduction - Importance of software project management, Problems with Software Projects Stages of Project The Feasibility Study, Planning, Project Execution, Project and Product Life Cycles , The Stakeholder of Project , The Role of Project Manager, Project Management Framework , Software Tools for Project Management Project Planning- Integration Management, Project Plan Development, Plan Execution, Scope Management, Methods for Selecting Projects , Project Charter, Scope Statement, Work Breakdown Structure, Main Steps in Project Planning , Use of Software to Assist in Project Planning Activities
Project Scheduling : Time Management- Importance of Project Schedules, Schedules and Activities , Sequencing and Scheduling Activity Project Network Diagrams- Network Planning Models , Duration Estimating and Schedule Development, Critical Path Analysis, Program Evaluation and Review Technique (PERT) Use of Software to Assist in Project Scheduling Project Cost Management-Importance and Principles of Project Cost Management, Resource Planning , Cost Estimating- Types of Cost Estimates, Expert Judgment , Estimating by Analogy , COCOMO Model, Cost Budgeting, Cost Control , Use of Software to assist in Cost Management. Module III (12 hours) Project Quality Management- Quality of Information Technology Projects, Stages of Software Quality Management, Quality Planning , Quality Assurance , Quality Control Quality Standards- Tools and Techniques For Quality Control Project Human Resources Management- Keys to Managing People , Organizational Planning- Issues in Project Staff Acquisition and Team Development , Project Communication Management - Communications Planning, Information Distribution, Performance Reporting,.
Project Risk Management - The Importance of Project Risk Management, Common Sources of Risk in IT projects, Risk Identification, Risk Quantification, Risk Response Development and Control Project Procurement Management- Importance of Project Procurement Management, Procurement Planning, Solicitation, Source Selection, Contract Administration, Contract Close-out, Project Management Process GroupsIntroduction to Project Management Process Groups Project Initiation, Project Planning, Project Executing, Project Controlling and Configuration Management , Project Closing.

Reference books 1. Ifechor-, Digital signal processing, Pearson edn.
2. Oppenhiem ,Desecrate time signal processing , Pearson edn. 3. Oppenhiem and Sheffer ,Digital signal processing , PHI 4. Johny R Johnson ,Introduction to Digital signal processing 5. Proakis and Manolakis, Digital signal processing 6. P Ramesh Babu ,Digital signal processing:,Scitech Publications.
2K6 CS 606 (E) ENTERPRENEURSHIP
Module I (20 hours) Entrepreneurial perspectives - understanding of entrepreneurship process - entrepreneurial decision process - entrepreneurship and economic development - characteristics of entrepreneur - Entrepreneurial competencies - managerial functions for enterprise Module II (10 hours) Process of business opportunity identification and evaluation - industrial policy- environment market survey and market assessment - project report preparation study of feasibility and Viability of a project - assessment of risk in the industry
Process and strategies for starting a venture - stages of small business growth entrepreneurship in -international environment - entrepreneurship achievement - motivation - time management creativity and innovation - structure of the enterprise - planning, implementation and growth Module IV (10 hours) Technology acquisition for small units - formalities to be completed for setting up a small scale unit - forms of organizations for small scale units - financing of project and working capitalventure capital and other equity assistance available - break even analysis and economic ratios technology transfer and business incubation Reference books 1. Harold Koontz and Heinz Weihrich: Essentials of Management, TMH International
2. Robert D Hirich and Michael Peters: Enterpreneurship, Mc Graw Hill 3. Rao T., Deshpande M. V, P. Mehta, M. S. Nadakami: Developing Enterpreneurship, a Handbook Learning System 4. D. Kurado and R M. Hodgelts: Enterpreneurship, a Contemporary Approach, The Dryden Press 5. Dr. Patel V. G.: Seven Business Crisis, TMH 6. Rao C. R.: Finance for Small Scale Industries
2K6 CS 606 (F) ADVANCED MATHEMATICS
3 hours lecture and 1 hour tutorial per week Module I : (10 hours) Linear Programming I : Systems of linear equations and inequalities Convex sets Convex functions Formulations of linear Programming problems Theory of simplex methods simplex algorithm Charnes Mmethod Two phase method Duality in linear programming dual simplex method. Module II: (10 hours) Linear Programming II : Sensitivity analysis Parametric Programming Bounded variable problems Transportation problems Development of the method Integrality property Degeneracy Unbalanced problems Assignment problem Development of the Hungarian method Routing problems. Module III: (10 hours) Nonlinear Programming : Mathematical preliminaries of non-linear programming Gradient and Hessian Unimodal functions Convex and Concave functions Role of convexity Unconstrained optimization Fibnonacci search Golden section search Optimal gradient method Classical optimization Langrange multiplier method Kuhn-Tucker conditions Quadratic programming Separable convex programming. Module IV: (9 hours) Dynamic Programming & Game Theory : Nature of Dynamic programming problem Bellmans optimality principle Cargo loading problem Replacement problems Multistage production planning and allocation problems Rectangular games Two person zero sum games Pure and mixed strategies 2 x m and m x 2 games Relation between theory of games and linear programming. Text books and References 1. Bazarra M. S., Jarvis J. J. & Sherall H. D., Linear Programming and Network Problems John Wiley. 2. Bazarra M. S., Sherall H. D & Shetty C. M., Nonlinear Programming Theory and Algorithms John Wiley. 3. Hadley G. Linear Programming Narosa. 4. Hillier. F. S. & Liebermann G. J. Introduction to Operations Research Mc Graw Hill. 5. Taha H.A. Operation Research, An Introduction PHI.

University examination pattern Q I - 8 short answer type questions of 5 marks, 2 from each module Q II - 2 questions of 15marks from module I with choice to answer any one Q III - 2 questions of 15marks from module II with choice to answer any one Q IV - 2 questions of 15marks from module III with choice to answer any one Q V - 2 questions of 15marks from module IV with choice to answer any one
2K6 CS 607(P) NETWORKS & DBMS LAB
3 hours practical per week 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. Study and configuration of NIC cards. Implementation of client server model using TCP protocol. Implementation of client server model using UDP protocol. Implementation of client server model using Multicast server. Implementation of POP3 protocol. Implementation of SMTP protocol. File transfer-using socket. DNS Tracing the path and find the root/name servers Dynamic Host Configuration Protocol To study about dynamic allocation of IP addresses. Web server installation and configuration. Mail server configuration. Setting up multiple virtual hosts in a single domain. Simulation of Medium access control protocols-Go back N, Selective repeat, sliding window Perform a case study about the different routing algorithms to select the network path with its optimum and economical during data transfer. Shortest path routing Flooding Link State Hierarchical
Database Management Systems
Recommended Software: Mysql /Oracle latest version 1. DDL statements in SQL 2. DML statements in SQL 3. Simple Queries using SELECT command on a given database. 4. Queries (along with sub Queries) using ANY, ALL, IN, EXISTS, NOTEXISTS, UNION, INTERSECT and Constraints. 5. Queries using Aggregate functions (COUNT, SUM, AVG, MAX and MIN), GROUP BY, HAVING 6. Creation and dropping of Views 7. High level language extension with cursors. 8. High level language extension with triggers. 9. Procedures and Functions.

Reference books 1.

Stevens W. Richard, Unix Network Programming, PHI 2. James F. Kurose & Ross, Computer Network, Third Edition, Pearson Education 3. Comer D.E., Internetworking with TCP/IP, Volume 1, II & III, PHI 4. Elmasr, Navathe, Fundamentals of Database Systems, 4/e, Pearson Education 5. Reghu Ramakrishnan, Databse Management Systems, McGrawHill

2K6 CS 608(P): COMPILER LAB
1. Design of a Lexical Analyzer using Finite Automation (including Symbol table)
(The program should be designed for a specific number of keywords, identifiers, numbers, operators, punctuators etc. Finite automata should be designed for each type of token) 2. Design of lexical analyzer using LEX 3. Design of recursive descent and LL (1) parsers (including syntax tree) (The programme should be designed for a subset of PL features (For example Arithmetic expressions with operators +, -, *, /, etc) 4. Implementation of Operator precedence Parsing (including syntax tree) 5. Design of parser for arithmetic expressions using YACC 6. Design of a simple type checker (For eg for the primitive types of C) 7. Generation of IC for arithmetic expressions 8. Simple code optimization strategies (For example Constant folding, Loop invariant elimination, common sub expression elimination etc) 9. Design of a code generator for arithmetic expressions using Expression tree (The program should take a set of IC as the input and produce the target code for some machine such as Intel 8086 Microprocessor) 10. Writing a simple Compiler for a subset of Language features
Reference books 6. Sethi R, Programming languages: Concepts & Constructs , Addison wesley 7. Scott M L, Programming language Pragmatics, Morgan Kaufman
Laboratory practical and record Test Total = 35 = 15 = 50

SEMESTER VI 601 Digital Signal Processing Module I Introduction to discrete time signals & system - 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 transform - the inverse Z transform - System function. Module II Discrete Fourier Transform & Fast Fourier Transform. Discrete Fourier series - properties discrete fourier transform - properties - block convolution decimation in - time FFT algorithms - decimation in - frequency FFT algorithms - FFT algorithms for N a composite number. Module III FIR Digital Filters Realizations - direct - cascade - lattice forms - hardware implementation - FIR filter design using Fourier series - use of window functions - frequency sampling design. Module IV IIR Digital Filters Realizations - Direct - Cascade - Parallel forms - hardware implementation - Analog filter approximations - Butterworth and chebychev approximations - The method of mapping of differentials - impulse invariant transformation - Bilinear transformation - Matched Z transform technique. Module V 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 - finite register length effects in IIR & FIR filters Limit cycles. Digital signal processing application (Only brief description required) Soft ware implementation of digital filters- Architecture of typical DSP processor. Reference : 1) Oppenheim & Ronald W Schafer, Digital Signal Processing, Prentice Hall India 2).Andreas Antoniou , Digital Filters Analysis & Design, Prentice Hall India 3) R Rabiner & B. Gold , Theory & Application of Digital Signal processing, Prentice Hall India 4) Andreas Antoniou , Digital Signal Processing, Prentice Hall India
5) John G Proakis & Dimitris G Manolakis ,Digital Signal Processing , Prentice Hall India 6) Sanjit K.Mithra , , Digital Signal Processing, Tata Mc Graw Hill. 7) Douglas K.Lindner, Introduction to signals &Systems Mc Graw Hill.
CS/IT 602 OPERATING SYSTEMS Module I Introduction to Operating Systems. Extended Machine - Operating System Structure. 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 - Multiprogramming with fixed partitions. Swapping - multiprogramming with 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. Design issues for paging systems - Working set model. Example systems. 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. Module IV Deadlock - conditions for deadlock - deadlock modelling. Deadlock detection and recovery. Deadlock avoidance - resource trajectories - safe and unsafe states - bankers algorithm. Deadlock prevention. Two phase locking non-resource deadlocks - starvation. Module V Introduction to distributed operating systems - distributed systems - design issues. Client server model. Remote procedure call. Synchronisation in distributed systems - clock synchronisation - concurrency control - Deadlocks in distributed systems. Process management - threads - system models - processor allocation algorithms - distributed file systems. Case Study UNIX / LINUX operating system Text Book 1) Andrew S. Tanenbaum, Modern Operating Systems, Prentice Hall, 1991 Reference: 1) Bach, M.J., Design of UNIX Operating System, Prentice Hall 2) Charles Crowley, Operating systems A Design Oriented Approach, Tata McGrawhill, 1997 3) D.M.Dhamdhere, System Programming and Operating Systems, Tata McGraw-Hill,1996 4) Deital, H.M., Operating Systems, Addison Wesley, 1992 5) Garry Nutt, Operating Systems A Modern perspective , Second Edition, Addison Wesley, 2000 6) Pradeep K.Sinha, Distributed Operating Systems, Tata McGrahill, 1998 7) Silberschatz et.al., Operating System Concepts, Addison Wesley, 1993 8) William Stallings, Operating systems, Prentice Hall, 1997 9) Michael Palmer, Guide to Operating System, Thomson
CS 603 COMPUTER GRAPHICS Module I Overview of Graphics systems. Video display devices - Raster scan systems - Random Scan systems input devices. Hardcopy devices - Graphic Software. Output primitives points and lines. Line drawing algorithms - circle generating algorithms - polygon filling algorithms Filling arcs pttern filling Output attributes - Bundled attributes. Antialiasing. Graphical user interface - Logical classification of input devices. Module II Two dimensional transformations. basic transformations - translation - rotation - scaling. Matrix representation and homogeneous cordinates - composite transformations. Transformation between cordinate systems - Affine transformations. Two dimensional viewing - viewing pipeline - Windows to viewport transformations - clipping operations point clipping - line clipping - polygon clipping. Module III 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. View volumes. Three dimensional clipping - Hardware implementation. Modula IV 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 - Ray casting. Module V Shading. Illumination models - light sources. Basic Illumination models. Polygon rendering - constant intensity - Goraud shading - Phong shading. Ray tracing. Texture mapping. Color models. Introduction to Animation. Raster animation animation languages- Key frame systems - Morphing - Motion specifications. Introduction to Virtual reality - Virtual Reality Modellling Language(VRML). 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

CS 604 MICROPROCESSOR SYSTEM DESIGN Module I Architecture 16 bit microprocessors : Intel 8086 Archetecture- Memory address space and data organization - Segment registers and memory segmentation - I/O address space - Addressing modes Comparison of 8086 and 8088 - Basic 8086/8088 configuration - Minimum mode - Maximum mode System timing. Bus interface. Interrupts and interrupt priority management. Intel 80286 ArchetectureComparison with 8086 processor. Module II Architecture of 32 bit Microprocessors : Intel 80386 Architecture Special 80386 Registers- Memory management -interrupts and exceptions - management of tasks - Real, protected and virtual 8086 modeIntroduction to 80486 microprocessor Architecture Comparison with 80386 processor. Module III Advanced Microprocessors: Introduction to Pentium and Pentium pro architectures: RISC conceptsBUS operation- Super scalar architecture- Pipelining-Branch prediction-Instruction and data cachesFPU- Comparison of Pentium and Pentium pro architecture. Introduction to Pentium II, Pentium III and Pentium IV processors Introduction to Intel and AMD 64 bit architectures. RISC Archetecture : Definition of RISC Properties of RISC Systems Practices in RISC Systems Register windowing Advantages and shortcomings Comparison with CISC architecture. Module IV Intel 80x86 Programming: 80x86 Instruction set , Assembly level programming with DEBUG and MASM
MS-DOS Functions andBIOS Calls - programming examples using 80x86.
Module V Introduction IBM PC Architecture , Peripherals & Interface Buses: Motherboard- Chip sets - graphic adapters and monitors-drive controllers - floppy and hard disk drives- IDE and SCSI - streamers and other drives -parallel interfaces and printers - serial interfaces 16550 UART CMOS RAM and real time clock- keyboard and mouse- the power supply (SMPS) - BIOS and Boot Process Bus Systems: PC/XT and AT Buses Microchannel and ISA Local Buses: VESA and PCI- I/O Buses: SCSI and USB References : 1) Barry B. Brey , The Intel Microprocessors 8086 to Pentum 4- Archetecture Programming and Interfaceing, 6/e Pearson Education ,2003. 2) James L. Antonacos , An Introduction to Intel Family of Microprocessors , 3/e Pearson Education, 2002. 3) John Uffenbeck , The 80x86 Family Design Programming and Interfacing, 3/e Pearson Education, 2002 4) YU-Cheng Liu & Glenn A Gibson, Microprocessor System , Architecture Programming & Design, Pentice Hall of India. 5) Douglas V Hall, Microprocessors & Interfacing, Tata McGrahill, 1998 6) Intel Users manual for 8086, 80386 & 80486, Pentium processors 7) H. P. Messmer, The Indispensable PC Hardware Book, 3/e, Addison Wesley, 1997 8) S. J. Bigelow, Troubleshooting, M aintaining, and Repairing PCs, 2/e, Tata McGraw Hill, New Delhi, 1999 9) Ytha Yu and Charles Marut , Assembly Language Programming and Organisation of IBM PC, International Edition , McGrawhill Inc, 1992 10) K. Miller, An Assembly Language Introduction to Computer Architecture using the Intel Pentium, Oxford University Press, 1999.

CS/ EB/EC/EI 605 CONTROL SYSTEM ENGINEERING
Module I Basic idea of control systems and their classification - differential equations of systems - linear approximation - Laplace transform and transfer function of linear system - Model of physical system (Electrical, mechanical and electromechanical)- block diagram - signal flow graph - Masons gain formula. Module II Time domain analysis - Representation of deterministic signals - First order system response - Splane root location and transient response - impulse and step response of second order systems performance - characteristics in the time domain - effects of derivative and integral control - steady state response - error constant - generalised definition of error coefficients - concepts of stability Routh - Hurwitz criterion. Module III Frequency domain analysis - frequency response - Bode plot, Polar plot, Nicol's chart - closed loop frequency response and frequency domain performance characteristics. Stability in frequency domain. Nyquist criterion. Module IV 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. Module VI State variable methods :- introduction to state variable concepts - state variable description of linear dynamic systems - representation in matrix forms - block diagram and signal flow graph representation of state equations - Transfer matrix from state equations - transition matrix - general solution for linear time invariant state equations. Control system components - Error detectors , : servomotor, tachogenerator, servo amplifier, magnetic amplifier, rotating amplifier - Basic principles of adaptive control systems. References: 1) Ogata K, Modern Control Engineering, Prentice Hall/Pearson 2) Dorf Morden Communication Systems ,Pearson Education 3) Franklin Feed back Control Systems, Pearson Education 4) Kuo B. C , Automatic Control System, Prentice Hall 5) Nagoor Kani :Control Systems, R B P 6) Ogata Discrete Time Control Systems ,Pearson Education 7) Nagarath & Gopal, Control System Engineering, Wiley Eastern 8) Control Engineerng Ramkayan Vikas Pub 9) Control Theory M N Bandyopadhyaya ,PHI 10) Control Theory Glad , Vikas Thomson Pub
CS 606 SYSTEM 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 5) Barry B. Brey , The Intel Microprocessors 8086 to Pentium 4- Archetecture Programming and Interfaceing, 6/e Pearson Education ,2003