DEPARTMENT OF COMPUTER SCIENCE VIDYASAGAR UNIVERSITY

PASCHIM MEDINIPUR– 721102
M.Sc. SEMESTER – I

Course Code

Paper

Teaching Scheme (Per Week) Th. 2 Tu. 1 Pr. 0

Examination Scheme (Marks) Int. Att. Ext. 10 0 20+20

Total (Marks)

CS/MSc/1101

CS/MSc/1102

CS/MSc/1103 CS/MSc/1104

CS/MSc/1111

CS/MSc/1112

Discrete Structure M1: Set Theory M2: Graph Theory Advance Computer Architecture & Microprocessor M1: Parallel Architecture M2: Microprocessor (8086 to Pentium) Distributed Operating System Graphics and Image Processing M1: Computer Graphics M2: Image Processing Computer Graphics Lab. & Microprocessor Lab Operating System Lab

25+25

2

1

0

10

0

20+20

25+25

2 2

1 1

0 0

10 10

0 0

40 20+20

50 25+25

0

0

3+3

10

0

20+20

25+25

0

0

6

10

0

40

50

1

M.Sc. SEMESTER – II

Course Code

Paper

CS/MSc/1201

CS/MSc/1202

CS/MSc/1203 CS/MSc/1204

Database System M1: Advanced Distributed DBMS M2: PHP, My SQL & ASP.NET, ADO.NET Theory of Computation and Compiler M1: Finite Automata M2: Compiler Design Design & Analysis of Algorithm System Analysis, Design and Software Engineering M1: SAD M2: Software Engineering DBMS Lab. & Algorithm Lab Compiler Lab & Soft. Eng. Lab

Teaching Scheme (Per Week) Th. Tu. Pr. 2 1 0

Examination Total Scheme (Marks) (Marks) Int. Att. Ext. 10 0 20+20 25+25

2

1

0

10

0

20+20

25+25

2 2

1 1

0 0

10 10

0 0

40 20+20

50 25+25

CS/MSc/1211 CS/MSc/1212

0 0

0 0

3+3 3+3

10 10

0 0

20+20 20+20

25+25 25+25

2

Embedded System. 2. Soft Computing. & Web-Page Designing Lab AI Lab & JAVA Lab Teaching Scheme (Per Week) Th. 7. 3. Pr. VLSI Design. Ext. 5. 2 1 0 Examination Total Scheme (Marks) (Marks) Int. Tu. SEMESTER – III Course Code Paper CS/MSc/2101 CS/MSc/2102 CS/MSc/2103 CS/MSc/2104 CS/MSc/2111 CS/MSc/2112 Network and Internet M1: Computer Network M2: Internet Technology Advance Programming M1: Object Oriented Programming M2: Advanced JAVA Artificial Intelligence & Neural Network Elective . 10 0 20+20 25+25 2 1 0 10 0 20+20 25+25 2 1 0 10 0 40 50 2 0 1 0 0 3+3 10 10 0 0 40 20+20 50 25+25 0 0 3+3 10 0 20+20 25+25 List of Electives: 1. Fuzzy set theory 3 . Mobile Computing. Pattern Recognition.M. Bio-informatics.Sc. 4. Att.I Network Lab. 6.

Symmetric Difference. Tu. Mathematical Inductions. Planar and Dual Graphs.K. Mott J. Infinite Sets (Definition). 0 0 200 200 0 0 0 0 50 50 50 50 Detailed Syllabus Outline M. Dijkstra’s Algorithm. 1986. SEMESTER – IV Course Code CS/MSc/2211 CS/MSc/2212 CS/MSc/2213 Teaching Scheme (Per Week) Th. SEMESTER – I CS/MSc/1101 : DISCRETE STRUCTURE M1: SET THEORY Set Theory: Introduction. Circuits.TMH 4. and Baker T. P. Paths. Subsets. DFS. 1968. L. Ford-Fulkerson Algorithm for Maximum Flow. L.Union. McGraw Hill. Power Sets. Metric Representation of Graphs. M2: GRAPH THEORY Graphs. Representation of Sets. PH. De Morgan’s Law.. “Introduction to combinatorial mathematics”. “Discrete mathematics for Computer Scientists and Mathematicians”. Books: 1. Cotrees and Fundamental Circuits.Sc.. Combinations. 2. Trees. Att.. Addition. BFS. Pr. Walks. Networks. Computing Principles. Permutations. Partition Sets. Ext. Definition & Concepts. Finite Sets. Liu C. Digraphs. S. 3. Rosen—Discrete Mathematics. Shortest Spanning Trees--. Set Operations--.M.Sc. Isomorphism. Mapa—Higher Algebra (Abstract & Modern) 4 .Kruskal’s Algorithm. Difference. Cut Sets. Prim’s Algorithm. Intersection. Kandel A. 2/e. Properties of Trees. Flow Augmenting Path. External Project & 0 0 0 Industrial Training Seminar 0 0 0 Grand VIVA 0 0 0 Paper Examination Total Scheme (Marks) (Marks) Int. Shortest Path Problem. Cut Vertices.

