CSE (M Tech) Syllabus

1st. Year
Sl. N o 1 Annual/ Semest er 1st Semester Name of the Subjects Weekly load (In Periods) L T P Total Teaching load (Periods/ Week)

Theory
I. Core compulsory subjects Computer Organization & Architecture (CS901) Data Structure & Algorithms (CS902) Systems Programming & Operating Systems (CS903) II. Fundamental Engineering subjects ( any one ) Solid State Physical Electronics (EC901) Analog & Digital Circuits (EC902) Discrete data Control Systems (CS904) Elements of Robotics (ME901) Optoelectronics (EC903) Information & Coding Theory (CS905) III. Fundamental nonEngineering subjects ( any one ) Numerical Methods (M901) Discrete Structures (CS906) Quantum Mechanics (PH901) Operations Research & Applications (CS907) Fuzzy sets & Fuzzy Logic (CS908) IV. Sessional & Laboratory (Compulsory) Data Structure & Algorithms (CS9021) Systems Programming (CS9031) 4 4 4 0 0 0 0 0 0 4 4 4

4 4 4 4 4 4

0 0 0 0 0 0

0 0 0 0 0 0

4 4 4 4 4 4

4 4 4 4 4 0 0

0 0 0 0 0 0 0

0 0 0 0 0 3 3

4 4 4 4 4 2 2

Theory

I. Core subjects (Any three from the following) DBMS (CS1001) Computer Network (CS1002) Parallel and Distributed Architecture (CS1003) Artificial Intelligence & Expert Systems (CS1004)

2nd Semester

4 4 4 4

0 0 0 0

0 0 0 0

4 4 4 4

Sl. N o 2.

Annual/ Semest er 2nd Semester

Name of the Subjects

Weekly load (In Periods) L T P

Total Teaching load (Periods/ Week)

Theory
Any two from groups II & III II. Advanced hardware subjects 4 Computer Aided Hardware Design (CS1005) Digital Systems- Testing & Testable Design (CS1006) VLSI Technology (CS1007) Microprocessor, Microcontroller & Applications (CS1008) III. Advanced software subjects 4 4 4 0 0 0 0 0 0 0 0 4 4 4 4

Analysis & Design of Information (CS1009) Theory of Computation Systems (CS1010) Object Technology (CS1011) Computational Geometry & Applications (CS1012) Principles of Programming Languages (CS1013) Theory of Formal languages & Automata (CS1014)

4 4 4 4 4 4

0 0 0 0 0 0

0 0 0 0 0 0

4 4 4 4 4 4

IV. Sessional/laboratory Sessional on core subjects offered (CS1000)

2nd. Year
Sl. N o 3 Annual/ Semest er Name of the Subjects Weekly load (In Periods) L T P Total Teaching load (Periods/ Week)

Theory

Any two papers form Group I & II I. Advanced subjects Advanced Computing Technology (CS1101) Multimedia Technology (CS1102) Robot Vision & Robot Manipulation (CS1103) Distributed Databases (CS1104) Embedded Systems (CS1105) Theory of Compilers (CS1106) Soft computing Techniques (CS1107) VLSI Design Techniques (CS1108) Remote Sensing & GPS, GIS (CS1109) II. Modern subjects Quantum Computing (CS1110) Image Processing & Pattern Recognition (CS1111) Biomedical Application of Computers (CS1112) Optical Communication & Networks (CS1113) Cellular Networks & Communications (CS1114) Data Mining & Data Warehousing (CS1115) Data Security (CS1116) Cellular Automata & Molecular Computation (CS1117) E-commerce (IT1101) III. Sessional / Laboratory Project (Preliminary) (CS1100) Viva voce on project (CS1120)

3rd. Semester

4 4 4 4 4 4 4 4 4

0 0 0 0 0 0 0 0 0

0 0 0 0 0 0 0 0

4 4 4 4 4 4 4 4 4

4 4 4 4 4 4 4 4 4 0 0

0 0 0

0 0 0

4 4 4

0 0 0 0 0 0 0 0 0 0 0 1 8 4 0 0 0 4 18 4 4 4 4 4 4

4th. Semester

Theory Project & Thesis (CS1200) Seminar & Viva Voce on (CS1210) General Viva-Voce (CS1220)

Project

0 0 0

0 0 0

22 4 4

22 4 4

Note: Part time students will complete 4 subjects per semester and complete the entire course in six semesters.

SEMESTER I
I. Core compulsory subjects : Computer Organization & Architecture FM: 100 4

CS901 00

Digital Computer Components, Organization of ALU, Combinational circuits, Sequential circuits, algorithms of addition, subtraction, multiplication and division. Memory Unit: Classification, bipolar and MOS, storage cells, timing diagram, organization of RAM/ROM, Virtual memory. Instruction sequencing & microprogramming, hardware implementation, addressing modes, interfacing of buses and I/O organization. RISC VS CISC, Parallel processing, pipelining in CPU design, super-scalar machines, distributed computing. Performance evaluation: SPEC marks and other standard benchmarks. CS902 0 0 FM: 100 Data Structure & Algorithms 4-

Stacks and Queues - Definition and implementation using arrays Linked List - Dynamic memory allocation. Single linked & multiply linked lists Different operations, Advantages and Application. Circular linked lists. Linked lists as an ADT. Tables and Information Retrieval Hashing - Hash function. Collision Resolution using methods; Analysis of hashing. Symbol tables. Recursion - Solution, refinement and analysis. Applications to various search problems like game trees. Algorithms Definitions and properties. Complexity analysis Time and Space Complexity, Average case, Worst case and Best case complexities. Order Notations Big On, Big Omega, Big Theta and Small Oh. Different Categories of algorithms. P, NP, NP-complete, NP-Hard categories of algorithms. Cooks theorem. Approximation algorithm. Tree- Definition and terminologies. Tree traversals inorder, preorder and postorder, Tree as an ADT. Applications to problems. BST - insertion, deletion, tree sort. AVL trees; Balanced Multiway Search trees Max Heap and Mix Heap Construction and applications. Searching Sorting; barrier Graphs Definitions, Computer Representation of graphs, Graph traversals BFS & DFS. Minimum Spanning tree Kruskals and Prims algorithm. Shortest Path Algorithm Dikstras and Warshall-Floyol algorithm. Graph colouring Chromatic number, Algorithms for transitive closure, topological sort, and critical paths. Files Files, Queries and Sequential Organization. Index Techniques File organizations Storage Management References Data structures and Program Design in C by Kruse, Leung and Tondo (PHI) Fundamentals of Data Structures by Horowitz & Sahani ( Galgotia ) Data Structures in C & C++ - Tannenbaum (PHI).

