Booklet MTech CSE1 2nd Sem 2010 11

M. Tech.
CSE, 1st and 2nd Semester Syllabus 2010-11
Scheme 2010-11 M.Tech. 1ST YEAR (SEMESTER-I) COMPUTER SCIENCE & ENGINEERING
Sr. No.
1 2 3 4 5 6 7 8
Subject Code
NC-CSE-501 NC-CSE-503 NC-CSE-505 NC-CSE-507 NC-CSE-509 NC-CSE-511 NC-CSE-513 NC-CSE-515
Subjects
Foundations in Computer Science Advanced Resource Management Systems Advanced Database Management Systems C & Data Structures Advanced Computer Networks C & Data Structures Lab DBMS Lab Seminar Total
L
3 3 3 3 3 -
T
-
P
2 2 -
Contact Weightage Hours

3 3 3 3 3 2 2 2 21 3 3 3 3 3 1 1 2 19
M. Tech. CSE, 1st and 2nd Semester Syllabus 2010-11
Scheme 2010-11 M.Tech.1 YEAR (SEMESTER-II) COMPUTER SCIENCE & ENGINEERING

1stT
Sr. No. 1 2 3 4 5 6 7 8
Subject Code NC-CSE-502 NC-CSE-504 NC-CSE-514 NC-CSENC-CSENC-CSE-508 NC-CSE-510 NC-CSE-512
Subjects Analysis and Design of Algorithms Advanced Computer Architecture Modelling and Simulation Elective-II Elective-III Algorithms Lab Java Programming Lab Seminar
L 3 3 3 3 3 2
T -
P 2 2
-
Contact Hours 3 3 3 3 3 2 2 2 21
Weightage 3 3 3 3 3 1 1 2 19
Elective II
1. 2. 3. NC-CSE-520 Computer Graphics NC-CSE-522 Distributed Computing NC-CSE-506 Security and Cryptography
Elective-III
1. 2. 3. 4. NC-CSE-540 NC-CSE-542 NC-CSE-544 NC-CSE-516 Natural Language Processing Neural Networks and Fuzzy Logic Artificial Intelligence Object Oriented Analysis and Design
MARKS DISTRIBUTION (ACCORDING TO AUTONOMY)