control hazards. Busby and Ross. SPARC. Fraleigh J. “Computer architecture a quantitative approach”. Balakrishnan—Graph Theory (Schaum). Interconnection networks. compiler effectiveness in vector processors. 1993 2. Centralized shared architectures. Robert J. 1975 8. K. Single instruction multiple data stream (SIMD) architectures. Deo N. 1968 Reference: 1.A. Morgan Kaufman. Smullyan R. Tremblay and Manohar. distributed shared memory architectures..L. data hazards. RISC architectures. example of array processors such as MMX Technology.MH 3. “First Order Logic Springer Verlag”. 9. 1980 7. M. MISD. message passing architectures. PHI. Tata McGraw Hill 6. Power PC.. “Discrete mathematical structures”. McGraw Hill. PHI. 1990 10. Lipschutz—2000 Solved Problems in Discrete Mathematics. “Graph Theory with Applications to Engineering and Computer Science”.5.TMH 3. “Discrete mathematical structures with applications to computer science”. Data flow architectures. performance improvement with pipelines and effect of hazards on the performance. vector register architecture. memory to memory vector architectures. 1996. pipeline hazards. “Introduction to discrete Mathematics”. effect of simplification on the performance. Techniques to handle hazards. SISD.. Array processors. J. vector length and stride issues. Patterson D.Use and effectiveness. instructions formats. 2nd ed. Kolamn. McElice . TMH 2. 3/ed. Text Books: 1. CS/MSc/1102: ADVANCE COMPUTER ARCHITECTURE & MICROPROCESSOR M1: PARALLEL ARCHITECTURE Review of Pipelining. McGraw Hill. MIMID Multiprocessors. Vector processors. B. Robert B. Carter—Computer Architecture ( Schaum Series). comparison with vector processors. and Hennessy . Hararay—Graph Theory. comelier issues. etc. synchronization and memory consistency models. addressing modes. “Advanced Computer architecture with parallel programming”. 1996 5 .. “A first course in abstract algebra Narosa”. Ash & Carol Ash. Examples of some pipeline in modern processors. MIMD. PA-RISC. example processors such as MIPS. Hwang.

Subex Inc. 80286. 8259. Hall. addressing modes and their features. Microprocessor Book – Intel marketing communication.4. H.Interrupts and DMA. Intel Corp. Advanced Microprocessors by Ray and Bhurchandi . 8237. 1980. Typical applications of a microprocessor... Pin description and features. 1990 Reference: Quinn—Parallel Processing M2: MICROPROCESSOR (8086 to PENTIUM) Introduction to 8086 CPU architecture-register organization. 2. Stone. distributed middleware and applications such as the web and peer-to-peer systems. Pentium). 8253. 8255. 1989 6. McGraw Hill. Gaonkar. Prentice Hall. A brief overview of advanced 6 . References: 1..TMH 5. H. India 1996. Miller. Covered topics include processes and threads. 2nd Ed. The Intel Microprocessors: 8086/8088. Hardware Interfacing: Interfacing memory. Brey. machine cycle. Some coverage of operating system principles for multiprocessors will also be included. 3. Hwang & Briggs—Computer Architecture & Parallel Processing. Instruction cycle. 2 – some real Microprocessor – Galgotia Book Source.S. 8251. Addison Wesley. CS/MSc/1103 : DISTRIBUTED OPERATING SYSTEM Principles of distributed systems in general and distributed operating systems in particular. Micro Controller Handbook – Intel Publications. Wiley inter science publications. distributed process scheduling. Wiley eastern Ltd. 80386 & 80486. shared virtual memory. Bary B. Assembly Language Programming the IBM PC by Alan R. “Advanced Computerat”. 1987 8. Brief overview of some other microprocessors (eg. concurrent programming. Peripherals: 8279. programming and applications with 8085/8085A. A/D and D/A converters and interfacing of the same. New Delhi by Adam Osborne and J. 6. security in distributed systems. “Interconnection Network for Large Scale parallel Processing”. Siegel. TMH 5. 1992 7. distributed inter-process communication. Intel Corp: The 8085 / 8085A. McGraw Hill International Ed. Microprocessors and Interfacing by Douglas V. peripheral chips (IO mapped IO & Memory mapped IO).J. Timing diagram. distributed file systems. 80186. Software instruction set and Assembly Language Programming. 1989 by Ramesh S. Microprocessor architecture. An introduction to micro computers Vol. 1994. Kane 4.

3D Transformation and Viewing: 3D Transformations--. CS/MSc/1104 : COMPUTER GRAPHICS AND IMAGE PROCESSING M1: COMPUTER GRAPHICS Introduction to Computer Graphics and Graphics Systems: Overview of Computer Graphics. etc. Rotation. Surfaces. Active and Passive graphics devices. Boundary Fill Algorithm. Rotation about an arbitrary axis in space.topics such as multimedia operating systems. Processing. Parallel Projection transformation. time permitting. Line clipping. Digitizers. 7 . Z-buffer Algorithm. polygons and ellipse. Bresenham’s Line Algorithm. Rotation). Reflection. Scan Conversion: Points and Lines. Geometric Model. Prentice Hall. Shear. Light pens. Curves: Curve representation. Digital Image Representation.Translation. Hidden Surfaces: Depth comparison. Sampling & Quantization . lines. RGB color model. Perspective Projection. Digital Image Formation : A Simple Image Model. Transformations of points. Viewing pipeline. Communication. Clipping circles. Flood Fill Algorithm. Addison Wesley.Point clipping. Window to viewport coordinate transformation. Distributed Systems: Principles and Paradigms Andrew Tannenbaum and Maarten van Steen.Basic Transformation (Translation. End conditions for periodic B-spline curves. Scaling. Bezier curves. Designs. Scaling. Fill Algorithm. Transformations between coordinate systems. Display. Fundamental steps in Image Processing. M2: IMAGE PROCESSING IMAGE PROCESSING: Introduction: Background. 2001 Distributed Systems. Clipping. Text Books / References : 1. Clipping Operations--. real-time operating systems and mobile computing will be provided.Translation. Matrix Representations and homogeneous coordinates. 2D Transformation and Viewing: Basic Transformations--.Image Acquisition. General. Reflection through an arbitrary plane. Ellipse Generating Algorithm. Printers. DDA Algorithm. Back face detection. intersecting lines. parallel lines. Plotters. Scan Line Polygon. Rotation. Scaling & other transformations. Circle Generation Algorithm. Line Drawing Algorihms. 1993 2.Uniform & Non uniform.. Computer Graphics Software. Storage. Elements of Digital Image Processing . 2nd edition Sape Mullender.

W. Vandam.Lo C.Chanda & Majumder. Z. Distance Measures. Edge detection. J.PHI 8. PHI 5. Springer India 7. PE. High-pass Filtering. Adams – “ Mathematical Elements for Computer Graphics (2nd Ed. Sonka. Albert. Concepts & Techniques of GIS .Digital Image Processing & Analysis.Image Averaging.)” – TMH 4. Arithmetic/Logic Operations. Image Sharpening. Text Books: 1. Combined detection. Properties of The Two Dimensional Fourier Transform. R.Local Processing. Baker – “ Computer Graphics ( C version 2nd Ed.PHI. Reference Books: 1. Region Splitting & Merging. Equivalence & Transitive Closure. Global Processing via The Hough Transform. Low-pass Filtering. Relations. Digital Image Processing. Fundamentals of Computer graphics & Multimedia. Sproull – “Principles of Interactive computer Graphics” – TMH. D.Mathematical Preliminaries : Neighbour of pixels. Histogram Processing. Digital Image Processing. Mean Filter. Hearn. 5. 11.Clarke Keith. Enhancement in the frequency domain Low pass filtering.)” – TMH 3. F. 3.Image Processing.P. M. Rogers.)” – Pearson education 2. Feiner. C. VIKAS 10. Discrete Fourier Transform. High pass filtering. Gonzalves. Derivative Filtering. Fourier Transformation. Jahne. Getting Started with GIS. Edge Linking & Boundary Detection . Foley. Plastock – “ Schaum’s outlines Computer Graphics (2nd Ed.Pearson 6. Jain. Smoothing . 3.) – Pearson Education. Optimal Thresholding. Yeung K. 4. Newman. PHI 9. 2. A. Thresholding . Image Segmentation : Point Detection.Fundamentals of Digital Image Processing. High-boost Filtering. Hughes – “Computer Graphics principles (2nd Ed. Elsom Cook – “Principles of Interactive Multimedia” – McGraw Hill 8 . Xiang. Image Enhancement : Spatial Domain Method. Region Growing by Pixel Aggregation. Homomorphic Filtering. Region Oriented Segmentation . W. Simple Global Thresholding. Discrete Cosine & Sine Transform. Line Detection. Mukherjee.Foundation. R. Frequency Domain Method. Analysis & Machine Vision.Basic Formulation. F. Connectivity. Contrast Enhancement -Linear & Nonlinear Stretching.

3. reading switch state & glowing LEDs accordingly. finding out the frequency of a pulse train etc Interfacing any 8-bit Latch (eg. a) Familiarization with 8086 Assembler c) Study of prewritten programs using basic instruction set (data transfer. subroutine for delay. 1.CS/MSc/1111 Sl. Load/Store. M1: MICROPROCESSOR LAB Name of the Experiments Familiarization with 8086 register level architecture and trainer kit components. 74LS373) with trainer kit as a peripheral mapped output port with absolute address decoding a) b) c) d) e) Interfacing with I/O modules: ADC Speed control of mini DC motor using DAC Keyboard Multi-digit Display with multiplexing Stepper motor 6. Arithmetic. i) ii) iii) iv) v) vi) vii) viii) 5. No. a) Study of prewritten programs on trainer kit using the basic instruction set ( data transfer. Load/Store. 8. Familiarization with the process of storing and viewing the contents of memory as well as registers. Arithmetic. including the memory map. Program using subroutine calls and IN/OUT instructions using 8255 PPI on the trainer kit eg. Writing programs for ‘Wait Loop (busy waiting)’ and ISR for vectored interrupts (eg. Logical) b) Assignments based on above. counting number of pulses within specified time period) M2: GRAPHICS LAB • • Point plotting. 4. line & regular figure algorithms Raster scan line & circle drawing algorithms 9 . 7. b) Assignments based on above Programming using kit/Assembler for table look up Copying a block of memory Shifting a block of memory Packing and unpacking of BCD numbers Addition of BCD numbers Binary to ASCII conversion String Matching Multiplication using Booth’s Algorithm 2. Logical) on the simulator.

