You are on page 1of 26

KANNUR UNIVERSITY

FACULTY OF ENGINEERING

Curricula, Scheme of Examinations & Syllabus for
Semesters V & VI of B.Tech. Degree Programme in
Computer Science & Engineering
with effect from 2007 Admissions

FIFTH SEMESTER

Code Subject Hours/Week Sessional University
Marks Examination
L T P/D Hrs Marks
2K6 CS 501 Engineering Mathematics IV 3 1 - 50 3 100
2K6 CS 502 Economics & Business 3 1 - 50 3 100
Management
2K6 CS 503 Theoretical foundation of 3 1 - 50 3 100
Computation
2K6 CS 504 Programming Language 3 1 - 50 3 100
Concepts
2K6 CS 505 Operating Systems 3 1 - 50 3 100
2K6 CS 506 Software Engineering 3 1 - 50 3 100
2K6 CS 507(P) Programming Environment Lab - - 3 50 3 100
2K6 CS 508(P) Systems Lab - - 3 50 3 100
TOTAL 18 6 6 400 - 800

SIXTH SEMESTER

Code Subject Hours/Week Sessional University
Marks Examination
L T P/D Hrs Marks
2K6 CS 601 Environmental Engg: & 3 1 - 50 3 100
Disaster Management
2K6 CS 602 Graph Theory & 3 1 - 50 3 100
Combinatorics
2K6 CS 603 Data Base Management 3 1 - 50 3 100
Systems
2K6 CS 604 Compiler Design 3 1 - 50 3 100
2K6 CS 605 Data Communication & 3 1 - 50 3 100
Computer Networks
2K6 CS 606 Elective - I 3 1 - 50 3 100
2K6 CS 607(P) Networks & DBMS Lab - - 3 50 3 100
2K6 CS 608(P) Compiler Lab - - 3 50 3 100
TOTAL 18 6 6 400 - 800

Elective I
2K6 CS 606 (A) – Distributed Computing
2K6 CS 606 (B) - Bioinformatics
2K6 CS 606 (C) – Software Project Management
2K6 CS 606 (D) – Digital Signal Processing
2K6 CS 606 (E) - Entrepreneurship
2K6 CS 606 (F) – Advanced Mathematics