FOR ALL THEORY COURSES: -
1. On semester evaluation of all theory courses total: Distribution
100 marks
I. Mid semester exam: II. Mid semester exam: Continues Evaluation Test (CET): Attendance: Teachers assessment: 2) End semester (final examination) of all theory courses Total: is of : 100 marks 200 marks 3) Total of on semester + end semester evaluation 4) To pass a theory course student should obtain Minimum: - 40 marks in on semester evaluation. : - 35 marks in end semester evaluation. Total: - 80 marks out of 200. Criterion for passing and failing the theory course: -
20 marks 20 marks 20 marks 20 marks 20 marks
a) If students fails in on semester evaluation despite passing in aggregate one will have to repeat that course. b) If student pass in on semester evaluation but fails in end semester exam he/ she will be permitted to appear in supplementary examination. c) If student is pass both in on semester evaluation and end semester evaluation but fails in total then He/ she would have to appear in supplementary exam. d) If attendance in a course is below 75%, the student shall not be permitted to appear in the End- Semester Examination.
FOR ALL PRACTICAL (LABORATORY) COURSES: I) On semester evaluation of all practical (laboratory) courses would be of total: 120 marks.
Distribution Performance of class practical: Reports of practical: II) End semester evaluation (final lab exam + oral or viva test) Total: 80 marks III) Total of on semester evaluation final lab examination + end semester evaluation is of : 200 marks IV) To pass a lab course student should obtain Minimum: 48 marks in on semester evaluation. 28 marks in end semester evaluation. Total- 80 marks out of -200 Criterion for passing and failing the lab course is just like theory course. 60 marks 60 marks
CALCULATION OF SEMESTER GRADE POINT AVERAGE: Semester grade point average (SGPA) is the weighted average of the grade for the subjects registered in a Semester and is computed as follows:
SGPA =
Ci Gi
Ci
Ci denotes the Credits (or Units) assigned to the ith subject and Gi denotes the Grade Point Equivalent to the Letter Grade obtained for the ith subject.
Cumulative Grade Point Average (CGPA) is the weighted average of the grades of the subjects for the registered in the semester.
Computer Science & Engineering I SEM M.Tech FOUNDATIONS IN COMPUTER SCIENCE NC-CSE-501
On Semester Evaluation: 100 End Semester Evaluation: 100 UNIT-1 Introduction to set theory, relation, function. Introduction, Basis notation, semantic, Eqvivalence of Wffs, normal form of Wffs, validity theorem, natural deduction, rules for Connectives, rules for quantifier, derived rules of inference, rules for operators, The resolution methods. UNIT 2 Finite automata and regular expression, Basis definition: Deterministic finite automata, Non-deterministic finite automata, Eqvilance of DFA and NFA, Finite automata with E-moves Equivalence of NFA with E-moves and NFA, regular expression, Equivalence From finite automata and regular expression, Moore Machine, Mealy Machine and their Equivalence. UNIT 3 Context free and context sensitive languages, Chomsky Normal form, Griebach normal form, Turing machine and their types. Design of Turing machine, Halting problems, Chomsky Hierarchies. UNIT 4 Hard NP complete problems, Verification of programs, Flow Chart programs, partial Connection, inductive assertation methods, and termination BOOKS: 1. Theory of Computation by Zohar and Manna 2. John C Martin: Introduction to language and theory of computation REFERENCES: 1. Theory of computer science(Auto Mata, Language & Computation)by K.L.P Mishra and N Chandershakaran 2. Introduction to Formal Language & Automata Peter Linz L 3 T 0 P 0
Computer Science & Engineering I SEM M.Tech ADVANCED RESOURCE MANAGEMENT SYSTEMS NC-CSE-503
On Semester Evaluation: 100 End Semester Evaluation: 100 L 3 T 0 P 0
Unit-I File and CPU Management File System: Functions of the systems, file access and allocation methods, Directory system: structured organization, Directory and file protection mechanism, implementation issues; hierarchy of file and device management. CPU Scheduling: Levels of scheduling, comparative study of scheduling algorithms, multiple processor scheduling. Distributed System Structure and File Systems Topology, Network Types, Communication, Communication Protocols, Robustness, Design issues Naming and Transparency, Remote File Access, Stateful Versus Stateless Service, File Replication, An example AFS. Unit-II Storage Management and Protection: Storage Management: Storage allocation methods: single contiguous allocation, multiple contiguous allocation, Paging, Segmentation, Combination of Paging and Segmentation, Virtual memory concepts, Demand paging, Page replacement algorithms, Thrashing Protection: Goals of Protection, Domain of Protection, Access Matrix, Implementation of Access Matrix, Revocation of Access Rights, Capability Based Systems, Language Based Protection Unit-III Deadlocks and Concurrency Control: Deadlock: Deadlock characterization, Deadlock prevention and avoidance, Deadlock detection and recovery, practical considerations. Concurrent Processes: Critical section problem, Semaphores, Classical process coordination, problems and their solutions, interprocess communication, multithreading. Unit-IV Case Studies: 1.The Mach System: History, Design Principles, System Components, Process Management, Interprocess Communication, Memory Management, Programmer Interface 2. The Nachos System: Overview, Nachos Software Structure, Sample Assignments, Obtaining a Copy of Nachos, Conclusions
Reference Books: 1. Peterson J L & Silberschatz, Operating System concepts Addison Wesley 2. Brinch, Hansen, Operating System Principles PHI 3. Tenanbaum A S Operating System, PHI.
Computer Science & Engineering I Semester M.Tech Advanced Database Management Systems NC-CSE-505
Unit 1 Parallel & Distributed Databases Architecture for parallel databases, Parallel query evaluation. Parallelizing individual operations. Introduction to distributed databases. Data fragmentation, Replication, distributed DBMS architectures. Storing data in a distributed DBMS. Distributed catalog management, distributed query processing. Updating distributed data. Introduction to distributed transactions. Distributed concurrency control. Distributed recovery. Unit 2 Object Database Systems & XML Overview of Object-Based Databases, structured Data Types. User defined ADT. Inheritance. Objects & reference types. Database design for an ORDBMS. Challenges in implementing an ORDBMS. Database schema design for OODBMS, comparing RDBMS,OODBMS & ORDBMS,Performance Tuning Tunable parameters, tuning the schema, indices, tuning transactions, performance bench marks. Unit 3 Data Warehousing & Data Mining Architecture of Data Warehouse, warehouse schemas, Introduction to Data Mining, counting co-occurrences. Mining for rules. Tree structured rules. Clustering, Similarity search over sequences. Unit 4 Advanced Topics Advanced transaction processing., integrated access to multiple data source, mobile databases, main memory databases, multimedia databases, GIS, temporal & sequence databases, Web interfaces to databases, client side scripting, web servers and sessions. Note: The examiner will set nine questions, taking first question from entire syllabus, and two questions from each unit. Students are required to attempt five questions in all selecting at least one question from each unit and first question is compulsory. All questions will carry equal marks. Books Recommended 1. R. Ramakrishnan & J. Gehrke Database Management Systems: MGH. International Ed. 2000. 2. Korth. Silberschatz. Sudarshan: Data Base concepts. MGH. 2001. 3. C.J. Date. Database Systems:. 7th Ed.. Addison Wesley. Pearson Education. 2000.
Computer Science & Engineering I SEM M.Tech C & DATA STRUCTURES NC-CSE-507
UNIT-I C FUNDAMENTALS Data Types: Elementary & Structured data types, User defined data types (Using Typedef & Enum), Selection statements, Loops & their applications, Local & External variables. Functions, Argument passing, Call by value & Call by reference, Recursive functions. UNIT-II ARRAYS & FILES One-Dimensional & Multidimensional arrays, Processing of arrays, Pointers & Arrays, Strings, Arrays of strings, String applications, Structures, Arrays of structures, Unions, Searching & Sorting. File handling, File operations, Errors in file operations & Error handling, Macros & Storage Classes. UNIT-III QUEUES & LINKED LISTS Operations of queues, Linear queue, Circular queue, Priority queue, Applications of queues. Operations on lists, Implementation of lists, Dynamic implementation of lists, Circular lists, Doubly Linked Lists: Operations & Implementation. Application queues (Administration, public & private, transactional & non transactional queues etc.). UNIT-IV TREES & GRAPHS Simple trees, Binary trees, Operations & Implementation of binary trees, Binary tree traversals: Pre-order, in-order and post-order traversals, Depth First Search, Breadth First Search, Use of Stacks for expression evaluation, B-trees, B+ trees, AVL trees, Red Black trees, Applications of trees. Directed & Undirected graphs, Operations & Implementation of graphs, Graph traversals, Minimum-spanning trees. Note: The examiner will set nine questions, taking first question from entire syllabus, and two questions from each unit. Students are required to attempt five questions in all selecting at least one question from each unit and first question is compulsory. All questions will carry equal marks.
10
Reference Books: 1. The C Programming Language by Dennis M. Ritchie, Brian W. Kenighan, PHI Pub. 2. Let Us C by Yashwant Kanetkar, BPB Pub. 3. Programming Language Concepts, Design & Implementation by T.W. Pratt, Pearson Education. 4. Data Structures using C by A.M.Tenenbaum,Langsam,Moshe J Angentem, PHI Pub. 5. Data Structures and Algorithm s by Alfred V.Aho, Hop Croft Vllman, Pearson Education. 6. Theory & Problems of Data Structures by Jr.Symour Lipschetz, Schaums outline, TMH.
11
Computer Science & Engineering I SEM M.Tech ADVANCED COMPUTER NETWORKS NC-CSE-509
On Semester Evaluation: 100 End Semester Evaluation: 100 UNIT I Basics of Computer Networks, Need and evolution of computer networks, LAN, MAN, WAN and Wireless networks, Bandwidth, Logical and physical topologies, Connecting devices, OSI model, Functions of each layer, Services and protocols of each layer, TCP/IP model, Physical Layer, Guided and Unguided media, Media connectors, Dial-Up Modems, DSL, Cable TV Networks. UNIT II Data Link Layer, LLC & MAC sub layer, MAC addressing, Error control and Flow control, Error Detection and Correction methods, Elementary data link layer protocols, Sliding window protocols, HDLC Protocol, PPP Protocol, Channel allocation problem Static and Dynamic, Multiple access protocol- ALOHA, CSMA/CA, CSMA/CD, Token bus, Token ring, FDDI, 802.11, BLUETOOTH. UNIT III Network Layer, IP addressing, IP address classes, Subnet addressing, Subnetting, subnet mask, IP, ARP, RARP, BOOTP, DHCP, ICMP, Routing algorithms - Optimality principle, Shortest path routing, Hierarchical routing, Distance vector routing, Link state routing, Routing for mobile host, Routing protocols- IGP & EGP (RIP, IGRP, EIGRP, OSPF, BGP etc.), IPv6, ATM Networks. UNIT IV Desing issues of Transport Layer, Session Layer and Application layer, Protocols TCP and UDP, Three way handshakes open connection establishment and connection termination, DNS, Email-SMTP, POP, IMAP, FTP, NNTP, HTTP, Telnet. Note: The examiner will set nine questions, taking first question from entire syllabus, and two questions from each unit. Students are required to attempt five questions in all selecting at least one question from each unit and first question is compulsory. All questions will carry equal marks. Reference Books : 1. Data Communications and Networking, 4 th edition, Behrouz A Forouzan, Tata McGraw Hill. 2. Data and Compuer Communication,6th edition, William Stalling, Pearson Education 3. Computer Networks, PHI, Tanenbaum. 4. Cisco Certifide Network Associate, Todd Lammle, CCSI M. Tech. CSE, 1st and 2nd Semester Syllabus 2010-11 12 L 3 T 0 P 0
COMPUTER SCIENCE & ENGG. M.TECH SEMESTER-I NC-CSE-511 C & Data Structures Lab On Semester Evaluation: 120 End Semester Evaluation: 80 L 0 T 0 P 2
1. Write a program to check whether a number is Armstrong or not. 2. Write a program to calculate factorial of a number recursively. 3. Write a program to implement call by value and call by references. 4. Write a program to copy the content of a file to another file. 5. Write a program to implement a Stack of 10 integers. 6. Write a program to implement a circular queue. 7. Write a program to implement Binary search algorithm. 8. Write a program to implement bubble sort. 9. Write a program to implement Merge sort. 10. Write a program to insert, delete and modify a node in linked list. 11. Write a program to reverse the linked list. 12. Write a program to implement various tree traversal algorithms. 13. Write a program to implement BFS in graphs. 14. Write a program to implement tridiagonal sparse matrix efficiently.
13
COMPUTER SCIENCE & ENGG. M.TECH SEMESTER-I NC-CSE-513 DBMS LAB On Semester Evaluation: 120 End Semester Evaluation: 80
L 0
T 0
P 2
1. Write the queries using Data Definition Language commands such as Create, Alter, trunc, rename, drop etc. using constraints (Primary key, Unique, Check, Not Null and Foreign Key). 2. Write queries using Data Manipulation Language commands such as Insert, Delete, Update, merge etc. 3. Write SQL queries to retrieve the data (Select Clause, Where clause etc.) from the database using Arithmetic operators (+, -, /, * etc.), Logical operators (AND, OR, NOT), Comparison operators (=, <, >, etc.), SQL operators (Between. AND, IN (List), Like, IS NULL, ||,), column aliases, Order by clause etc.
4. Write SQL query using character, number, date, conversion, and general functions. 5. Write SQL queries for extracting data from more than one table using various joins available in SQL. 6. Write SQL queries using group functions, group by clause, sub queries and nested queries. 7. Write SQL queries to implement the concepts for ROLLBACK, COMMIT & SAVEPOINTS. 8. Create views, Index, cursors and synonyms for the user tables. 9. Write a program in PL/SQL to implement control statements. 10. Write a program in PL/SQL to implement procedure and function. 11. To familiarize with the Distributed Data Base Management system 12. To familiarize with the Object Oriented Data Base Management system
14
15
Computer Science & Engineering I SEM M.Tech NC-CSE-521 Java Programming