5. set_semvalue. Distributed deadlocks. Distributed database design . Shell programming: creating a script. 2. pthread_cancel) 6. conditions. 3. semaphore_p. control structures. Partitioned networks. pthread_create. signal interface. commands). Levels of distribution transparency. Architectural aspects. duplicating a process image. Signal: signal handling. semop. pthread_join. Process: starting new process. SEMESTER – II CS/MSc/1201 : DATABASE SYSTEM M1: ADVANCED DISTRIBUTED DBMS Distributed DBMS features and needs.Sc. 10 .non-blocking commitment protocols. del_semvalue. 4. named pipes(FIFOs. waiting for a process. Query execution and access plan. Semaphore: programming with semaphores (use functions semctl. Reliability.2 phase unit protocols. popen. replacing a process image. Reference architecture. Storage mechanisms. lines & polygons 2-D / 3-D transformations Simple fractals representation Filling algorithms Web document creation using Dreamweaver. making a script executable. DirectX Supported Graphics 2D Graphics using DirectX 3C Graphics using DirectX CS/MSc/1112 : OPERATING SYSTEM LAB 1. Translation of global queries. signal sets. / Global query optimisation. allocation criteria. pthread_exit. Checkpoints and cold starts. Comparison. Management of distributed transactions.• • • • • • • • • Clipping & Windowing algorithms for points. accessing FIFO) M. replication. pclose).2 phases locks. semaphore_v). semget. Node and link failure recoveries. POSIX Threads : programming with pthread functions(viz.fragmentation. Time based and quorum based protocols. Creating Animation using Flash. sending signals. Concurrency control . Inter-process communication : pipes(use functions pipe. pthread_attr_init. shell syntax (variables. zombie process. functions.

Distributed database administration. recognition of a language by an automata .Distributed data dictionary management.NET. Finite Automation : Definition. regular expressions from DFA. mathematical representation. Pearson 3. Heterogeneous databases-federated database. definition. derivation trees. Pearson 3. MH 2. Web Forms Architecture. OODBMS – introduction to object orientation. NFA from regular expressions. Development tasks. Operation. ADO. NFA. equivalence of Moore & Mealy machines. and manipulating data with the MySQL database within a PHP program. Principles of Distributed Database Systems. Accessing Data with ADO. C# as a Language for the Web. creating HTML forms. Topics covered include: PHP scripting fundamentals. Books: 1. and writing secure PHP programs. Database System Concepts.NET Platform. Databases and Data access on the Web. Constructing an application.idea of grammar. MH M2: PHP. Silberschatz Korth.global task management. DFA. My SQL & ASP. NFA with e-moves. Introduction to the Web and . M. Sudarshan. Tamerozsu Patrick Valduriez. Moore versus Mealy m/c.Ramakrishnan. Tannenbaum.deductive databasessemistructured and web databases-mobile databases. Client server databases-SQL server. accessing.NET. simplification. Minimization of finite automata Context Free Grammars: Introduction.temporal databases-spatial databases-data mining and warehousing. 11 . CNF & GNF. Alternative architecture. Database Management Systems.object relational databases. equivalence of DFA and NFA. applications of finite automata. Introduction to ASP. Distributed Database. open database connectivity. loosely and tightly coupled. reference architecture. regular sets & Regular expressions : equivalence with finite automata. concept of sequential circuits. Server Side Controls.NET CS/MSc/1202 : THEORY OF COMPUTATION AND COMPILER M1: THEORY OF COMPUTATION Finite State Machines: Definition. creating.NET Covers the PHP scripting language and the MySQL database to create dynamic Web pages. Introduction to advanced databases-homogeneous and heterogeneous databases. state table & state assignments Finite State Models : Basic definition.persistence of objects.

M2: COMPILER DESIGN Introduction to Compiling :Compilers. Register allocation & assignment. moves. 2. Ullman . Martin—Introduction 5. Patterns. acceptance by final state & empty stack.P Mishra & N. “Elements of the theory of Computation”. Bottom-up evaluation of inherited attributes. Recognition of a tokens. From a regular expression to NFA. Specifications of a token. 12 . Chandrasekharan – “Theory of Computer Science”. and Ullman JD. Type checking :Type systems. From a regular expression to DFA. Context free grammars. Design of a lexical analyzer generator (Lex). Techniques and Tools” . Lexical Analysis :The role of the lexical analyzer.“Compiler Principles. LALR) Syntax directed translation:Syntax director definitions.I. “Introduction to Formal Languages”. Specification of a simple type checker. and Papadimitrou C. “Switching & Finite Automata”. Ash & Ash – “Discrete Mathematics”.. McGraw Hill. Narosa. K. Finite automata. Lewis H. Tata McGraw Hill. a simple code generator. PHI 3. Cousins of the compiler. Kohavi ZVI. H.Pearson Education. Hopcroft JE. Writing a grammar. Input buffering. Top down Parsing. deterministic PDA... Code generations :Issues in the design of code generator. Aho. Sethi. Linz Peter. 2nd Edn. Basic blocks & flow graphs. The phases of the compiler. Tata McGraw Hill. Bottom-up evaluation of S attributed definitions. 6. “An Introduction to Formal Languages and Automata”. Analysis of the source program. Viable prefixes. Syntax Analysis :The role of a parser. Tokens. Kain.TMH 4. R. 2. “Theory of Automata & Formal Language”. Peephole optimization. 1983. The principle sources of optimization. P. “Introduction to Automata Theory. Lexemes. Construction of syntax trees. L attributed definitions. Handles. Equivalence of type expressions.Pushdown Automata : Definition. Non-recursive Predictive parsing (LL). Dag representation of basic blocks. Instantaneous Descriptions. References : 1. equivalence of PDA and CFL. Languages & Computation”. Loops in flow graph. language recognized by PDA. LR parsers (SLR. Type conversions Code optimization :Introduction. Narosa 3.L.H. Transformation of basic blocks. Bottom up parsing. Text books : 1. From a regular expression to an NFA. Text books: 1. Operator precedence parsing.

3. Hamiltonian problem. graph Coloring problem. Examples: Knapsack problem. Examples: 15-puzzle problem. Polynomial time approximation schemes: 0/1 Knapsack problem. A. Text Books: 1. Binary search. “The computational complexity of Algebraic and Numeric problems” 13 . K.Munro. Tail recursion. I & Vol. “Data Structures and algorithms.Vol.“Combinational algorithms. Vol.2 3. Horowitz Ellis.2. Divide and Conquer: Basic concepts. Limitations. DFT and FFT algorithm.Knuth “The Art of Computer Programming”. Use. Theta etc. 4. Lower Bound Theory: Bounds on sorting and searching techniques using partial and total orders. Use.PHI. Job Sequencing with deadlines. Big-O. Examples: Matrix-chain multiplication.Horowitz and Shani “Fundamentals of Computer algorithms” E.Hopcroft and J. Algorithm Design Techniques: Recursion (definition). All pair shortest paths.“Compiler Design in C” . NP-hard class. 2 “ S. CS/MSc/1203 : DESIGN AND ANALYSIS OF ALGORITHM Asymptotic notation: Time and Space complexity. R. Quick sort.Heap sort.Baase “Computer algorithms” E. Matrix Manipulation algorithms: Different types of algorithms and solution to Simultaneous equations. Examples: Tower of Honoi problem. I & Vol. Notion of NP-completeness: P class. Use. Circuit Satisfiability problem.Ullman “The Design and Analysis of algorithms” 2. Single source shortest path. Use.Nievergelt and N. Clique Decision Problem. 4.Borodin and I.Aho. Traveling salesman problem.Deo. Minimum Spanning tree (Prim’s and Kruskal’s algorithms). Sanguthevar " Fundamentals of Computer Algorithms". A. Backtracking: Basic method. Prentice Hall . Quick sort. 1997 5. J. Branch and Bound: Basic method. Approximation Algorithms: Necessity of approximation scheme.E.. 2.Theory and Practice”. Dynamic Programming: Basic method. Search algorithm etc. Sahani Sartaz. Holub . Performance guarantee.Mehlhorn . Use. J. Integer multiplication schemes. Goodman: Introduction to Design and Analysis Of Algorithms TMH Reference: 1. Greedy Method: Basic method. D. Examples: Merge sort. Finding time complexity of well-known algorithms like--. Omega.M.Reingold. Examples: Eight queens problem.

Measurement of quality and productivity. Quality assurance: Reviews. Validation & Verification Metrics. Design & implementation of Information Systems. 14 . Jain. Wiley Dreamtech M2: SOFTWARE ENGINEERING System Development Life Cycle. Strategic planning. System Requirement Specification – DFD. Reliability Assessment . Reuse. COCOMO model. Requirements Determination.Rajaraman. Ram Bansal ‘Vigyacharya’. VIKAS 7. Information Systems:Analysis & Design. Project Scheduling. OO Programming.Benefit Analysis. Physical Design. use and application. EXCEL BOOKS 6. Testing – Levels of Testing. Risk analysis. Documentation.K. Design & MIS. Functional vs.Oriented approach. ISO and capability maturity models. Technical Feasibility. Books: 1. Coding & Documentation . Feasibility analysis. Design of Information System. Object. System Analysis & Design Hand Book. Prototyping. Project Monitoring. Walkthroughs.Parthasarathi. Integration Testing. PHI 4.Structured Programming. System Design: Process descriptions. User interface design. System Analysis. 2. Analysis. Database design. Data Dictionary. Analysis. Cost.MH. Waterfall Model . Top-Down And Bottop-Up design . Input/Output controls. Data modeling with Entity-Relationship Diagrams. Feasibility Analysis. V. System Analysis & Design.Senn. Software Configuration Management. SRS. ER diagram.New Age International 3.CS/MSc/1204 : SYSTEM ANALYSIS. Analysis & Design of Information Systems. Sharma. Cost benefit analysis. Logical Design.Decision tree. . Test case Specification. Monitoring & Control. Process Organization & Interactions. Feasibility studies. Introduction to Project management. System Design – Problem Partitioning. Software Project Management – Project Scheduling . Program Design. DESIGN AND SOFTWARE ENGINEERING M1: SYSTEM ANALYSIS AND DESIGN Overview of System Analysis & Design: System Development Life Cycle. decision table and structured English. Object modeling. System audit. Information Requirement Analysis: Process modeling with physical and logical data flow diagrams. Inspection. Information Hiding. Quality Assurance. System Documentation. Spiral Model. Staffing.EPH 5. CASE TOOLS : Concepts.

OUP 3. Ian – Software Engineering. BETWEEN.Benmenachen. R. 5. Vikas Reference: 1.TMH 6. TRUNCATE statements ! DROP. Software Defect Prevention. SPD CS/MSc/1211 : DBMS LAB Structured Query Language 1. LIKE .Object Oriented & Classical Software Engineering(Fifth Edition). SPD 7.Uma. PHI 4. Essentials of Software Engineering. Kane. Software Engineering. Ghezzi. Pressman – Software Engineering. Pearson Education 9. Software Engineering Fundamentals. Software Quality. UPDATE.Pankaj Jalote – An Integrated Approach to Software Engineering. G. Jaico 8. GROUP BY and HAVING Clause ! Using Aggregate Functions ! Combining Tables Using JOINS ! Subqueries 15 . SCHACH.Vans Vlet. Creating Database ! Creating a Database ! Creating a Table ! Specifying Relational Data Types ! Specifying Constraints ! Creating Indexes 2. Software Engineering. NAROSA. Retrieving Data from a Database ! The SELECT statement ! Using the WHERE clause ! Using Logical Operators in the WHERE clause ! Using IN. ALTER statements 3. ORDER BY. IEEE Standards on Software Engineering. TMH 2.Sommerville. 2.Books: Text: 1. Table and Record Handling ! INSERT statement ! Using SELECT and INSERT together ! DELETE.Behforooz.

Design of Algorithms: This will involve design and implementation of algorithms for problems not covered in class but related to a topic covered in class. comparison of different algorithms for the same problem etc. RELOP (Relational Operator) or others. Write a program in LEX/YACC to check whether a given expression (relational or assignment or bitwise operator) is valid or not and it gives the type of expression as output. there will be at least one significantly large design project involving some real world application. Database Management Creating Views Creating Column Aliases Creating Database Users Using GRANT and REVOKE Cursors in Oracle PL / SQL SQL SERVER Implementing Data Integrity Implementing Indexing Implementing Stored Procedures Implementing Triggers Implementing User-defined Functions Managing Transactions and Locks Writing Oracle PL / SQL Stored Procedures ALGORITHM LAB Laboratory: The laboratory component will emphasize two areas: Implementation of algorithms covered in class: This will involve running the algorithms under varying input sets and measuring running times. 2. An efficient design of the project should require the use of multiple data structures and a combination of different algorithms/techniques. The exact set of algorithms to design and implement is to be decided by the instructor. use of different data structures for the same algorithm (wherever applicable) to see its effect on time and space. In addition. 16 . Write a Program in LEX/YACC to check whether a given string is a valid ID (Identifier). CS/MSc/1212: COMPILER LAB List of Experiments 1.! ! ! ! 4. Keyword.

total no of characters. white space and Count the no of lines. which are names followed by ‘(‘outside of any braces. SOFTWARE ENGENEERING LAB Developing a software following all the phases of SDLC and full documentation of the software 17 . Write a C code analyzer in LEX/YACC: comments. 4. Write programs in LEX/YACC. 11. 6. 5. Write a program in LEX/YACC which takes a English sentence as input and gives the output as the parts of speech. code.3. and multiplication and division operation. structure name etc. Implement translator from integers to roman numerals based on above syntax directed translation using LEX/YACC. Write a program in LEX/YACC to check whether a sentence of English language is grammatically correct or not. which stores the name of the variable. 9. 10. 12. keywords etc. white space. Write a program in LEX /YACC to eliminate white space and collect numbers as a token. Write a program in LEX/YACC to create and maintain a symbol table. Construct a syntax directed translation scheme that translates integers into roman numerals. This calculator program also allows you to assign values to variables (each designated by a single lower case letter) and then use the variables in calculation. Write a program in LEX/YACC which takes a C program as inputs and delete the comment. 7. total no of vowels and total no of punctuation marks in a paragraph. 8. Try to identify function definition and declaration. Write a program in LEX/YACC which counts the no of lines. subtraction. which create a simple desk calculator program that performs addition. which recognize regular expression. count braces. type of the variable. Write a program using FLEX/YACC.

Cable modem. B. Data link layer: Types of errors. Router. Vikas 18 . Wireless LAN: IEEE 802. concentration. categories of network (LAN. user authentication. Network layer:Internetworking & devices: Repeaters. Switches. PHI 6. their comparative study. Networks: distributed processing. link state routing. Bridges. Text Books: 1. RARP. transmission (analog & digital)& transmission media ( guided & non-guided). TCP/IP reference model. Addressing : Internet address. Digital & Data Communication. direction of data flow(simplex. Miller. Circuit switching: time division & space division switch. Physical level: Overview of data (analog & digital). Flow control. NCP. OUP 5. W. A. physical structure (type of connection. Jaico 8. Security: Cryptography. Reservation. HTTP & WWW. Hubs. Routing algorithms: shortest path algorithm. Transport layer: Process to process delivery.)” – PHI/ Pearson Education 4. LCP.11. UDP. network criteria.WAN). Cellular telephony & Satellite network. FDM. Firewalls. Token bucket algorithm. Unicast and multicast routing protocols. CSMA/CD. Understanding Data Communication & Network. fast Ethernet. Introduction to blue-tooth. IPV6. data Communication & Network. polling. security protocols in internet. TDM. DSL technology.N ARQ. Shay. S. Medium access sub layer: Point to point protocol.)” – Pearson Education/PHI 3. A.) “ – TMH 2. Forouzan – “Data Communications and Networking (3rd Ed. SNMP.Sc. Vikas 7. MAN. Selective repeat ARQ. topology). Data & Computer Communication. dynamic routing . Sonet. CSMA. static vs. Slotted ALOHA. Protocols: Stop & wait ARQ. IP. full duplex). half duplex. ICMP. Gateway. Congestion control algorithm: Leaky bucket algorithm. Network for Computer Scientists & Engineers. framing(character and bit stuffing). FDDI. Data communications: components. Application layer: DNS. Go-Back.M. Multiple access protocols: Pure ALOHA. FTP. Protocols: ARP. SMTP. Miller. Modern topics: ISDN services & ATM . subnetting. flooding. token bus. Routing : techniques. Traditional Ethernet. SEMESTER – III CS/MSc/2101 : COMPUTER NETWORK AND INTERNET M1: COMPUTER COMMUNICATION NETWORK Overview of data communication and Networking: Introduction. classful address. Black. error detection & correction methods. distance vector routing. HDLC. Tanenbaum – “Computer Networks (4th Ed. OSI reference model. routing table for classful address. token ring. TCP. Stallings – “Data and Computer Communications (5th Ed. Zheng & Akhtar. VLAN’s.

public & private properties. Concepts of polymorphism. Concept of object & classes. object oriented programming features. 2. Introduction to . XML Web Services. and ring topologies. CS/MSc/2102: ADVANCE PROGRAMMING M1: OBJECT-ORIENTED PROGRAMMING Evolution of object oriented programming: (a) Brief history (b) Application domain (c) Existing-programming languages. Class construction from existing classes.NET namespaces. bus. 4. mesh. Inheritance. 2. Classes and objects. operator overloading. Access Specifiers. and the directory services of the major network operating systems.)” – Pearson Education/PHI M2: INTERNET TECHNOLOGY 1. Difference between Web Form and Web Service.NET Platform. AJAX and ATLAS.NET. . and their advantages and disadvantages. 4. To provide the student with basic knowledge of networking technology. Novell NetWare. Defining behavior by messages & methods. To provide the student with basic knowledge of the characteristics of segments and backbones. To provide the student with basic knowledge of the major network operating systems.Reference Books: 1. Garica. To provide the student with basic knowledge of the clients that best serve specific network operating systems and their resources. 5. Comer – “Internetworking with TCP/IP. including knowledge and understanding of basic network structure and the characteristics of star. Concept of generic objects & Classes. types of inheritance. vol. properties of a class : Structural & behavioral. encapsulation. Kurose and Rose – “ Computer Networking -A top down approach featuring the internet” – Pearson Education 2. 3(4th Ed. Protected and Public Inheritance—Overloading—Direct and 19 . Leon. Internet Information Server. ASP. class as type. Widjaja – “Communication Networks” – TMH 3. Walrand – “Communication Networks” – TMH. Overloading. Types of Inheritance—Private. Introduction to C# Programming Language. assemblies. Memory Management and Pointers. 3. and Unix. 1. including Microsoft Windows NT. singles multiple & restricted.

robotics. Kohonen network Capabilities of multilayer perceptrons. breadth first seach. CS/MSc/2103 : ARTIFICIAL INTELLIGENCE & NEURAL NETWORK ARTIFICIAL INTELLIGENCE: Scope of AI: Games. limitations of symbolic approach to machine intelligence Perceptrons. Adaptive Resonance Theory. basic constructs and syntax of the language.Indirect base Classes –Abstract base Classes. use object serialization. branch and bound. linear separability Multilayer perceptron. Remote Method Invocation (RMI). Handling uncertainty. abstraction. Search space control : Depth first. learning automation. Use the java. complexity issues. natural language processing. learning by induction. importance of integrating symbolic and connectionist systems. training. use JDBC to access data from relational databases. genetic algorithm. vision and speech processing. Boltzmann machine and simulated annealing Hopfield net. Dynamic Binding. Resolution. Knowledge Representation :Predicate Logic . Modus pones. and perform basic network communication by using sockets. heuristic search – Hill climbing. neural nets-back propagation. expert systems. stability. Use of certainty factors. capacity. Reflection. AI techniques-search knowledge. Minimax search : Alpha-Beta cut offs. Skolemizing queries. energy. core advanced features which include such topics as Networking and Sockets. theorem proving. dependency directed backtracking. Structured Exception Handling. convergence theorem. connectionist expert systems 20 . Learning: Concept of learning. M2: ADVANCED JAVA Advanced Web-based programming with an emphasis on the Java language and platform. best first search. Unification. Probabilistic reasoning. NEURAL NETWORK: Motivation. Backpropagation. Backward reasoning : Use of no backtrack . Rule Based Systems : Forward reasoning : Conflict resolution. Structured Knowledge Representations : Semantic Net : slots. Fuzzy logic. MultiThreading and Lightweight Components (Swing). Java Beans. exceptions and defaults Frames. Application to optimization problems Unsupervised learning. Threading. Problem solving: State space search : Production systems. importance of Kolmogorov complexity.io package to read and write files. Probably Approximately Correct learning and neural networks Hybrid systems.

Gene Finding: predicting reading frames. hardware realizations. Linear discriminant functions: Perceptrons and training. Bayesian model selection. automata realizations. delta rule and back propagation. 5. Mobile Computing. Statistical Pattern Recognition: Patterns and classification. 2. feed forward networks. local alignment gapped and ungapped global alignment. Fuzzy set theory 1. 21 . Adaptive resonance architectures. discovering new sites. 2. Grammatical Inference. PATTERN RECOGNITION Introduction to pattern recognition and applications to OCR.I List of Electives: 1. Embedded System.CS/MSc/2104 : ELECTIVE . related techniques. maximal dependence decomposition. probability of error. Image Processing & Pattern Recognition. Multiple alignment: scoring model. Introduction to Statistical. Unsupervised learning and clustering. Motif finding: motif models. stochastic grammars. discriminant functions. Analysis of DNA microarray data using hierarchical clustering. Commercial importance of applications. signatures etc. and alignment. dynamic programming algorithms. homology. finding occurrence of known sites. Pattern associators and content addressable memories. 3. 6. VLSI Design. speech recognition. Neural and Structural Approaches. BIO-INFORMATICS: Sequence similarity. and pairwise alignment using Hidden Markov Models. Bio-informatics. nearest neighbour rule. Bayes decision rule. 7. Valiant"s framework. LMSE approaches. Pairwise alignment: scoring model. Parsing. Feature extraction. 4. Hopfield networks and unsupervised learning. expectation-maximization clustering. model-based clustering. Soft Computing. computational learning theory. heuristic alignment. Syntactic pattern recognition: Formal languages and grammars Pattern grammars and higher dimensional grammars. fingerprints. Neural Approach: Introduction to artificial neural networks.

kernel architecture. programming languages. sea-of-gates and standard cells. control & industrial automation. task synchronization. embadded operating system. circuit characterization. context switch. buffers. embedded system development system.11. interrupt basics. memory. network information appliances. Design Verification and Testing: simulation at various levels. analog-to-digital converters.3. system level test techniques. USB. design strategies for testing. ARM bus. Students will be required to undertake. keypad controllers. latches. fault models. 22 . including reprogrammable gate arrays. interrupt handling. chip level test techniques. VLSI DESIGN: Introduction to VLSI Technology: CMOS logic. MOS transistor theory. CMOS chip design options. LCD controllers. Systems Design and Methods: design strategies. Communication Principles : Parallel. real time clocks. including hardware definition languages such as VHDL and packages such as MCE BX. PCI bus. significant practical work asociated with the issues of the class. IrDa. structural and physical representations. wireless and layering. design technology. Protocols : 12C. performance estimation. UART. including finite state machines and control logic implementations via PLAs and ROM. design capture tools. Bluetooth. timers. control. design methods. serial. operating system. applications : consumer electronics. IEEE 802. counters. 4. processor technology. behavioral. ports. design rule verification. wireless communications Hardware architecture : processor. timing verification. development tools for host & target machines. CMOS Subsystem Design: datapath operations. memory elements. watchdog timers. including circuit and logic level. stepper motor controllers. pulse width modulators. real time and mobile operating system. as private study. FireWire. categories of embedded system. circuit and logic design. EMBEDDED SYSTEM: Introduction and Hardware Environment Overview of embedded system. processing technology. CAN.

Vikas Gupta.11 and HIPERLAN I and II. MFC Programming. check boxes. Binary and multi-level (M-ary) amplitude-shift keying (ASK). common controls (Radio buttons. Narrowband digital modulation. Embadded System Design. scroll bars. Collision Avoidance (RTS-CTS) protocols. Pub. The need for pulse shaping. MOBILE COMPUTING Introduction to wireless networking. Programming for embedded system by Dr. Calculation of bit-error probabilities when the channel is affected by the addition of Gaussian noise. An Embedded software primer by David E. Introduction to synchronous transmission. 2. managing texts). Project Studies Simple LED blinking program. icons. WILEY Dreamtech india Pvt. properties sheet. Multipath propagation Introduction to digital transmission. Pub. MFC fundamentals. Pub. frequency-shift keying (FSK) and phase-shift keying (PSK). protocol converter. Low Price Edition. Ref. device driver programming. message boxes. 23 . The need for modulation. The near far effect. Das & Verma. Programming Embedded Systems by Michael Barr. processing messages. Pub. MAC protocols for wireless LANs such as IEEE802. WILEY. Prasas. cursor. synchronisation and line-coding. by Herbert Schildt. menus. O'REILLY 5. buttons. Books : 1. 2. 3. TataMcGraw Hill. dialog boxes.VC++ Programming Introduction to MFC & windows. MAC protocols for digital cellular systems such as GSM. Pub. Hidden and exposed terminals. development of navigation system. Wideband modulation techniques to cope with intersymbol interference Direct sequence spread spectrum Adaptive Equalization Orthogonal frequency division multiplex Medium Access Control (MAC). Books : 1. Advantages and disadvantages of wireless networking Characteristics of radio propagation. serial communication programming for PC-to-PC communication. by Frank Vashid & Tony Givergis. Fading. Definition of bit-rate and signalling rate. Simon.

Klir & B.Evolution strategies(Ess). Hebbian learning. The boltzman machine.G. Multilayer Perceptron Model. Jang.Protocols supporting mobility.Fuzzy Logic: Classical Logic. Competitive learning networks. Mobile network layer protocols such as mobile-IP. Pearson “Neural networks: a comprehensive foundation”. R. PHI. Unsupervised and reinforcement Learning. Anderson J. Back Propagation Algorithm. Learning Paradigms-Supervised. Learning rules. “Neural Networks-A Comprehensive Foundations”. Fuzzy Equations. Sun. “Neuro-Fuzzy and Soft computing”. Kohonen self organizing networks. 2. 1998. Dynamic Host Configuration Protocol (DHCP). 1999. Aggregation Operations. PHI. New Jersey.analysis of selection algorithms. Associative Memories. Classical and Fuzzy Sets: Overview of Classical Sets. PHI. Unions.convergence. “An Introduction to Genetic Algorithm”. Reference: 1. Yuan.J. ANN architecture. 4. Goldberg.mutation. Applications of Artificial Neural Networks. Hertz J. Tabu Search.crossover. Mobile transport layer protocols such as mobile-TCP. “Introduction to the Theory of Neural Computation”. California.schema analysis. Melanie Mitchell. 3. Prentice-Hall International. 3. Hopfield Networks. Linguistic Variables. Fuzzy rule generation. Intersections. Applications. 2.Evolutionary programming(EP). Addison-Wesley. Other Soft computing approaches Simulated Annealing. Ant colony based optimisation. SOFT COMPUTING Introduction to artificial neural network Neural Networks: History. Genetic algorithms(Gas). G. Text: 1. ANN training Algorithms-perceptions. Krogh. Training rules. Operations on Fuzzy Sets: Compliment.A. Wireless Application Protocol (WAP). 6..Genetic Programming(GP). Pearson “Genetic Algorithms”. Fuzzy Arithmetic: Fuzzy Numbers. overview of biological Neuro-system. Fuzzy Logic Fuzzy Logic: Introduction to Fuzzy Logic. Combinations of Operations. Haykin. Delta. Lattice of Fuzzy Numbers. indirectTCP. 1991. 1999. Mathematical Models of Neurons. “An Introduction to Neural Networks”. Mizutani. 4. Palmer. Membership Function. Pearson “Fuzzy Sets & Fuzzy Logic”. 24 . etc. Arithmetic Operations on Intervals & Numbers.Markov & other stochastic models.Selecting.

Pattern recognition .Recursive Least-squares estimator .Newton's method .Maximum likelihood estimator .Random search .History of networking . & D.Adaptive neuro-fuzzy inference systems (ANFIS) –Architectures.Gauss-Newton method .Network devices .Other variants .Fuzzy reasoning . Fuzzy relations . Fuzzy if-then rules . Fuzzy rules and fuzzy reasoning .Gradient-based optimization -Steepest descent .Fuzzy sets and classic fuzzy operators . “Neural Networks: Algorithms.Addressing . Fuzzy clustering . Fuzzy inference systems-Mamdani's fuzzy models . Applications:-Data modeling . FUZZY SET THEORY Introduction : Objective. intersection.Recursive Least-squares estimator with forgetting factors . Applications and Programming Techniques”. (1992). Mass.5.Topologies .LAN & WAN 25 . Fuzzy Set Theory: Fuzzy sets.Network models .A.Levenberg-Margquardt method .Simulated annealing .Binary arithmetic . Skapura.Leastsquares estimator and its geometric interpretation . Gradient-free optimization -Genetic algorithms .M.Protocols . Regression and optimization:-Least-squares estimator-Matrix techniques .Step size determination .Learning rules .Adaptive fuzzy control CS/MSc/2111: NETWORK LAB & WEB-PAGE DESIGNING LAB NETWORK LAB: . MF formulation and parameterization .Routing . Overview. and complement . Addison Wesley.Tsukamoto's fuzzy models . 7. Sugeno's fuzzy models . Freeman J. Extended fuzzy union.Hybrid learning rules . Adaptive fuzzy inference systems :-Adaptive networks -Architectures .Extension principle .Downhill search . Reading.OthersFuzzy arithmetic.

Adding a Web Service to a Web Site. Adding Master Pages CS/MSc/2106 M1: ARTIFICIAL INTELLIGENCE LAB Programming in PROLOG.WEB-PAGE DESIGNING LAB: Visual Web Developer tools and features. Use UML where applicable.multiple inheritance. handling errors and exceptions. M2: JAVA LAB 1. Simple ASP. vectors. Assignments on class. SEMESTER – IV External Project. 6. 5. arrays Assignments on developing interfaces.NET Web Page. extending interfaces Assignments on creating and accessing packages Assignments on multithreaded programming. User Interface Design. M. overriding Assignments on wrapper class. applet programming and graphics programming Use of CASE tools Note: Use Java and C++ as programming language. inheritance. constructor. Student will do their project in any Industry / academic Institute. Simple Web Service. 26 . overloading. 3. Adding Data on a Web Page. 4.Sc. 2.

Sign up to vote on this title
UsefulNot useful