IIT CSE 1st Year Syllabus

HI I would like to have the details about the department as well as the syllabus for the Computer Science Engineering at IIT, Patna?

[sumit]

A journey to the worldwide scholastic summit that touches each part of national life afterward is the essential objective of the office. The office appeared in 2008 with miniscule personnel quality and moment undergrad understudy body. This insufficiency was no impediment to its intense choice to begin the doctoral program immediately.

The office has not thought back from that point forward. It has seen a complex bring up in the measure of the lively understudy body. In the blink of an eye, all endeavors are adapted towards settling on this the principal decision of trying students. This is being prepped to be the favored destination for examination researchers overflowing with thoughts. Personnel quality is good to go to increase many times over with the arranged expansion of youthful and element persons blazing fortunate scholastic and exploration records.

The office brags of liberally prepared educating and research labs. Doctoral applicants are generously bolstered either by grants or by supported partnerships.

Supported examination and formative exercises add muscle to the humming scholastics.

Syllabus
First Year
First Semester

CH 101 Chemistry
CH 101 Chemistry 3-1-0-8 Thermodynamics: The fundamental definition and concept, the zeroth and first law. Work, heat, energy and enthalpies. The relation between Cv and Cp. Second law: entropy, free energy (the Helmholtz and Gibbs) and chemical potential. Change of Phase: Clapeyron-Clausius equation. Third law. Chemical equilibrium, Chemical kinetics: The rate of reaction, elementary reaction and chain reaction. Electrochemistry: Conductance of solutions, equivalent and molar conductivities and its variation with concentration. Kohlrausch’s law-ionic mobilities, Transference number of ions. Activities in electrolytic solutions, application of Debye-Huckel theory. The Walden’s rule. Debye-Huckel-Onsager treatment. Electrochemical cells, Nernst equation. Application of EMF measurements. Liquid junction potential, commercial cells – the primary and secondary cells. Fuel cells. Polarisation and overvoltage.

The periodic table of elements, shapes of inorganic compounds, chemistry of materials. Coordination compounds: ligand, nomenclature, isomerism, stereochemistry, valence bond, crystal field and molecular orbital theories. Bioinorganic chemistry and organometallic chemistry.

Stereo and regio-chemistry of organic compounds, conformers. Bioorganic chemistry: amino acids, peptides, proteins, enzymes, carbohydrates, nucleic acids and lipids. Modern techniques in structural elucidation of compounds (UV – Vis, IR, NMR). Solid phase synthesis and combinatorial chemistry. Green chemical processes.

CH110 Chemistry Lab
CH110 Chemistry Lab 0-0-3-3 Pre-requisites: nil Estimation of metal ion: Determination of total hardness of water by EDTA titration. Experiments based on chromatography: Identification of a mixture containing two organic compounds by TLC. Experiments based on pH metry.: Determination of dissociation constant of weak acids by pH meter. Experiments based on conductivity measurement: Determination of amount of HCl by conductometric titration with NaOH. Synthesis and characterization of inorganic complexes: e. g. Mn(acac)3, Fe(acac)3, cis-bis(glycinato)copper(II) monohydrate and their characterization by m. p. IR etc. Synthesis and characterization of organic compounds: e.g. Dibenzylideneacetone. Kinetics: Acid catalyzed hydrolysis of methylacetate. Verification of Beer-Lamberts law and determination of amount of iron present in a supplied solution. Experiments based on electrogravimetry and electroplating. Experiments based on magnetometry.

EE101 Electrical Sciences
EE101 Electrical Sciences 3-1-0-8 Circuit Analysis Techniques, Circuit elements, Simple RL and RC Circuits, Kirchoff’s law, Nodal Analysis, Mesh Analysis, Linearity and Superposition, Source Transformations, Thevnin’s and Norton’s Theorems, Time Domain Response of RC, RL and RLC circuits, Sinusoidal Forcing Function, Phasor Relationship for R, L and C, Impedance and Admittance.

Semiconductor Diode, Zener Diode, Rectifier Circuits, Clipper, Clamper, Bipolar Junction Transistors, Transistor Biasing, Transistor Small Signal Analysis, Transistor Amplifier, Operational Amplifiers, Op-amp Equivalent Circuit, Practical Op-amp Circuits, DC Offset, Constant Gain Multiplier, Voltage Summing, Voltage Buffer, Controlled Sources, Instrumentation Circuits, Active Filters and Oscillators.