On Semester Evaluation: 100 T P End Semester Evaluation: 100 L 3 0 0
Unit-1 Introduction to Java & Principles of Object Oriented Progamming: Basic Concepts of OOP and its Benefits. Application of OOP, comparing Java with C& C++, Importance & features of Java, Javas Magic:The Byte-code, Java Program Structure, Defining class & methods . Array & Strings. Inheritance, Using Final Modifier Understanding Packages, Understanding CLASSPATH, Standard Packages, Access Protection in Packages, Concept of Interface. Exception Handling: The Idea behind Exceptions, Types of Exceptions, Dealing with Exceptions, Defining Your Own Exceptions, Checked and Unchecked Exceptions. Multithreading Programming: The Java Thread Model, Understanding Threads, The Main Thread, Creating a Thread: extending Thread and implementing Runnable, multithreaded programming , Thread Priorities, Synchronization of threads, Deadlocks. Input/Output in Java: I/O Basic, Byte and Character Structure, I/O Classes, Reading Console Input, Writing to Console Output, Reading and Writing on Files, Random Access Files, chaining streams. Unit-2 Creating Applets in Java: Applet Basics, Applets Architecture , Applet Life Cycle, Simple Applet Display Methods, Requesting Repainting, Using the Status Window, The HTML APPLET Tag, Passing parameters to Applets. Networking: Basics, Networking Classes and Interfaces, Using Java.net Package, doing TCP/IP and Datagram Programming by Server Socket and Socket Classes. Java Data Base Connectivity(JDBC) Database Connectivity- Relation Databases, JDBC API, Reusing Database Objects, Transactions, Advance Techniques. Working with Windows: AWT Classes, Window Fundamentals, Working with Frame, Creating a Frame Window in an Applet, displaying information within a Window. Unit-3 Event Handling: Two Event Handling Mechanisms, The Delegation Event Model, The Event Handling Process, Event Classes, Sources of Events, event Listener Interfaces, Using the Delegation Event Model, Adapter Classes. Java Servlet Programming: Role and Advantages of Java Servlets in Web application Development. HTTP Servlets- Introduction, page generation, server side includes, servlet chaining, java Server pages. M. Tech. CSE, 1st and 2nd Semester Syllabus 2010-11 16
Server Life Cycle- Servlet Alternative, Reloading, Init and Destroy, Single Thread Model, Background Processing Last Modified times, synchronization, Persistent state capabilities. Retrieving Information- Initialization Parameters, Methods of receiving Information about Client-server and clients request. Unit-4 A Tour of Swings: Japplet, Icons & Labels, Text Fields, Buttons, Combo boxes, Tabbed Panes, scroll panes, trees, labels, exploring swing. Java Beans & RMI: Introduction to Java Beans, application of Java Beans, Application Builder tools, using Bean developer kits, JAR Files, Overview of RMI, client/server application using RMI, using RMI in Beans, building multicast beans. Note: The examiner will set nine questions, taking first question from entire syllabus, and two questions from each unit. Students are required to attempt five questions in all selecting at least one question from each unit and first question is compulsory. All questions will carry equal marks. Books Recommended: 1. Java-2 The complete Reference by Patrick Naughton and Herbertz Schildt, TMH. 2. Beginning JAVA 2 (JDK1.3 Edition), Ivor Horton, WROX Public. 3. Thinking in Java, Bruce Eckel 4. JAVA 2 UNLEASHED, Tech Media Publications. 5. JAVA 2(1.3) API Documentations. 6. Programming with Java, By E Balaguruswamy.
17
Computer Science & Engineering I SEM M.Tech FOUNDATIONS IN COMPUTER SCIENCE NC-CSE-525
On Semester Evaluation: 100 End Semester Evaluation: 100 L 3 T 0 P 0 Unit-I Set Theory: Introduction to set theory, Set operations, Algebra of sets, combination of sets, Duality, Finite and Infinite sets, Classes of sets, Power Sets, Multi sets, Cartesian Product, Representation of relations, Types of relation, Binary Relations, Equivalence relations and partitions, Partial ordering relations and lattices, Mathematics Induction, Principle of Inclusion & Exclusion, Propositions. Function and its types, Composition of function and relations, Cardinality and inverse relations. Functions & Pigeo principles. Unit-II Propositional Calculus and Recurrence Relation: Basic operations: AND (^), OR (v), NOT (~), Truth-value of a compound statement, propositions, tautologies, contradictions. Linear recurrence relation with constant coefficients, Homogeneous solutions, Particular solutions, Total solution of a recurrence relation using generating functions. Unit-III Grammars: Definitions, Context free and Context sensitive Grammar, Ambiguity, Regular Grammar, Reduced forms, Removal of useless symbols and unit production, Chomsky Normal form (CNF), Griebach Normal Form (GNF). Unit-IV Concepts in automata Theory: Finite Automata and Regular Expression: Finite State System, Basic Definition Non-Deterministic finite Automata (NDFA). Deterministic finite Automata (DFA), Equivalence of DFA and NDFA, Finite Automata with E-moves. Regular Expression, Equivalence of finite Automata and expression. Regular expression conversion and Vice-Versa. Introduction to Machines: Concept of basic machines, Properties and limitations of FSM, Moore and Mealy Machines, Equivalence of Moore and Mealy Machines. Conversion of NFA and DFA by Ardens method. Turing Machines, Deterministic and Non-Deterministic Turing Machines Note: The examiner will set nine questions, taking first question from entire syllabus, and two questions from each unit. Students are required to attempt five questions in all selecting at least one question from each unit and first question is compulsory. All questions will carry equal marks. Reference Books: 1. R.B. Patel, & Prem Nath, Theory of Automata and Formal Languages, Umesh Publication, New Delhi, Ist Edition 2005, ISBN-81-88114-53-7, pp. 1-496. 2. John C. Martin: Introduction to Language and the Theory of Computation, MGH. 3. Lewis & Papadimitriou: Elements of the Theory of Computation. PHI. M. Tech. CSE, 1st and 2nd Semester Syllabus 2010-11 18
4. Daniel I.A. Cohen: Introduction to Computer Theory: John Wiley. 5. J.E. Hoproft and J.D. Ullman: Introduction to Automata Theory Languages and Computation, Narosa. 6. Introduction to Automata Theory, Language & computations Hoproaft & O.D. Ullman, R. Motwani. 7. Theory of Computer Sc. (Automata, Languages & Computation): K.I..P. Mishra & N. Chandershekaran. 8. Introduction to formal language & Automata- Peter Linz.
19
2nd Semester (CSE) ANALYSIS AND DESIGN OF ALGORITHMS NC-CSE-502