CS903 00

Systems Programming & Operating Systems FM:100

Overview: Loader, Linker, assembler, command interpreter, compiler, operating systems. Various kinds of language translators: interpreters, compilers, cross compilers. The flow of compilation process: lexical analysis, syntax analysis, semantic analysis, intermediate code generation, code optimization, code generation. Overview of operating systems: Process Management: process model, interprocess communication & synchronization, critical section problem and solutions, semaphore primitives, process scheduling algorithms. Memory Management: Bare machine model, residential monitor, multiprogramming with a fixed and variable number of tasks (MFT), Fragmentation, Paging, Segmentation, Virtual memory management. Deadlock: condition for deadlock, deadlock prevention & avoidance, recovery. I/O systems: disk scheduling, device drivers & controllers. Case study: Windows, UNIX, linux Overview of distributed O.S.: Characterization of distributed system, networking and internetworking, interprocess communication. RPC, File Service Models and case studies, Name services, time and co-ordinations, replication, Shred data and transaction, concurrency control, distributed transaction, Recovery and fault tolerance, security, distributed shared memory, case studies. II. Fundamental Engineering subjects (any one) : Solid State Physical Electronics 4 0 0

EC901 FM: 100

Structure of solids- crystal systems & binding types; Wave mechanics and Atomic spectra, Approximation methods in wave mechanics, some applications; Distribution functions, classical, semi classical & quantum statistics; Band theory of solids-1 & 3 dimensional lattice; semiconductors- types, carrier concentration, contact problem; semiconductor electronics- Boltzmann transport equation, continuity equation, space charge issues; Thermionic and field emissionsSchottky effect, applications in planar diodes etc; Photoemission- volume and surface photoeffect, Photocathodes, noise considerations; Secondary electron emission- physical characteristics & theory, noise issues; PhotoconductivityKinetics of photoconduction, Bombardment induced photoconductivity; LuminescenceCharacteristic & noncharacteristic luminescence, electroluminescence, typical applications; Diodes- metal-semiconductor & p-n junction diodes breakdown phenomenon, tunnel diodes; transistors- Early effects and noise considerations, applications including photodiodes; FET, switching devices, space-charge limited diodes & triodes, Gun Effect Oscillators; Hall Effect and Magnetoresistance, Thermoelectric effect; Electric properties of insulators; Piezoelectric & Ferroelectric effects; Theory of magnetism- Induced magnetic moment, Ferromagnetic domains & their properties, applications in spin resonance, superconductivity etc. EC902 100 Analog and Digital Circuits 4-0-0 FM:

Review of Bands in solids, Transport phenomenon in semiconductors, junction diode and transistor characteristics, Models of diodes and transistors, diode clipping, sampling, rectifiers and filter circuits; Transistors as amplifiers & analytical models. Digital circuits & logic gates; DTL, RTL, TTL, RTL and DCTL implementations. Transistor low frequency operations, models & analysis, Thevinins and Norton theorems and corollaries, Miller theorem and dual, amplifiers. Thermal biasing and stabilization, bias compensation and related issues. FET & MOSFET characteristics & models. High frequency operation of transistors-Hybrid-pi model and related issues. Multistage amplifiers, feedback amplifiers- input & output resistance, Models and analysis, feedback methods. Oscillators- Feedback, bandwidth and transfer function, Analysis of multistage amplifies, stability issues, compensation. Differential amplifiers- offset errors, use as operational amplifiers. Linear & nonlinear analog systems AC coupled amplifiers, active filters delay equalizer etc. Sample & hold, AC/DC converters, logarithmic amplifiers, waveform generators etc. Combinational & sequential digital circuits- standard gates, adders, multiplexers/demultiplexers, ROM etc. Flip-flops, shift registers, counters etc. MOS/LSI circuits- shift registers, ROM,RAM, D/A,A/D converters, character generators etc. CS-904 FM: 100 Discrete Data Control Systems 4-0-0

Introduction to Discrete data control system with simple real life examples of discrete data and Digital control system. Review of z-transformation theory. Signal conversion and coding Data conversion and quantification, Sample and hold devices, D/A, A/D conversions, The sampling theorem, L.O.H and F.O.H, The Slewer hold. The Transfer: Transfer functions, block diagram and signal flow graph, characters equation, causality and physical realizability, modified and transfer, multirate sampling. The state variable technique Cayley-Hamilton theorem state diagram, pole placement, decomposition response between sample instants. Controllability, observability, Stability Relevant theorems, Jurys stability test, Liapunovs second method. Time domain and Z-domain analysis; Frequency domain analysis, simulation and redesign. Design of discrete data control systems Physical realizability, design using root locus, PID controller and dynamic controllers. Optimal control Euler-Lagrange equation, Maximum principle, Energy constraints, Optimal Linear regulator Discrete Riccati Equation, Digital State Observer, Microprocessor based and DSP control. B.C. Kuo Digital Control System, Saunclers College Publishing. A Har Court Brace Jovanovich College Publishers. ME-901 FM: 100 Elements of Robotics 4 0 0

Robotic manipulation Robot specification.

Direct and Inverse Kinematics Co-ordinate forms, Rotation, Homogeneous & link coordinates, Arm equations, 4,5 and 6 axis articulate robot and their inverse kinematics. Workspace analysis and trajectory planning, Work space Fixtures, Pick and place operation, continuos path interpolated motion, straight-line motion. Differential Motion and Statistics Jacobian matrix, the Manipulate Jacobian, Induced joint torque and forces. Manipulator Dynamics Lagranges Equation, Kinetic and Potential Energy, Generated force, Lagrange Euler dynamic model, Dynamic mode of articulated robots in 2 and 3 axis. Direct and inverse dynamics. Recursive Newton Euler Formulation. Dynamic model of a one axis robot. EC903 100 Optoelectronics 400 FM:

Basic Communication System: Advantages of fibers. Optical Transmitters: LED and Semiconductor Lasers: Principle of operation, Characteristics, Structures, Coupling to fibers, Drive circuitry, Direct and external modulation, Multiplexing. Optical Receivers: Photodetectors Principles and Characteristics, Preamplifiers, Noise sources, signal to Noise ratio, Power penalty, Link analysis and design. Opto electronic Emitters: IEDS- surface and edge emitters. Semiconductor communication lasers; Stripe geometry, distributed feedback, quantum-well and quantum-dot lasers; Laser arrays; Narrow line-width lasers; Vertical Cavity Surface Emitting Lasers. Detectors: PIN, APD, MSM photodetectors or communication, Imaging and Display-CCD; LCD. Guided Wave Control: Electrooptic, Acoustooptic and Magnetooptic effects and their applications. Optical Wave guides and Passive Guided Wave Devices: Planar wave-guides for OEIC; Guided wave excitation, Fiber optic devices-Multiport optical couplers; Switches; Isolators; Attenuators, Integrated Optical Devices- Power dividers; Directional Couplers; Grating based devices. Practical OE Systems: Laser printer, Xerography, CD HDTV and display. Display Devices & Pixels: LED, LCD, CCD, SEED AND Shart pixels. Optical Information Processing: Holography; Pattern recognition; Spatial Light Modulators and their use; Elements of Optical Computation. Optical Networks: Link in electronic networks, FDDI, Ethernet, SONET, ATM; Lightwave NetworksMAN, WAN, Experimental systems-Lambent & Rainbow; Fibers in the Local Loop. CS905 FM: 100 Introduction concept of information, complexity. Formal derivation of information, Law of Weber and Fechner. Concept of entropy Laws of thermodynamics, Maroscopic, Statistical and dynamic entropy, Renyis entropy. Extension of Shannons Information, Generalized entropy measures, Information functions and Gaussian distributions, Shannons Information of discrete probability distribution, information function; Bounds of variance, ambiguity functions Akaikes information criterion, Channel information, deterministic and stochastic information, Maximum entropy estimation. Information, entropy and self-organization, complexity theory, data reduction, cryptology. Information & Coding Theory 400

Ref. Information Measures Information and its description in Science & Engineering by C. Arndt. Springer Verlag. III. Fundamental non-Engineering subjects (any one) : Numerical Methods 4 0 0

M901 FM:100

Introduction- approximation & errors, recursive computation. Interpolation and divided differenceNewtons Fundamental Formula, error formulas, iterated and inverse iteration. Lagrangian methods- Lagrangian interpolation, Newton Cotes interpolation, Richard extrapolation, asymptotic behaviour, Filon intregation. Finite difference interpolation- forward & backward interpolation, Stirlings formula, Bessels formula, summation & integration, Error estimates. Numerical Differential equation- Formulas of open and closed types, Predictioncorrection methods, propagated error bounds, Runge-Kutta methods and their modifications, Boundary value problems, characteristic value problems. Least square polynomial approximation techniques and associated issues. Gaussian quadrature and related topics- Hermite, Gaussian, Legendre-Gaussia, Chebychev quadratures, Algebraic derivations. Fourier approximations- Continuous and discrete types, spline and spline approximations, Numerical solution of equations- sets of linear equations, inverse of matrix, iteration methods and relaxation, synthetic division, zeros of polynomials, quadratic factors, Bairstow approxomation. CS- 906 FM: 100 Sets, functions and relations Properties of sets, Set operation; properties of relation, ordered sets, transitive closure; Lattice, Boolean and switching algebra. Directed graphs Graphs and matrices, Warshalls Algorithm, Labeled graphs, finite state machines representation, equivalence relation, traversal on graphs. Algebraic system Groupoids, Homomorphisms, Congruencies, admissible partitions, Groups, rings, fields and related concepts, application to FSM. Formal systems syntax and semantics, recursive definition and functions; algorithms, Turing machines, formal deductive systems. Trees Homomorphism and congruences on trees, automata on trees, tree rewriting systems, and related applications, lists, structural induction on Lisp-like lists & data structures. Programming applications Data structures, correctness proof, stack machines, store pointer machines, store sequence machines single address machines, single address accumulate machines etc. PH901 FM: 100 Quantum theory, Postulates of quantum mechanism, principles of quantum mechanics, one-dimensional barriers, motion in three dimensions Angular momentum. Diracs bra and ket algebra; spin half particles. WKB approximation; Quantum Mechanics 4 0 0 Discrete Structures 4 0 0

spin and magnetic moment, addition of angular momentum. Time dependent Schrodinger equation, wave packets. Effects of magnetic field, variational method scattering theory, time dependent perturbation theory, quantum theory of radiation.

CS-907 FM: 100

Operations Research & Applications

4 0 0

Introductions to OR- goals and objectives. Model and simulation in ORClassification of Models, Use of Models for experimentation and optimization. Mathematical Programming Models General linear programming models, Simplex method, duality and related topics. Transportation models, Vogels Approximation, Assignment Model & TSP. Goal Programming, multiple goals, Modified simplex optimization, Dynamic Programming models formulation, solution procedures, capital allocation, knapsack problem. Models for Decision alternatives Decision and game models under risk and uncertainly, production operations, economic equivalence, depreciation and replacement models. Production and operation control Production programming and sequencing, PERT, CPM, Statistical control of operations. Procurement and Inventory Models Deterministic and probabilistic models. Models for query operation Deterministic and probabilistic query models, Markov chains and process and Mote Carlo simulation, simulation case studies.

CS-908 FM: 100

Fuzzy sets & Fuzzy logic

4 0 0

Fuzzy sets versus crisp sets; operations on fuzzy sets Complements, intersection and unions Norms and t-norms, Aggregation operator, Fuzzy Arithmetic, Fuzzy equations. Fuzzy relation Binary equivalence, compatibility and ordering relation, composition of Fuzzy relations and relation equation, Possibility theory Fuzzy measures, Evidence theory, Possibility theory, Fuzzy Logic Proposition, quantifiers and linguistic hedges; Inference from proposition, uncertainty based information, uncertainty in evidence theory, uncertainty measures, principle of uncertainty. Application Constructing fuzzy sets and operation on fuzzy sets. Approximate reasoning Fuzzy expert system, Multi-conditional approximate reasoning. Fuzzy system and Fuzzy controllers use in neural networks, Fuzzy automata, Fuzzy databases, and fuzzy decision making. Some examples case for pattern recognition, computer engineering, civil and mechanical engineering, robotics.

IV