Number Systems, Logic Gates, Boolean Theorem, Algebraic Simplification, K-map, Combinatorial Circuits, Encoder, Decoder, Combinatorial Circuit Design, Introduction to Sequential Circuits.

Magnetic Circuits, Mutually Coupled Circuits, Transformers, Equivalent Circuit and Performance, Analysis of Three-Phase Circuits, Electromechanical Energy Conversion, Introduction to Rotating Machines.

MA 101 Mathematics I
MA 101 Mathematics I 3-1-0-8 Properties of real numbers. Sequences of real numbers, montone sequences, Cauchy sequences, divergent sequences. Series of real numbers, Cauchy’s criterion, tests for convergence. Limits of functions, continuous functions, uniform continuity, montone and inverse functions. Differentiable functions, Rolle's theorem, mean value theorems and Taylor's theorem, power series. Riemann integration, fundamental theorem of integral calculus, improper integrals. Application to length, area, volume, surface area of revolution. Vector functions of one variable and their derivatives. Functions of several variables, partial derivatives, chain rule, gradient and directional derivative.

Tangent planes and normals. Maxima, minima, saddle points, Lagrange multipliers, exact differentials. Repeated and multiple integrals with application to volume, surface area, moments of inertia. Change of variables. Vector fields, line and surface integrals. Green’s, Gauss’ and Stokes’ theorems and their applications.

ME110 Workshop – I
ME110 Workshop – I 0-0-3-3Carpentry: Introduction to wood working, Marking and Measuring Tools-rule, try square, marking gauge, mortise gauge etc., Cutting Tools-rip saw, tenon saw, firmer chisel, mortise chisel, iron jack plane, wooden jack plane etc., Drilling Tools-braces, drill bits etc., Striking Tools-hammers, mallet etc., Holding Tools-bench vice, G-cramp etc., Miscellaneous Tools- rasps, files, screw driver, pincer etc.; Operations-marking, sawing, planning, chiseling, boring, grooving etc., Joints- Corner joints, Tenon and Mortise joint, Briddle cross-joint.

Fitting: Introduction to fitting, Tools-bench vice, hammers, chisels, files-flat file, square file, half round file, round file, knife edge file, scrapers, hacksaws, try squares, drill machine, drill bits, taps, dies etc, Operations-chipping, filing, scrapping, sawing, marking, drilling, tapping, dieing etc.;

Sheet Metal Working: Introduction to sheet metal work; GI sheets, aluminium, tin plate, copper, brass etc, Toolssteel rule, vernier calipers, micrometer, sheet metal gauge etc., scriber, divider, punches, chisels, hammers, snips, pliers, stakes, rivets etc., Operations-shearing, bending, drawing, squeezing etc.

Pattern making and Foundry: Introduction to pattern making, moulding and foundry practice. Pattern material-wood, cast iron, brass, aluminium, waxes etc., different types of patterns, core-boxes, core prints, hand tools-shovel, riddle, rammer, trowel, slick, lifter, sprue pin, bellow, mallet,vent rod, pouring weights etc., moulding sands-green sand, dry sand, loam sand, facing sand etc., grain shape and size, properties of moulding sand, sand preparation and testing etc., casting- permanent mould casting, centrifugal casting etc.

ME 111 Engineering Drawing
ME 111 Engineering Drawing 2-0-3-7Geometrical construction of simple plane figure: Bisecting the line, draw perpendicular, parallel line, bisect angle, trisect angle, construct equatorial triangle, square, polygon, inscribed circle

Free hand sketching: prerequisites for freehand sketching, sketching of regular and irregular figures.

Drawing scales: Engineering scale, graphical scale, plane scale, diagonal scale, comparative scale, scale of chord

Orthographic projection: Principle of projection, method of projection, orthographic projection, plane of projection, first angle of projection, third angle of projection, reference line

Projection of points, lines and plane: A point is situated in the first quadrant, point is situated in the second quadrant, point is situated in the third quadrant, point is situated in the fourth quadrant, projection of line parallel to both the plane, line contained by one or both the plane, line perpendicular to one of the plane, line inclined to one plane and parallel to other, line inclined to both the plane, true length of line