L 3 T 0 On Semester Evaluation- 100 Marks End Semester Evaluation-100 Marks There are NINE questions in a set of question-paper. All questions carry equal marks. Attempt five questions in all. FIRST question is compulsory which covers the whole syllabus. Attempt ONE question from each of other four Units.
Note: - 1. 2. the
UNIT-I Introduction: Algorithm, Analyzing algorithm, Designing algorithm, Concept of algorithmic efficiency, Run time analysis of algorithms, Asymptotic Notations, recurrences, divide and conquer algorithms. UNIT-II Greedy method: General method, elements of greedy strategy, problem solving using greedy method, knapsack problem. Dynamic programming: General method, Principle of optimality, elements of dynamic programming, problem solving using dynamic programming, knapsack problem. UNIT-III Graph algorithms: Single source shortest paths algorithm, Single source shortest paths in directed acyclic graphs, Dijkstras algorithm. Flow Networks: Flow networks, ford fulkerson method, Maximum bipartite matching. Sorting Networks: Comparison networks, The zero-one principle, Bitonic Sorting network. Backtracking: Overview, 8-Queen problem and Knapsack problem. UNIT-IV Introduction to Approximation algorithms, Randomized algorithms: indicator random variables, algorithms, Linear programming: formulating problems as linear programs, simplex algorithms, Geometric algorithms: introduction to line segment, convex hull, Numerical algorithms: elementary number theoretic notions, solving modular linear equations, Internet algorithms. Text Books: 1. E. Horowitz, S.Sahni and s. rjasekaran, Fundamentals of computer algorithms, Galgotia publications. 2. T.H.Cormen, Leiserson, Rivest and Stein, Introduction of computer algorithms, PHI.
20
Reference Books: 1. Sara Basse, A.V. Gelder, Computer algorithms, Addison Wesley. 2. Tanenbaum, Data structures using C
21
2nd Semester (CSE) ADVANCED COMPUTER ARCHITECTURE NC-CSE-504