Sessional & Laboratory Data Structure & Algorithms 0 0 3

CS-9021 FM: 100

In above lab students will carry advanced experiments on the subject CS902 Data Structure & Algorithms. CS-9031 FM: 100 System Programming 0 0 3

In above lab students will carry advanced experiments on the subject CS-903 Systems Programming & Operating Systems.

SEMESTER II
I. Core subjects (any three from the following) : Database Management systems (DBMS) 3 0 0

CS1001 FM: 100

Introduction: Data abstraction and modeling, Instances and schemas, Database Managers, users and their interactions, Data Definition and manipulation language, Data dictionary, system structure. Entity-Relationship Model: Entities and entity sets, constraints, E-R diagram, Reducing E-R diagram to tables, trees or graphs, Generalization & Specialization, Aggregation, ER language. Review of Files and Data-structure including Sequential file organization, ISAM file, Use of B-tree and B*-tree for indexing, Hashing and Hash functions. Relational Model: Structure of relational database, Relational Algebra, tuple and Domain relational calculus, query language. Hierarchical Model: Information Management system (IMS), Database description and tree-structure diagram, Limitations, Virtual records. Network Model: Database task group (DBTG) model, Data-structure diagram, Record and Set constructs, Record retrieval and update facility, Set processing facility, Example case Normalization in Relational System: functional, multivalued and joint dependencies, 1NF to 5NF. Case study with an actual RDBMS and its query language. Query Optimization: Equivalence of queries, Cost estimation for query processing, bi-relational and multi-relational join algorithms, algebraic manipulations. Failure and Crash Recovery in DBMS: various methods, an Example case Security and Integrity: Security and Integrity violations and constraints, Authorization and views, Encryption, Example of an actual implementation. CS1002 100 Computer Networks 400 FM:

Network and services, Review of OSI reference model, ARQ protocols and sliding window flow control, analysis of protocol behaviour and comparisons using finite states machines, petri nets etc. LAN and MAC Local Area Networks, Random access: ALOHA, CSMA/CSMA-CD, their mathematical models and performance analysis. Channelization: FDMA, TMA, CDMA. Bridges. Packet switching networks: Topology, routing in packet networks, shortest path algorithms, ATM networks, traffic management and congestion control. Modelling and analysis of routing, traffic conjestion problems, analysis of concentrator placement under variable traffic conditions and other traffic related issues. Statistical queuing and other Markovian models should be studies. TCP/IP: Architecture, Internet protocols, IPV6, User datagram and Transmission Control protocol, mobile IP, Internet routing protocols, security and cryptographic algorithms. Introduction to multimedia information and networking: Data compression codes, real time transport protocols including critical analysis using current day mathematical tools.

CS1003 FM: 100

Parallel and Distributed Architecture

4 0 0

Introduction to Parallel and Distributed Processing: Parallelism in microprocessor systems. Review of Mutiprogramming, Time sharing, Pipelining, Array computers, Multiprocessor systems. General architecture and classification of parallel computers. Principles of pipelining: Overlapped operation. Linear pipelines, General pipeline, Reservation Table, Instruction and arithmetic pipeline design examples. Multifunction array pipelines. Branch handing, Data buffering, Internal forwarding, Register Tagging, Hazard detection and resolution. Job sequencing and Collision Prevention, Dynamic Pipelines and Reconfigurability.

Vector Processing: Characteristics, Vector supercomputers. Some examples of vector supercomputers. Vectorization and optimization methods. Architecture and Algorithms for Array Processors: Architecture, Marking and Data Routing Mechanisms of SIMD processors; interconnection Networks some example cases, Parallel algorithms for SIMD array processors, Systolic array processors. Distributed and Multiprocessor Architecture: Shared memory parallel computers. Loosely and Tightly coupled multiprocessors. Inter connection networks, Distributed shared memory, Message Passing Parallel Computers. Cluster of workstations. Inter process communication mechanisms. Process synchronization. Deadlock prevention and avoidance, deadlock detection and Recovery. Multiprocessor scheduling strategies. Parallel algorithms for multiprocessors. CS1004 FM: 100 Artificial Intelligence & Expert Systems 400

Introduction to AI: Symbolic computation, AI definition, AI and related fields. AI problems and approach. Connectionist approach to AI. Turings Test State Space Search: Defining the problem as a state space search. Problem characteristics, production system characteristics. Heuristic Search, Best first Search. A* Algorithm, AO* Algorithm, Interactive deepening search. Predicate Logic: Knowledge representation using predicate. Theorem proving techniques, Breaking into clause form, Resolution theorem, Hesbrand Interpretation, Soundness and completeness of resolution theorem. Logic Programming: Horn Clause. Introduction to prolog programming. Constraint Logic Programming, Resolution. Non-monotonic and Default reasoning: Non-monotonic logic, Truth maintenance system, Default logic and reasoning. Model and Autoepistemic Logic. Probabilistic reasoning: Bayesian reasoning, Pearls evidential reasoning, Fazzy reasoning, Dampstar Shafter theory. Game playing: Alpha-beta prouning. Machine learning: Pattern recognition and classification process. Decision-tree based learning. Neural learning, Self-organising feature Map. Expert Systems: Knowledge representation and reasoning in an ES, Knowledge acquisition, Knowledge Management.

II.

Advance hardware subjects : Computer Aided Hardware Design 400

CS1005 FM:100

Design concepts, review of logic circuits and implementation technology- NMOS, CMOS, PLAs, CPLDs and FPGAs. MOSFET etc. Optimization of logic functions-ma, incompletely specified functions, multilevel synthesis, Cubical representation, CAD tools for minimization- an introduction to VHDL. Combination circuit building blocks MUX/DMUX, comparators, adders etc and their design using VHDL. Flip-f;ops, and sequential circuit design- state tales and diagrams, specification of Moore And Mealy machines using VHDL, FSM and ASM (algorithm state machine), design of synchronous and asynchronous circuits. Digital system Design- building blocks, clock synchronization, Introduction to testing of sign hardwares, CS1006 Digital Systems- Testing & Testable Design 0 0 FM:100 4