Missing views: Drawing of missing front view of a solid, missing top view of solids, missing side view of solids Orthographic projection of simple solid: Introduction, types of solid, projection of solid when axis perpendicular to HP, axis perpendicular to VP, axis parallel to both HP and VP, axis inclined to both HP and VP

Orthographic projection of simple solid: Introduction, types of solid, projection of solid when axis perpendicular to HP, axis perpendicular to VP, axis parallel to both HP and VP, axis inclined to both HP and VP

HS101 English: Language through Literature
HS101 English: Language through Literature

Essays
Freedom by George Bernard Shaw
Student Mobs by J.B. Priestley

Short Stories
The Three Dancing Goats- A Folk Tale (Anonymous)
The Fortune Teller by Karel Capek
Grief by Anton Chekov

One-Act Play
Refund by Fritz Karinthy

Poems
Night of the Scorpion by Nissim Ezekiel
Porphyria’s Lover by Robert Browning

PH101 Physics – I
PH101 Physics – I 2-1-0-6 Pre-requisites: nil Classical Mechanics: Position, velocity and acceleration vectors in plane polar coordinate. Newton’s laws of motion. Fundamental forces. Contact forces. System of Particles. Conservation of momentum. Work-energy theorem. Line integral of a vector field. Conservative forces. Gradient of a scalar field. Potential energy and equilibrium. Conservation of energy. Angular momentum. Rotation about fixed axis. Torque. Motion involving translation and rotation. Vector nature of angular velocity and angular momentum. The Gyroscope. Pseudo forces. Rotating frame. Centrifugal and Coriolis forces. Foucault pendulum. Special Theory of Relativity: Result of Michelson-Morley Experiment. Postulates of STR. Galilean transformation. Lorentz transformation. Simultaneity. Length contraction. Time dilation. Relativistic addition of velocities. Quantum Mechanics: Failure of classical concepts. De Broglie’s hypothesis. Davison and Germer’s experiment. Uncertainity Principle, Wave packets. Phase and Group velocities. Schrodinger equation. Probabilities and Normalization. Expectation values. Eigenvalues and eigenfunctions. Applicationa in one dimension: Particle in a box, Finite Potential well, Steps and Barriers, Harmonic oscillator.

Second Semester
CS101 Introduction to Computing
CS101 Introduction to Computing 3-0-0-6 Pre-requisites: Nil Digital computer fundamentals: flowcharts, the von Neumann architecture, programs, assembly language, high level programming languages, text editors, operating systems. Imperative programming (Using C): data types, variables, operators, expressions, statements, control structures, functions, arrays and pointers, recursion, records (structures), files, input/output, some standard library functions and some elementary data structures.

Program development: programming tools, testing and debugging.

CS110 Computing Laboratory
CS110 Computing Laboratory 0-0-3-3 Pre-requisites: Nil Laboratory experiments will be set in consonance with the material covered in CS 101. This will include assignments in a programming language like C.

Third Semester
CS201 OOP and Data Structures
CS201 OOP and Data Structures 3-0-3-9 Pre-requisites: CS101 From C to Java: basics of Java, introduction to the object oriented programming (OOP) concepts (such as classes, objects, constructors, destructors, inheritance, polymorphism, operator overloading) using Java, JVM, applets, APIs, GUI Programming. From Java to C++: the OOP concepts using C++. Performance of algorithms: space and time complexity, asymptotics. Fundamental Data structures: linked lists, arrays, matrices, stacks, queues, binary trees, tree traversals. Algorithms for sorting and searching: linear search, binary search, insertion-sort, bubble-sort, quicksort. Priority Queues: lists, heaps. Graphs: representations, depth first search, breadth first search. Hashing: separate chaining, linear probing, quadratic probing. Search Trees: binary search trees, red-black trees, AVL trees, splay trees, B-trees.

CS203 Discrete Mathematics
CS203 Discrete Mathematics 3-0-0-6 Pre-requisites: Nil Set theory: sets, functions, relations, partial orders, lattices. Logic: propositional logic (formulae, truth tables, proof systems, soundness and completeness of proof systems), predicate logic (formulae, interpretations, proof systems, soundness and completeness of proof systems). Combinatorics: permutations, combinations, partitions, Stirling numbers. Recurrences, summations, generating functions, asymptotics. Graph Theory: paths, connectivity, subgraphs, isomorphic and homeomorphic graphs, trees, complete graphs, bipartite graphs, matchings, colourability, planarity, digraphs. Algebraic Structures: semigroups, groups, subgroups, homomorphisms, rings, integral domains, fields.