L 3 T 0 On Semester Evaluation- 100 Marks End Semester Evaluation-100 Marks There are NINE questions in a set of question-paper. All questions carry equal marks. Attempt five questions in all. FIRST question is compulsory which covers the whole syllabus. Attempt ONE question from each of the other four Units.
Note: 1. 2.
UNIT-I General System Architecture: Flynns classification of computers (SISD, MISD, MIMD); Store program control concept, Multilevel viewpoint of a machine: digital logic, micro architecture, ISA, operating systems, high level language; structured organization. Concepts of RISC and comparison with CISC processors; addressing modes: register, immediate, direct, indirect, indexed; Operations in the instruction set; Arithmetic and Logical, Data Transfer, Machine Control Flow, Asynchronous Data Transfer. UNIT-II Basic non-pipelined CPU Architecture: CPU Architecture types (accumulator, register, stack, memory/ register) detailed data path of a typical register based CPU, Principles of instruction decoding and implementation, implementation of control unit, Hardwired control design method, Micro programmed control unit, microinstruction sequencing. Bus Control, Instruction codes, computer register, computer instructions, timing and control, type of instructions, memory reference, register reference. I/O reference, Instruction Formats, Types of interrupts; Programmed I/O, DMA & Interrupts. UNIT-III Memory Hierarchy & I/O Techniques: The need for a memory hierarchy (Locality of reference principle), Memory hierarchy in practice: Cache, main memory and secondary memory, Concepts of memory compaction, virtual memory, Memory parameters: access/ cycle time); Main memory (Semiconductor RAM & ROM organization, Static & dynamic memory types); Cache memory (Associative & direct mapped cache organizations. Allocation & replacement polices. UNIT-IV Advanced Computer organization: Parallel Processing and its applications; Parallelism in uniprocessor system; Processor level parallelism (Multiprocessor systems overview). Principles of pipelining: Pipelining: An overlapped parallelism, Instruction and arithmetic pipelining; principles of designing pipeline processors: Instruction prefetch and branch handling, Data Buffering and busing structures, Internal forwarding and Register Tagging.
22
Text Books: 1. Computer Organization and Design, 2nd Ed., by David A. Patterson and John L. Hennessy, Morgan 1997, Kauffmann. 2. M. Morris Mano Computer System and Architecture, PHI. 3. Computer Architecture and Organization, 3rd Edi, by John P. Hayes, 1998, TMH. Reference Books: 1. Computer Architecture and Parallel Processing, By Kai Hwang and Faye A. Briggs, McGraw-Hill 2. Operating Systems Internals and Design Principles by William Stallings,4th edition, 2001, Prentice-Hall Upper Saddle River, New Jersey 3. Computer Organization, 5th Edi, by Carl Hamacher, Zvonko Vranesic, 2002, Safwat Zaky. 4. Structured Computer Organization by A.S. Tanenbaum, 4th edition, Prentice-Hall of India, 1999, Eastern Economic Edition. 5. Computer Organisation & Architecture: Designing for performance by W. Stallings, 4th edition, 1996, Prentice-Hall International edition.
23
2nd Semester (CSE) MODELING AND SIMULATION NC-CSE-514

Note: - 1. 2.
UNIT-I Systems Models and simulation: continuous and discrete, static and dynamic, deterministic and stochastic systems, discrete event simulation, time advance mechanisms, continuous simulation, Monte Carlo simulation modeling of complex systems, advantages and disadvantages, weaknesses of computer simulation, area of application. UNIT-II Probability and statistics: mean variance, probability distribution, random number generation, methods of generating random variates, inverse transforms, discrete random variates, generating correlated random numbers. UNIT-III Queuing models: single server and multiple server systems, arrival and departure patterns, theoretical results for some queuing systems. UNIT-IV Matlab environment: programming, modeling, with matrices, simulation in Matlab, introduction to dynamic system simulation using SIMULINK, applications of simulink, Validation, Verification techniques, statistical methods for verification, confidence interval approach, time series approach, output data analysis. Books: 1) Banks J. Carson J.S. and Nelson B: Discrete Event system simulation, PHI. 2) Celler F. E.: Continuous system simulation, Springer verlag 3) Athanasios Papoulis: Probability Random variables and Statistics Processes, Mc Graw Hill. 4) Reference manual & users guide on Matlab
24
2nd Semester (CSE) COMPUTER GRAPHICS NC-CSE-520

Note: - 1. 2. the
UNIT-I Introduction: Survey of computer Graphics and its applications, Interactive and passive graphics, introduction to GKS primitives, display processors. Graphics Devices: Display systems-refresh CRTs, raster scan and random scan monitors, Grey shades, Interlacing, beam penetration shadow mask monitors, look up tables, plasma panel, LED and LCD monitors, VGA and SVGA resolutions, Hardcopy devices printers, plotters, interactive input devices-mouse, digitizing tablet, light pan, touch panels, image scanners, voice systems, joy stick, track ball. UNIT-II Drawing Geometry: Coordinate System, resolution, use of homogenous coordinate system, scan conversion, symmetrical DDA, simple DDA, Bresenhams line drawing algorithm, Circle drawing using DDA and polar coordinates, Bresenhams circle drawing algorithm, generation of ellipse. UNIT-III 2-D Transformations: Translation, rotation, scaling, mirror reflection, shearing, zooming, panning, input techniques pointing, positing, rubber band methods and dragging, tweening. Graphics Operations: Clipping-line clipping using Sutherland-Cohen and midpoint subdivision algorithm, polygon clipping, window and view port, windowing transformation, Filling stack based fill algorithm, scan-line seed fill algorithm. UNIT-IV 3-D Graphics: 3D modeling of objects, 3D display techniques, coordinate system, 3D transformation matrices for translation, scaling and rotation, parallel projection, perspective projection, hidden surface removal Z buffer, backface, scan-line, depthsorting, area subdivision, Shading-modelling, light intensities, gouraud shading, phong shading. Multimedia: Concepts of Hypertext/Hypermedia, Multimedia applications, multimedia authoring, multimedia hardware, images, bitmaps, and windows paint brush. M. Tech. CSE, 1st and 2nd Semester Syllabus 2010-11 25
References: 1. Computer Graphics Donald Hearn, M.pauline Baker-PHI 2. Principles of Interactive Computer Graphics-Newman & Sproull McGraw Hill 3. Multimedia Systems- John F. Koegel Bufford Addison Wesley 4. Computer Graphics Principles & Practice Foley etc.- Addison Wesley 5. Procedural elements of Computer Graphics Rogers McGraw Hill 6. Fundamentals of Computer Graphics and Multimedia D.P. PHI
26
2nd Semester (CSE) DISTRIBUTED COMPUTING NC-CSE-522