Modeling- Functional modeling at logic and register levels, structural models. Logic simulation- types of simulation, compiled and event driven simulation, delay models, hazard detection, transport delays. Fault modeling- fault detection & redundancy, fault equivalences, localization, fault dominance, stuck-at-faults. Fault simulation- serial, parallel & concurrent fault simulation, fault in combinational circuits. Testing methods of single stuck-at-fault. Bridging faultssimulation & test generation techniques. Functional testing- circuits with and without faults, sequential circuits, logic arrays. Design for testability- Ad hoc designs, controllability & observablity, Board level and system level, approaches. Compression techniques- LFSRs as signature analyzers. Built-in-self test- BIST concept, test pattern generation, off-line BIST architecture. Logic level diagnosis methods, self check design, checking circuits, self check concepts & methods. PLA testing and system level diagnosis.

CS 1007 FM:100

VLSI Technology

400

Process and preparation in Crystal Growth and Wafer Preparation, Epilaxy, oxidization-Growth mechanics and Kinematics, Lithography, Reactive Plasma etching, Dielectric and Polysilicon Film deposition, Diffusion, Ion Implantation, Metallization and Simulation of these processes. VLSI Process integration NMOS & CMOS IC Technology, MOS memory and Bipolar IC technology, IC fabrication. Analytical Techniques Analytical beans and Chemical methods. Assembly Technique and Package of VLSI Devices Design consideration, Assembly, techniques and fabrication technologies; Yield and reliability considerations.

CS1008 FM: 100

Microprocessor, Microcontroller & Applications 4 0 0

Evolution of Digital computer & Microprocessors, Single Clip, Microcontrollers, General Architecture of a Microcomputer System and Single Clip Micro Computer. Software model of microprocessors Memory, address space and Data organization, segment registers, instruction and Data registers, Pointers and index registers, Status registers, Stack, Generation of memory address, Input/Output Address space and different addressing modes. Instruction sets examples cases for typical 16 & 32 bit microprocessors and microcontrollers like 8086, 80386, 68000, 680 x 0 etc. Microprocessors programming Instruction Lab., Memory and data instructions, Arithmetic and Logic instructions, Flag control instructions, Loop & Subroutine Handling instructions, string handling instruction. Memory interface System Clock and bus cycle, hardware organization of Address space, status codes and control signals, DMA and interrupt handling input output interface I/O data transfer, interface and interrupt pointer table, Min and Max modes, Asynchronous mode and I/O interface. Exception processing, Priorities and Vector tables, Processing sequences. RISC Architectures Principles and operations, Examples of RISC based processors.

III.

Advance software subjects : Analysis & Design of Information Systems 400

CS-1009 FM: 100

Introduction to Information system development Requirement Analysis and Determination Tools for determining system requirements, structured analysis development strategy, application prototype development strategy, CASE tools. System design Analysis to design transition, Design of Computer output, Design of input and control, design of online dialog, design of files systems, design of database interaction and data communication. Systems Engineering and Quality Assurance, Managing system implementation, Information system development, Hardware and Software Selection. Ref. Analysis and design of Information System by Jones A. Senn McGraw Hill International

CS1010 FM:100

Theory of Computation

400

The history of computation: abacus, slide rules to present day computing devices. Algorithms: Deterministic, non-deterministic, random, direct and indirect algorithms, flowchart, structured flowchart, recursion and iteration. Machines: finite state machine (FSM), Moore and Mealy FSMs, deterministic and non-deterministic FSMs, Minimization, equivalence, isomorphism.

Formal languages: grammar, Chomsky hierarchy, regular expressions, pumping lemma. Push-down automata: recognition of context free languages by non-deterministic push-down automata. Turing Machines: the concept, examples of computations done by TM, Universal TM, Halting problem and its undecidability, Church-Turing thesis. Functions: Primitive recursive functions, primitive recursive functions over an alphabet. Productions: Post canonical system, Universal Canonical system. Markov algorithms Computation: Algorithmic complexity-intractability, NP-hard, and NP-complete problems, Cooke's theorem, Some well-known NP-complete problems and proof of their NP-completeness CS1011 FM:100 Object Technology 400

Basic concepts - Complexity of software the object model Evolution of object model, classes and objects, Nature of object, relationship among objects, classes, classification. The method The Notation Class diagram, State Transition diagram object diagrams, Interaction diagram, Module diagram, Process diagram. The process First principles, Micro and Macro development Process. Management and Planning, release management, Quality Assurance Metrics, The benefit and role of object development. Application of object technology for Data acquisition, Client/Server Computing, Artificial Intelligence, Traffic management etc. Ref: Object orientation analysis and design by Grady Books Addesen-Wesley Designery object oriented Software by Rebecca Wirfs Brock, Brian Wilkerson, Lauren wiener PHI Object-oriented system development by Dennis de Champeaux, Douglas lea Penelope Faure CS1012 0 0 FM:100 Computational Geometry & Applications 4

Introduction to computational geometry range queries, trapezoidal decomposition, convex polytopes, voronoi diagram, some deterministic and randomized algorithm. Incremental algorithms and Dynamic algorithms. Random sampling configuration spaces, range space and nets. Applications Arrangement of hyperplanes Zone theorem, cutting lemma, dynamic maintenance. Convex polytopes number of faces, dynamic maintenance, Voronoi diagrams and search problems. Range search, application in computer graphics. Pseudorandom sources, derandomization. Fundamental concepts of combinational geometry and selected peometric algorithms and application. Ref. Computational Geometry An introduction through randomized algorithms by Ketan Mulmukey, Prentice Hall.

Algorithms in Combinational geometry by Herbert Edelsbrunner Springer Verlag

CS1013 0 0 FM: 100

Principles of Programming Languages

Introduction the Art of language design, an over view of compilation. Programming Language syntax specifying syntax Regular expressions and cfgs. Recognizing syntax Scanner and Parsers ; Review of Finite Push down automata, grammar and language classes. Names, scopes and bindings object lifeline, scope rules, overloading and related concepts. Semantic Analysis Attribute grammars and flow, action routines, syntax tree. Assembly level computer architecture Werbstation Macro Architectures, Memory and Data representation, Instruction set Architecture. Control flow Expression evaluation, Structured and non-structured flow, sequencing, section, iteration, recursion, non-determinacy. Data types (System, checking, records and variants, arrays, strings, sets pointers, lists, files and I/0) Equality testing and assignments. Subroutine and Control Abstraction Calling sequence, parameter passing, exception handling and coroutines. Back end compiler structure, Intermediate forms, code generation, address space organization, Assembly, Linking. Data Abstraction and object orientation encapsulation and inheritance, initialization and finalization, dynamic method building, multiple inheritance. Nonimperative programming models Functional and logic programming concurrency Basic concepts, shared memory, message passing. Code Improvement Phases, pipehole optimization, Redundancy elimination, data flow analysis. Ref: Programming language propagation by Michael L. Scoll Pub: Harcourt Asia Pte Ltd. A Harcourt Publisher International Co. Morgan Kaufmann A Harcourt Science & Technology CS1014 FM:100 Theory of Formal languages & Automata 4 0 0