CS221 Digital Design
CS221 Digital Design 3-0-0-6 Pre-requisites: Nil Number Systems: representations of numbers (binary, octal, decimal, and hexadecimal), arithmetics of signed and unsigned numbers. Boolean Algebra and logic gates: gate level minimization of Boolean functions. Combinational logic circuits: design and analysis, some standard combinational circuits (encoders, decoders, multiplexers). Sample and hold Circuits, Analog-to-Digital Converter, Digital-to-Analog Converter. Synchronous sequential logic circuits: design and analysis; flip-flops, registers, counters; finite state model: state tables and state diagram, state minimization. Asynchronous sequential logic circuits: design and analysis; incompletely specified machines; reduction of states and flow tables; race free state assignments. Programmable logic devices: memory, PLA, PAL. Representation and synthesis using ASM charts.

Fourth Semester-Core Courses
CS204 Algorithms
CS204 Algorithms 3-0-0-6 Pre-requisites: CS201, CS203 Models of Computation: Turing machines and random access machines, space and time complexity measures, lower and upper bounds. Design and analysis techniques: the greedy method, divide-and-conquer, dynamic programming, backtracking, branch and bound, amortized analysis. Priority Queues: lists, heaps, binomial heaps, Fibonacci heaps. Sorting and order statistics: sorting algorithms (insertion-sort, bubble-sort, shell-sort, quicksort, merge-sort, heapsort and external-sort) and their analyses, selection. Graph Algorithms: connectivity, biconnectivity, topological sort, shortest paths, minimum spanning trees, maximum flow. Advanced topics: the disjoint set union problem; string matching; NP-completeness; geometric, approximation, parallel, and randomized algorithms.

CS222 Computer Organization and Architecture
CS222 Computer Organization and Architecture 3-0-0-6 Pre-requisites: CS221 Memory organization: hierarchical memory systems, cache memories, cache coherence, virtual memory. System buses: interconnection structures and bus interconnection. Arithmetic Logic Unit. Study of an existing CPU: architecture, instruction set and the addressing modes supported; assembly language programming. Control unit Design: instruction interpretation, hardwired and microprogrammed methods of design. RISC and CISC paradigms. I/O Transfer techniques: programmed, interrupt-driven and DMA; I/O processors and channels, mapping of I/O addresses. Advanced architectures: parallel and pipelined systems, dataflow, hypercubes, superscalar processors.

CS223 Hardware Laboratory
CS223 Hardware Laboratory 0-0-3-3 Pre-requisites: CS221 Design of synchronous and asynchronous sequential circuits. Digital system design using RTL level functional blocks. Design of various controllers using hardwired and/or microprogrammed techniques. Design of a CPU using SSI/MSI/LSI level components: choice of word size, instruction format, I/O and memory interface, datapath, control unit. Introduction to hardware description languages such as VHDL, Verilog, etc.

CS241 Software Engineering
CS241 Software Engineering 2-0-3-7 Pre-requisites: CS201 The software life cycle, nature and qualities of software, software engineering principles. Software project management: planning, scheduling, monitoring, control, risk management. Requirements specification: specification styles (informal, formal), operational and descriptive specifications. Software Design: function-oriented and object-oriented approaches; architectural, component-level and user-Interfaces design; structured programming and implementation. Verification: testing (strategies and techniques), formal methods, validation. Advanced topics: maintenance, reengineering, product metrics. Software Engineering tools and environments. Use of some software engineering packages in laboratory assignments.

CS242 Systems Programming Laboratory
CS242 Systems Programming Laboratory 0-1-3-5 Pre-requisites: CS201 Linux administration: basic utilities, make, logging, backup, authentication; PERL programming; Unix system calls and shell programming; electronic mail administration; assemblers, linkers and loaders; assembly language programming; introduction to LaTeX.