Note: - 1. 2. the
UNIT-I Introduction to Distributed System: Goals, Hardware concepts, Software concepts, and Client-Server model. Examples of distributed systems. Communication: Layered protocols, Remote procedures call, Remote object invocation, Message-oriented communication, Stream-oriented communication. UNIT-II Processes:Threads, Clients, Servers, Code Migration, Software agent. Naming:Naming entities, Locating mobile entities, Removing un-referenced entities. Synchronization:Clock synchronization, Logical clocks, Global state, Election algorithms, Mutual exclusion, Distributed transactions. UNIT-III Consistency and Replication:Introduction, Data centric consistency models, Client centric consistency models, Distribution protocols, Consistency protocols. Fault Tolerance:Introduction, Process resilience, Reliable client server communication, Reliable group communication. Distributed commit, Recovery. Security:Introduction, Secure channels, Access control, Security management. UNIT-IV Distributed File System:Sun network file system, CODA files system. Case Study:CORBA, Distributed COM, Globe, Comparison of CORBA, DCOM, and Globe. Text Books: 1. A. Taunenbaum, Distributed Systems: Principles and Paradigms 2. G. Coulouris, J. Dollimore, and T. Kindberg, Distributed Systems: Concepts and Design, Pearson Education. References: 1. M. Singhal, N. Shivaratri, Advanced Concepts in Operating Systems, TMH.
27
2nd Semester (CSE) SECURITY & CRYPTOGRAPHY NC-CSE-506

Note: - 1. 2.
UNIT-I Introduction to Cryptography: Concepts, Basic objectives of cryptography, Block ciphers: Design Principles and Modes of operation, how crypto system fail, choosing between strong and weak crypto, security model, cryptographic techniques substitution and transposition techniques, steganography techniques, Basic issues in secret key management, random key generation, Key distribution centers, Maintaining keys and system security, Types of Attacks. UNIT-II Symmetric & Asymmetric key Cryptography: System Level security aspects: Sniffing, spoofing, viruses, worms, Trojan horses, and their security. Symmetric Cryptography: Algorithm types and modes block cipher design principals and criteria, DES, IDEA, RC5, BLOWFISH. Asymmetric Cryptography: Principal of public key crypto systems, RSA algorithm, MD5, Diffie-Hellman Public key exchange. UNIT-III Web Security: Web Security consideration, secure socket layer, transport layer security, and secure electronic transaction, secure virtual private network (VPN) technology: IPSEC proxy Cryptography, IPSEC encrypting router, and site to site encryption, Internet firewalls, IPSEC firewall. UNIT-IV Network Security: Authentication applications Protocol-Kerberos, Authentication Service-Basic issues with Electronic Mail Security, technology-offline message keying, Digital Signatures, secure E-mail client. Public Key Certificates: Distributing Public keys, technology-Public Key Certificates, Certificates distribution, centralized certification authority, hierarchical certification authority. Books Recommended: 1. Richard E-Smith, Internet Cryptography, Addision Wesley, 2nd Ed. 2. Cryptography and network security Atul Kahate (TMGH). 3. Cryptography and network security- principal and practice William Stallings (3rd Edition, Person Prentice Hall). M. Tech. CSE, 1st and 2nd Semester Syllabus 2010-11 28
4. Network Security private communication in a practice chartic Kaufman, Radio

Perl man, Mike spicier (2nd Edition PearsonPrintice Hall).
29
2nd Semester (CSE) NATURAL LANGUAGE PROCESSING NC-CSE-540

Note: - 1. 2.
UNIT-I Goals of NLP: Survey of applications, Levels of linguistic processing: morphology, syntax, semantics, Language processors: recognisers, transducers, parsers, generators, Language as a rulebased system. Resources for NLP: lexicons and knowledge bases. UNIT-II Elements of formal language theory: alphabet, string, language, grammar, productions, symbol vocabulary, generator, recogniser, procedure. Types of grammar: the Chomsky Hierarchy. Computational morphology: lemmatisation, Part-of-Speech Tagging ,Finite-State Analysis. UNIT-III Parsing:definition of a parser; derivations ,basic parsing strategies for context free grammars ,determinism and non-determinism; decidability ,data structures and algorithms for parsing ,unification based grammar formalisms. UNIT-IV Ambiguity and its resolution: Syntactic ambiguities and heuristics, lexical ambiguities and selectional restrictions ,indeterminacy of reference Generation and Dialogue: Syntactic generation algorithms and reversibility, text planning, modeling dialogue agents. Text Books: 1. Allen, J., Natural language understanding. 2nd edition. Redwood City, CA: 1994. Benjamin/Cummings. Reference Books: 1. Grosz, B.J., Sparck Jones, K. & Webber, B.L. (eds) Readings in natural language processing. Los Altos, CA, 1986: Morgan Kaufmann. 2. Jurafsky, D. & J. Martin. 2000. Speech and Language Processing: An Introduction to Natural Language Processing, Computational Linguistics, and Speech Recognition Prentice Hall.
30
2nd Semester (CSE) NEURAL NETWORKS AND FUZZY LOGIC NC-CSE-542