Formal languages: Overview, grammar, derivation, canonical derivation, chomsky hierarchy of languages, regular expressions, pumping lemma and its applications. Automata: Basic concepts, finite recognizers, deterministic and non-deterministic, transition graphs, conversion of a non-deterministic finite recognizer to a deterministic recognizer, interchangeability between transition graphs and regular sets, Finite state machines, synthesis of synchronous sequential circuits. Capabilities, minimization and transformation of sequential machines: the finitestate model, capabilities and limitations of finite-state machines, stateequivalence and machine minimization, simplification of incompletely specified machines.

Push-down automata: Basic concepts, example, construction of a nondeterministic push-down automata from a context-free grammar. Turing machine: The concept, examples of TMs to perform some simple computations, composite and integrated TM, universal TM, halting problem of TM and its undecidability, Church-Turing thesis. IV Sessional / Laboratory Sessional on core subjects offered 0 0 6

CS1000 FM: 200

In above lab students will carry advanced experiments on the core subjects.

SEMESTER III
I. Advance subjects : Advanced Computing Technology 4 0 0

CS1101 FM: 100

Computer organization and operating system for parallel and distributed computing. Parallel programming languages and algorithms Computer organization for parallel and distributed computing pipeline & vector processors, Multi computer and Multiprocessors Synchronization and interprocess communication. Massively parallel Architecture; Data flow and Reduction machines, issues in communication and computer networks ISPN & ATM, Wireless computing. Operating system Network OS, Distributed OS, OS for parallel computing; OS modeling by FSA, Petri net, example OS. Parallel programming languages and Algorithms parallel C++, parallel prolog etc. CS-1102 FM:100 Multimedia Technology 4 0 0

Sound, Image and Text - Introduction to Multimedia & Virtual reality; Sound Physics of sound, physiology and psychology of hearing, recording technologymicrocontrollers, preamplifiers, more amplifiers, equalizers and tone controls, power amplifiers, load speak and enclosures. Wave form generation and synthetic Additive synthesis, Sampling Wave table synthesis, MIDI, Speech Synthesis. Image Physics of light, Physiology and psychology of vision Colour and depth perception, Film and television, combining of video signals, computer video standards, vector and bitmap graphics- file format. Text Hypertext Fonts, type faces and layouts, hyper text.

Digital audio and video Standards and interfaces, digital image processing, point and window operations. Data compression techniques Image and audio data compression. Computer Capture and play back hardware, peripheral hardware and software tools. Audio Productions Tools and concepts Delay, reverb, stereo planning, distortion, Noise gates and compressors, Audio enhancers, Digital Audio production Hard disk editing, MIDI sequencing. Video Production Pre production planning; production shot, camera, lighting, sound, video product technique Monochrome, split screens, Posterize, Chromakey. Computer graphics and Animation, Multimedia Authority Windows & OLE, BMP, MID, AVI files graphical browsers, HTML files and the Internet. Virtual Reality Realistic Audio simulation, Binaural techniques, Creation of source files Dolby surround. Realistic Visual simulation Spectroscopy and Stereoscopic TV images, Auto Stereoscopy, Depth enhancement technique, Cyberspace. CS1103 0 0 FM: 100 Robot vision & Robot manipulation 4

Robot control The control problem, State equations one, two, and three axis robots. Constant solution by Liapunovs methods. Linear feedback system, single axis PID control, PD gravity control Computed Torque & Variance-Structure control, Impedance control. Robot vision Image representation, template matching, Polyhedral Objects, Slope analysis, segmentation, perspective transformations, structured illumination, camera calibration. Sensors for robots, Piezoelectric sensors, Optical encoders, velocity, proximity, tactile, wrist, compliance and range sensing, laser range meters. Elements of image processing Neighborhood averaging, Median filtering, Thresholding. Object description by Method of moments Mahalanobis Procedure. Collision Fronts Algorithms- Propagation and thinning algorithm, Freeman chain code, Hold site selection. Task planning Task level programming, uncertainty configuration space, gross motion planning, fine motion planning, simulating planner motion. Task planning examples. Ref: Robotics & Image processing P.A. Janakiraman-TMH. CS1104 FM: 100 Distributed Databases 4 0 0

Review of Database and Computer Networks, Distributed vs Centralized databases. Principles of distributed Database levels of distribution transparency, Distributed database design issues Frame work, fragmentation handling, Translation of global queries to fragment queries; optimization of Access strategies, Management of distributed transactions; concurrency control, Reliability issues; Distributed database administration. Study of Example commercial system like Tandons ENCOMPASS, SDD-1, distributed INGRESS, MULTIBASE etc.

Ref. Distributed Database Principle & System by Stefano. Ceri Pelagatti McGraw Hill. CS1105 100 Embedded System

& Giuseppe

4 0 0

FM:

Introduction; real time applications; Hard VS Soft real time systems; Scheduling Classical approaches; Clock and priority driven scheduling, scheduling of a periodic and sporadic jobs; Resource access control, synchronization and control in multiprocessor scheduling, scheduling flexible computation and tasks with temporal distance constraints. Real time communication, operating system characteristics, features and implementation, embedding of computer, microprocessors and microcontroller in real time system implementations and their application. Ref: Real Time System by Jane W.S. Lix- Pub. Pearson Education (Singapore) Pte Ltd. A practical guide to Real time System Development by Sylvia fold smith. Prentice Hall. Embedded System design with 8051 micro controller by Zdravko Karakehayou Kund Smed Christenson Ole Winther, Pub. Marcel Dekker Inc. Real time System by Dr. Nimal Nissanke Prentice Hall. CS1106 100 Theory of Compilers 4 0 0 FM:

