Computer Sc. & Engg. Deptt. M.
Tech in Computer Science & Engineering
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
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
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
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)
CS 60070 CS 60076 CS 60078 CS 60080 CS 60082 CS 60084 CS 63052 IT 60004 IT 60030
Quantum Computing & Quantum Inf.
segment intersections. primality testing. Hopcroft and J. Halting Problem of Turing Machines.H.
CS 60003 Algorithm Design and Analysis
L-T-P: 4-0-0. Special topics: Geometric algorithms (range searching. Approximation algorithms. extended Euclid's algorithm. 4. H. House. Languages and Computation. Credit: 4
Discrete Structures -. NP-Completeness. The class PSPACE. Graph Algorithms: Shortest paths. Flow networks. The class P. modular exponentiation. Narosa Pub.Elements of the Theory of Computation. Web caching). Posets.Chomsky Hierarchy of Grammars and the corresponding acceptors. co-NP. Prentice Hall.Sets. data compression. 2. Morphisms. Algebraic Structures. Thomson Course Technology. Michael Sipser -. McGraw Hill Book Co. 3. Linear programming. Decidability and Undecidability. Delhi. cryptographic computations).Measuring Complexity.
.Savich's Theorem. Text Books and References: 1. Relations and Functions. Asymptotic complexity. information retrieval.Tech.Time Complexity -.Church-Turing Thesis.Ullman -. Computability -.Discrete Mathematical Structures with Applications to Computer Science. Credit: 4
Algorithmic paradigms: Dynamic Programming. Manohar -. Branch-and-bound. closest pairs). Numerical algorithms (integer. Greedy. matrix and polynomial multiplication. Reduction. Problem reduction (Turing and mapping reduction). convex hulls. Recursive and Recursively Enumerable Languages. Computational Complexity -. Satisfiabiliy and validity. Turing Machines. Polynomial Hierarchy. NP-completeness.Inrtroduction to Automata Theory.P. Trembley and R. Randomized algorithms.Propositional calculus and Predicate Calculus. John E.D. International. Notions of soundness and completeness Languages & Automata Theory -. Amortized analysis. The class NP. Inc.Introduction to The Theory of Computation.Computer Science and Engineering Department Syllabi of M. Lewis and C.Papadimitrou -. Proof Techniques. Lattices and Boolean Algebras.. tries. Decision Problems. Operations on Languages. J. Logic -.R. Space Complexity -. Subjects
CS60001 Foundations of Computing Science L-T-P: 3-1-0. Internet algorithms (text pattern matching. N. FFT. closures with respect to the operations.
directory services. First Order Theories. Kerberos.
CS 60031 Logics for Computer Science
L-T-P: 3-1-0. Instruction-level parallelism: basic concepts. Cluster computers. leader election. Coherence and locality properties. Fault tolerance and recovery: basic concepts. instruction and arithmetic pipeline. Cache memory organizations. Peano Arithmetic. Pipelining: Basic concepts. techniques for increasing ILP. Decision Procedures in First Order Logic: Resolution Theorem Provers: some theoretical issues. Model Checking. Temporal Logic: their applications. Proof Theory. Credit: 4
Basic concepts. memory consistency. Exception handling. agreement problems and its applications. Hierarchical memory technology: Inclusion. Credit: 4
Introduction: review of basic computer architecture. Virtual memory organization. Distributed shared-memory architecture. systolic architectures. and structural hazards. synchronous and asynchronous systems. web services. Compiler techniques for improving performance. Array and vector processors. measuring and reporting performance. control hazards. Techniques for reducing cache misses. Pipeline optimization techniques. Modal Logic. mapping and management techniques. Query Processing and Optimization: Evaluation of Relational Operations. data hazards. distributed databases. Lambda Calculus. Fuzzy Logic. Models of computation: shared memory and message passing systems. mutual exclusion. superpipelined and VLIW processor architectures. CS 60030 Distributed Systems L-T-P: 4-0-0. techniques for handling hazards. memory replacement policies. Inclusion and Generalized Functional Dependency. Predicate Calculus. reduction computer architectures. Indexing and Query Optimization. Centralized shared-memory architecture: synchronization. Intuitionistic First Order Logic. Multi-valued and Join Dependency.CS 60002 High Performance Computer Architecture
L-T-P: 4-0-0. Multiprocessor architecture: taxonomy of parallel architectures. Resource sharing and load balancing. Security and Authentication: basic concepts. Special topics: distributed objects. clock synchronization. Transformation of Relational Expressions. distributed shared memory. Nonmonotonic Reasoning. deadlock detection. Limitations of Relational
. Model Theory. Chase Algorithms and Synthesis of Relational Schemes.
CS 60032 Database Engineering
L-T-P: 3-0-0. CISC and RISC processors. interconnection networks. spanning tree construction. termination detection. Template Algebraic. Global state and snapshot algorithms. Credit: 3
Relational Databases: Integrity Constraints revisited: Functional. mu Calculus. reliable communication. fault models. Credit: 4
Axiomatic Theory: Propositional Calculus. Non von Neumann architectures: data flow computers. Programming models: remote procedure calls. checkpointing and recovery. superscalar. voting protocols. commit protocols. quantitative techniques in computer design. Logical time and event ordering.
Built-in Multi-user and
. Q uadtrees. Compensation and Databases Recovery. Image Features. Logic programming language PROLOG . Superscalar. DB2. Architecture of Object Oriented and Object Relational Databases. Active Databases: Triggers in SQL. Long Duration Transactions. Recursive queries with negation. Basic concepts. Location and Fragment Transparency.Data Model. Cuts and negation. Processor Architecture with hierarchical memory organization: Cache memory. Real Time Databases: Temporal Constraints: Soft and Hard Constraints. Parallelism in Processor Architecture: Pipelining. Audio and Handwritten Data. Objected Oriented and Object Relational Databases: Modeling Complex Data Semantics. Herbrand interpretation and resolution methods. Autoepistemic knowledge. Modal logic. Multimedia Data Formats. Constraint Logic Programming over finite domains. Super-pipeline and VLIW Architectures. Oracle xxi. Constraint Logic Programming over the reals.a case study. Transaction Work Flows. Non-deterministic programming. Event Constraint and Action: ECA Rules. constraint propagation. Negation as Failure. Accessibilty. Virtual memory. Constraint satisfaction. Generalization. Compensating Transactions and Saga. Co-processors. Inference Rules. Equality and Object Reference. Query Processing and Concurrency Control. Video Data Model. Recursive programming. Content Based Retrival: Color Histograms. Unification and SLD-Resolution. k-d tree. deduction. Textures etc. Temporal logic. Evaluation of Datalog program. DB2. Object Identity. Deductive Databases: Datalog and Recursion. Transaction Processing Monitors. First Order Logic: syntax and semantics. WEB Servers. Distributed Query Processing and Optimization. Relation and Kripke possible world semantics. CS 60034 Advanced Microprocessor Based Systems L-T-P: 3-0-0. Credit: 3
Introduction: Basics of Von Neumann Architecture and the early Microprocessors. Sequential Patterns.Warren s Abstract Machine (WAM). Aggregation and Association.R-tree. O2. Spatial and Topological Relationships.
CS 60033 Logic Programming
L-T-P: 3-0-0. XML Databases. Distributed Deadlock. Geographic Information Systems (GIS). Built-in Multiprocessing support. CISC and RISC concepts. Distributed Transaction Modeling and Concurrency Control. Parallel Query Evaluation. Data Structures . Abstract computational model . WEB Databases: Accessing Databases through WEB. Image and Multimedia Databases: Modeling and Storage of Image and Multimedia Data. Low-power Architecture. Null Values and Partial Information. Commercial Systems: Oracle xxi. Weak Levels of Consistency. Parallel and Distributed Databases: Distributed Data Storage: Fragmentation and Replication. Implementation of Prolog on WAM. SQL3. Credit: 3
Propositional logic. Commit Protocols. Transaction Scheduling and Concurrency Control. Objects. Object Store. Advanced Transaction Processing: Nested and Multilevel Transactions. Association and Classification Rules. The logic of knowledge and belief. Case Studies: Gemstone. Data Mining: Knowledge Representation Using Rules. Syntax and Semantics of Logic Programs. Specialization. Algorithms for Rule Accessing. Design of Parallel Databases. Introduction to Constraint Logic Programming: Constraint logic programming scheme. Introduction to nonclassical logics.
specification languages. Indexing. Kluwer. specification refinement and design. Inference: reasoning about knowledge. Credit: 3
Data. special purpose processors. Frame/script systems. information and knowledge. Rulebased programming and production systems. M Manning and P Schutze. Casebased reasoning. Model of an intelligent system. Case studies with contemporary Microprocessors. Real Time operating system issues with respect to embedded system applications. Credit: 3
Introduction: Principles of Information Retrieval. Temporal reasoning. e. Introduction to Information Retrieval. Evolution of platform architecture. Knowledge representation and the Web. input-output design and I/O communication protocols. intelligent interfaces. Communication processors. Search. TREC Text classification. Zipfs Law. Intelligent agents. Planning. Inference under uncertainty: Bayesian techniques. Special-purpose processor Architectures: Signal processing Microprocessors. time constraints and performance analysis. example system design. design validation. Semantic Web. hardware and processor requirements. 2007
CS 60036 Intelligent Systems
L-T-P: 3-0-0. Formal approach to specification. Semantic representations: semantic networks. f-measure. Agent theory and languages. Credit: 4
Introduction to Embedded Systems . Fuzzy reasoning. The agent metaphor and attributes of agenthood. Ontologies. Vector space model. usermodelling. frames. Suggested Text: 1. Knowledge based systems: Software architecture of a knowledge-based system. clustering. Rochhio. Ontological issues. Configuration.
. Applications of AI: Example application domains. recall.
CS 60037 Embedded Systems
L-T-P: 3-1-0. design space exploration for constraint satisfaction. cosine similarity.definitions and constraints. Inter-agent communication. P Raghavan. Scoring techniques. Rule chaining and inference control. Evaluation: Precision. Query expansion. Conceptual dependency and conceptual graphs.g. Advanced topics like summarization and question answering. query routing.multitasking support in 16-bit and 32 bit microprocessors. Built-in memory mapping and management support. their history. Diagnosis. Stemming. Practical implications of choosing and applying AI solutions. Probabilistic models language. Models of knowledge representations: Representation and reasoning in logic.
CS 60035 Information Retrieval
L-T-P: 3-0-0. codesign approach. Stop words. Relevance feedback. Alternatives to the symbolic approach: Foundations of connectionist networks.
Delay faults and hazards. Case studies of contemporary operating systems. test generation techniques. Fault simulation: parallel. RCS. SAFER. one-way and trapdoor one-way functions. Exhaustive. aliasing and its effect on fault coverage. Credit: 3
Theory and implementation aspects of distributed operating systems. embedded systems. divide and conquer. Process synchronization in multiprocessing/multiprogramming systems. Verification: logic level (combinational and sequential circuits). routing. relationship with PRAM models. secret-key and public-key cryptography. lower bounds. OS issues related to the Internet. random and weighted test pattern generation. graph algorithms. SEAL. cryptanalysis. boundary scan. intermittent and pattern-sensitive faults. etc. The PRAM Model: balancing.
. list ranking. clock synchronization. Distributed resource management. mobile systems and wireless networks. mutual exclusion. DES and its variants. Inter-process communication and co-ordination in large distributed systems. logical time and event ordering. CS 60040 Parallel and Distributed Algorithms L-T-P: 3-0-0. scan path and LSSD. AES. BlowFish. Test pattern generation for sequential circuits: ad-hoc and structures techniques. Block ciphers: Modes of operation. fault collapsing. pointer jumping. classical cryptography. IDEA. sorting and searching. Test generation for combinational circuits: Boolean difference. Information management in distributed systems: security. logic-based approaches. Distributed graph algorithms. integrity and concurrency problems. attack models. Built-in self-test techniques. termination. global state and snapshot algorithms. butterfly) and fundamental algorithms. D-algorithm. Fundamentals of real time operating systems. pervasive computing. test generation. Memory testing: permanent. Stream ciphers: Stream ciphers based on linear feedback shift registers. termination detection. hypercubes. Case studies. critical path tracing. Applications of Distributed algorithms. intranets. RTL-level (data path and control path). Verification of embedded systems. test generation. parallel complexity and complexity classes. FEAL. parallel prefix computation. safety. easily testable designs. Use of formal techniques: decision diagrams. trees. Distributed Algorithms: models and complexity measures. liveness.CS 60038 Advances in Operating Systems Design
L-T-P: 3-0-0. deductive and concurrent techniques. routing. Credit: 3
Fundamentals: Models of parallel and distributed computation. Interconnection Networks: topologies (arrays and mesh networks. linear and differential cryptanalysis. Fault equivalence and dominance. matrix algorithms. Credit: 4
Introduction: Basic objectives of cryptography. symmetry breaking. election. Asynchronous Parallel Computation. Podem. systolic networks. Fault tolerance issues. sorting. PLA testing: cross-point fault model. CS 60041 Cryptography and Network Security L-T-P: 3-1-0. Credit: 4
Physical faults and their modeling.
CS 60039 Testing and Verification of circuits
L-T-P: 3-1-0. graph algorithms. complexity measures.
Code improvement . finding occurrence of known sites. error recovery and intermediate code generation. modular square roots. known algorithms for solving the intractable problems. model-based clustering. discovering new sites. Benchmarks. Estimation of MTF and other reliability parameters.peephole optimization. Multiple alignment: scoring model. Parameter estimation and hypothesis testing. loop optimization. Digital signatures: RSA. Analysis of DNA microarray data using hierarchical clustering. blind and undeniable signatures. stochastic processes.unconditional security.
CS 60044 Performance Evaluation and Reliability of Information Systems
L-T-P: 3-0-0. parsing. instruction scheduling. Portability and retargetability. maximal dependence decomposition. Software metrics and software reliability models. CS 60043 Algorithms for Bioinformatics L-T-P: 3-0-0. DAS and NR signature schemes. hidden monomial cryptosystems. Kerberos. primality testing. optimization for memory hierarchy. CS 60042 Advances in Compiler Construction L-T-P: 3-1-0. Credit: 4
Review of compiler fundamentals .lexical analysis. Models of information systems. zero-knowledge protocols. discrete logarithm problem. introduction to reliability measures. Rabin and EIGamal schemes. object-oriented and mark-up languages. heuristic alignment. Message digest: Properties of hash functions. Chinese remainder theorem. Bayesian model selection. Network issues: Certification. Credit: 3
Review of probability and statistics.
. Intractable problems: Integer factorization problem. Key exchange: Diffie-Hellman and MQV algorithms. finite fields. gcd. Standards: IEEE. Markov Models. dependence analysis and redundancy elimination. Compilation for high performance architecture. number field sieve. secured socket layer (SSL). Estimations of performance metrics. homology. challenge-response algorithms. Runtime storage management. Credit: 3
Sequence similarity. procedural and inter-procedural optimization. local alignment gapped and ungapped global alignment. expectation-maximization clustering. parallel and distributed programming and concurrency. Queuing network models. Diffie-Hellman problem. dynamic programming algorithms. RSA and ISO standards. keyed hash functions. attacks on hash functions. Motif finding: motif models. modular square root problem. and pairwise alignment using Hidden Markov Models. semantic analysis. MD2. case studies. Code generation. lattices and their applications in cryptography. Advanced topics: Elliptic and hyper-elliptic curve cryptography. Workload design. RSA problem. Entity authentication: Passwords. and alignment. Public-key encryption: RSA. cryptographically secure random number generators. Selected topics from compilers for imperative. Public-key parameters: Modular arithmetic. public-key infrastructure (PKI). MD5 and SHA-1. Pairwise alignment: scoring model. Gene Finding: predicting reading frames. side channel attacks.
reinforcement learning. game playing. shortest paths. Applications. the cycle space and the bond space. Credit: 3
Introduction to real time system. the Welsh-Powell bound. duality. Max flow min cut theorems. Networks and flows: Flow cuts. Intelligent Agents. Extremal problems: Independent sets and covering numbers. Real Time operating systems. non-monotonic reasoning. computational learning theory. CS 60048 Theory of Programming Languages L-T-P: 3-0-0. diameter and maximum degree. Petersen's theorem. isomorphism. Hard and Soft Real Time Systems. Distributed Real Time Systems. Credit: 4
Basic Concepts: Graphs and digraphs. the greedy algorithm. perfect graphs. Neural networks. Matchings: Berge's Theorem. Linear
. answer extraction. Colorings: Brooks theorem. girth. Vizing's theorem. Selected topics: Dominating sets. plan space and partial order planning. graphs on other surfaces. directed paths and cycles. minimum spanning trees. girth and chromatic number. Reasoning under Uncertainty: probabilistic reasoning. Euler's formula. connectivity and strongly connected digraphs.
CS 60047 Advanced Graph Theory
L-T-P: 3-1-0. logic programming and constrained logic programming. incidence and adjacency matrices. Directed graphs: Tournaments. branchings. critical graphs. inference and deduction. Natural Language Understanding. Ramsey theorems. bonds. Learning: inductive learning. Bondy and Chvatal. perfect square. Validation and Verification. Cayley's formula. decision trees. Hall's theorem.CS 60045 Artificial Intelligence
L-T-P: 3-0-0. Real time Process and Applications. Ore. Graphs on surfaces: Planar graphs. toroidal graphs. Menger s theorem. Context Free Languages. the reconstruction problem. Hamilton paths and cycles. Connectivity: Cut vertices. resolution refutation. Pushdown Automata. Kuratowski's theorem. perfect matchings. Automated Reasoning: proposition and first order logic. circumference. Design methods. the Chinese Postman Problem. Turan's theorem. Handling real time. intersection graphs. Credit: 3
Problem solving by search: state space. knowledge based systems.
CS 60046 Real Time Systems
L-T-P: 3-0-0. chromatic polynomials. Tutte's theorem. Formal Language and Automata Theory: Finite Automata. cut edges. Planning: state-space. Konig's theorem. blocks. the Travelling Salesman problem. Paths and Cycles: Euler tours. constraint satisfaction. theorems of Dirac. Regular Languages. the automorphism group. logical approaches. Specification and Modeling. Tutte's f-factor theorem. factors of graphs (decompositions of the complete graph). random graphs. Trees: Equivalent definitions of trees and forests. algorithms for matching and weighted matching (in both bipartitie and general graphs). embedded systems and reactive systems. problem reduction. Credit: 3
Syntax of Programming Languages. belief networks. planning algorithms. the Matrix-Tree theorem. 2-cell embeddings.
completeness. Quantum computation. Cardinality of sets. reductions. Countable and Uncountable Sets. Probabilistic Machine Learning Maximum Likelihood Estimation. algorithms. Groups. complexity. lower bounds. Inference in Bayesian Networks. Interactive proofs. Algebraic Structures. Rule Learning: Propositional and First-Order. P/NP/PSPACE. Communication complexity.
CS 60049 Computational Complexity
L-T-P: 3-1-0. Approximability. resources (time and space). Sample complexity. Counting problems. Decision Tree Learning. Lattices. Parallel computation and complexity. Clustering and Unsupervised Learning.
. Axiomatic Semantics: Floyd. Algebraic Semantics and Data Types. Rings. Algebraic Structures: Semigroups. Substructures and Morphisms. Probabilistically checkable proofs. Minimum description length principle. MAP. Fields and Vector Spaces. Artificial Neural Networks : Linear threshold units. Turing machines and Recursively Enumerable Sets. Computational complexity of training. Credit: 4
Models of Computation. Context Sensitive Languages. Denotational Semantics: Scott-Strachy Theory. Hidden Markov Models. Sets. Basic operations on sets. Binary relations: Equivalence Relations. hierarchy. computability. Lambda Calculus. Version spaces. Over-fitting. preventing overfitting. Bayes optimal classifers. Relations.
CS 60051 Discrete Structures
L-T-P: 3-1-0. Case-based learning. Perceptrons. Sequential Languages (Imperative and Applicative): Operational Semantics. Partial Orders and Posets. recurrent networks. Circuit complexity. Bayes Classifiers Naive Bayes. General-to-specific ordering of hypotheses. Experimental Evaluation of Learning Algorithms Instance-Based Learning: k-Nearestneighbor algorithm. Bayes Net Structure Learning Unlabelled data: EM. Mathematical Induction. Radial basis functions. Multilayer networks and backpropagation. Vienna Definition Methods. K-means and Hierarchical Clustering. cotraining Gaussian Mixture Models. Credit: 3
The concept learning task. Attribute Grammars.Bounded Automata.
CS 60050 Machine Learning
L-T-P: 3-0-0. Vapnik-Chervonenkis dimension. Cantor's Theorem. Reinforcement Learning Support Vector Machines Ensemble learning: boosting. Randomized computation and complexity. Proof Methods of Implications. Theory of LR(k) Parsing. Complexity classes. hardness. incompleteness. Credit: 4
Propositional Logic. Bayesian Networks. Temporal Logic. Semantics of Programming Languages: Basic Mathematical Introduction: Propositional and Predicate Calculus. relationships between complexity classes. Pigeonhole Principle. Functions. bagging. Computational Learning Theory: probably approximately correct (PAC) learning. Inductive bias. Cross-Validation. Finite and Infinite Sets. Logical characterizations. Monoids. First Order Logic and Other Proof Methods.Hoare Approach.
3D Imaging. Dynamic CMOS circuits. Basic Counting Principles. operation of MOS transistors as a switch and an amplifier. Texture Analysis. Camera Principles. NMOS and CMOS. Low-Power CMOS Circuit Design: CMOS inverter characteristics. Non-linear Image Processing: Median and Order Statistics Filters.Voltage Device Modeling: Spice models for MOS transistor. Neural Network Classifiers. JPEG2000. Permutations. standard cell and datapath cell design. Parameters involved in power dissipation. Scale space and diffusion. Fuzzy Classification. Adiabatic switching concepts. Image and Video Compression Standards: Lossy and lossless compression schemes: Transform Based. BiCMOS. Logical effort. standard cell based. Radiometry of Imaging. Entropy Encoding. I/O cells. Different types of VLSI design styles: Full custom. CMOS logic: PMOS. Optical flow based motion estimation. Single Sensor Color Imaging and Color Demosaicing. design rules and layout. JPEG. Pass-transistor circuits. CMOS low voltage analytical model. Credit: 3
Sensor and Imaging: Imaging Optics. Switching activity in CMOS circuits. CMOS Power supply voltage scaling. Introduction to hardware description language (HDL) Verilog/VHDL. Sub-band Decomposition. Multi-threshold CMOS circuit design. Two Dimensional Teager Filters. Sources of Power dissipation. A logic synthesis example. Knowledge-based interpretation of images. Recurrence Relations and their solutions. Rank-Ordered-Mean Filters and Signal Dependent Rank-Ordered-Mean Filters. Illumination sources and techniques. delay and power estimation. Shape Reconstruction from volumetric data. Stereo matching and depth estimation. Multi-Resolutional Signal Representation. ASIC Library Design: Transistors as Resistors and parasitic Capacitance. Applications of nonlinear filters in image enhancement.
CS 60053 VLSI System Design
L-T-P: 3-1-0. Signal Representation: Vector Space and Unitary Trasnsforms.Boolean Algebras. Retinex Processing. and MPEG-7. Object Analysis. delay analysis. VLSI Design flow. pass transistors etc. Classification: Bayesian Classification. Edge Detection. programmable logic. Depth from focus. Low-Power circuit techniques. Edges in multichannel images. Reflectance based shape recovery. Credit: 3
Low-Power Design Methodologies: an Overview: Why Low-Power? Low. Example design technique: mapping of architecture to silicon. Range Images. Wavelet Decomposition. Color Imaging. Floor-planning and Placement: I/O and power planning. Feature Estimation: Morphological Operations. gate array. noise removal etc. Credit: 4
Introduction to VLSI Design. Low-
. stick diagram. clock planning. CMOS process. gate array based. MPEG-1. Representation of color. CS 60054 Low Power Circuits Design L-T-P: 3-0-0. MOS inverter. Markov Random Field Modellings of Images. Sequential logic cells. Combinational logic cells. MPEG-4. different type of MOS circuits: Dynamic logic. edge detections. field programmable gate arrays etc. Datapath logic cells. Routing global and detailed. CS 60052 Advanced Digital Image Processing and Computer Vision L-T-P: 3-0-0. Combinations. Electrical characteristics. Morphisms of Boolean Algebras.
Modulation. Projection: perspective and parallel projections. circle. Plotters. Mobile TCP. Cubic and Bicubic Splines. Mobile applications and services. Wireless ATM. Power estimation techniques. Sweep Representation. Coordinate Conventions: world coordinates. Computer Animation: fundamental concepts. Finite State Transducers. device coordinates. polygon. Hidden surface and line elimination: Elimination of back surfaces. Low-Power Architecture level design. Octree and Medial Axis representation. vector devices. curves and text. TDMA. localization. Display of colors: Look Up Tables. Brief Review of Regular Expressions and Automata. fractal modeling. Part of Speech Tagging. Binary Space Partitioning Tree. Credit: 3
Speech and Natural Language Processing: Introduction. Surfaces and Volumes by rotation of curves and surfaces. Working Principles of display devices: refreshing raster scan devices. reflection. Voxel. parametric curves and surfaces. Blue-tooth. convex hull computation. Display and drawing of graphics primitives: point. polygon intersection. Introduction to HMMs and Speech Recognition. Satellite systems: basic routing. and handoff issues. Multiplexing. Half toning. Lowvoltage BICMOS families. Radiosity Computation. isometric projection. Algorithmic-level Power Reduction. Wireless Application Protocol (WAP) and WML. Cellular systems: AMPS. Geometric computation and representation. Wireless TCP: indirect TCP. DSR. display of gray shades. Signal propagation. GSM. Goraud and Phong Shading. polygon filling.
CS 60057 Speech and Natural Language Processing
L-T-P: 3-0-0. Indian language case studies. DSDV routing. Media access control: FDMA. Information Management. IMT-2000. Ray tracing algorithm. rotation. Graphics Environments. CDMA-based cellular systems. view-port and window. Computations on polygons: point inclusion problem. Low-power gate level design. CDMA. Wireless Networks: packet radio network. Low-power VLSI Design Methodologies: Low-Power Physical design. Ad-Hoc Networks: AODV.11b. Rendering and Visualization: Shading model. CS 60055 Ubiquitous Computing L-T-P: 3-0-0. Security. painters' algorithms. Transformations in 2D and 3D: translation. zooming and panning by changing coordinate reference frames. Wireless LAN:IEEE 802. polygonization of a point set. Credit: 3
Overview of wireless technologies. Snooping TCP. Transformation matrices. Word level Morphology and Computational Phonology.
CS 60056 Computer Graphics
L-T-P: 3-1-0. scaling. UMTS. clipping. line. Parsing with
. Location-Independent and Locationdependent computing models. normalized device coordinates. Basic Text to Speech. Mobile Networking: Mobile IP. Low-voltage BICMOS Applications. triangulation of polygons. Credit: 4
Introduction: Display of entities. DECT. and Spread spectrum techniques. Constant. Volume and Surface Representation: polygonal meshes.Power BICMOS Circuit Design: Characteristics of BICMOS logic circuits. Cathode Ray Tube Terminals.
detection of faults. Turing Computability: number theoretic computations by Turing machines and indexing. Lambda calculus and applications. Semantic Analysis. components and framework. computable sets. Object-oriented programming languages and implementation. Turing machines. recursive and general recursive functions. still image and video.
CS 60062 Multimedia Systems
L-T-P: 3-0-0. Probabilistic Parsing. Axiomatic systems. functions and functionals. Object model and object-oriented concepts.
CS 60060 Formal Systems
L-T-P: 3-1-0. Techniques of Machine Translation. Natural Language Generation. concentrated and distributed voters. Coding theory: application to fault tolerant system design. Case studies. protective redundancy. Word Sense. object-relational system. Recursive function theory: primitive recursive functions and primitive recursive predicates. Fault recovery techniques. Credit: 3
An overview of multimedia system and media streams. linear bounded automata and CSLs. object definition and query language. Computability and decidability: computable functions. interoperability and middleware standards COM/DCOM and CORBA. Discourse understanding. Source representation and compression techniques text. Disambiguation. decision theory in redundant systems. Fault-tolerance and reliability of multicomputer networks (direct and indirect) including fault-tolerant routing and sparing techniques. Credit: 3
Fundamental concepts in the theory of reliable computer systems design. models of fault tolerant computing systems. Implementation techniques: software defense. errors and their management strategies. Graphics and
. behavioral and architectural modeling. their soundness and completeness. Introduction to redundancy theory. Distributed object computing. architectural support. Ackermann's function. time and space bounds for recognizing CFLs.
CS 60059 Object Oriented Systems
L-T-P: 3-0-0. Representation of Meaning. speech and audio. Indian Language case studies. limit theorems. Credit: 3
Review of programming practices and code-reuse. decision problems. Object-oriented database system data model. Yield and reliability enhancement techniques for VLSI/WSI array processors. Unified development process.CFGs. verification methods. CS 60058 Fault Tolerant Systems L-T-P: 3-0-0. Objectoriented analyses and design using UML structural. Time and tape bounded Turing machines. Hardware fault tolerance. replication and compression techniques. Software fault tolerance: fault tolerance versus fault intolerance. Fixpoint theory of programs. Software reuse design patterns. Credit: 4
Formal languages and their related automata. Lexical Semantics. self-repairing techniques. type-0 languages. redundancy techniques.
Introduction. challenges. many-faces complexity and algorithms. complexity of the union of convex sets. Arrangements of lines: arrangements of hyperplanes. Visibility: algorithms for weak and strong visibility. representations. Sweep techniques: plane sweep for segment intersections. Multimedia OS and middleware. Unified Modelling Language (UML). variants. writing test benches.
CS 60068 CAD for VLSI
L-T-P: 3-1-0. video conferencing. lower bounds. Credit: 4
Convex hulls: construction in 2d and 3d. Function-oriented design: structured analysis and design. Life cycle models. Delayney triangulations: divideand-conquer. Coding standards and guidelines. flip and incremental algorithms. Technology mapping. Applications of computational geometry. Credit: 4
Introduction: VLSI design flow. techniques for counting. Overview of object-oriented concepts. Verilog/VHDL: introduction and use in synthesis. duality of Voronoi diagrams. linear programming with prune and search. Helly's theorems. simply connected sets and visible regions. zone theorems.
CS 60066 Software Engineering
L-T-P: 3-0-3.animation. scheduling. Randomization in computational geometry: algorithms. Triangulations: polygon triangulations. state assignment of finite state machines. Multimedia information system and applications. Clientserver software development. Software maintenance issues and techniques. polytopes and linear progarmming in d-dimensions. User interface design. visibility with reflections. Testability issues: fault modeling and
. Formal requirements specification. planar graphs. Combinatorial geometry: Ham-sandwich cuts. Voronoi diagrams: construction and applications. Multimedia communication. polytopes and hierarchies. Synchronization and QoS. Multi-modal communication. video-on-demand broadcasting issues. traffic shaping and networking support. SEI CMM and ISO 9001. Software project management. Fortune's sweep for Voronoi diagrams. allocation and binding. Integration and system testing. Transcoding. Cleanroom technique. Fundamental issues in software design: goodness of design. Software quality and reliability. Logic synthesis: two-level and multilevel gate-level optimization tools. topological sweep for line arrangements. Robust geometric computing. PSP and Six Sigma. Code walkthrough and reviews. Configuration management. Unit testing. cohesion. interval trees.
CS 60064 Computational Geometry
L-T-P: 3-1-0. art-gallery problems. fractional cascading. point-set triangulations. Software reuse. Basic concepts of high-level synthesis: partitioning. concatenable queues. modeling combinational and sequential logic. finger trees. min-max angle properties. k-sets. Unified design process. databases and content management. Requirements analysis and specification. coupling. Geometric searching: pointlocation. Black box and white box testing. segment trees. Multimedia servers.
Main Text Books: 1. Advanced BIST techniques: theory of linear machines. IEEE 1149. Kluwer Academic Publishers. VLSI design styles: full-custom. Kluwer Academic Publishers.4 test standard”. test generation. static ADC and DAC testing methods. Sequential circuit testing: time frame expansion and simulation-based approaches to ATPG. limitations. future challenges. “Essentials of Electronic Testing”. analog ATPG. etc. clock and power routing. Physical design automation. analog test bus. Model-based analog and mixed-signal test: analog fault models. S. standard-cell. CS 60076 Advances in Digital & Mixed Signal Testing L-T-P: 3-0-0. 1997. Bushnell and V. DSP-based analog and mixed-signal test: functional DSP-based testing. quantum gates and registers. CODECD testing.simulation. placement.
. universal gates for quantum computing. transition faults. quantum entanglement. Analog test bus standard: analog circuit DFT. A. proposed test architectures for SOC. compaction.D. core-based design and system wrapper. Cheng. Thadikaran. elements of quantum information theory and quantum cryptography. “Delay fault testing for VLSI circuits”. IDDQ design for testability. IDDQ testing: basic concept. routing. Credit: 4
Mathematical foundations. analog fault simulation. quantum Fourier transforms and its applications. 2. practical BIST architectures.L. reversible computation. CS 60070 Quantum Computing and Quantum Information Processing L-T-P: 3-1-0. Review of MOS/CMOS fabrication technology.4 standard. “Analog and mixed-signal boundary scan: a guide to the IEEE 1149. “Introduction to IDDQ testing”. Functional testing of microprocessors and microcontrollers. entanglement assisted communication. quantum search algorithms. 1999. Physical design automation algorithms: floor-planning. quantum parallelism and simple quantum algorithms. design of testable FSMs. realizing emulated instruments. M. Chakravarty and P. Basic concepts of verification. System-on-chip design and test: SOC testing problem. 3. 2000. Agrawal. Kluwer Academic Publishers. quantum mechanical principles. levels of abstraction. A. qubits. design for testability. platform-based design and testability issues. Special considerations for analog and mixed-signal designs. Testing SoC's. design rule check. Functional testing of arithmetic and regular arrays. built-in self-test. 2003. test generation. power and delay estimation. elements of quantum automata and quantum complexity theory. Credit: 3
Delay fault testing: path delay test. faults detected. use of coding theory. gate-array and FPGA.J. Osseiran. introduction to quantum error correcting codes. Krstic and K-T. delay test methodologies. Kluwer Academic Publishers. 4.
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. maximum degree. F. Watts.
Models of computation and efficiency: Searching faster than O(log n). Evolution of Networks. Applications: Search on networks. Information networks. Approximation algorithms: A set of rapidly evolving techniques that lead to provable approximation guarantees for hard optimization problems within polynomial running times. Oxford 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. Typically analysis is often harder than design. Technological networks. degree correlations. N. directed graph.CS 60078 Complex Networks
L-T-P: 3-0-0. guided network search. etc.
. Barabasi and Albert's model. other growth models. 3. Graph Theory. sorting faster than O(n log n). Biological networks. M. D. 2. CS 60080 Selected Topics in Algorithms L-T-P: 3-1-0. network navigation. the configuration model. Newman. network resilience. generalized random graphs. degree correlations. exhaustive network search. Credit: 3
Types of network: Social networks. spanners. Models of network growth: Price's model.
References 1. network visualization. Random Graphs: Poisson random graphs. The structure and dynamics of networks. S. Epidemiological processes. network navigation. Narsingh Deo. bipartite graph. Processes taking place on networks: Percolation theory and network resilience. F. 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. mixing patterns. transitivity and clustering. degree distribution. Mendes. A-L Barabasi. Princeton University Press. convex hulls. Dorogovtsev and J. mincuts. triangulations. scale free networks. Prentice Hall of India. The treatment will be theoretical with emphasis on problem solving and will be primality assignments based. J. power-law degree distribution. community structures. Properties of network: Small world effect. vertex copying models.
Alfred J. Modern Computer Algebra. Lenstra-Lenstra-Lovasz algorithm. Applications of Finite Fields. Joachim von zur Gathen and Juergen Gerhard. A Computational Introduction to Number Theory and Algebra. Montgomery. integer and modular square roots. Coppersmith's algorithm. Primality testing algorithms: Fermat test. quadratic residues. gcd. Vanstone.
. Chinese remainder theorem. 8. Credit: 3
Algorithms for integer arithmetic: Divisibility. modular exponentiation. Hensel lifting. we may pick and choose from the above list of topics. An Introduction to the Theory of Numbers. Algorithms for polynomials: Root-finding and factorization. Cambridge University Press. cryptography. index calculus methods. Zuckerman and H. Introduction to Finite Fields and their Applications. congruence. continued fractions and rational approximations. Pollard rho method. Menezes. References 1. representation of extension fields.Each of the topics on their own could be easily a full semester course. optimal normal basis. A. AKS test. Pollard rho method. linear sieve method. Maurice Mignotte. Springer International Edition. Integer factoring algorithms: Trial division. p-1 method. Miller-Rabin test. Silverman and John Tate. prime number theorem. orders and primitive roots. Victor Shoup. Pohlig-Hellman method. 7. Ivan Niven. Hankerson. normal basis. editor. Cambridge University Press. 6. R. Schoof's point counting algorithm. J. Joseph H. A. modular arithmetic. Menezes and S. Elliptic curves: The elliptic curve group. CFRAC method. Computing discrete logarithms over finite fields: Baby-step-giant-step method. Solovay-Strassen test. John Wiley. Cambridge University Press. Mathematics for Computer Algebra. Rudolf Lidl and Harald Niederreiter. quadratic sieve method. Springer-Verlag. primitive elements. 3. D. elliptic curves over finite fields. Rational Points on Elliptic Curves. so depending on the class response. irreducible polynomials. Representation of finite fields: Prime and extension fields. Herbert S. Montgomery arithmetic. Guide to Elliptic Curve Cryptography. polynomial basis. Applications: Algebraic coding theory. 5. Kluwer Academic Publishers. Springer-Verlag. elliptic curve method. polynomials over finite fields. 4. 2. L. CS60082 COMPUTATIONAL NUMBER THEORY L-T-P: 3-0-0.
Introduction to Cryptography: Basics of Symmetric Key Cryptography. Using a PRF as a MAC. Application of the Luby Rackoff Construction to the construction of Block Ciphers. Henri Cohen. CS60084 FOUNDATIONS OF CRYPTOGRAPHY L-T-P: 3-1-0. Veni Madhavan. 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. A. Interrelations among the attack model Random Oracles: Provable Security and asymmetric cryptography. A Course in Computational Algebraic Number Theory. Signing and Verification. 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). Trap-door permutation. hash functions One-way functions: Weak and Strong one way functions Pseudo-random Generators (PRG): Blum-Micali-Yao Construction. Basics of Assymetric Key Cryptography. SpringerVerlag. Attacks under Message Non-malleability: NM-CPA and NM-CCA2. Hard Core Predicate. Pearson Education Asia. Variable length MAC Public Key Signature Schemes: Formal Definitions. E. Construction of more powerful PRG.9. 10. Hardness of Functions Notions of Semantic Security (SS) and Message Indistinguishability (MI): Proof of Equivalence of SS and MI. Das and C. Relation between One-way functions and PRG. Public-key Cryptography: Theory and practice. Pseudorandom Functions (PRF) Building a Pseudorandom Permutation: The Luby Rackoff Construction: Formal Definition. Chosen Ciphertext Attacks (IND-CCA1 and INDCCA2). 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
records of physical and systematic examinations and investigations including laboratory. Applications of Internet and world wide web in health care delivery. CS 69012 Computer Systems Lab-II L-T-P: 0-0-6. Shaffi Goldwasser and Mihir Bellare. 4.edu/. Integrated hospital information systems. Implementation of graph algorithms. building large client server applications. Credit: 4
Object-oriented programming concepts and implementation of abstract data types. Available at http://citeseerx. Oded Goldreich. Basics of OS programming: process creation and synchronization. Modern Cryptography. Basics of compiler writing using lex and yacc. Linear programming with applications. Pearson Education (Low Priced Edition) 3. Springer Verlag. development and spread. pathology. Theory and Practice. radiology. Computer aided learning and education for medical and para-medical professionals. shared memory and semaphore. Medical information storage and management patient medical history. cybernetics. Information Technology Prerequsites: None Computers in clinical medicine and practice.ist. Lecture Notes on Cryptography. virtual reality. Introduction to Cryptography: Principles and Applications. Interactive applications and multimedia medical information systems. Introduction to medical knowledgebased systems. Foundations of Cryptography. CS63052 L-T-P: 3-0-3 Credit: 5
. shell programming. Informatics and its relevance to medicine. Wenbo Mao. Part 1 and Part 2
CS 69011 Computer Systems Lab-I
L-T-P: 0-0-6. diagnosis and treatment. Credit: 4
Socket programming. CRC Press (Low Priced Edition Available). 2. Hans Delfs and Helmut Knebl. database creation and update.References 1.psu.