Khanna Publishers Sessional work assessment Two tests 2 x 15 = 30 Two assignments 2 x 10 = 20 Total marks = 50 University Examination Pattern Q I ..Orthogonality of Bessel functions . P. 3. Beta Distribution. Wylie C R & Barrett L. Text book Johnson RA. John Wiley. Q III . Grewal B.2 questions of 15 marks each from module I with choice to answer any one.Geometric Distribution- Uniform Distribution.2 questions of 15 marks each from module III with choice to answer any one.Legendre’s equation – series solution of Legendre’s differential equation -Rodrigues formula-Legendre Polynomials – Generating function for Pn(x). Module III (Series solutions of differential equations (13hours) Power series method of solving ordinary differential equations .Fourier Cosine transform-Fourier Sine Transform.Matrix associated with a quadratic form . 2 from each module. Q IV .Technique of Diagonalization using row and column transformations on the matrix . Miller & Freund’s Probability and Statistics for Engineers. Prentice Hall of India (For Module I and II only) Reference Books 1. Laxmi Publications 4.Definite..their identification using the Eigen values of the matrix of the quadratic form. & Manish Goyal. Fourier Transform-Properties of Fourier Transforms-Linearity property-Change of scale property-shifting properties –Modulation property-Transform of the Derivative-simple problems. Gamma distribution. Mc Graw Hill 2.2 questions of 15 marks each from module II with choice to answer any one. C.series solution of Bessel's equation – Recurrence formula for Jn(x)-expansions for J0 and J1 – value of J1/2.Chi square test as test of goodness of fit. Q II . Kreyszig E.8 short answer type questions of 5 marks. Module II Statistical inference (13hours) Population and Sample-Sampling Distributions of Mean and Variance-Point Estimation-Interval Estimation -Null Hypotheses and Significance tests-Hypotheses concerning one mean. Exponential Distribution and Hyper-Geometric Distributions. Advanced Engineering Mathematics. Higher Engineering Mathematics.binomial distribution –Poisson distribution-normal distribution –Mean.Chebyshev’s theorem. A Text book of Engineering Mathematics.generating function for Jn(x).Confidence Intervals of mean and variance - Estimation of Variances-Hypotheses concerning one variance-Hypotheses concerning two variance. Q V . Bali N. 2K6 CS 501 ENGINEERING MATHEMATICS IV 3 hours lecture and 1 hour tutorial per week Module I Probability distributions (13 hours) Random variables-Probability distributions .2 questions of 15 marks each from module IV with choice to answer any one. variance and Moment generating function -Poisson process . Advanced Engineering Mathematics. S. . Semidefinite and Indefinite forms .Recurrence formulae for Pn(x) -Orthogonality of Legendre polynomials Module IV Quadratic forms and Fourier Transforms (13 hours) Quadratic forms .

R & Sharma S.K. Benga T.properties of isoquants -law of variable proportions.demand – law of demand- elasticity of demand. 4.K& Verma J.R . S Chand & Co. managerial Economics Prentice-Hall of India Pvt Ltd.L & Maheshwari K. 2K6 CS 502 ECONOMICS & BUSINESS MANAGEMENT 3 hours lecture and 1 hour tutorial per week Module I (12 hours) Definition of economics-nature and scope f economic science-nature and scope of managerial economics-central problems of an economy-scarcity and choice-opportunity cost-objectives of business firms-forms of business- proprietorship-partnership-joint stock company-co-operative organization-state enterprise Module II (14hours) Consumption – wants –characteristics of wants. Khanna Publishers 6.N. Barthwal A.Industrial Economics.returns to scale-isocost line-least cost combination of factors-expansion path-technical and economical efficiency-linear programming –graphical method- economics of large scale production.D.L . S Chand & Co. Q V .8 short answer type questions of 5 marks. Q IV .Ltd. Q III .2 questions A and B of 15 marks from module I with choice to answer any one. Managerial Economics.supply – law of supply. Ltd 7.elasticity of supply Module III (14hours) Production – factors of production – features of production – features of factors of production. Text books and References 1 Varshney R.C. Module IV (12hours) Market structures and price determination – perfect competition-monopoly -monopolistic competition-oligopoly- kinked demand curve-money and banking-nature and functions of money-money market and capital market- commercial banks –functions-central banking functions-methods of credit control. Dewett .2 questions A and B of 15 marks from module III with choice to answer any one. Ahuja H.division of labour – production function.2 questions A and B of 15 marks from module II with choice to answer any one. Sessional work assessment Two tests 2 x 15 = 30 Two assignments 2 x 10 = 20 Total = 50 University examination pattern Q I . Vrinda Publications Pvt. Modern Microeconomics. Managerial economics. Industrial Organization and Engineering Economics . 2 Dwiivedi D. 10.K. Macro Economic theory . Modern Economic theory. Vikas Publishing House Pvt Ltd 3.Elementary Economic Theory . 9. Koutsoyiannis A .. Q II . S Chand & Co. Joel Dean. 8.law of diminishing marginal utility..types of elasticity-factors determining elasticity-measurement.its significance in business- demand forecasting-methods of demand forecasting.L Modern Micro Economics –Theory and Applications . Dewett K. 2 from each module. New Age International Publishers 5.2 questions A and B of 15 marks from module IV with choice to answer any one . Jhingan M. S Chand & company Ltd. Macmillan Press Ltd. Ltd.L.Cobb-Douglas production function-production possibility curve-isoquants-marginal rate of technical substitution. Ltd.

Two-way finite automata. Narosa Sessional work assessment Assignments 2x10 = 20 2 tests 2x15 = 30 Total marks = 50 University examination pattern Q I .- universal Turing Machines-Equivalence of the various variants with the basic model.-Computing a partial function with Turing machine- Variants of TMs –Multitape TMs. subroutines.8 short answer type questions of 5 marks. Strings and Languages. CENAGE LEARNING Indian Edition 3.2 questions A and B of 15 marks from module III with choice to answer any one Q V . -Regular grammars and FA -Proving languages to be non-regular -Pumping Lenma – Applications.Models of computation and Church-Turing Thesis. Nondeterministic TMs. alphabets. DPDAs and Regular Languages. Finite automata with output.Ambiguity in grammars and Languages-Applications of CFG- Pushdown Automata (PDA) -Equivalence of PDAs and CFGs -DPDAs -Definition. etc. multistack machines. -TMs with semi-infinite tapes. John C Martin : Introduction to Languages and the Theory of Computation(3 rd Edition) . applications of REs. Module IV (13 hours) Computability – Closure properties of recursive and recursively enumerable language. Module III (13 hours) Turing Machines -Formal definition and behavior . multiple tracks. Module II (13 hours) Context-free Grammars (CFG) -Parse tree . Closure properties of Regular languages -Closure under Boolean operations. algebraic laws for RE. 2K6 CS 503: THEORETICAL FOUNDATION OF COMPUTATION 3 hours lecture and 1 hour tutorial per week Module I (14 hours) Introduction.Decision properties of CFL. 2 from each module Q II .2 questions A and B of 15 marks from module IV with choice to answer any one 2K6 CS 504: PROGRAMMING LANGUAGE CONCEPTS . –Myhill-Nerode theorem-DFA Minimization - Decision properties of Regular languages . TMH Reference books 1.Closure properties of CFLs .TM as a computer of integer functions -Programming techniques for TMs -Storage in state. J E Hopcroft And J D Ullman : Introduction to Automata Theory and Computation. H R Lewis and C H Papadimitriou : Elemnts of Theory of Computation 2.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. homomorphism.2 questions A and B of 15 marks from module I with choice to answer any one Q III . etc. Undecidability. FA to RE. inverse homomorphism. reversal. Addison Wesley 2. Linz P : An Introduction to Formal Languages and Automata.-DPDA and Ambiguous grammars--CYK algorithm -Simplification of CFGs -Normal forms -CNF and GNF --Pumping lemma for CFLs. RE to FA.2 questions A and B of 15 marks from module II with choice to answer any one Q IV . Text books 1. Automata and Grammars -Finite automata (FA) -DFA-NFA – Finite Automata with epsilon-transitions-Equivalence of DFAs and NFAs -Regular expressions (RE) -Definition. Sipser : Introduction to theory of Computation.

3 hours lecture and 1 hour tutorial per week Module I (12 hours) Preliminaries – Reasons for studying concept of programming languages.attribute grammars.Dynamic semantics-Names.Concurrency – Subprogram level concurrency-monitors-message passing-threads-statement level concurrency.Implementation of object oriented constructs.subprograms-Design issues – parameter passing methods-over loaded subprograms-Implementing subprograms-blocks-implementing dynamic scope Module III (12 hours) Concept of Abstraction-Data abstraction-design issues-encapsulation constructs-Object oriented programming- Design issues-support for object oriented programming in C++.2 questions A and B of 15 marks from module II with choice to answer any one Q IV . ML-Application of functional languages.2 questions A and B of 15 marks from module III with choice to answer any one Q V . Addison Wesley 2. variables-concept of binding-type checking- strong typing-type compatibility-Scope and lifetime-referencing environments-Named constants.2 questions A and B of 15 marks from module I with choice to answer any one Q III . Morgan Kaufman Sessional work assessment Assignments 2x10 = 20 2 tests 2x15 = 30 Total marks = 50 University examination pattern Q I . Programming languages: Concepts & Constructs . Scott M L.Exception handling in JAVA & C++ -event handling with JAVA. Module IV (12 hours) Functional programming languages – Mathematical functions – fundamentals of functional programming languages.Comparison of functional & Imperative languages – Logic programming languages – Introduction to predicate calculus-Overview of logic programming-origins of prolog-basic elements of prolog Applications of logic programming Text books 4.8 short answer type questions of 5 marks. Sethi R. 2 from each module Q II .Introduction to COMMON LISP.2 questions A and B of 15 marks from module IV with choice to answer any one . Programming language Pragmatics.JAVA.C# etc. Robert W Sebesta.Programming Domains-Language evaluation criteria. Concepts of programming Languages (7 edn) – Pearson Education Reference books 1.influence on language design-language categories-Implementation methods-Programming environments – Evolution of programming languages. 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 conversions- relational and Boolean expressions-short circuit evaluation-assignment statements-mixed mode assignment- statement level control structures-selection and iterative statements.unconditional branching and guarded commands.Describing Syntax and semantics-Formal methods of describing syntax.

Pearson education 6.critical section.Operating system organization – Basic functions-Implementation considerations-Computer organization-bootstrapping the machine-Mobile computers. S.concept of Linux process & thread descriptors-Process scheduler organization- different scheduling strategies(non preemptive & preemptive). Modern Operating Systems.semaphore & its implementation – classical synchronization problems and its solutions (Producer-consumer. Addison Wesley 4. readers-writers. real time.2 questions A and B of 15 marks from module IV with choice to answer any one .Process synchronization. Gary Nutt. Gary Nutt. Buffering. authorization and cryptography. DMA ). Text books 5. Module IV (12 hours) File Management – Low level files and Structured files. 2K6 CS 505: OPERATING SYSTEMS 3 hours lecture and 1 hour tutorial per week Module I (12 hours) Computers and Software –General System software. Operating system concepts (7 edn).Resource abstraction & Sharing-Operating system strategies (Batch.process state transition diagram- Process manager responsibilities. Interrupt driven I/O. Disk scheduling strategies Module II (15 hours) Process & Threads.2 questions A and B of 15 marks from module II with choice to answer any one Q IV . Siberschatz & Galvin.Operatig Systems (3rd edn). and Sarmistha Neogy.8 short answer type questions of 5 marks. Timesharing. Module III (12 hours) Memory management. Prentice hall.Inter process communication(Pipes. Operating Systems – A Design oriented Approach.Low level file implementation – different approaches to Block management. Reference books 3. Multiprocessors and parallel computers.Kerberos authentication. TMH 5.Acess matrix-Access control list – Capability list – Concept of File management in Linux and Windows NT.Structured sequential file-Indexed sequential file-different directory structures-file systems- Mounting file systems. Pearson Education Sessional work assessment Assignments 2x10 = 20 2 tests 2x15 = 30 Total marks = 50 University examination pattern Q I . dining philosopher). Crowley C.address space abstraction-address binding-memory allocation-Fixed partition & variable partition memory strategies-dynamic address binding-swapping-paging-virtual memory address translation-dynamic paging-static paging algorithms-dynamic paging algorithm-working set algorithm-segmentation-implementation- memory mapped files-concept of memory management in Linux & Windows NT/XP.Deadlock-prevention-avoidance-bankers algorithm-detection-reduced resource allocation graph..General protection model. Operating Systems( Third Edition).Implementing process & Threads – Process address space.2 questions A and B of 15 marks from module III with choice to answer any one Q V . Pearson Education.Protection and Security-security and Policy – Authentication . Nebendu Chaki. embedded etc) – Concept of Multiprogramming.2 questions A and B of 15 marks from module I with choice to answer any one Q III . Tanenbaum A.Device Management-Device controllers & Device drivers – I/O strategies (direct I/O with polling. 2 from each module Q II . message passing etc)-concept of process management in Linux and widows NT.

Risk identification. Object oriented model. CBSE process. “Software Engineering 6th Addition”.2 questions A and B of 15 marks from module I with choice to answer any one Q III . Object-oriented testing.8 short answer type questions of 5 marks.”Narosa Publishing House 2. System engineering process. Quality-Quality control. Unit testing and Integration Testing. Behavioral model Software requirements. Project scheduling.Software Testing Fundamentals. Testing strategies.Project planning process. Component based development. 2K6 CS 506: SOFTWARE ENGINEERING 3 hours lecture and 1 hour tutorial per week Module I (12 hours) Introduction. System testing Testing tactics. Software re-engineering. Rajib Mall Sessional work assessment Assignments 2x10 = 20 2 tests 2x15 = 30 Total marks = 50 University examination pattern Q I . Cost of Quality. Object oriented Design. Component based design.Metrics for process and projects. Decomposition techniques.The software process. pattern based software design Architectural Design-system structuring.2 questions A and B of 15 marks from module II with choice to answer any one Q IV . Text books 7. “Software Engineering”. Quality assurance. Estimation.Functional and Non-functional requirements- SRS. Clean room engineering process Module IV (14 hours) Project Management. Risk projection.2 questions A and B of 15 marks from module III with choice to answer any one Q V . Tata Mac Graw Hill 8. Validation testing. Change Management-Configuration Management. Prototyping model. RMMM Quality management-Product metrics. Software inspection. White box testing. Software process models-Waterfall model. Pressman S. Black box testing. Software scope and feasibility. control models. 2 from each module Q II . Jalot Pankaj. Addition Wesley 2002 Reference books 1.2 questions A and B of 15 marks from module IV with choice to answer any one . Flow oriented model. User Interface Design Module III (13 hours) Software Testing. Sommerville Ian.Testing process. Spiral model.Requirement Engineering Process Module II (13 hours) Design Engineering. software project estimation. Reverse Engineering. Class-based model. RAD model. Aspect-oriented software development System modeling. Risk refinement. modular decomposition. Risk Management. Scenario based model. System models-Data models. Roger.Design concepts. design model. Resources. “An Integrated Approach to S/W Engg.Verification and validation.

Design and implement a multi-threaded program. Addison Wesley 3. Define a base class “Shape” and derived classes for “Rectangle”. Programming language Pragmatics. Kevin Knight. “Square”. Scott M L. Write a program to implement Binary Search Tree (BST) and do the following operations on BST. Implement operator and function overloading. Design and implement a multi-process application Reference books 1. Design and implement a Generic class Functional Programming in LISP/Scheme 1. Concurrent Programming in Java/ Ada 1. Morgan Kaufman 4. 2. Tata McGraw Hill Publishing Company Limited Sessional work assessment Laboratory practical and Record = 35 Test = 15 Total marks = 50 2K6 CS 508(P): SYSTEMS LAB . 4. 3. Elaine Rich. Design and implement an interface. 2K6 CS 507(P): Programming Environment Lab 3 hours practical per week Object-oriented programming in Java/C++ 1. (i) Insertion of an element (ii) Deletion of a n element (iii) Display of BST (iv) Display of Maximum and Minimum elements of BST 4. Write a program to implement Quick Sort on both list of numbers and list of strings. Concepts of programming Languages (7 edn) – Pearson Education 2. 3. Programming languages: Concepts & Constructs. sort them in lexicographic order. Write a program to implement Missionaries and Cannibals problem. 2. “Ellipse” and “Circle” with proper class hierarchy. 2. “Artificial Intelligence”. Robert W Sebesta. Write a program to implement Tower of Hanoi problem for n number of disks. If strings. Sethi R.

Producer-Consumer problem using semaphores 4. 5. by a process. total size etc. Inter-process communication using pipes.Communication. size of each file. user generated interrupts etc. message queues and shared memory 2. FIFO. Simulation of various process scheduling algorithms (Pre-emptive and non pre-emptive) 8. Garry Nutt. Open a directory and display its contents. Simulation of various memory page replacement strategies Reference books 1. Producer-Consumer problem using mutex and condition variables 3. Steve Robbins: UNIX Systems Programming. Kay Robbins. Concurrency and Threads. 6. 3 hours practical per week Operating systems 1. Banker’s algorithm 7. 2. Detection and handling of signals like death of child process. Operating Systems Sessional work assessment Laboratory practical and Record = 35 Test = 15 Total marks = 50 2K6CS 601 ENVIRONMENTAL ENGG: & DISASTER MANAGEMENT 3 hours lecture and 1 hour tutorial per week .

nuclear accidents and holocaust. MODULE III ( 13 HOURS) Environmental Pollution – Definition – causes . ethical. national and local levels –India as a mega-diversity nation – hot spots of biodiversity – threats to biodiversity : habitat loss.Ecological successive food chains . rain water harvesting . overuse and misuse of these resources with appropriate case studies to substantiate – effect on the environment – role of individual in conservation of natural resources – equitable use of resources for sustainable lifestyle. rivers. Solid waste management – causes. man-wildlife conflicts – endangered and endemic species of India – conservation of biodiversity : In-situ and Ex-situ conservation of biodiversity. aesthetic and option values – biodiversity at global. Human population and the environment – Population growth. MODULE II (12 HOURS) Ecosystem – concept – structure and function – producers. ozone layer depletion. Case studies – waste land reclamation – consumerism and waste products. oceans and estuaries) Biodiversity and its conservation – Introduction – definition : genetic species and ecosystem diversity – Biogeographical classification of India – value of biodiversity – consumptive and productive use. types and characteristic features. sanitation and health – Human rights for a clean environment – value education – HIV/AIDS – social concern – Women and Child welfare – role of Information Technology in environment and human health – Case studies. hazards. Disaster Management – Principles of disaster management – nature and extent of disasters – natural disasters . lakes.MODULE I (12 HOURS) Multidisciplinary nature of Environmental studies – Definition – scope and importance – need for public awareness Natural resources – renewable and non-renewable resources – natural resources – forest resources .effects and control measures of : Air Pollution – water Pollution – soil Pollution – marine Pollution – noise Pollution – thermal Pollution – Nuclear hazards . watershed management – resettlement and rehabilitation of people . – preparedness and mitigation measures for various hazards – financing relief expenditure – legal aspects . streams. consumers & decomposers – energy flow in the ecosystem.post disaster relief – voluntary agencies and community participation at various stages of disaster management – rehabilitation programmes.food webs ( all in brief) Ecological pyramids – introduction. risks and vulnerabilities – man-made disasters – chemical. nuclear and fire. case studies – environmental ethics : Issues and possible solutions – climate change. FIELD WORK ( 5 HOURS) • Visit to a local area to document environmental assets – river / forest / grassland / hill / mountain . grassland. MODULE IV ( 10 HOURS) Social Issues and the Environment – From unsustainable to sustainable development – urban problems related to energy – water conservation. desert and acquatic ecosystems ( ponds. effects and control measures of urban and industrial wastes – Role of an individual in preventing Pollution – Environmental Protection Act – Prevention and control of air and water Pollution – Wildlife Protection Act – Forest Conservation Act – Issues involved in Enforcement of Environmental Legislation – Public awareness. structure and function of forest. variations among nations – population explosion – Family welfare programmes – Environment and human health – Pollution hazards. its problems and concerns. global warming. industrial. poaching of wildlife.water resources Mineral resources – food resources – energy resources – Land resources – use. social. acid rain.

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

2 questions A and B of 15 marks from module I with choice to answer any one Q III . 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.PHI 5. “Distance in graphs”.Planar Graphs-Kuratowski's theorem(without proof).2 questions A and B of 15 marks from module III with choice to answer any one Q V .Leserson and Rivest.Corman ."Discrete Mathematics for Computer Scientist and Mathematicians .8 short answer type questions of 5 marks.4 th Edn Pearson education Asia Reference books 1. 2 from each module Q II .Graph coloring and chromatic polynomials Module II (13 hours) Trees-Definitions and properties-examples-Weighted Trees-Dijkstra's shortest path algorithm-Spanning trees - Kruskal and Prim's algorithms.Rose K H '"Discrete Mathematics and its Applications".2 questions A and B of 15 marks from module II with choice to answer any one Q IV .6th Edn McGrawHill 3. Grimaldi R P .PHI 4.Kolman Busby Ross .2 questions A and B of 15 marks from module IV with choice to answer any one 2K6 CS 603: DATABASE MANAGEMENT SYSTEMS .-Rook polynomials Module IV (14 hours) Generating functions-definitions and examples-calculational and techniques. 3 hours lecture and 1 hour tutorial per week Module I (13 hours) Introduction to graphs-definitions and examples-subgraphs-complements-isomorphism-vertex degree-Euler trails and circuits-. Fred Buckley and Frank Harry.2 nd Edn PHI 2."Discrete and Combinatorial Mathematics"."Introduction to Algorithms"."Discrete Mathematical Structures". Joe L Mott Abraham Kandel Theodore P Baker. Addison Wesley Sessional work assessment Assignments 2x10 = 20 2 tests 2x15 = 30 Total marks = 50 University examination pattern Q I .-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.

Attributes and Keys .Hashing Techniques .Example of Other Notation: UML Class Diagrams Module II (16 hours) Relational Model and Relational Algebra .Examples of Queries .Weak Entity Types .Data models - schemas and instances .Indexes on Multiple Keys Module IV (14 hours) Transaction Management .Relationship types.Transaction and System Concepts – ACID Properties . 2007 .Centralized and client-server architectures . R.Characteristics of Database approach .Constraints .Transaction Support in SQL Concurrency Control Techniques .Using Locks for Concurrency Control in Indexes Database Recovery Techniques .ER Diagrams and Naming Conventions .Data Definition and Data Types .Relational Model Concepts .The Tuple Relational Calculus .Parallelizing Disk Access Using RAID Technology .Recovery Techniques Based on Deferred and Immediate Updates .The Domain Relational Calculus SQL .Binary Operations .Sorted Files .Multilevel Indexes .Advantages of using DBMS approach . Relationship Sets.Dynamic Multilevel Indexes Using B-Trees and B+ Trees .Properties of Relational Decompositions . Entity Sets.Specifying constraints .Recovery in Multidatabase Systems .Views Database Design .Use of UML Diagrams in database design.Shadow Paging .Entity Types.Three-schema architecture and data independence .Algorithms for Relational Database Schema Design .Secondary Storage Devices – Placing File Records on Disk - Operations on Files . Module III (12 hours) Disk Storage. Entity-Relationship Model . 3 hours lecture and 1 hour tutorial per week Module I (12 hours) Introduction . Text books 1.Heap Files .Relational Database Schemas – Relational Algebra: Unary Operations .Optimistic Concurrency Control .Insert.Backup and Recovery from Catastrophic Failures.Normal Forms Based on Primary Keys (Up to BCNF) .Timestamp Ordering .Functional Dependencies .Recovery Concepts . Navathe: Fundamentals of Database Systems.Schedules .Database languages and interfaces .Characterizing Schedules Based on Recoverability and Serializability .Schema change statements . Roles and Structural Constraints .Set Theoretic operations .Types of Single-Level Ordered Indexes .New Storage Systems Indexing Structures for Files . B.Informal Design Guidelines for Relation Schemas . Elmasri and S.Classification of Database Management systems. 5th Edition.Basic queries – Aggregate functions and grouping . Addison-Wesley.Assertions and Triggers . Delete and Update statements .Locking Techniques .Multiversion Concurrency Control .Aggregate functions and grouping – Outer Join and Outer Union .The Database Design and Implementation Process . Basic File Structures.Refining the ER Design .The database system environment . and Hashing .

3.C. Jeffrey D Ullman: Principles of Database Systems. a practical approach to design implementation and management – Thomas Connolly and Carolyn Begg.Reference books 1. H. Date. Sudarshan: Database System Concepts. A. 2006.2 questions A and B of 15 marks from module IV with choice to answer any one 2K6 CS 604: COMPILER DESIGN . Korth and S. Swamynatham: An Introduction to Database Systems.8 short answer type questions of 5 marks. McGraw-Hill 4.J. 2. Kannan. 5/E. Mc-Graw Hill.2 questions A and B of 15 marks from module I with choice to answer any one Q III . Raghu Ramakrishnan and Johannes Gehrke: Database Management Systems.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 II with choice to answer any one Q IV . S. F. Galgotia Publications Sessional work assessment Assignments 2x10 = 20 2 tests 2x15 = 30 Total marks = 50 University examination pattern Q I . Pearson education 5. A. Database systems. Silberschatz. 2 from each module Q II . Pearson Education.

2 questions A and B of 15 marks from module IV with choice to answer any .L.Aho A Ravi Sethi and J D Ullman. “Compiler Construction Principles and Practice”. Canonical LR and LALR parsers. Error handling-Types of errors-Compile time errors and recovery-Runtime errors-Runtime Error Handling Text books 1. Cenage Learning Indian Edition 2. System programming and operating system.2 questions A and B of 15 marks from module III with choice to answer any one Q V .TMH 3.Design of syntax analyzer using YACC Module 3 (15 Hrs) Semantic analysis-Need for semantic analysis-Syntax directed definitions-S attributed definitions.8 short answer type questions of 5 marks.2 questions A and B of 15 marks from module I with choice to answer any one Q III .Addison Wesley Reference books 1. Kenneth C Louden. 2 from each module Q II .TMH 3Allen T Hollub . Compiler design in C .PHI Sessional work assessment Assignments 2x10 = 20 2 tests 2x15 = 30 Total marks = 50 University examination pattern Q I .The theory and practice of Compiler writing. stack and heap allocations)-Memory allocation in block structured languages-Accessing local and non local data-Array allocation and access-Procedure calls- Parameter 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 Generation- Basic issues in code generation-Data descriptors-Expression trees-Generating target code from expression trees- Symbol table handling-Symbol table requirements and organization.2 questions A and B of 15 marks from module II with choice to answer any one Q IV .D M Dhamdhare. Compilers Principles Techniques and Tools.attributed definitions-Translation schemes-Type system and Type checking-Design of a simple type checker Storage Management:-Memory allocation strategies (static. 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 role- Review of finite automation and Regular Expressions-Specification of tokens using regular expressions- Implementing 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 parsing- Operator precedence parsing-LR parsing-Simple LR.Tremblay and Sorenson.

FDDI . 2. William Stallings.5 . “Data and Computer Communication..Link Layer addressing .2 questions A and B of 15 marks from module IV with choice to answer any one . Kurose and Ross.2 questions A and B of 15 marks from module II with choice to answer any one Q IV .Routing Algorithms -LS -DV -Hierarchial routing -Routing in the Internet -Broadcast and Multicast routing. PHI 3.TCP congestion control. Text books 1. Tanenbaum A S. Application Layer -Principles -HTTP –FTP -SMTP -DNS.Pearson Reference books 1. LAN . 2K6 CS 605: DATA COMMUNICATION & COMPUTER NETWORKS 3 hours lecture and 1 hour tutorial per week Module I (14 hours) 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 Module II (16 hours) Data link layer services .Multiple Access Protocols .Virtual circuit and datagram networks . Computer Networks. Third Edition.A Design Oriented Approach.SONET – Bridges.HDLC. "Computer Networking".Hub and Switches -PPP. . Module III (13 hours) Network layer: Introduction .IEEE 802.2 questions A and B of 15 marks from module III with choice to answer any one Q V . 2004.Operating Systems .2 questions A and B of 15 marks from module I with choice to answer any one Q III . Tata McGraw-Hill. TMH 2.3 . Crowley C.Router .4 - IEEE 802.Internet Protocol -Forwarding and addressing in the Internet .Principles of Congestion Control .Error detection and correction – Parity – LRC – CRC – Hamming code .Ethernet IEEE 802. 2 from each module Q II .Connection oriented transport TCP . Pearson EducationI Sessional work assessment Assignments 2x10 = 20 2 tests 2x15 = 30 Total marks = 50 University examination pattern Q I . “Data communication and Networking”. Forouzan. Module IV (14 hours) Transport layer : Introduction and services-multiplexing and demultiplexing -Connectionless transport UDP - Principles of Reliable data transfer . Behrouz A.8 short answer type questions of 5 marks.

2. Distributed deadlocks. System Models: Architectural models. 2 from each module Q II . Module III (12 hours) Distributed Objects and Remote Invocation: Communication between distributed objects. performance metric for distributed mutual exclusion algorithms. path pushing algorithms. global state.2 questions A and B of 15 marks from module III with choice to answer any one Q V . detection & resolution. Kindberg: "Distributed System: Concepts and Design”. Mukesh Singhal And Niranjan G Shivaratri.Pearson Education. edge chasing algorithms. Flat and nested distributed transactions. Dollimore. Pearson Education Reference books 1. Java RMI case study. Fundamental Models Theoretical Foundation for Distributed System: Limitation of Distributed system. Coulouris. deadlock prevention. centralized dead lock detection.8 short answer type questions of 5 marks. Resource sharing and the Web Challenges. CORBA services. Transaction recovery. 2. P K Sinha. Applications of Agreement algorithms. Remote procedure call.2 questions A and B of 15 marks from module IV with choice to answer any one .2 questions A and B of 15 marks from module I with choice to answer any one Q III . absence of global clock. 2K6 CS 606 (A): DISTRIBUTED COMPUTING 3 hours lecture and 1 hour tutorial per week Module I (16 hours) Characterization of Distributed Systems: Introduction.Issues in Distributes Operating Systems. Transactions and Concurrency Control: Transactions. requirement of mutual exclusion theorem. Token based and non token based algorithms.Tata McGraw Hill.2 questions A and B of 15 marks from module II with choice to answer any one Q IV . Distributed shared memory – Design and Implementation issues. shared memory. Lamport’s & vectors logical clocks. avoidance. classification of Agreement Problem-Interactive consistency Problem. Distributed Mutual Exclusion: Classification of distributed mutual exclusion. distributed dead lock detection. Module II (14 hours) Distributed Deadlock Detection: system model. concurrency control in distributed transactions. Optimistic Concurrency control. Text books 1. Events and notifications.CORBA Case Study: CORBA RMI.. resource Vs communication deadlocks. Comparison of methods for concurrency control Module IV (12 hours) Distributed Transactions: Introduction. “"Distributed System: Concepts and Design”. System models. "Advanced Concept in Operating Systems". Logical clocks. “Distributed Operating Systems”. Locks. Agreement Protocols: Introduction. consistency models. Timestamp ordering. termination detection. Tanenbaum S . Examples of distributed Systems. PHI Sessional work assessment Assignments 2x10 = 20 2 tests 2x15 = 30 Total marks = 50 University examination pattern Q I . Nested transactions. Causal ordering of messages. Atomic commit protocols.

2. D. 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. Prentice Hall. Pearson Education.K. Parry Smith.J. Reference books 1. 2 from each module Q II . Module II (16 hours) Definition – Data Management – Data Life Cycle – Database Technology – Interfaces – Implementation – Networks: Communication Models – Transmission Technology – Protocols – Bandwidth – Topology – Contents – Security – Ownership – Implementation.2 questions A and B of 15 marks from module III with choice to answer any one Q V . Introduction To Bio Informatics.2 questions A and B of 15 marks from module IV with choice to answer any one .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 . 3. Bryan Bergeron. Soren Brunak. Affward. T. Bio Informatics – The Machine Learning Approach. 2K6 CS 606 (B) BIOINFORMATICS 3 hours lecture and 1 hour tutorial per week Module I (12 hours) The Central Dogma – Killer Application – Parallel Universes – Watson’s Definition – Top Down Vs Bottom Up Approach – Information Flow – Conversance – Communications. First East West Press. 2003 Sessional work assessment Assignments 2x10 = 20 2 tests 2x15 = 30 Total marks = 50 University examination pattern Q I . 2003. Pierre Baldi.8 short answer type questions of 5 marks. 2001. Module IV (10 hours) Drug Discovery Fundamentals – Protein Structure – System Biology Tools – Collaboration And Communication – Standards – Issues – Case Study. Bio Informatics Computing . 2nd Edition.

Third Edition. Organizational Planning. Use of Software to assist in Cost Management. Project Plan Development. Main Steps in Project Planning . Program Evaluation and Review Technique (PERT) Use of Software to Assist in Project Scheduling Project Cost Management-Importance and Principles of Project Cost Management. Project Communication Management . Critical Path Analysis. Performance Reporting. Contract Administration. Ramesh Gopalaswamy. Source Selection. Common Sources of Risk in IT projects. Scope Statement.. Project Execution. Prentice-Hall India. “Information Technology Project Management” Kathy Schwalbe. Stages of Software Quality Management. Expert Judgment . Procurement Planning. 2003 5. Software Project Management. Project Controlling and Configuration Management .Quality of Information Technology Projects.Types of Cost Estimates. Use of Software to Assist in Project Planning Activities Module II (16 hours) Project Scheduling : Time Management. Resource Planning . 2. A Concise Study. Solicitation. Information Distribution. Pankaj Jalote. Cost Budgeting. Problems with Software Projects Stages of Project - The Feasibility Study. Module III (12 hours) Project Quality Management. THOMSON Course Technology. “Managing Global Projects”. International Student Edition. Kelkar. Risk Response Development and Control Project Procurement Management. 2003 3. Plan Execution.Importance of software project management. Cost Control . S. Sequencing and Scheduling Activity Project Network Diagrams. Estimating by Analogy . Quality Assurance . Methods for Selecting Projects .Issues in Project Staff Acquisition and Team Development .Tools and Techniques For Quality Control Project Human Resources Management.The Importance of Project Risk Management. Project Planning.Importance of Project Procurement Management. Pearson Education. Risk Quantification. Software Project Management” Bob Hughes and Mike Cotterell. Software Project Management in Practice. Tata McGraw Hill.Communications Planning. Duration Estimating and Schedule Development.Keys to Managing People .A. Quality Control Quality Standards. Contract Close-out. 2002 4. Schedules and Activities . Module IV (14 hours) Project Risk Management . Software Tools for Project Management Project Planning. Reference books 1.Importance of Project Schedules. Cost Estimating. Scope Management. 2K6 CS 606(C): SOFTWARE PROJECT MANAGEMENT 3 hours lecture and 1 hour tutorial per week Module I (12 hours) Introduction . Project Charter.Integration Management. COCOMO Model. Tata McGraw-Hill. 2001 . The Stakeholder of Project . Project and Product Life Cycles . Project Management Process Groups- Introduction to Project Management Process Groups Project Initiation. Planning. Walker Royce “Software Project Management – A Unified Framework “. Work Breakdown Structure. Revised Edition. Quality Planning .Network Planning Models . Project Management Framework . Pearson Education. 2004 6. Project Executing. Project Closing. Risk Identification. The Role of Project Manager.

8 short answer type questions of 5 marks.Sessional work assessment Assignments 2x10 = 20 2 tests 2x15 = 30 Total marks = 50 University examination pattern Q I .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 I with choice to answer any one Q III .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 . 2 from each module Q II .

quantization errors in FFT algorithms.Sign-Magnitude - One’s-complement.Impulse Invariant Transformation.Chebyshev design.Direct.Signal Flowgraph. Digital signal processing.Scaling. Introduction .Introduction to Digital signal processing 5.2 questions A and B of 15 marks from module II with choice to answer any one Q IV .Product quantization error . 2K6 CS 606 (D): DIGITAL SIGNAL PROCESSING 3 hours lecture and 1 hour tutorial per week Module I (13 hours) Review of signals and systems. Module IV (14 hours) Finite word length effects in digital filters: Introduction.Scitech Publications.design based on numerical solutions of differential equations.Fast Fourier Transform. P Ramesh Babu . Oppenhiem and Sheffer .truncation.Digital signal processing:.hamming.Linear Convolution using DFT. Johny R Johnson .Blackman.Fixed Point.2 questions A and B of 15 marks from module IV with choice to answer any one .Quantization effects in the Computation of the DFT.advantages and limitations of Digital Signal Processing.Kaiser windows.Frequency response of linear phase FIR filters - Location of the zeros of linear phase FIR filters.lattice design-Fourier Series method- using windows-rectangular.cascade . Digital signal processing 6.zero-input limit cycle Oscillations .rounding - effects due to truncation and rounding. PHI 4.Digital signal processing .hanning.Number Representation .Parallel Forms.Input quantization error .Co-efficient quantization error.Block floating point numbers. Sessional work assessment Assignments 2x10 = 20 2 tests 2x15 = 30 Total marks = 50 University examination pattern Q I . Realization of FIR. Pearson edn. Module II (16 hours) Finite Impulse Response (FIR) Filters: Linear phase FIR filters.relation between Z- Transform and DFT.FFT algorithms – General Computation using Radix 2 algorithm.2 questions A and B of 15 marks from module III with choice to answer any one Q V .Finite Word Length Effects in FIR Digital Filters. Oppenhiem . Proakis and Manolakis.8 short answer type questions of 5 marks.Cascade. Reference books 1.Basic Network structure for IIR filter.2 questions A and B of 15 marks from module I with choice to answer any one Q III .Floating point numbers. 2.Butterworth design.Desecrate time signal processing . decimation – in time and Frequency . Ifechor-.triangular or barlett windows.quantization . 2 from each module Q II .Multiplication in Fixed Point arithmetic .Two’s .complement forms -Addition of two fixed point numbers.Quantization in Floating Point realization IIR digital filters .Overflow limit cycle Oscillations . Infinite Impulse Response (IIR) Filters . Module III (13 hours) Discrete fourier Transform: Properties-Circular convolution. Pearson edn. 3. Design of IIR Digital filters from analog filters.

project report preparation – study of feasibility and Viability of a project .2 questions A and B of 15 marks from module II with choice to answer any one Q IV .: Seven Business Crisis. 2 from each module Q II .: Finance for Small Scale Industries Sessional work assessment Assignments 2x10 = 20 2 tests 2x15 = 30 Total marks = 50 University examination pattern Q I .entrepreneurship and economic development . Dr. Nadakami: Developing Enterpreneurship.forms of organizations for small scale units .2 questions A and B of 15 marks from module IV with choice to answer any one . R.financing of project and working capital- venture capital and other equity assistance available . D.8 short answer type questions of 5 marks. Deshpande M. TMH International 2. Mc Graw Hill 3. Hodgelts: Enterpreneurship. a Contemporary Approach. S.entrepreneurship – achievement .2 questions A and B of 15 marks from module III with choice to answer any one Q V .stages of small business growth – entrepreneurship in -international environment . a Handbook Learning System 4.structure of the enterprise .. Kurado and R M. Rao C. TMH 6.environment - market survey and market assessment .industrial policy.assessment of risk in the industry Module III (12 hours) Process and strategies for starting a venture . V. P. Rao T.formalities to be completed for setting up a small scale unit .motivation .time management creativity and innovation .characteristics of entrepreneur . Harold Koontz and Heinz Weihrich: Essentials of Management. 2K6 CS 606 (E) ENTERPRENEURSHIP 3 hours lecture and 1 hour tutorial per week Module I (20 hours) Entrepreneurial perspectives . Mehta.planning. M.2 questions A and B of 15 marks from module I with choice to answer any one Q III .break even analysis and economic ratios technology transfer and business incubation Reference books 1.understanding of entrepreneurship process .entrepreneurial decision process . Patel V. implementation and growth Module IV (10 hours) Technology acquisition for small units . Robert D Hirich and Michael Peters: Enterpreneurship. G.Entrepreneurial competencies . The Dryden Press 5.managerial functions for enterprise Module II (10 hours) Process of business opportunity identification and evaluation .

‘Nonlinear Programming Theory and Algorithms’ John Wiley. Bazarra M. Bazarra M. 5.. Sherall H. D & Shetty C. 4.2 questions of 15marks from module III with choice to answer any one Q V . 2 from each module Q II . Sessional work assessment Two tests 2 x 15 = 30 Two assignments 2 x 10 = 20 Total = 50 University examination pattern Q I .A. J. ‘Introduction to Operations Research’ Mc Graw Hill.8 short answer type questions of 5 marks. & Sherall H. An Introduction’ PHI. Module IV: (9 hours) Dynamic Programming & Game Theory : Nature of Dynamic programming problem – Bellman’s 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. S. 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.2 questions of 15marks from module IV with choice to answer any one .. S. Text books and References 1. 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. D.2 questions of 15marks from module I with choice to answer any one Q III . Jarvis J. & Liebermann G. M. 3. Taha H.2 questions of 15marks from module II with choice to answer any one Q IV . S. F... 2. 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. ‘Operation Research. Hillier. ‘Linear Programming’ Narosa. Hadley G. J. ‘Linear Programming and Network Problems’ John Wiley.

Databse Management Systems. 10. “Internetworking with TCP/IP.. 7. ‘Fundamentals of Database Systems’. EXISTS. PHI 2. Creation and dropping of Views 7. SUM. DDL statements in SQL 2. 11. 2K6 CS 607(P) – NETWORKS & DBMS LAB 3 hours practical per week 1. 12. Implementation of POP3 protocol. Setting up multiple virtual hosts in a single domain. 4. UNION. Simulation of Medium access control protocols-Go back N. High level language extension with triggers. Reference books 1. sliding window 14. ALL. MAX and MIN). Third Edition”. High level language extension with cursors. Queries using Aggregate functions (COUNT. AVG. Comer D. Navathe. Richard. INTERSECT and Constraints. 4. IN. Implementation of client server model using UDP protocol. HAVING 6. Volume 1. “Computer Network. Stevens W. Implementation of client server model using TCP protocol. Pearson Education 5. Implementation of SMTP protocol. 4/e. 2. Implementation of client server model using Multicast server. 8. “Unix Network Programming”. McGrawHill Sessional work assessment Laboratory practical and Record = 35 Test = 15 Total marks = 50 . 3.E. NOTEXISTS. Perform a case study about the different routing algorithms to select the network path with its optimum and economical during data transfer. 8. PHI 4. GROUP BY. Pearson Education 3. DML statements in SQL 3. II & III. 5. 5. Procedures and Functions. Study and configuration of NIC cards. Simple Queries using SELECT command on a given database. Kurose & Ross. Mail server configuration. Reghu Ramakrishnan. DNS – Tracing the path and find the root/name servers 9. 9. Elmasr. Dynamic Host Configuration Protocol – To study about dynamic allocation of IP addresses. Queries (along with sub Queries) using ANY. Web server installation and configuration. ƒ Shortest path routing ƒ Flooding ƒ Link State ƒ Hierarchical Database Management Systems Recommended Software: Mysql /Oracle latest version 1. Selective repeat. 6. James F. 13. File transfer-using socket.

Writing a simple Compiler for a subset of Language features Reference books 6. common sub expression elimination etc) 9. numbers. ↑ etc) 4. Implementation of Operator precedence Parsing (including syntax tree) 5. Simple code optimization strategies (For example Constant folding. Loop invariant elimination. Morgan Kaufman Sessional work assessment Laboratory practical and record = 35 Test = 15 Total = 50 . 2K6 CS 608(P): COMPILER LAB 3 hours practical per week 1. /. punctuators etc. *. Design of a simple type checker (For eg for the primitive types of C) 7. operators. identifiers. 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. Generation of IC for arithmetic expressions 8. Sethi R. 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 +. Design of a Lexical Analyzer using Finite Automation (including Symbol table) (The program should be designed for a specific number of keywords. Finite automata should be designed for each type of token) 2. -. Design of lexical analyzer using LEX 3. Design of parser for arithmetic expressions using YACC 6. Addison wesley 7. Programming language Pragmatics. Scott M L. Programming languages: Concepts & Constructs .