Introduction - High level programming languages and their implementation. Compilation of Imperative programming Languages, Compilation of functional programming languages, Compilation of logic programming languages, Compilation of object oriented languages. The structure of compiler Lexical, syntax, semantic analysis Abstraction, Trees: Pattern matching and parsing, code generation. Implementation of compilers using C, Lex, Yacc and other tools. Ref: Compiler Design by Reinhard wilhelm & Dieter Mauver Addison Wesley, Computer Design in C by Attn. I. Holub PHI. CS1107 FM: 100 Soft computing Techniques 4 0 0

Introduction to Soft computing: Fuzzy Logic and Application fuzzy sets (general, axiomatic framework with several examples like Hamacher, Frank, Yager, DuboisPrade etc.). Crisp relation, fuzzy relation and their relevance to the theory of approximate reasoning; Max-* composition of fuzzy relation; computation of Maz-* transitive closure of a fuzzy relation; fuzzy relational equation and related issues; probability measures of fuzzy events; fuzzy expected value.

Neural Networks and Their Applications: Introduction to neural networks. Threshold logic, basic logic element, circuit realization, network complexity. Introduction to biological neural network, significance of massive parallelism. Basic neural network models-and learning algorithms, selection of number of layers and modes in a network, recurrent networks. With applications. Simulated annealing, mean-field annealing. Boltzman machine, learning. Feature map, learning vector quantization, LVQ1, LVQ2. Adaptive resonance theory, ART1, ART2, ART3, ARTMAP. Some Applications Evolutionary Algorithms: Genetic algorithm, simulated annealing, evolutionary programming, convergence of genetic algorithm, multi-objective GA, Applications. D. Rough Set: Preliminaries and application. Ref: G.J.Klir & T.A. Folger: Fuzzy Sets, Uncertainty, and Information, Prentice Hall, NJ, 1988. CS 1108 FM: 100 VLSI Design Techniques 4 0 0

Introduction - Size and complexities of Integrated circuits, IC design process, Economic, Trends in VLSI Design. Technology IC production process, Semiconducter process, Bipolar and Hybrid technology, Design rules, Layout techniques. Device Modeling Device models, MOS models, Diode and Bipolar models, passive component models, BJT Noise models, Circuit simulation using spice. IC Building blocks Switches, active registers, current sources and sinks, current minors and amplifiers, V & I references. Amplifiers MOS & BJT Invertory, Dirrential, Output and Operational amplifiers, comparaters. Digital circuits Characteristics, Single channel MOS inverters, NVIOS and CMOS gates, Transmission gates, propagation delay, capacitance loading and power dissipation and Noise consideration. Analog system AID & DIA converter, filters, switched capacitor, Analog signal processing circuits. Structured design PLAs, structured gate layout, MD, clocking scheme, ROM, RAM, Microprocessor and Micro controller design, Systolic arrays. Design automation and Ventification IC circuit layout, symbolic etc and representation, Design rule checks, Circuit extraction, Simulation and timing analysis. Placement, layout, floor planning and routing methods, algorithms, implementation using some Hardware and Design languages like VHDL, EXPRESSO, SIMPLIFY, MAGIC etc. CS1109 FM: 100 Remote Sensing, GPS & GIS 4 0 0

Introduction Perspectives and concept of remote sensing, special applications. Geophysical Remote Sensing external fields, magnetics, geophysical remote sensing: Gravity, crust dynamics seismology. Electromagnetic spectrum; The

photon, Distribution of Radiant energies, Sensor technology, Spectral signaturesInterpretation and classification. Multispectral images, colour and false colour composites ERTS-1, MSS histogram. Thermatic mapper, SP07 & CCDS, Hyperspectral imaging; Meteorological, Oceanographic and Earth system Satellites, Systems approach to Remote sensing, military intelligence and medical applications. Image Processing & Interpretation: Morro Bay images ground and Arial photographs analysis mystery features and classification techniques. Geologic application Strategy and Structure, Mineral and Petroleum explorations; Vegetation application Agriculture, forestry and Ecology; Urban and Land use application, space flight. Radar and microwave remote sensing, thermal Remote sensing. Arial photography as Primary and Ancillary data source; 3D Stereo system and Topographic mapping. Astronaut Photography- collection of surface data and geographic information system. Earth system Science; Basic science study- Mega Geomorphology, Impact cratering, Planetory remote sensing-Use in Astronomy and Cosmology. Future Prospects. http:11rst.gsfc.nasa.gov/Front/tofc.html. II. Modern subjects : Quantum Computing 4 0 0

CS1110 FM: 100

Classical computation Vs. Quantum computation, quantum bits (q-bits), q-bit gates, quantum circuits, Bell States, quantum teleportation, quantum parallelism, Deutschs algorithm, experimental quantum information processing the sternGerlach experiment, basics of quantum information theory. Fundamentals of linear algebra, postulates of quantum mechanics, superdense coding, EPR and Bell inequality. Quantum algorithms, single q-bit operations, controlled operations, universal quantum gates. The quantum Fourier transformation and its applications. Physical realization of quantum computers. Basic concepts of quantum noise and quantum operations, quantum error correction, entropy and information, quantum information theory. CS1111 FM: 100 Image Processing & pattern Recognition 4 0 0

Introduction: Capturing and representation of images. Image pre-processing, image analysis, applications of image processing. Image Sampling and Quantization: Image scanning, recording. Two dimensional sampling theory, limitations and reconstruction, quantization. Image Transform: Orthogonal and Unitary transforms and their properties, convolution, DFT, DCT, Sine Transform, Walsh-Hadamard Transform, Harr Transform, Slat Transform, KL-with applications Image Enhancement: Point operations, Histogram models. Spatial domain & Frequency domain operations. Pseudo color processing, Color image enhancement. fuzzy logic in image enhancement.

Image Restoration: Image models, noise models, Inverse and Wiener filtering, Different Fourier domain filters. Coordinate transformation and geometric correction. Image segmentation and Analysis: Edge detection, Boundary & region extraction, moment representation, Morphological operations, Texture analysis, Scene matching and detection. Image Compression: Compression and bandwidth, entropy, predictive & Transform coding and standards. Statistical Pattern Recognition: Decision boundaries, Estimation of errors. Classification: Nearest neighbour classification techniques, and discriminants; Clustering: techniques. Classification with optimization algorithm. Fuzzy and artificial neural networks approach to classification. Ref: 1) Digital Image Processing Gonzalez and Wintz Fundamentals of Digital Image Processing A. K. Jain CS-1112 FM: 100 Biomedical Application of Computers 4 0 0

