You are on page 1of 20

Computer Sc. & Engg. Deptt. M.

Tech in Computer Science & Engineering
Semester 1
Subject CS60001 Foundations of Computing Science CS60003 Algorithm Design and Analysis Elective 1 Elective 2 Elective 3 (HSS /MGMT/Depth optional) CS69011 Computing Lab 1 CS69001 Seminar 1 Total: L-T-P 3-1-0 4-0-0 3-0-0 3-0-0 3-0-0 0-0-6 0-0-3 Credits 4 4 ¾ ¾ ¾ 4 2 23/26

Semester 2
Subject Core 3 High Performance Computer Arch. Elective 4 Elective 5 Elective 6 Elective 7 CS69012 Computing Lab 2 CS69002 Seminar 2 Total: L-T-P 4-0-0 3-0-0 3-0-0 3-0-0 3-0-0 0-0-6 0-0-3 Credits 4 3 3/4 3/4 3/4 4 2 22/25

Total Credit of Lecture Courses: Semester 3
Subject CS67001 Project CS68002 Comprehensive Viva Voce Total: L-T-P


Credits 20 3 23

Semester 4
Sub. No. CS67002 Project Total: Subject L-T-P Credits 20 20

Out of 20 credit in Project, 4 credits for project work during Summer vacation (from May to July) Total Credit: 88-94

List of Autumn (Odd) Semester Electives
Sub. No. CS 60031 CS 60033 CS 60035 CS 60037 CS 60039 CS 60041 CS 60043 CS 60045 CS 60047 CS 60049 CS 60051 CS 60053 CS 60055 CS 60057 CS 60059 IT60107 IT60109 Subject Logics for Computer Science Logic Programming Information Retrieval Embedded Systems Testing and Verification of Circuits Cryptography & Network Security Algorithms for Bioinformatics Artificial Intelligence Advanced Graph Theory Computational Complexity Discrete Structures VLSI System Design Ubiquitous Computing Speech & Natural Lang. Proc. Object Oriented Systems Data Warehousing & Data Mining Cluster and Grid Computing L-T-P 3-1-0 3-0-0 3-0-0 3-1-0 3-1-0 3-1-0 3-0-0 3-0-0 3-1-0 3-1-0 3-1-0 3-1-0 3-0-0 3-0-0 3-0-0 4-0-0 3-0-0 Credits 4 3 3 4 4 4 3 3 4 4 4 4 3 3 3 4 3 Prerequisites
Discrete Structure

Computer Orgn. & Arch. Operating System Switching Ckts & Logic Design/ Dig. Electronics Algorithms I & Discrete Strc. Algorithms I Algorithms I Disc. Strct & Algo I Disc. Strct. & Algo I Switching Ckts & Logic Design/ Dig. Electronics Computer Ntks. Software Eng. + Lab

List of Spring (even) Semester Electives
Sub. No. CS 60030 CS 60032 CS 60034 CS 60036 CS 60038 CS 60040 CS 60042 CS 60044 CS 60046 CS 60048 CS 60050 CS 60052 CS 60054 CS 60056 CS 60058 CS 60060 CS 60062 CS 60064 CS 60066 CS 60068 Subject Distributed Systems Database Engineering Advanced Microprocessor Based Systems Intelligent Systems Advances in Operating Systems Design Parallel & Distributed Algorithms Advances in Compiler Construction Perf. Eval. & Reliability of Information Sys. Real Time Systems Theory of Programming Languages Machine Learning Advanced Digital Img Proc & Comp Vision Low Power Circuits Design Computer Graphics Fault Tolerant Systems Formal Systems Multimedia Systems Computational Geometry Software Engineering CAD for VLSI Design L-T-P 4-0-0 3-0-0 3-0-0 3-0-0 3-0-0 3-0-0 3-1-0 3-0-0 3-0-0 3-0-0 3-0-0 3-0-0 3-0-0 3-1-0 3-0-0 3-1-0 3-0-0 3-1-0 3-0-3 3-1-0 Credits 4 3 3 3 3 3 4 3 3 3 3 3 3 4 3 4 3 4 5 4 Prerequisites
DBMS Comp. Org & Arch + lab Algorithm I OS + Lab. Algorithm I + Comp. Org. Arch. Compiler + Lab Probability + Stat. OS + Lab Disc. Strct. Artf. Intel. Disc. Strct. + Signals & Networks + Lab VLSI Syst. Design Algo I + Lab

Image Proc. Algo I + Lab Disc. Strct. Algo I + Lab. Com Org Arch +

Advances in Digital and Mixed Signal Testing Complex Networks Selected Topics in algorithms Computational Number Theory Foundations of Cryptography Information Technology E-Commerce Information System Design 3-1-0 3-0-0 3-0-0 3-0-0 3-0-0 3-1-0 3-0-3 4-0-0 4-0-0 4 3 3 3 3 4 5 4 4 Algo I + Lab. Algorithms I + Algorithms Lab (only for MMST students) . Proc.Lab CS 60070 CS 60076 CS 60078 CS 60080 CS 60082 CS 60084 CS 63052 IT 60004 IT 60030 Quantum Computing & Quantum Inf.

