NIT Delhi CSE Syllabus Part II

NIT Delhi CSE Syllabus Part II

Advanced Data Structures

 

Prerequisites – CS 202
Binary Search Trees–Height Balanced Trees – AVL – Splay Trees – Balanced Trees – B-Trees – Priority Queues – Binomial Heaps – Leftist Heaps–Skew Heaps–Binomial Queues–Top down Splay Trees – Red Black Trees – Skip Lists – AA Trees – Pairing Trees – Amortized Analysis
Text Books: Mark Allen Weiss, Data Structures and Algorithm Analysis in C++, Pearson, II Ed, 2004.
CS 263
Object Oriented Programming
3 – 0 – 3/2
4
Prerequisites – CS 202
Object Oriented Thinking – Messages and Methods – OO Design – Software Components – Design Paradigms – Inheritance – Mechanisms for software reuse – Polymorphism – AWT Class – Input output Streams
Text Books – Timothy Budd, “Understanding Object Oriented Programming with Java”, AW
CS 311
Operating Systems and Applications
3 – 0 – 0
3
Operating Systems : Batch, iterative, time sharing and real-time systems – operating system structure – concurrent processes – synchronization – Deadlocks – Memory management – Secondary storage management – File systems
Text Books – Sillberschatz, Galvin, Gagne, “Operating System Concepts”, John Wiley, 2006
CS 312
Database Management
3 – 0 – 0
3
Importance – Entity Relationship model, Relational model – structure and operations, query languages – relational algebra – relational calculus – Mapping ER model to relation form. Features of SQL. Functional Dependencies – normalization process. Multi valued dependencies. Query optimization
Text Books: Elamsri , Navathe, Somayajulu and Gupta: Database Concepts, Pearson Edition, 2006
CS 313
Management Information Systems
3– 0 – 0
3
This course discusses key issues pertaining to information systems in the managerial context. Focus is on the functional applications of management information systems and MIS practices in organizations. Information as a management resource Hierarchy of information systems Transaction processing, business information systems, decision support systems and expert systems. MIS – functional applications. Overview of information technology – hardware, software and telecommunications. Database management Current MIS trends in India.
CS 361
Design and Analysis of Algorithms
3– 0 – 0
3
Prerequisites – CS 202
Algorithm Analysis – Asymptotic notation – Amortization – Greedy method – Divide and conquer – Dynamic programming – example problems in each case of design methods – Sorting Algorithms – Graph Algorithms – Shortest path, search algorithms, Minimum spanning tree, Max flow min cut Algorithms – Strings and Pattern matching Algorithms – Backtracking, and Branch and Bound methods – Network Algorithms – P, NP, NP-hard, NP-complete classes.
Text Books: M T Goodrich, Roberto Tamasia. Algorithm Design John Wiley & Sons
Horowitz, Sartaj Sahni, S Rajasekaran. Fundamentals of Algorithms. Galgotia.
CS 363
System Analysis and Design
3 – 0 – 0
3
Information systems – People involved – System life cycle – gathering information – project planning – feasibility – evaluation – Modelling tools – DFD – ER diagrams – Alternate models – Process descriptions – structured English – Data Dictionary – Design – logical and physical models – User Interfaces – Relational Analysis – Database design – program design – structure chart – HIPO – SSADM – Alternate Life cycles – Prototypes.
Suggested Reading: Haryszkiewycz, “Introduction to Systems Analysis and Design”, II Ed. PHI 1995.
James A Senn : Analysis and Design of Information Systems, McGraw Hill 1989.
CS 365
Web and Visual Programming
3 – 0–3/2
3
Creating home pages – Online shopping – online examination – chat system – mailing system – Visual C++ controls usage – Mouse and Keyboard integrating applications – Timers and dialog boxes – menus – bitmaps – drawing – tool bars – ODBC and ADO database programming – Multi tasking – Networking and WEB applications
Text Books: Deitel, Deitel & Nieto, “Internet and Worldwide Web how to Program?”, Pearson
Lars Klander, “Core Visual C++ 6”, Pearson Education, PHI
CS 366
Unix Tools and Programming
3– 0 – 0
3
Prerequisites – CS 202, CS 204
Shell programming – Unix commands – Text processing – sed and awk utilities – grep utility – Introduction to Lex, Yacc utilities – Introduction to Perl programming.
Text Books: Kernighan and Pike, “Unix Programming Environment”, PHI
CS 411
Advanced Compiler Design
3– 0 – 0
3
Prerequisite: CS 351
Compiler optimizations : Processing intermediate code – Interpreters – DAG code generation technique – Loop simplifications – Redundancy elimination – Re-association – Loop invariant code optimization – Procedure call optimizations – Register allocation – Instruction Scheduling – Low level loop and branch optimizations – Inter procedural analysis
Parallelizing compilers : Data dependence, Data dependence decision algorithms: GCD test, Banerjee’s Inequality, Exact algorithm for a single loop index, Exact algorithm for Multiple indices, Vectorization, Concurrentization
Text Books: Steven S. Muchnick. “Advanced Compiler Design and Implementation”. Harcourt Asia and Morgan Kaufmann. 2000.
Michael Wolfe, “High performance compilers for parallel computing”, AW 1996
CS 412
Machine Learning and Soft Computing
3– 0 – 0
3
The concept learning task. General-to-specific ordering of hypotheses. Version spaces. Inductive bias. Decision Tree Learning. Rule Learning: Propositional and First-Order, Over-fitting, Cross-Validation. Experimental Evaluation of Learning Algorithms Instance-Based Learning: k-Nearest-neighbor algorithm, Radial basis functions. Case-based learning. Computational Learning Theory: probably approximately correct (PAC) learning. Sample complexity. Computational complexity of training. Vapnik-Chervonenkis dimension. Artificial Neural Networks: Linear threshold units, Perceptrons, Multilayer networks and backpropagation, recurrent networks. Probabilistic Machine Learning Maximum Likelihood Estimation, MAP, Bayes Classifiers Naive Bayes. Bayes optimal classifers. Minimum description length principle. Bayesian Networks, Inference in Bayesian Networks, Bayes Net Structure Learning Unlabelled data: EM, preventing overfitting, cotraining Gaussian Mixture Models, K-means and Hierarchical Clustering, Clustering and Unsupervised Learning, Hidden Markov Models, Reinforcement Learning Support Vector Machines Ensemble learning: boosting, bagging.
CS 413
Parallel Processing
3 – 0 – 0
3
Prerequisites – CS 202, CS 361
Parallel processing terminology – PRAM algorithms – Processor organizations – Interconnection networks – Mapping and Scheduling – Matrix multiplication , sorting and searching algorithms – graph algorithms – combinatorial search algorithms
Text Books: Michael J. Quinn, “Parallel Computing”, TMH, 1994.
CS 414
Distributed Object Technologies
3 – 0 – 0
3
COM/DCOM : Introduction to COM – COM Interfaces and Interface languages – COM library – Type libraries specification – Registering Type Libraries – Active template library – Developing Components using ATL – Threading models and apartments – Multithreaded components – Dll surrogates – Security models
CORBA : OMG’s object management architecture – CORBA services – CORBA business objects – 3-Tier client-server-object-style – Accessing distributed objects using applets – Dynamic CORBA – Multithreaded client-server programming
Text Books: Guy Eddon and Henry Eddon, “Inside DCOM”, Microsoft Press, 1998
Dan Harkey and Robert Orfali, “Client/Server programming with CORBA/Java”, John Wiley and Sons
CS 415
Information Security and Auditing
3 – 0 – 0
3
Computer Auditing: System Access Control, Data Access Control, Security Administration, System Design; Hardware Security Auditing, Software Security Auditing and controls – Security Policies
Database Security Auditing: Audit Trail Comparison of Database and Operating System Access, Field checks, Change logs, Integrity checks, User authentication, Precision checks, Access Control Procedures.
Network & Telecommunication Security Auditing: Confidentiality, Accuracy & Integrity, Availability; Tools: encryption, trusted system processing, and firewalls. Detect: security violation, misrouted data, components failure, and signal interception.
Microcomputer Security Auditing: Audit Trail, Auditing Virus Infection, Performing a security Audit; Issue: Future trends, challenges.
Text Books: Deborah Russell, Computer Security Basics, O’Reilly & Associate, 1991.
Karen A. Forcht, Computer Security Management, 1994; Donald A. Watne, Peter B.B. Turney, “Auditing EDP Systems”, 2nd PH 1990.
CS 416
Artificial Intelligence and Expert Systems
3 – 0 – 0
3
Problems and Search – Problem Space – Problem Characteristics – Heuristic Search Techniques – Knowledge Representation – Predicate Logic – Resolution – Rules – Logic Programming – Forward and Backward Reasoning – Matching – Semantic Nets – Frames – Game Playing – The Blocks World – Natural Language Processing – Expert Systems
Text Books – Elaine Rich, Kevin Knight, “Artificial Intelligence”, TMH
CS 417
Design Patterns
3 – 0 – 0
3
Introduction. – A Case Study: Designing a Document Editor. – Design Pattern Catalog – Creational Patterns – Structural Pattern – Behavioral Patterns. What to Expect from Design Patterns, a Brief History, and the Pattern Community.
Text Books: Erich Gamma “Design Patterns” Addison-Wesley
CS 418
Advanced Databases
3 – 0 – 0
3
Prerequisites – CS 303, CS 305
Object Oriented Databases: Persistent Programming Languages, Object Identity and its implementation, Clustering, Indexing, Client Server Object Bases, Cache Coherence. Parallel Databases: Parallel Architectures, performance measures, shared nothing/shared disk/shared memory based architectures, Data partitioning, Intra-operator parallelism, Pipelining, Scheduling, Load balancing, query optimization. Distributed Databases: Query processing, semi-joins, query optimization, Concurrency control Heterogeneity issues. Advanced Transaction Models: Save-points, Sagas, Nested Transactions, Multi Level Transactions. Recovery: Multi-level recovery, Shared disk systems, Distributed systems 2PC, 3PC, replication and hot spares. Recursive query processing: Top-down and bottom-up evaluation, Magic optimization.
Text Books: Introduction to Object Oriented Databases, Won Kim, MIT Press, 1989. Readings in Object Oriented Database Systems, S. Zdonik and D. Maier, First Edition, Morgan Kauffman, 1990. Readings in Database Systems, M. Stonebraker, Second Edition, Morgan Kauffman, 1993. Distributed Databases Principles and Systems, S. Ceri and G. Pelaggati, McGraw Hill, 1985. Selected research papers from various journals and conferences.
CS 511
Object Oriented Software Engineering
3 – 0 – 0
3
The Software Process – Requirements, Specification, Design, Implementation and Maintenance – Cohesion – Data Encapsulation – Reusability – Software Life Cycle – Use-case modeling – Data flow Analysis – Transaction Analysis – 4GL – Coding Standards – Module reuse – Module Testing – CASE tools for integration and Complete Software Process
Text Books – Stephen R Schach, “Object Oriented and Classical Software Engineering” , TMH V Ed
CS 514
Information Security and Auditing
3– 0 – 0
3
System Access Control, Data Access Control, Security Administration, System Design; Hardware Security Auditing, Software Security Auditing and controls – Security Policies – Audit Trail Comparison of Database and Operating System Access, Field checks, Change logs, Integrity checks, User authentication, Precision checks, Access Control Procedures. Encryption, trusted system processing, and firewalls. Detect: security violation, misrouted data, components failure, and signal interception. Audit Trail, Auditing Virus Infection, Performing a security Audit; Issue: Future trends, challenges.
Text Books: Deborah Russell, Computer Security Basics, O’Reilly & Associate, 1991.
Karen A. Forcht, Computer Security Management, 1994; Donald A. Watne, Peter B.B. Turney, “Auditing EDP Systems”, 2nd PH 1990.
CS 515
Advanced Topics in Theoretical Computer Science
3– 0 – 0
3
Turing machines and non-determinism, models of computation like RAM and pointer machines. Relations between complexity classes. Time-space tradeoffs for some fundamental problems. Reductions and completeness, Randomized complexity classes, Boolean circuit complexity. Cryptography and one-way functions. Polynomial hierarchy, P-space completeness, Interactive proofs and Hardness of approximation, Parallel complexity classes.
CS 517
Programming Language Semantics
3 – 0 – 0
3
Operational Semantics – Inductive definitions – Denotational Semantics – Axiomatic Semantics – Domain Theory – Recursion Techniques – Languages with Higher Types – Information systems – Recursive Types
Text Books – Winskel. “The Formal Semantics of Programming Languages”, MIT Press
CS 461
Network Security
3 – 0 – 0
3
Prerequisites – CS 352, CS 402
Network Security – Attacks Services and Mechanisms – Conventional Encryption – Classical Techniques, Modern Techniques – Simplified DES– Block cipher Design Principles – Encryption algorithms – placement of encryption function – traffic confidentiality – The Data Encryption Standard (DES) – Public Key Encryption – The RSA algorithm – Diffie – Hellman Key Exchange – Key Management – Message Authentication – Authentication Requirements – Authentication Functions – Message Authentication Codes – Digital Signatures and Authentication Protocols – Digital Signatures – Digital Signature Standard (DSS) – Electronic Mail Security – S/MIME – IP Security – IP security Overview – IP Security Architecture – Authentication Header (AH) – Encapsulating Security Payload (ESP) – Firewalls – Firewall Design Principles – Trusted Systems.
Text Books: William Stallings, Cryptography and Network Security, the Principles and Practice, Pearson Education, II Ed, 2002.
CS 462
Mobile Computing
3 – 0 – 0
3
Prerequisites – CS 352
Applications of Mobile Communications – Wireless Transmission – Medium Access Control – Telecommunication Systems – Satellite Systems – Wireless Lan – 802.11 – HIPERLAN – BlueTooth – Wireless ATM – Mobile Network Layer – Mobile IP – Mobile Transport Layer – Support for Mobility – File Systems – Wireless Application Protocol
Text Books: Jochen Schiller, Mobile Communications, Pearson Edition Asia, III Ed, 2001.

Leave a Comment