Fifth Semester
CS301 Formal Language and Automata
CS301 Formal Language and Automata 3-0-0-6 Pre-requisites: CS203 Basic concepts: alphabets, languages, and grammars. Regular Languages: regular expressions and algebraic laws thereof; deterministic and nondeterministic finite automata (DFAs and NFAs): equivalence of DFAs and NFAs, minimization of DFAs, Myhill-Nerode theorem; regular grammars; closure properties of regular languages; Pumping lemma; decidable properties of regular languages. Context free languages: context free grammars (CFGs): derivations, derivation trees, ambiguous grammars, inherently ambiguous languages, normal forms of CFGs: Chomsky Normal Form and Greibach Normal Form; pushdown automata (PDAs): deterministic and nondeterministic PDAs (DPDAs and NPDAs); deterministic CFLs, LL (k) and LALR grammars; closure properties of CFLs; Pumping lemma and Ogden’s Lemma; decidable properties of CFLs. Context sensitive languages: context sensitive grammars; linear bounded automata. Recursively enumerable languages: unrestricted grammars; Turing machines: variants and equivalence thereof; random access machine and its equivalence with Turing machine.

CS331 Programming Language
CS331 Programming Language 3-0-2-8 Pre-requisites: CS201 Introduction to various programming paradigms and their implementation issues. Imperative programming: block structure; scoping rules; parameter passing etc. in languages like C, Pascal, Fortran. Object-oriented programming: abstraction, hiding; objects; classes; inheritance etc in languages like C++, Modula, Java. Functional programming: functions; recursion; types; polymorphism; storage allocation etc in languages like LISP, ML, Scheme. Logic programming: Horn clauses; SLD-resolution etc in languages like Prolog. Introduction to concurrent programming: expressing parallelism; communication; synchronization etc in languages like Ada, CSP, Linda. Semantics of programming languages. (The course will include programming lab assignments in various languages.)

CS341 Operating Systems
CS341 Operating Systems 3-0-0-6 Pre-requisites: CS201, CS222 Process Management: process; thread; scheduling. Concurrency: mutual exclusion; synchronization; semaphores; deadlocks. Memory Management: allocation; protection; hardware support; paging; segmentation. Virtual Memory: demand paging; allocation; replacement; swapping; segmentation; TLBs. File Management: naming; file operations and their implementation. File systems: allocation; free space management; directory management; mounting. I/O Management: device drivers; disk scheduling; block I/O; character I/O. (Unix will be used as a running example, while examples will drawn also from DOS and NT.)

CS342 Operating Systems Laboratory
CS342 Operating Systems Laboratory 0-1-3-5 Pre-requisites: CS201, CS222, CS223, CS242
Programming assignments to build parts of an OS kernel. Use of a teaching package such as Nachos.
CS343 Data Communications
CS343 Data Communications 3-0-0-6 Pre-requisites: CS222 Basics of Digital Communications: signals, noise, Nyquist’s rate, Fourier transforms of signals, harmonics. Baseband and broadband transmission: modulation techniques; fundamentals of modems; local loop implementation. Digital transmission of voice: PCM, ADPCM, time division multiplexing; T1, T3 formats. Fibre optics: basic principles; SONET; technologies. VSAT technology: TDMA, DAMA; point-to-point wireless communication (microwave). Local Area Networks: Ethernet (CSMA/CD operation; parameters, specifications, limitations); cabling (Ethernet, Fast-Ethernet, Gigabit Ethernet; hubs, patch panels, wiring closets); bridges; switches; virtual LANs; 100BaseT; 100BaseVGANY; gigabit Ethernet; FDDI; token ring; wireless networks; ISDN, B-ISDN.

CS344 Databases
CS344 Databases 3-0-0-6 Pre-requisites: CS201, CS203 Data models: entity-relationship, relational, network, hierarchical, and logic data models, with the emphasis on the relational model. Query languages: relational algebra, relational calculus, SQL, QBE. Theory of database design: functional dependencies; normal forms: 1NF, 2NF, 3NF, Boyce-Codd NF; decompositions; normalization; multivalued dependencies, join dependencies, 4NF, 5NF. Data storage and indexing: disks, files, file organizations, indexes; tree structured indexing (ISAM, B-trees), hash based indexing. Query processing: evaluation of relational operators, query optimization; transcation management, Concurrency control; error recovery; security. Case studies: ORACLE, Microsoft access etc. Introduction to Open Database Connectivity, Client-Server environment etc.

CS345 Databases Laboratory
CS345 Databases Laboratory 0-1-3-5 Pre-requisites: CS201 Familiarization with various databases packages like Microsoft Access, ORACLE, SQL Server, DB2 etc. Client-server and 3 tier web enabled database programming. Use of Application servers. Design and implementation of a Database application using a multi-user DBMS.