Relations and Functions. 4. extended Euclid's algorithm. NP-completeness. CS 60003 Algorithm Design and Analysis L-T-P: 4-0-0. Delhi. 2. Decidability and Undecidability. Text Books and References: 1.Chomsky Hierarchy of Grammars and the corresponding acceptors. Hopcroft and J. Satisfiabiliy and validity. . Operations on Languages. The class NP. Reduction.P.H. cryptographic computations). The class P. The class PSPACE. International.Discrete Mathematical Structures with Applications to Computer Science.Computer Science and Engineering Department Syllabi of M. Linear programming. Randomized algorithms. Algebraic Structures. Logic -. Halting Problem of Turing Machines.D. Turing Machines. House. Notions of soundness and completeness Languages & Automata Theory -. NP-Completeness.Measuring Complexity. Space Complexity -. data compression. Manohar -. Graph Algorithms: Shortest paths. Polynomial Hierarchy. Asymptotic complexity. Prentice Hall. modular exponentiation. Internet algorithms (text pattern matching. closures with respect to the operations. John E.Church-Turing Thesis.Introduction to The Theory of Computation.Ullman -.Papadimitrou -.Inrtroduction to Automata Theory. Special topics: Geometric algorithms (range searching. Michael Sipser -. primality testing. Greedy.Propositional calculus and Predicate Calculus. Decision Problems. closest pairs). Recursive and Recursively Enumerable Languages.Sets. H. Approximation algorithms. information retrieval. Credit: 4 Algorithmic paradigms: Dynamic Programming. Trembley and R. Credit: 4 Discrete Structures -. Lewis and C. convex hulls. segment intersections. matrix and polynomial multiplication. Computability -. Problem reduction (Turing and mapping reduction). Amortized analysis. Computational Complexity -.R. Thomson Course Technology. Numerical algorithms (integer. 3. N. Morphisms. Subjects CS60001 Foundations of Computing Science L-T-P: 3-1-0. Narosa Pub. Proof Techniques. Inc.Savich's Theorem. FFT. Branch-and-bound. Web caching).Time Complexity -.Elements of the Theory of Computation.Tech. Flow networks. Posets. co-NP. Lattices and Boolean Algebras. McGraw Hill Book Co. J.. tries. Languages and Computation.

Special topics: distributed objects. Security and Authentication: basic concepts. synchronous and asynchronous systems. First Order Theories. Credit: 3 Relational Databases: Integrity Constraints revisited: Functional. directory services. Centralized shared-memory architecture: synchronization. systolic architectures. Instruction-level parallelism: basic concepts. Logical time and event ordering. web services. Model Checking. mutual exclusion. Pipeline optimization techniques. CS 60030 Distributed Systems L-T-P: 4-0-0. Decision Procedures in First Order Logic: Resolution Theorem Provers: some theoretical issues. voting protocols. instruction and arithmetic pipeline. distributed databases. commit protocols. Cluster computers. Credit: 4 Axiomatic Theory: Propositional Calculus. Non von Neumann architectures: data flow computers. Template Algebraic. techniques for increasing ILP. Credit: 4 Basic concepts. Models of computation: shared memory and message passing systems. Kerberos. Lambda Calculus. Hierarchical memory technology: Inclusion. Techniques for reducing cache misses. Programming models: remote procedure calls. control hazards. spanning tree construction. Peano Arithmetic. Indexing and Query Optimization. checkpointing and recovery. mapping and management techniques. fault models. reliable communication. Distributed shared-memory architecture. techniques for handling hazards. CISC and RISC processors. measuring and reporting performance. memory consistency. Exception handling.CS 60002 High Performance Computer Architecture L-T-P: 4-0-0. memory replacement policies. Proof Theory. Array and vector processors. CS 60032 Database Engineering L-T-P: 3-0-0. Multiprocessor architecture: taxonomy of parallel architectures. interconnection networks. Pipelining: Basic concepts. Global state and snapshot algorithms. Fault tolerance and recovery: basic concepts. Model Theory. Query Processing and Optimization: Evaluation of Relational Operations. superscalar. Credit: 4 Introduction: review of basic computer architecture. superpipelined and VLIW processor architectures. Resource sharing and load balancing. Chase Algorithms and Synthesis of Relational Schemes. CS 60031 Logics for Computer Science L-T-P: 3-1-0. reduction computer architectures. distributed shared memory. Limitations of Relational . agreement problems and its applications. Intuitionistic First Order Logic. Multi-valued and Join Dependency. quantitative techniques in computer design. Transformation of Relational Expressions. mu Calculus. Temporal Logic: their applications. termination detection. Fuzzy Logic. Predicate Calculus. Inclusion and Generalized Functional Dependency. deadlock detection. clock synchronization. Coherence and locality properties. data hazards. Compiler techniques for improving performance. Modal Logic. Nonmonotonic Reasoning. Cache memory organizations. Virtual memory organization. leader election. and structural hazards.

Content Based Retrival: Color Histograms. Image Features. CS 60034 Advanced Microprocessor Based Systems L-T-P: 3-0-0. Negation as Failure. Sequential Patterns. Generalization. Abstract computational model . Transaction Work Flows. Evaluation of Datalog program. Parallel and Distributed Databases: Distributed Data Storage: Fragmentation and Replication. Case Studies: Gemstone.a case study. Unification and SLD-Resolution.Warren s Abstract Machine (WAM). Compensating Transactions and Saga. Spatial and Topological Relationships. deduction. XML Databases. Introduction to nonclassical logics. Built-in Multi-user and . WEB Databases: Accessing Databases through WEB. First Order Logic: syntax and semantics. Oracle xxi.Data Model. Objected Oriented and Object Relational Databases: Modeling Complex Data Semantics. Weak Levels of Consistency. Distributed Deadlock. Object Store. Transaction Processing Monitors. SQL3. Object Identity. Distributed Query Processing and Optimization. Introduction to Constraint Logic Programming: Constraint logic programming scheme. Credit: 3 Propositional logic. Multimedia Data Formats. O2. Real Time Databases: Temporal Constraints: Soft and Hard Constraints. Cuts and negation. Credit: 3 Introduction: Basics of Von Neumann Architecture and the early Microprocessors. Distributed Transaction Modeling and Concurrency Control. Inference Rules. Event Constraint and Action: ECA Rules. Data Structures . Aggregation and Association. Processor Architecture with hierarchical memory organization: Cache memory. CS 60033 Logic Programming L-T-P: 3-0-0. Implementation of Prolog on WAM. Co-processors. Constraint Logic Programming over the reals. Logic programming language PROLOG . Textures etc. Built-in Multiprocessing support. Relation and Kripke possible world semantics. Long Duration Transactions. Design of Parallel Databases. Architecture of Object Oriented and Object Relational Databases. Algorithms for Rule Accessing. Association and Classification Rules. Temporal logic. Superscalar. Non-deterministic programming. Active Databases: Triggers in SQL. Virtual memory. Parallelism in Processor Architecture: Pipelining. Commit Protocols. Herbrand interpretation and resolution methods. Equality and Object Reference. k-d tree. Accessibilty. Syntax and Semantics of Logic Programs. Image and Multimedia Databases: Modeling and Storage of Image and Multimedia Data. DB2. CISC and RISC concepts. Deductive Databases: Datalog and Recursion. Null Values and Partial Information. The logic of knowledge and belief. Objects. Low-power Architecture. WEB Servers. Autoepistemic knowledge. Modal logic. Advanced Transaction Processing: Nested and Multilevel Transactions. Q uadtrees. Video Data Model. Transaction Scheduling and Concurrency Control. Super-pipeline and VLIW Architectures. Compensation and Databases Recovery. constraint propagation. Parallel Query Evaluation. Constraint satisfaction. Audio and Handwritten Data. Query Processing and Concurrency Control. Location and Fragment Transparency. Recursive queries with negation. Constraint Logic Programming over finite domains. DB2. Recursive programming. Commercial Systems: Oracle xxi.R-tree. Basic concepts. Data Mining: Knowledge Representation Using Rules. Geographic Information Systems (GIS). Specialization.