Bioelectric signals and electrodes for ECG, EEG, EMG, Physiological transducers for pressure, body temperature, pulse and respiration sensors. Biomedical recorders Electrocardiograph, Phonocardiograph, Electroencelphalograph, Electromograph. Medical display system Patient monitoring systems- monitoring of B.P, temperature, respiration rate, Apnoea detectors. Arrhythmia and Ambulatory Monitoring Instruments; Foetal monitoring Instruments. Biomedical telemetry use of conventional transmission networks. Computer applications in ECG analysis, catheterization, patients monitory. Patient safety considerable for leakage currents and shock hazards. X-Ray Machines and Computerized Technography, Magneto Resonance Imaging (MRI) Systems. Ultrasonic Imaging systems, Medical Thermography. Ref. Handbook of Biomedical Instrumentation by R. S. Khandpur- T.M.H. CS1113 FM: 100 Optical Communication Networks 4 0 0

Need for fiber optic communications, modulation formats, line coding, channel capacity. Optical fibers types, propagation modes, dispersion in single mode fibers, limitations on bit rate and fiber bandwidth, fiber loss, wave-guide imperfections, nonlinear optical effects. Optical transmitters Receivers, properties, types, characteristics. System design and performance architecture PPP links, broadcast and distribution networks, local area networks, design guidelines- budgets, Coherent light-wave systemshomodyne and heterodyne detection, Different modulation formats, demodulation schemes, BER, system performance. Multi channel light-wave systems-WDM systems, WDM networks, components, linear and nonlinear crosstalk, TDM-channel multiplexing and demultiplexing, subcarrier multiplexing.

Optical amplifiers; Dispersion compensation-pre-chirping, duobinary coding, amplifier induced chirp, fiber induced chirp, high dispersion fibers, optical equalizing filters. Solution communication systems nonlinear Schrodinger equation, fundamental and higher order solitons, dark solitons, soliton based communication systems soliton interaction, soliton amplification, soliton system design, WDM soliton systems, high capacity soliton systems. CS-1114 FM:100 Cellular Networks & Communications 4 0 0

Introduction to Cellular Mobile System, Elements of Cellular Radio System Design, Specification of analog system, Cell coverage for signals and Traffic, Cell site antennas and mobile antenna, co-channel interference reduction, Frequency and channel assignment, reduction, frequency and channel assignments, Handoffs and dropped cells, operational techniques and technologies, switching and traffic, data lines and microwaves, system evaluations, digital systems, digital cellular system, intelligent cell, and applications, intelligent network for wireless communication. Any other related topic of current internet. Ref: Mobile cellular telecommunication Analog and digital system 2nd ed. by William C.Y. Lee McGraw Hill Int. Satellite Base Cellular Communication by Bruno Pattan McGraw Hill. CS1115 FM: 100 Data Mining & Data Warehousing 4 0 0

Introduction to data mining, data mining term and methodology, Data mining models and algorithm, Data storage models, Directed and undirected data mining, Decision trees, Creating decision trees with SQL and OLAP. Sharing Information, Role SQL server OLAP Services and other services Planning and Designing Enterprise Analytical system Different phases and cycles, Data transformation Services, Optimization of SQL Server Data ware house, use of Visual Basic in Data Ware housing CS1116 FM: 100 Data Security 4 0 0

Terminology, Steganography, substitution and transposition ciphers, simple XORS, computer algorithm, use of large numbers. Cryptographic protocols Introduction, Digital signatures and encryption; Basic protocols-key exchange, authentication, secret key splitting and sharing. Intermediate protocols-undeniable digital signatures; Proxy, group and fail stop signatures all or noting disclosure of secrets. Advanced protocols- zero knowledge proof, blind signatures, certified mail, exchange of secrets. Esoteric protocolsSecure electrons, Anonymous message broadcast, digital cash.

Techniques Key length and management, Algorithm types and modes. DES and other block ciphers, stream ciphers. One way hash, public key algorithm and digital signatures, key exchange algorithm. Some example implementation legal and political issues. Ref. Applied Cryptograph by Bruce Schneir. Then Wiley & Sons Inc. CS1117 FM: 100 Cellular Automata & Molecular Computation 4 0 0

Cellular automata- introductory concepts, definitions & terminologies. Von Neumanns self reproducing cellular automata; universal computation in cellular automata- Smiths construction, Game of Life; Dynamics and computation; The Firing Squad Synchronization problem; Applications of cellular automata- Parallel Formal-Language Recognition, Parallel arithmetic; Evolving cellular automata with Genetic Algorithms. Molecular Computation- Computational Molecules in the Cell- RNA, DNA as ROM; reversible regulation of enzymes, proteolites as switch, G-proteins as signals, proteins as RAMs, Protein based neural networks; vision systems. Artificial biomolecular systems- bacteriorhodopsin as bio electrical material, Protein based memory, DNA based computing, other applications of DNA; Supermolecular systems- Supermolecular recognition, use as wires, switches and memories; DNA computing by programmed molecular systems; molecular computing and molecular manufacturing/ nanotechnology. IT-1101 FM: 100 E-commerce 4 0 0

Review of Internets, TCP/IP protocols, EDI Standards, Internet commerce architecture the ECO system, Services. Internet based E-commerce: Issues, problem and prospects. Intranets trends in intranet uses, Business needs, Implementation, use in corporate world. Electronic Payment systems Banking Network in On-line commerce, digital economy-Electronic cheques and funds transfer, Electronic cheque system, SWIFT. Value Added Services Service Industrys characteristics. The internet commercialization, commercialization of internet service provides, logistics of service provides, value-added network, controls in third party networks, liability of third party vendors. E-commerce Laws E-commerce transactions, binding commitment, validity and enforceability of Agreements, Enforcement, Electronic Fund Transfer Acts and Regulations, Forms of agreements, Legal issues, India scenario effect on corporate world. Security Implications Security mechanisms, Internet security and corporate world. Ref. Computer Networks and E-commerce by Parag Diwan, Dharam Bir Singh, Pentagon Press.

III.

Sessional/Laboratory : Project (Preliminary) 0 0 18

CS-1100 FM: 300

Each student will carry out preliminary survey work & preliminary study of the project to be complete in semester-IV and submit report by the end of the semester. CS-1120 FM: 100 Viva voce

A viva voce test will be given by each student before a board of examiners at the each of the 3rd semester.