Note: - 1. 2. the
UNIT-I Neural Networks: History, overview of biological Neuro-system, Mathematical Models of Neurons, ANN architecture, Learning rules, Learning Paradigms-Supervised, Unsupervised and reinforcement Learning, ANN training Algorithms-perceptions, Training rules, Delta, Back Propagation Algorithm, Multilayer Perceptron Model, Hopfield Networks, Associative Memories, Applications of Artificial Neural Networks. UNIT-II Fuzzy Logic: Introduction to Fuzzy Logic, Classical and Fuzzy Sets: Overview of Classical Sets, Membership Function, Fuzzy rule generation. Operations on Fuzzy Sets: Compliment, Intersections, Unions, Combinations of Operations, Aggregation Operations. Fuzzy Arithmetic: Fuzzy Numbers, Linguistic Variables, Arithmetic Operations on Intervals & Numbers, Lattice of Fuzzy Numbers, Fuzzy Equations. UNIT-III Fuzzy Logic: Classical Logic, Multivalued Logics, Fuzzy Propositions, Fuzzy Qualifiers, Linguistic Hedges. Uncertainty based Information: Information & Uncertainty, Nonspecificity of Fuzzy & Crisp Sets, Fuzziness of Fuzzy Sets. UNIT-IV Introduction of Neuro-Fuzzy Systems, Architecture of Neuro Fuzzy Networks. Application of Fuzzy Logic: Medicine, Economics etc. Genetic Algorithm: An Overview, GA in problem solving. Text Books: 1. J. A. Anderson, An Introduction to Neural Networks, PHI, 1999. 2. Hertz J. Krogh, R.G. Palmer, Introduction to the Theory NeuralComputation, Addison-Wesley, California, 1991. 3. G.J. Klir & B. Yuan, Fuzzy Sets & Fuzzy Logic, PHI, 1995.
of
31
Reference Books: 1. Neural Networks-A Comprehensive Foundations, Prentice-Hall International, New Jersey, 1999. 2. J. A. Freeman, D.M. Skapura, Neural Networks: Algorithms, Applications and Programming Techniques, Addison Wesley, Reading, Mass, (1992). 3. Melanie Mitchell, An Introduction to Genetic Algorithm, PHI, 1998.
32
2nd Semester (CSE) ARTIFICIAL INTELLIGENCE NC-CSE-544

Note: - 1. 2. the
UNIT-I Introduction: foundation and history of AI, AI problems and techniques. AI programming languages, Problem spaces and searches, Blind search strategies, Breadth first Depth first Heuristic search techniques Hill Climbing Best first A Algorithms AO* algorithm game tress, Min-max algorithms, game playing Alpha beta pruning. UNIT-II Knowledge representation issues predicate logic: logic programming Semantic netsframes and inheritance, constraint propagation; Representing Knowledge using rules, Rules based deduction systems. Reasoning under uncertainly, Review of probability bays probabilistic interferences and Dempster Shafer theory, Heuristic methods, symbolic reasoning under uncertainty Statistical reasoning fuzzy reasoning, temporal reasoning non-monotonic reasoning. UNIT-III Natural language processing: Introduction, Need for NLP, Overview of linguistics, Grammars and languages, Basic parsing Techniques, Semantic analysis and Representation Structures, Natural language generation, Natural language systems. UNIT-IV Expert systems: Introduction, History of Expert Systems, Rule-based System architectures, Nonproduction System architectures, dealing with uncertainty, knowledge acquisition and validation, knowledge system building tools, Application Areas of Expert Systems, Benefits, Problems and Limitations of Expert Systems, introduction to MYCIN, DENDRAL. Books Recommended: 1. Elain Rich and Kevin Knight, Artificial Intelligence, Tata McGraw-Hill, New Delhi. 2. Staurt Russel and other Peter Norvig, Artificial Intelligence a Modern Approach, Prentice Hall. 3. Patrick Henry Winston, Artificial Intelligence, Addison Wesley, third Ed.
33
4. Artificial Intelligence & Expert System By Patterson PHI.
2nd Semester (CSE) OBJECT ORIENTED ANALYSIS AND DESIGN NC-CSE-516

Note: - 1. 2. the
UNIT-II Introduction to Object Orientation: Real-world Domains, Object oriented approach and technology, Objects Instances and Concepts. Objects and Classes of Objects, Generalization and inheritance, Grouping constructs, Aggregation, Generalization as extension and restriction, Multiple inheritance, Meta Classes, Object Containment, Object Persistence. Object Oriented Features: The Notion of Encapsulation and Information Hiding. Object Identity: Entity and Attributes, Data and knowledge, Relationship between Objects/Link and Association, Object oriented Development Life Cycle. UNIT-II Object Oriented Analysis: Introduction, Use-Case Driven Object-Oriented Analysis, Use-Case Model, Different Approaches for identifying the classes, Identifying the elements of an Object model, Dynamic Model, Functional Model, Classes, Responsibilities, and Collaborators. UNIT-III Object-Oriented System Design: Object-Oriented design introduction, System design concepts and the Object-Oriented Approach, Conventional versus Object Oriented approaches, The generic design interfaces: View Layer interface design, Access Layer: Object storage and object interoperability, Design patterns, Frameworks, Designing Methods and Protocols. UNIT-IV Object-Oriented Designing with UML: UML and the System Design: Introduction to the Unified Modeling Language (UML), the unified approach, UML Object Constraint Language, Static class diagram, Use case diagram, Behavior diagram relationships.
34
Case Study: Object Basics: A Payroll program, Object Oriented Analysis Process: Analyzing the ViaNet Bank ATM using a Use-Case Driven Process, Access Layer: Designing the Access Layer for the ViaNet Bank ATM. Books Recommended: 1. Rambough, Object Oriented Modeling and Design, PHI 2. Ali Bahrami: Object-oriented systems Development, McGrawHill, 1999 3. Grady Booch: Object-oriented analysis and design, Addison Wesley, 1994. 4. Roger S Pressman, Software Engineering -A Practitioners Approach, The McGraw Hill Publications V edition.
35
2nd Semester (CSE) ADVANCED ALGORITHMS LAB NC-CSE-508 P 2 LIST OF EXPERIMENTS: 1. Write a program to implement Quick sort. 2. Write a program to implement knapsack and 0-1-knapsack problem. 3. Write a program to find out the element-using divide and conquer strategy. 4. Write a program to find out the single source shortest path (using Dijkstra algorithm). 5. Write a program to find out all pair shortest path. 6. Write a program to implement Matrix chain multiplication. 7. Write a program to find out the longest common subsequence. 8. Write a program to find minimum spanning tree using prims algorithm. 9. Write a program to implement activity selection problem. 10. Write a program to implement Bellman Ford algorithm. On Semester Evaluation: 120 Marks End Semester Evaluation: 80 Marks
36
2nd Semester (CSE) JAVA PROGRAMMING LAB NC-CSE-510 P 2 LIST OF EXPERIMENTS: 1. (a) Program to display the area of a rectangle. (b) Program to find Sum of series 1+x+x2+x3+ 2. (a) Write a class to display the area of rectangle and inherit this class into other class which is displaying perimeter of a rectangle and implement. (b) Write a class to add three nos inherit this class into other class to add five nos and implement it. 3. (a) Write a program to print the path, filename and extension for a given path of a file. (b) Write a program to receive two command line arguments check whether they are equal or not. 4. (a) A program to take two arguments and divide the first argument with second argument and display the result. Display the error message if divide by zero without abnormal exit. (b) A program to accept more than one string and arrange them in alphabetical order. (c) Write a program to display simultaneously output of even and odd numbers starting from one to specified number. 5. Write a program to accept data from keyboard and write it into a file. 6. Write a java program to implement stack & Queue operations. 7. Write a program to draw line and circle using mouse. 8. Write a applet program for drawing the bar chart. 9. Write a applet program to design a calculator for implementing basic functions like +,-,*, /. 10. Write a program to check active ports in system. On Semester Evaluation: 120 Marks End Semester Evaluation: 80 Marks
37
38