Rochhio. Zipfs Law. Credit: 3 Data. The agent metaphor and attributes of agenthood. Evaluation: Precision. Practical implications of choosing and applying AI solutions. Inference under uncertainty: Bayesian techniques. design validation. example system design. clustering. Kluwer. Ontological issues. Built-in memory mapping and management support. Planning. intelligent interfaces. usermodelling. Fuzzy reasoning. Introduction to Information Retrieval. e. Credit: 3 Introduction: Principles of Information Retrieval. Suggested Text: 1. Semantic Web. cosine similarity. .definitions and constraints. Credit: 4 Introduction to Embedded Systems . query routing. Stop words. Diagnosis. Real Time operating system issues with respect to embedded system applications. special purpose processors. Ontologies. Frame/script systems. Case studies with contemporary Microprocessors. specification refinement and design. Alternatives to the symbolic approach: Foundations of connectionist networks. Temporal reasoning.multitasking support in 16-bit and 32 bit microprocessors. P Raghavan. Advanced topics like summarization and question answering. Models of knowledge representations: Representation and reasoning in logic. Knowledge representation and the Web. Inter-agent communication. Formal approach to specification. Probabilistic models language. information and knowledge. TREC Text classification. specification languages. Communication processors. Stemming. Configuration. Indexing. Knowledge based systems: Software architecture of a knowledge-based system. Evolution of platform architecture. Special-purpose processor Architectures: Signal processing Microprocessors. Rule chaining and inference control. Vector space model. Query expansion. f-measure. Agent theory and languages. recall. input-output design and I/O communication protocols. M Manning and P Schutze.g. Applications of AI: Example application domains. Search. Scoring techniques. CS 60035 Information Retrieval L-T-P: 3-0-0. Rulebased programming and production systems. codesign approach. frames. Relevance feedback. Semantic representations: semantic networks. CS 60037 Embedded Systems L-T-P: 3-1-0. design space exploration for constraint satisfaction. Inference: reasoning about knowledge. hardware and processor requirements. 2007 CS 60036 Intelligent Systems L-T-P: 3-0-0. Model of an intelligent system. Casebased reasoning. time constraints and performance analysis. Conceptual dependency and conceptual graphs. Intelligent agents. their history.