Sixth Semester-Core Courses
CS302 Theory of Computation
CS302 Theory of Computation 3-0-0-6 Pre-requisites: CS203, CS301 Formal Logic: proof systems for propositional and first-order logic; consistency; completeness; compactness. Computability: primitive recursive functions; Godelization; Church's thesis. Review of models of computations, time and space bounded computations. Classes P, NP, polynomial reducibilities, NP-completeness.

CS346 Compilers
CS346 Compilers 3-0-0-6 Pre-requisites: CS201, CS301 Overview of different phases of a compiler : front-end; back-end. Lexical analysis: finite automata; DFA construction and minimization; automatic tools. Syntax analysis: context free grammars; top down and bottom up parsing techniques; construction of efficient parsers; syntax-directed translation; automatic tools. Semantic analysis: declaration processing; type checking; symbol tables; error recovery. Intermediate code generation: run-time environments; translation of language constructs. Code generation: Flow-graphs; register allocation; code-generation algorithms. Introduction to code optimization techniques.

CS347 Compilers Laboratory
CS347 Compilers Laboratory 0-0-3-3 Pre-requisites: CS202 Programming assignments to build a compiler for a subset of a C-like programming language, using tools such as Lex and Yacc.

CS348 Computer Networks
CS348 Computer Networks 3-0-2-8 Pre-requisites: CS201, CS343 7 layer OSI/ISO model; evolution of computer networks. Data Link Layer: HDLC, PPP, sliding window protocols. Network Layer: IP, ICMP, X.25, Frame Relay, ATM, routing algorithms (EGP, RIP, OSPF etc.); Transport Layer: TCP, UDP, congestion control, flow control; Sockets interface, sockets programming; Application Layer: SNMP, Authentication, Encryption, electronic mail. WWW basics: http, html, CGI, Java, Firewalls.

CS362 Computer Graphics
CS362 Computer Graphics 3-0-2-8 Pre-requisites: CS204 Introduction: organization of an interactive graphics system. Scan conversion, filling, clipping, antialiasing, geometrical transformations, viewing, hidden line and hidden surface removal, representation of curves and surfaces, solid modeling, illumination and shading. Graphical user interfaces and Interactive input methods.
The laboratory work will involve programming with standard graphics libraries like OpenGL.

Seventh Semester - Core Courses
CS400 Summer Training
CS400 Summer Training 0-0-0-2 Pre-requisites: NIL Training for a minimum period of 8 weeks in a reputed industry / R&D lab / academic institution except IIT Patna. The student is expected to submit a report and present a seminar after the training.

CS421 Computer Peripherals and Interfacing
CS421 Computer Peripherals and Interfacing 3-0-0-6 Pre-requisites: CS222 Introduction to architectural details of 8/16/32 bit microprocessors and their programming. Interfacing microprocessors with devices such as displays, keyboard, DAC & ADC’s etc. using programmable chips like I/O ports, timer/counter, keyboard/display controller, DMA controller, Interrupt controller etc. Familiarization with microprocessor development systems (MDS). Bus standards, IEEE 488, VME, MULTIBUS, SCSI, ISA/EISA, PCI, AGP. Selected peripheral devices and their characteristics. Peripheral controller chips, Microcontrollers.
Selected applications and design problems.

CS422 Peripherals and Interfacing Laboratory
CS422 Peripherals and Interfacing Laboratory 0-1-3-5 Pre-requisites: CS222, CS223 Familiarization with 8/16 bit microprocessors kits, writing simple programs. Assignments relating to interfacing. Design a standalone system. System development: case studies in instrumentation, process control systems etc. using PC based add-on cards. Use of a hardware description language such as VHDL, Verilog to describe & simulate the hardware of selected problems targeted to FPGA.

CS498 Project
CS498 Project 0-0-10-10 Pre-requisites: NIL Each student will undertake a sizeable project involving survey of literature, development of new techniques and/or implementation of systems, writing of reports etc. under the guidance of one or more faculty members.

Eighth Semester - Core Courses
Project-II
CS499 Project-II 0-0-16-16 Pre-requisites: Nil
Each student will undertake a sizeable project involving survey of literature, development of new techniques and/or implementation of systems, writing of reports etc. under the guidance of one or more faculty members.