Booklet MTech CSE1 2nd Sem 2010 11

Transféré par

Informations du document

Description originale:

Copyright

Formats disponibles

Partager ce document

Partager ou intégrer le document

Options de partage

Avez-vous trouvé ce document utile ?

Ce contenu est-il inapproprié ?

Droits d'auteur :

Formats disponibles

Booklet MTech CSE1 2nd Sem 2010 11

Transféré par

Droits d'auteur :

Formats disponibles

M. Tech.

CSE, 1st and 2nd Semester Syllabus 2010-11

Contact Weightage Hours

M. Tech. CSE, 1st and 2nd Semester Syllabus 2010-11

Scheme 2010-11 M.Tech.1 YEAR (SEMESTER-II) COMPUTER SCIENCE & ENGINEERING

Subject Code NC-CSE-502 NC-CSE-504 NC-CSE-514 NC-CSENC-CSENC-CSE-508 NC-CSE-510 NC-CSE-512

M. Tech. CSE, 1st and 2nd Semester Syllabus 2010-11

MARKS DISTRIBUTION (ACCORDING TO AUTONOMY)

1. On semester evaluation of all theory courses total: Distribution

20 marks 20 marks 20 marks 20 marks 20 marks

M. Tech. CSE, 1st and 2nd Semester Syllabus 2010-11

M. Tech. CSE, 1st and 2nd Semester Syllabus 2010-11

M. Tech. CSE, 1st and 2nd Semester Syllabus 2010-11

M. Tech. CSE, 1st and 2nd Semester Syllabus 2010-11

M. Tech. CSE, 1st and 2nd Semester Syllabus 2010-11

M. Tech. CSE, 1st and 2nd Semester Syllabus 2010-11

M. Tech. CSE, 1st and 2nd Semester Syllabus 2010-11

M. Tech. CSE, 1st and 2nd Semester Syllabus 2010-11

M. Tech. CSE, 1st and 2nd Semester Syllabus 2010-11

M. Tech. CSE, 1st and 2nd Semester Syllabus 2010-11

M. Tech. CSE, 1st and 2nd Semester Syllabus 2010-11

Computer Science & Engineering I SEM M.Tech NC-CSE-521 Java Programming

M. Tech. CSE, 1st and 2nd Semester Syllabus 2010-11

M. Tech. CSE, 1st and 2nd Semester Syllabus 2010-11

2nd Semester (CSE) ANALYSIS AND DESIGN OF ALGORITHMS NC-CSE-502

M. Tech. CSE, 1st and 2nd Semester Syllabus 2010-11

M. Tech. CSE, 1st and 2nd Semester Syllabus 2010-11

2nd Semester (CSE) ADVANCED COMPUTER ARCHITECTURE NC-CSE-504

M. Tech. CSE, 1st and 2nd Semester Syllabus 2010-11

M. Tech. CSE, 1st and 2nd Semester Syllabus 2010-11

2nd Semester (CSE) MODELING AND SIMULATION NC-CSE-514

M. Tech. CSE, 1st and 2nd Semester Syllabus 2010-11

2nd Semester (CSE) COMPUTER GRAPHICS NC-CSE-520

M. Tech. CSE, 1st and 2nd Semester Syllabus 2010-11

2nd Semester (CSE) DISTRIBUTED COMPUTING NC-CSE-522

M. Tech. CSE, 1st and 2nd Semester Syllabus 2010-11

2nd Semester (CSE) SECURITY & CRYPTOGRAPHY NC-CSE-506

4. Network Security private communication in a practice chartic Kaufman, Radio

M. Tech. CSE, 1st and 2nd Semester Syllabus 2010-11

2nd Semester (CSE) NATURAL LANGUAGE PROCESSING NC-CSE-540

M. Tech. CSE, 1st and 2nd Semester Syllabus 2010-11

2nd Semester (CSE) NEURAL NETWORKS AND FUZZY LOGIC NC-CSE-542

M. Tech. CSE, 1st and 2nd Semester Syllabus 2010-11

M. Tech. CSE, 1st and 2nd Semester Syllabus 2010-11

2nd Semester (CSE) ARTIFICIAL INTELLIGENCE NC-CSE-544

M. Tech. CSE, 1st and 2nd Semester Syllabus 2010-11

4. Artificial Intelligence & Expert System By Patterson PHI.

2nd Semester (CSE) OBJECT ORIENTED ANALYSIS AND DESIGN NC-CSE-516

M. Tech. CSE, 1st and 2nd Semester Syllabus 2010-11

M. Tech. CSE, 1st and 2nd Semester Syllabus 2010-11

M. Tech. CSE, 1st and 2nd Semester Syllabus 2010-11

M. Tech. CSE, 1st and 2nd Semester Syllabus 2010-11

M. Tech. CSE, 1st and 2nd Semester Syllabus 2010-11

Vous aimerez peut-être aussi