global state and snapshot algorithms. relationship with PRAM models. butterfly) and fundamental algorithms. easily testable designs. boundary scan. Inter-process communication and co-ordination in large distributed systems. secret-key and public-key cryptography. logic-based approaches. Information management in distributed systems: security. DES and its variants. Block ciphers: Modes of operation. test generation. Case studies. Stream ciphers: Stream ciphers based on linear feedback shift registers. attack models. Credit: 4 Introduction: Basic objectives of cryptography. . Fault tolerance issues. Test pattern generation for sequential circuits: ad-hoc and structures techniques. Case studies of contemporary operating systems. symmetry breaking. Credit: 3 Fundamentals: Models of parallel and distributed computation. RTL-level (data path and control path). integrity and concurrency problems. random and weighted test pattern generation. election. Verification of embedded systems. termination detection. safety. parallel prefix computation. liveness. critical path tracing. logical time and event ordering. Use of formal techniques: decision diagrams. one-way and trapdoor one-way functions. AES. Fault simulation: parallel. CS 60039 Testing and Verification of circuits L-T-P: 3-1-0. D-algorithm. IDEA. fault collapsing. SEAL. parallel complexity and complexity classes. linear and differential cryptanalysis. clock synchronization. systolic networks. aliasing and its effect on fault coverage. PLA testing: cross-point fault model. sorting and searching. Credit: 4 Physical faults and their modeling. Asynchronous Parallel Computation.CS 60038 Advances in Operating Systems Design L-T-P: 3-0-0. intranets. Built-in self-test techniques. list ranking. scan path and LSSD. matrix algorithms. graph algorithms. cryptanalysis. Test generation for combinational circuits: Boolean difference. lower bounds. Fundamentals of real time operating systems. Distributed resource management. Process synchronization in multiprocessing/multiprogramming systems. embedded systems. intermittent and pattern-sensitive faults. Distributed graph algorithms. divide and conquer. Exhaustive. hypercubes. Applications of Distributed algorithms. The PRAM Model: balancing. Distributed Algorithms: models and complexity measures. routing. mobile systems and wireless networks. BlowFish. deductive and concurrent techniques. RCS. classical cryptography. FEAL. complexity measures. CS 60040 Parallel and Distributed Algorithms L-T-P: 3-0-0. Podem. test generation. Memory testing: permanent. etc. termination. sorting. mutual exclusion. Fault equivalence and dominance. routing. OS issues related to the Internet. SAFER. pointer jumping. CS 60041 Cryptography and Network Security L-T-P: 3-1-0. graph algorithms. test generation techniques. Delay faults and hazards. pervasive computing. Verification: logic level (combinational and sequential circuits). trees. Credit: 3 Theory and implementation aspects of distributed operating systems. Interconnection Networks: topologies (arrays and mesh networks.

dependence analysis and redundancy elimination. instruction scheduling. Chinese remainder theorem. discovering new sites. Estimations of performance metrics. lattices and their applications in cryptography. Credit: 3 Sequence similarity. object-oriented and mark-up languages. Entity authentication: Passwords. Kerberos. blind and undeniable signatures. Diffie-Hellman problem. Software metrics and software reliability models. attacks on hash functions. stochastic processes. Portability and retargetability. Markov Models. Runtime storage management. MD2. Motif finding: motif models. Models of information systems. Benchmarks. finding occurrence of known sites. case studies. expectation-maximization clustering. and pairwise alignment using Hidden Markov Models. maximal dependence decomposition. primality testing. Message digest: Properties of hash functions. error recovery and intermediate code generation. CS 60044 Performance Evaluation and Reliability of Information Systems L-T-P: 3-0-0. Digital signatures: RSA.unconditional security. Code generation. Workload design. CS 60043 Algorithms for Bioinformatics L-T-P: 3-0-0. introduction to reliability measures.lexical analysis. . Queuing network models. side channel attacks. procedural and inter-procedural optimization. modular square root problem. cryptographically secure random number generators. Network issues: Certification. Bayesian model selection. parallel and distributed programming and concurrency. zero-knowledge protocols. Public-key parameters: Modular arithmetic. Parameter estimation and hypothesis testing. keyed hash functions. Public-key encryption: RSA. finite fields. DAS and NR signature schemes. Gene Finding: predicting reading frames. Analysis of DNA microarray data using hierarchical clustering. Pairwise alignment: scoring model. number field sieve. public-key infrastructure (PKI). heuristic alignment. Advanced topics: Elliptic and hyper-elliptic curve cryptography. hidden monomial cryptosystems. MD5 and SHA-1. Estimation of MTF and other reliability parameters. parsing. homology. Key exchange: Diffie-Hellman and MQV algorithms. model-based clustering. optimization for memory hierarchy.peephole optimization. Rabin and EIGamal schemes. known algorithms for solving the intractable problems. Standards: IEEE. Multiple alignment: scoring model. RSA problem. Code improvement . and alignment. gcd. secured socket layer (SSL). RSA and ISO standards. Selected topics from compilers for imperative. discrete logarithm problem. modular square roots. semantic analysis. Credit: 3 Review of probability and statistics. dynamic programming algorithms. challenge-response algorithms. Intractable problems: Integer factorization problem. Credit: 4 Review of compiler fundamentals . loop optimization. CS 60042 Advances in Compiler Construction L-T-P: 3-1-0. Compilation for high performance architecture. local alignment gapped and ungapped global alignment.

graphs on other surfaces. incidence and adjacency matrices. random graphs. Planning: state-space. planning algorithms. resolution refutation. Kuratowski's theorem. Credit: 3 Introduction to real time system. logic programming and constrained logic programming. Credit: 3 Syntax of Programming Languages. CS 60047 Advanced Graph Theory L-T-P: 3-1-0. Turan's theorem. Specification and Modeling. Directed graphs: Tournaments. critical graphs. minimum spanning trees. problem reduction. Selected topics: Dominating sets. circumference. Neural networks. Real time Process and Applications. toroidal graphs. perfect square. algorithms for matching and weighted matching (in both bipartitie and general graphs). the Welsh-Powell bound. Credit: 3 Problem solving by search: state space. factors of graphs (decompositions of the complete graph). isomorphism. girth. shortest paths. directed paths and cycles. Natural Language Understanding. perfect graphs. inference and deduction. the cycle space and the bond space. Pushdown Automata. diameter and maximum degree. plan space and partial order planning. 2-cell embeddings. the greedy algorithm. reinforcement learning. Real Time operating systems. Context Free Languages. duality. Connectivity: Cut vertices. blocks. Matchings: Berge's Theorem. Bondy and Chvatal. CS 60046 Real Time Systems L-T-P: 3-0-0. Paths and Cycles: Euler tours. embedded systems and reactive systems. Max flow min cut theorems. non-monotonic reasoning. the Matrix-Tree theorem. Konig's theorem. theorems of Dirac. Formal Language and Automata Theory: Finite Automata. Learning: inductive learning. intersection graphs. cut edges. the reconstruction problem. Design methods. girth and chromatic number. Distributed Real Time Systems. game playing. logical approaches. Trees: Equivalent definitions of trees and forests. Tutte's f-factor theorem. constraint satisfaction. Petersen's theorem. Cayley's formula. bonds. Colorings: Brooks theorem. knowledge based systems. Credit: 4 Basic Concepts: Graphs and digraphs. Ore. branchings. Ramsey theorems. perfect matchings. Tutte's theorem. Intelligent Agents. Euler's formula. belief networks. decision trees. Regular Languages. Hamilton paths and cycles.CS 60045 Artificial Intelligence L-T-P: 3-0-0. Validation and Verification. Extremal problems: Independent sets and covering numbers. Linear . Applications. Vizing's theorem. computational learning theory. the Chinese Postman Problem. Hard and Soft Real Time Systems. Reasoning under Uncertainty: probabilistic reasoning. Menger s theorem. Hall's theorem. chromatic polynomials. Handling real time. the Travelling Salesman problem. the automorphism group. Graphs on surfaces: Planar graphs. connectivity and strongly connected digraphs. Networks and flows: Flow cuts. CS 60048 Theory of Programming Languages L-T-P: 3-0-0. Automated Reasoning: proposition and first order logic. answer extraction.

Probabilistic Machine Learning Maximum Likelihood Estimation. Artificial Neural Networks : Linear threshold units. Vienna Definition Methods. cotraining Gaussian Mixture Models. hierarchy. Cardinality of sets. resources (time and space). Version spaces. Hidden Markov Models. Parallel computation and complexity. Case-based learning. Functions. K-means and Hierarchical Clustering. relationships between complexity classes. Interactive proofs. Countable and Uncountable Sets. Quantum computation. Sequential Languages (Imperative and Applicative): Operational Semantics. Decision Tree Learning. Mathematical Induction. Sets. Proof Methods of Implications. Axiomatic Semantics: Floyd. Computational complexity of training. MAP. Rings. Radial basis functions. Temporal Logic. Cantor's Theorem. Semantics of Programming Languages: Basic Mathematical Introduction: Propositional and Predicate Calculus. Denotational Semantics: Scott-Strachy Theory. Bayes Classifiers Naive Bayes. P/NP/PSPACE. Lambda Calculus. algorithms. computability. recurrent networks. preventing overfitting.Bounded Automata. Inductive bias. Experimental Evaluation of Learning Algorithms Instance-Based Learning: k-Nearestneighbor algorithm. lower bounds. Substructures and Morphisms. Computational Learning Theory: probably approximately correct (PAC) learning. Attribute Grammars. Context Sensitive Languages.Hoare Approach. Bayes optimal classifers. Circuit complexity. Sample complexity. bagging. Complexity classes. CS 60049 Computational Complexity L-T-P: 3-1-0. Credit: 4 Propositional Logic. CS 60051 Discrete Structures L-T-P: 3-1-0. Over-fitting. incompleteness. . Rule Learning: Propositional and First-Order. Logical characterizations. General-to-specific ordering of hypotheses. Reinforcement Learning Support Vector Machines Ensemble learning: boosting. hardness. Probabilistically checkable proofs. Cross-Validation. Finite and Infinite Sets. Vapnik-Chervonenkis dimension. Bayes Net Structure Learning Unlabelled data: EM. Lattices. Clustering and Unsupervised Learning. Pigeonhole Principle. Fields and Vector Spaces. Credit: 4 Models of Computation. Perceptrons. Credit: 3 The concept learning task. CS 60050 Machine Learning L-T-P: 3-0-0. Partial Orders and Posets. Randomized computation and complexity. Approximability. Multilayer networks and backpropagation. Algebraic Structures: Semigroups. Algebraic Semantics and Data Types. Bayesian Networks. Counting problems. Relations. complexity. completeness. Theory of LR(k) Parsing. reductions. Inference in Bayesian Networks. Monoids. Groups. First Order Logic and Other Proof Methods. Basic operations on sets. Turing machines and Recursively Enumerable Sets. Binary relations: Equivalence Relations. Minimum description length principle. Communication complexity. Algebraic Structures.

Multi-Resolutional Signal Representation. A logic synthesis example. BiCMOS. Markov Random Field Modellings of Images. delay analysis. Switching activity in CMOS circuits. Representation of color. MOS inverter. Datapath logic cells. Rank-Ordered-Mean Filters and Signal Dependent Rank-Ordered-Mean Filters. Edge Detection. Routing global and detailed.Boolean Algebras. Radiometry of Imaging. Illumination sources and techniques. and MPEG-7. CMOS low voltage analytical model. Low- . JPEG2000. gate array. Range Images. stick diagram. I/O cells. Applications of nonlinear filters in image enhancement. Fuzzy Classification. Basic Counting Principles. Non-linear Image Processing: Median and Order Statistics Filters. Logical effort. Two Dimensional Teager Filters. Stereo matching and depth estimation. Credit: 3 Sensor and Imaging: Imaging Optics. standard cell based. Combinational logic cells. MPEG-4. programmable logic. clock planning. VLSI Design flow. CS 60053 VLSI System Design L-T-P: 3-1-0. operation of MOS transistors as a switch and an amplifier. edge detections. Recurrence Relations and their solutions. Sub-band Decomposition. Introduction to hardware description language (HDL) Verilog/VHDL. ASIC Library Design: Transistors as Resistors and parasitic Capacitance. different type of MOS circuits: Dynamic logic. Scale space and diffusion. JPEG. Camera Principles. Texture Analysis. Parameters involved in power dissipation. Credit: 3 Low-Power Design Methodologies: an Overview: Why Low-Power? Low. Morphisms of Boolean Algebras. Multi-threshold CMOS circuit design. CMOS logic: PMOS. design rules and layout. Image and Video Compression Standards: Lossy and lossless compression schemes: Transform Based. Knowledge-based interpretation of images. Example design technique: mapping of architecture to silicon. Sources of Power dissipation. CMOS Power supply voltage scaling. CMOS process. noise removal etc. Color Imaging. CS 60052 Advanced Digital Image Processing and Computer Vision L-T-P: 3-0-0. Low-Power circuit techniques. Single Sensor Color Imaging and Color Demosaicing. Signal Representation: Vector Space and Unitary Trasnsforms. Entropy Encoding. Pass-transistor circuits. Object Analysis. gate array based. Retinex Processing. Adiabatic switching concepts. Classification: Bayesian Classification. Reflectance based shape recovery. Sequential logic cells.Voltage Device Modeling: Spice models for MOS transistor. Different types of VLSI design styles: Full custom. NMOS and CMOS. Feature Estimation: Morphological Operations. Depth from focus. Shape Reconstruction from volumetric data. Optical flow based motion estimation. Combinations. Wavelet Decomposition. Low-Power CMOS Circuit Design: CMOS inverter characteristics. Electrical characteristics. Edges in multichannel images. Neural Network Classifiers. Permutations. pass transistors etc. MPEG-1. delay and power estimation. 3D Imaging. Dynamic CMOS circuits. standard cell and datapath cell design. Credit: 4 Introduction to VLSI Design. Floor-planning and Placement: I/O and power planning. field programmable gate arrays etc. CS 60054 Low Power Circuits Design L-T-P: 3-0-0.

Credit: 3 Overview of wireless technologies. polygon filling. Part of Speech Tagging. Mobile TCP. Cubic and Bicubic Splines. polygon. Geometric computation and representation. Low-power gate level design. Radiosity Computation. convex hull computation. device coordinates. Wireless ATM. isometric projection. CS 60055 Ubiquitous Computing L-T-P: 3-0-0. Brief Review of Regular Expressions and Automata.Power BICMOS Circuit Design: Characteristics of BICMOS logic circuits. and Spread spectrum techniques. polygonization of a point set. Volume and Surface Representation: polygonal meshes. CS 60056 Computer Graphics L-T-P: 3-1-0. Binary Space Partitioning Tree. Hidden surface and line elimination: Elimination of back surfaces. Working Principles of display devices: refreshing raster scan devices. Introduction to HMMs and Speech Recognition. parametric curves and surfaces. Half toning. Octree and Medial Axis representation. UMTS. polygon intersection. Lowvoltage BICMOS families. DSDV routing. Low-Power Architecture level design. Signal propagation. and handoff issues. Mobile Networking: Mobile IP. DSR. Rendering and Visualization: Shading model. Ray tracing algorithm. TDMA. line. Satellite systems: basic routing. painters' algorithms. Low-power VLSI Design Methodologies: Low-Power Physical design. vector devices. Transformations in 2D and 3D: translation. clipping. Wireless Application Protocol (WAP) and WML. Security. Sweep Representation. Display of colors: Look Up Tables. Credit: 3 Speech and Natural Language Processing: Introduction. Credit: 4 Introduction: Display of entities. Snooping TCP. Blue-tooth. localization. scaling. Computer Animation: fundamental concepts. Parsing with . Display and drawing of graphics primitives: point. circle. Information Management. Multiplexing. Voxel. Goraud and Phong Shading. GSM. Cellular systems: AMPS. Location-Independent and Locationdependent computing models. Computations on polygons: point inclusion problem. Low-voltage BICMOS Applications. IMT-2000. Modulation. CS 60057 Speech and Natural Language Processing L-T-P: 3-0-0. Constant. reflection. DECT. Plotters. Cathode Ray Tube Terminals. Coordinate Conventions: world coordinates. Indian language case studies. normalized device coordinates.11b. Graphics Environments. Power estimation techniques. Word level Morphology and Computational Phonology. curves and text. triangulation of polygons. Basic Text to Speech. view-port and window. display of gray shades. Ad-Hoc Networks: AODV. Wireless TCP: indirect TCP. CDMA. zooming and panning by changing coordinate reference frames. Algorithmic-level Power Reduction. Wireless LAN:IEEE 802. Projection: perspective and parallel projections. Media access control: FDMA. Finite State Transducers. Surfaces and Volumes by rotation of curves and surfaces. Wireless Networks: packet radio network. fractal modeling. Transformation matrices. rotation. Mobile applications and services. CDMA-based cellular systems.

redundancy techniques. Introduction to redundancy theory. Credit: 3 Review of programming practices and code-reuse. errors and their management strategies. CS 60062 Multimedia Systems L-T-P: 3-0-0. Credit: 3 An overview of multimedia system and media streams.CFGs. Distributed object computing. Lexical Semantics. Disambiguation. still image and video. Natural Language Generation. Hardware fault tolerance. Object-oriented database system data model. Semantic Analysis. Representation of Meaning. Source representation and compression techniques text. concentrated and distributed voters. Software reuse design patterns. Unified development process. computable sets. Turing machines. Software fault tolerance: fault tolerance versus fault intolerance. Axiomatic systems. detection of faults. Objectoriented analyses and design using UML structural. Recursive function theory: primitive recursive functions and primitive recursive predicates. CS 60058 Fault Tolerant Systems L-T-P: 3-0-0. self-repairing techniques. Graphics and . speech and audio. interoperability and middleware standards COM/DCOM and CORBA. Discourse understanding. type-0 languages. behavioral and architectural modeling. Object-oriented programming languages and implementation. Object model and object-oriented concepts. replication and compression techniques. Case studies. Implementation techniques: software defense. Word Sense. Time and tape bounded Turing machines. Fault recovery techniques. verification methods. components and framework. functions and functionals. decision theory in redundant systems. their soundness and completeness. Indian Language case studies. models of fault tolerant computing systems. decision problems. architectural support. Lambda calculus and applications. Techniques of Machine Translation. Credit: 4 Formal languages and their related automata. Credit: 3 Fundamental concepts in the theory of reliable computer systems design. linear bounded automata and CSLs. CS 60059 Object Oriented Systems L-T-P: 3-0-0. Yield and reliability enhancement techniques for VLSI/WSI array processors. object-relational system. limit theorems. Fault-tolerance and reliability of multicomputer networks (direct and indirect) including fault-tolerant routing and sparing techniques. object definition and query language. Turing Computability: number theoretic computations by Turing machines and indexing. Ackermann's function. protective redundancy. recursive and general recursive functions. CS 60060 Formal Systems L-T-P: 3-1-0. Fixpoint theory of programs. Computability and decidability: computable functions. time and space bounds for recognizing CFLs. Probabilistic Parsing. Coding theory: application to fault tolerant system design.

segment trees. coupling. Fundamental issues in software design: goodness of design. PSP and Six Sigma. Basic concepts of high-level synthesis: partitioning. Multimedia communication. complexity of the union of convex sets. Arrangements of lines: arrangements of hyperplanes. variants. k-sets. Geometric searching: pointlocation. Fortune's sweep for Voronoi diagrams. Transcoding. SEI CMM and ISO 9001. polytopes and hierarchies. scheduling. Unit testing. Visibility: algorithms for weak and strong visibility. state assignment of finite state machines. zone theorems. concatenable queues. point-set triangulations. many-faces complexity and algorithms. Helly's theorems. Function-oriented design: structured analysis and design. allocation and binding. databases and content management. Credit: 4 Introduction: VLSI design flow. Formal requirements specification. Logic synthesis: two-level and multilevel gate-level optimization tools. Requirements analysis and specification. Unified Modelling Language (UML). Code walkthrough and reviews. Sweep techniques: plane sweep for segment intersections. lower bounds. representations. planar graphs. duality of Voronoi diagrams. Clientserver software development. fractional cascading. Configuration management. cohesion. User interface design. Combinatorial geometry: Ham-sandwich cuts. Multimedia OS and middleware. Black box and white box testing. Overview of object-oriented concepts. Software reuse. finger trees. Credit: 5 Introduction. Coding standards and guidelines. topological sweep for line arrangements. Triangulations: polygon triangulations. visibility with reflections. Credit: 4 Convex hulls: construction in 2d and 3d. challenges. Cleanroom technique. techniques for counting. Unified design process. linear programming with prune and search. Multi-modal communication. Software maintenance issues and techniques. min-max angle properties. video conferencing. Multimedia information system and applications. simply connected sets and visible regions. polytopes and linear progarmming in d-dimensions. CS 60066 Software Engineering L-T-P: 3-0-3. writing test benches. interval trees. Life cycle models. CS 60068 CAD for VLSI L-T-P: 3-1-0. Robust geometric computing. art-gallery problems. flip and incremental algorithms. Voronoi diagrams: construction and applications. Randomization in computational geometry: algorithms. Integration and system testing. Multimedia servers. traffic shaping and networking support. Applications of computational geometry. Software project management. Synchronization and QoS. Verilog/VHDL: introduction and use in synthesis. CS 60064 Computational Geometry L-T-P: 3-1-0. Technology mapping. modeling combinational and sequential logic. Software quality and reliability. Delayney triangulations: divideand-conquer. Testability issues: fault modeling and . video-on-demand broadcasting issues.animation.

CS 60076 Advances in Digital & Mixed Signal Testing L-T-P: 3-0-0. “Analog and mixed-signal boundary scan: a guide to the IEEE 1149. Krstic and K-T. Main Text Books: 1. Thadikaran.D. Special considerations for analog and mixed-signal designs. Review of MOS/CMOS fabrication technology. built-in self-test. “Essentials of Electronic Testing”. Kluwer Academic Publishers. universal gates for quantum computing. design for testability. CODECD testing. use of coding theory.4 standard. compaction. “Delay fault testing for VLSI circuits”. placement. routing. gate-array and FPGA. Credit: 3 Delay fault testing: path delay test. Chakravarty and P. IEEE 1149. A. Functional testing of arithmetic and regular arrays.4 test standard”. clock and power routing. 2.J. introduction to quantum error correcting codes. static ADC and DAC testing methods. S. VLSI design styles: full-custom. 1997. Functional testing of microprocessors and microcontrollers. A. platform-based design and testability issues. standard-cell.L. analog ATPG. elements of quantum information theory and quantum cryptography. . reversible computation. faults detected. design of testable FSMs. Analog test bus standard: analog circuit DFT. Cheng. 2003. 2000. IDDQ design for testability. Model-based analog and mixed-signal test: analog fault models. test generation. future challenges. qubits. Sequential circuit testing: time frame expansion and simulation-based approaches to ATPG. Kluwer Academic Publishers. power and delay estimation. Physical design automation algorithms: floor-planning. practical BIST architectures. 4. analog fault simulation. quantum parallelism and simple quantum algorithms. elements of quantum automata and quantum complexity theory. limitations. 1999. quantum entanglement. IDDQ testing: basic concept. realizing emulated instruments. quantum gates and registers. test generation. Kluwer Academic Publishers. Osseiran. Physical design automation. System-on-chip design and test: SOC testing problem. Bushnell and V. Testing SoC's. entanglement assisted communication. 3. CS 60070 Quantum Computing and Quantum Information Processing L-T-P: 3-1-0. core-based design and system wrapper. quantum Fourier transforms and its applications. etc. Basic concepts of verification. transition faults. Credit: 4 Mathematical foundations. Advanced BIST techniques: theory of linear machines. delay test methodologies. Kluwer Academic Publishers. design rule check. quantum search algorithms. quantum mechanical principles. “Introduction to IDDQ testing”. proposed test architectures for SOC. levels of abstraction. M. analog test bus. Agrawal. DSP-based analog and mixed-signal test: functional DSP-based testing.simulation.

A-L Barabasi. Newman. References 1. The treatment will be theoretical with emphasis on problem solving and will be primality assignments based. generalized random graphs. . community structures. Properties of network: Small world effect. Technological networks. triangulations. Princeton University Press. Credit: 4 The objective of this course is to familiarize students with some contemporary research in the area of algorithm design and analysis.CS 60078 Complex Networks L-T-P: 3-0-0. network resilience. vertex copying models. Mendes. mixing patterns. guided network search. degree distribution. Typically analysis is often harder than design. Oxford University Press. Information networks. exhaustive network search. scale free networks. Applications: Search on networks. etc. D. degree correlations. Credit: 3 Types of network: Social networks. bipartite graph. F. Watts. network navigation. 2. Dorogovtsev and J. network navigation. S. maximum degree. Barabasi and Albert's model. Approximation algorithms: A set of rapidly evolving techniques that lead to provable approximation guarantees for hard optimization problems within polynomial running times. sorting faster than O(n log n). network visualization. Biological networks. spanners. degree correlations. Randomized algorithms in graphs and geometry: The impact of using randomization for designing algorithms that are simpler and often more efficient than the deterministic counterparts for several fundamental problems like MST. Graph Theory. J. Prentice Hall of India. CS 60080 Selected Topics in Algorithms L-T-P: 3-1-0. other growth models. Epidemiological processes. mincuts. the configuration model. 3. Processes taking place on networks: Percolation theory and network resilience. Random Graphs: Poisson random graphs. Narsingh Deo. M. N. The structure and dynamics of networks. transitivity and clustering. directed graph. Models of network growth: Price's model. convex hulls. Unlike other communities dealing with the same problems the emphasis here is on provability of general instances and goes hand-in-hand with the "hardness of approximation" theory. • • • Models of computation and efficiency: Searching faster than O(log n). Evolution of Networks. power-law degree distribution. F.

Zuckerman and H. CFRAC method. representation of extension fields. Montgomery arithmetic. optimal normal basis. Modern Computer Algebra. modular arithmetic. Springer International Edition. Computing discrete logarithms over finite fields: Baby-step-giant-step method. 6. elliptic curves over finite fields. Schoof's point counting algorithm. Applications of Finite Fields. polynomial basis. irreducible polynomials. Mathematics for Computer Algebra. . Lenstra-Lenstra-Lovasz algorithm. Victor Shoup. L. Chinese remainder theorem. Hensel lifting. Cambridge University Press. 2. Pohlig-Hellman method. 5. continued fractions and rational approximations. A. Cambridge University Press. Springer-Verlag. primitive elements. gcd. cryptography.Each of the topics on their own could be easily a full semester course. Applications: Algebraic coding theory. Kluwer Academic Publishers. index calculus methods. Pollard rho method. Integer factoring algorithms: Trial division. modular exponentiation. Menezes. Herbert S. Rational Points on Elliptic Curves. Algorithms for polynomials: Root-finding and factorization. prime number theorem. linear sieve method. Cambridge University Press. Vanstone. Elliptic curves: The elliptic curve group. Introduction to Finite Fields and their Applications. CS60082 COMPUTATIONAL NUMBER THEORY L-T-P: 3-0-0. Pollard rho method. Rudolf Lidl and Harald Niederreiter. normal basis. References 1. we may pick and choose from the above list of topics. Silverman and John Tate. Primality testing algorithms: Fermat test. congruence. p-1 method. polynomials over finite fields. Solovay-Strassen test. 4. Representation of finite fields: Prime and extension fields. so depending on the class response. Guide to Elliptic Curve Cryptography. quadratic residues. Maurice Mignotte. AKS test. R. Ivan Niven. A. Coppersmith's algorithm. Montgomery. Hankerson. Alfred J. Miller-Rabin test. orders and primitive roots. editor. 7. integer and modular square roots. John Wiley. 3. 8. D. Joachim von zur Gathen and Juergen Gerhard. Joseph H. quadratic sieve method. elliptic curve method. Menezes and S. A Computational Introduction to Number Theory and Algebra. An Introduction to the Theory of Numbers. Springer-Verlag. Credit: 3 Algorithms for integer arithmetic: Divisibility. J.

The DES in the light of Luby Rackoff Construction Left or Right Security (LOR) Message Authentication Codes (MACs): Formal Definition of Weak and Strong MACs. Application of the Luby Rackoff Construction to the construction of Block Ciphers. Public-key Cryptography: Theory and practice.9. Interrelations among the attack model Random Oracles: Provable Security and asymmetric cryptography. Formal Proofs of Security of Full Domain Hashing Assumptions for Public Key Signature Schemes: One way functions Imply Secure One-time Signatures Shamir's Secret Sharing Scheme Formally Analyzing Cryptographic Protocols Zero Knowledge Proofs and Protocols . hash functions One-way functions: Weak and Strong one way functions Pseudo-random Generators (PRG): Blum-Micali-Yao Construction. E. Credit: 4 Introduction to Cryptography: Basics of Symmetric Key Cryptography. Das and C. Pearson Education Asia. Signing and Verification. A. SpringerVerlag. Construction of more powerful PRG. Hardness of Functions Notions of Semantic Security (SS) and Message Indistinguishability (MI): Proof of Equivalence of SS and MI. A Course in Computational Algebraic Number Theory. Henri Cohen. Using a PRF as a MAC. Variable length MAC Public Key Signature Schemes: Formal Definitions. Relation between One-way functions and PRG. Trap-door permutation. 10. CS60084 FOUNDATIONS OF CRYPTOGRAPHY L-T-P: 3-1-0. Attacks under Message Non-malleability: NM-CPA and NM-CCA2. Hard Core Predicate. Veni Madhavan. Basics of Assymetric Key Cryptography. Goldwasser-Micali Encryption Goldreich-Levin Theorem: Relation between Hardcore Predicates and Trap-door permutations Formal Notions of Attacks: Attacks under Message Indistinguishability: Chosen Plaintext Attack(IND-CPA). Chosen Ciphertext Attacks (IND-CCA1 and INDCCA2). Pseudorandom Functions (PRF) Building a Pseudorandom Permutation: The Luby Rackoff Construction: Formal Definition.

database creation and update. diagnosis and treatment. cybernetics. Basics of OS programming: process creation and synchronization. building large client server applications. Hans Delfs and Helmut Knebl. Oded Goldreich. 4. Introduction to medical knowledgebased systems. Available at http://citeseerx. Credit: 4 Socket programming. shared memory and 2. Part 1 and Part 2 CS 69011 Computer Systems Lab-I L-T-P: 0-0-6. Interactive applications and multimedia medical information pathology. Linear programming with applications.psu.References 1. Pearson Education (Low Priced Edition) 3. Introduction to Cryptography: Principles and Applications. Modern Cryptography. Basics of compiler writing using lex and yacc. Lecture Notes on Cryptography. Foundations of Cryptography. virtual reality. Springer Verlag. Implementation of graph algorithms. Computer aided learning and education for medical and para-medical professionals. Theory and Practice. CRC Press (Low Priced Edition Available). CS 69012 Computer Systems Lab-II L-T-P: 0-0-6. Information Technology Prerequsites: None Computers in clinical medicine and practice. development and spread. Informatics and its relevance to medicine. Credit: 4 Object-oriented programming concepts and implementation of abstract data types. CS63052 L-T-P: 3-0-3 Credit: 5 . Applications of Internet and world wide web in health care delivery. radiology. Wenbo Mao. Shaffi Goldwasser and Mihir Bellare. Medical information storage and management patient medical history. records of physical and systematic examinations and investigations including laboratory. shell programming. Integrated hospital information systems.