http://intranet.iiit.ac.in/Information/academic/sy...

UG - CSE Core Courses

Course Code Course Name

MA 1000 Mathematic I
SC 1000 Physics I
ET 1000 Electrical Science I
CS 1200 Digital Logic Design
CS 1000 Computer Programming
CS 1010 IT Workshop I
MA 1010 Mathematics II
CS 1001 Physics II
ET2050 Electronic Circuits
CS 2100 Data Structures & Algorithms
CS 2200 Computer Organization
CS 1011 IT Workshop II – Scripting
ET 1002 Electrical Science II
MA 3200 Mathematics III
ET 3105 Signals & Systems
CS 3300 Operating Systems
CS 2010 IT Workshop III – Software Technologies
CS 3101 Theory of Computation
CS 3400 Database Management Systems
CS 3110 Algorithms
CS 3700 Artificial Intelligence
CS 3350 Computer Networks
CS 3155 Compilers
CS 3105 Principles of Programming Languages
CS 3600 Software Engineering

MA 1000 Maths I [3-1-0-4]   Top

Convergent sequence of real numbers, Canchy’s Convergence, uniqueness of limit and boundedness of a convergent sequence. Bounded Monotone sequences their convergence. Convergence of series of real numbers, the ratio test, D’Alemberts test, root test and integral tests for convergence. Alternating Series, Absolutely Convergent Series, Dominated Series, Power Series and their radius of convergence, Abel’s theorem for Power
Series. Properties  of continuous and differentiable functions. Rolle’s Theorem, Lagrange & Canchy’s mean value theorems. Undeterminate forms, Taylor’s Expansion, Convex functions & points of inflection, Curvature of Plane Curves. Partial differentiation, Euler’s Theorem, Chain-Rule, Legendre Transformation with its application in transforming Lagrangian to Hamiltonian in Analytical Dynamics. Jacobians and their properties.
Directional-Derivative, Level Surfaces and Normal Derivative. Maxima-minima of function of two variables, Lagranges’s method of undetermined multipliers. Double, Triple, Line and Surface Integrals and their applications. Theorems of Green, Gauss and Stokes. Vector-Calculus and its applications in Tengential-normal, Radial-cross radial. Velocity and acceleration of a particle motion in two dimensions. Gradient, Divergence and Curl.
Serret-Frenet Formulae for a  three dimensional Curve. Differentiation under the sign of integration, Trapezoidal and Simpson’s rule for Numerical Calculation of Integrals.

SC 1000 Physics I [3-1-0-4]   Top

Newtonian formulation: Frames of reference, Galilean transforms, Systems of particles , non-inertial frames and pseudo forces, rotational frames, applications – projectiles, cyclones. Lagrangian Formulation: Generalized coordinates; Lagrange’s equations from d’Alembert’s Principle, simple applications. Hamilton’s principle and Lagrange’s equations, conservation laws. Hamiltonian formulation: Principle of Least action; Hamilton equations, canonical coordinates, Poisson brackets, Hamilton equations in
Poisson bracket form. Thermodynamics and Statistical Physics Thermodynamic quantities, Concept of equilibrium and Zeroth law, First law . Kinetic theory of gases, Second law. Carnot cycle , Efficiency , thermodynamic temperature scale. Entropy and Claussius’ inequality. Entropy and disorder. Maxwell’s equations. Phase space, ensembles, Liouville’s theorem, Statistical definition of entropy. Partition function ,Maxwell- Boltzmann statistics, Fermi - Dirac and Bose-Einstein statistics.

Preferred Text Books: Classical Mechanics: H.Goldstein, Pearson Education(2002), Lagrangian & Hamiltonian Mechanics : M.G.Calkin, Allied Publishers(2000), Heat and Thermodynamics: Zemansky and Dittman , McGraw Hill (1981), Classical Mechanics: T.L.Chow, John Wiley(1995), Introduction to Classical Mechanics: R.G. Takwale and P.S. Puranik, TMH(2001), Mechanics: Kittel et al , Berkeley Physics Course Vol I, McGraw Hill, The Feynman Lectures on Physics : Vols I & II, Addison Wesley

ET 1000          Electrical Science    I                                                                  [3-1-0-2]  

   Top

Circuit Analysis:Kirchoff’s laws, analysis of single loop circuit, nodal analysis, mesh analysis, linearity and superposition, source transformations, Thevenin’s and Norton’s theorems. Reactive circuits: Inductance and capacitance combinations, RL, RC circuits, transient and steady state response, the LCR circuit, source free series and parallel circuits, damping, forced response and resonance, quality factor of a resonant circuit. Phasor concept and complex frequency : Complex forcing function, the phasor
relationships for R, L and C, impedance and admittance, complex frequency and complex frequency and complex frequency and complex frequency plane resonance. Average power and RMS values: Instantaneous power, average power, effective value values of voltage and current, apparent power and power factor complex power. Magnetic Circuits: Mutual inductance, coupled circuits, linear transformers, ideal transformers, hysteresis loss.

Preferred Text books: Engineering Circuits Analysis, by Hayt and Kemmerley, Publisher:Tata McGraw Hill. Electrical Engineering Fundamentals by Del Toro, Publiser: Prentic Hall of India.

CS 1200 Digital Logic Design [3-1-0-2]   Top

Detailed Syllabus: Number systems – representation in radix-2,8,10,16 systems, conversion between systems, ones and twos-complement representation, arithmetic in different number systems. Codes – Binary, BCD, Excess-3, Gray, ASCII codes. Boolean algebra – Boolean logic, axioms and theorems, truth tables, logic gates. Boolean functions (BFs) - modeling problems; Canonic representations; Karnaugh maps; minimisation of completely and incompletely specified BF using Karnaugh maps. And the
Qunie-McCluskey algorithm; implementation using logic gates. Combinational logic circuits – Half and full adders, subtractors, encoders/decoders, multiplexers/demultiplexers, ROMs, PLAs. Implementations of BF using combinational logic circuits. Sequential circuits – Different types of flip-flops, clocked flip-flops, shift registers, counters; speed considerations

Preferred Text Books: Digital Logic and Computer Design by M Morris Mano

CS 1000          Computer Programming                                                            [3-1-3-4]   Top

An overview of Computer Organization identifying components and their functions, machine and assembly language, Programming Language and Programming – representation of integers, real characters, instructions, data type, constants, variables, arithmetic expressions, assignment statement, logical expression, sequencing, alternation, iteration, Arrays, structures, sub- programmes and parameters.  Simple I/O programming projects
utilizing concepts and emphasizing good programming style.Algorithm development – techniques of problem solving, flow-charting, stepwise refinement, simple numerical example, recursion, algorithms for searching(eg. Linear, binary), sorting (e.g. exchange, insertion, merging of ordered lists)

Preferred Text Books: Kelley. Al and Pohl. Ira “C by Dissection : The Essentials  of  C Programming” Benjamin/Cummings 1992. Kernigham Brain W and Ritchie. Dennis M “The C programming Language” PHI 1989 Wirth. Niklaus “Systematic Programming” An introduction. PH Int. 1972. Dahl, O.J. Dijkstra E.W. and Hoares C.A. “Structured Programming” A.P. 1972, Dromey R.G. “How to solve it by Computer” PHI 1988. Weiss. Mark A
“Efficient C Programming A Practical Approach” PH Int 1995

CS 1010          IT Workshop I                                                                            [2-0-2-2]    Top

Introduction to Personal computers – PC configuration, processor, memory, storage devices, i/o devices, Familiarization with key board, using typing tutor; Introduction to OS – Overview, command line interface, Linux, DOS, Windows 98; LAN environment – introduction, telnet, ftp, finger, ping; Symbolic Mathematics-Overview,
introduction to various commands and tool boxes, programming using MATLAB/OCTAVE; Office Productivity Tools – overview of office automation suits like MS office 2000 and star office; Word Processing – Document editing, formatting, printing, working with tables, drawing objects with the use of Latex, MS word etc; Unix shell – Overview of Unix shell programming, Unix utilities & regular expression.   Unix utilities: grep, cut, paste, diff,
comm., sort, cat, head, tail, tr etc.  Shell scripts: filter, redirection, pipe, batch, Bash shell vars, if-then, vi, sed; Internet – Introduction to web, overview of HTML tags, creating FORMS, FRAMES, creating HTML using a text editor, using a HTML.; CAD-drawing Simple objects like lines, circles etc; Installing OS – Underlying m/c concepts ( Ex.partition); Installing & uninstalling various packages (RPM, make, tar, etc.); Configuring, managing
accounts, printing.

Preferred Text books: Introduction to computer-peter Norton, Getting  started with MATLAB 6: A quick introduction for Scientists and Engineers by Rudra pratap singh.

MA 1010 Mathematics II [4-1-0-5]   Top

Ordinary Differential Equations: Equations of first order and first degree, Linear Second Order differential with  Constant Coefficients, Variation of Parameter method, Picords Iteration method; Fourier Series: Concepts of Orthogonality and completeness in L2 [a,b], Fourier Inequality, Parseval Relation, Fourier Series in real and complex forms; Partial Differential Equations: Product type solutions of ware equation and Heat Conduction
Equations; Elements of Vector Spaces: Vector Spaces, Sub-Spaces, Concepts of Linear Independence, Dimensions Basis etc., Linear Transformations , Normed Linear Spaces, Pre-hilbert Spaces, Gram-Schmidt Orthogonalisation Process; Complex Variables: Analytic functions, Caunchy-Riemann Equations, Conformal-Transformations, Cauchys Integral Theorem, Cauchy Inequality, Livoulle’s and Moreras theorem. Taylor & Laurent
Exoansions, Poles and Essential Singularities, Residues, Caunchy Residue Theorem, Contour-Integration; Matrices: Inversa of a Matrix, Echelon form of a Matrix, Rank, Eigen Values and Eigen-Vectors, Cayley-Hamilton theorem, Hermition and Unitory Matrices, Similar Matrices, Reduction of Quadratic forms to its canonical forms, necessary and sufficient condition for Diagonalisation of a real Square Matrix. Statistics & Probability: Mean,
Median & Mode, Standard Deviation. Elements of Probability Theory, Bayes Theorem, Random Variable, PDF & CDF, Transformation of Random Variable, PDF & CDF, Transformation of Random Variable, Binomial, Poisson, Normal and Hypergeometric, Probablistic distributions, Markov & Chebyshev Inequalities Chernoff Bound. Expectation, Covariance, Correlation, Moment Generating function and characteristic functions, Linear
Regression, Estimation.

Preferred Text Books: C.R.Wylie: Advanced Engineering Mathematics, Mc Graw-Hill; K.F.Riley: Hobson And Bence; Mathematical Methods for physics and Engineering, Cambridge University Press; G.B. Arfkhen, H.J. Weber: Mathematical Methods for Physicists: Prism Books Pvt. Ltd., Publishers, Bangalore; E.Kreyszig: Advanced Engineering Mathematics, John Wiley & Sons; P.V.O’Neil: Advanced Engineering Mathematics, Thompson Asia Pvt. Ltd., Singapore; S.M.Ross: Introduction to Probability Models,
Academic Press; A.Papoulis: Probability and Random Variables, and Stochastic Processes, Mc Graw Hill; Y.Viniotis: Probability and Random Processes, McGraw –Hill; R.J.Larsen, M.L.Marx: An Introduction to mathematical Statistics & its applications, Prentice Hall Publishers.

SC 1001 Physics II [3-1-0-2]   Top

Coulombs Law, Electric field, Gauss’ law. Electric potential, Electrostatic energy. Boundary conditions. Electric field and potential due a charge distribution. Dielectrics and capacitance. Electric fields in mater, Polarization and Electric Displacement. Magnetic field, Lorentz force, Force on a current carrying conductor, Equation of continuity. Biot-Savart law. Ampere’s law. Magnetic vector potential. Boundary conditions, Magnetization, magnetic fields in matter. Ohms law, Electromagnetic Induction , Faraday’s law
and Lenz’ law. Displacement current . Maxwell’s equations in free space and in dielectrics. Boundary conditions . Electromagnetic waves in vacuum. Energy and momentum in E.M. waves. E.M. waves in matter , reflection , transmission and refraction.
Preferred Text Books : An Introduction to Electrodynamics : D.J.Griffiths, Prentice Hall of India (2000)

ET 2050 Electronic Circuits [3-1-3-4]   Top

Diode theory:ideal diode,terminal characteristics of junction diodes, analysis of diode circuits, small-signal model and its application, operation in the reverse breakdown region-Zener diodes, limiting and clamping circuits; UJT, Tunnel diode, Diode Circuits: Half-wave, full-wave and bridge rectifiers with and without filters, ripple, regulation, series and shunt regulators, introduction to SMPS; Bipolar junction transistors (BJTs): operation of the npn transistor in the active mode, the pnp transistor, graphical representation of transistor charac
Preferred text books: Electronic Principles – Malvino; Microelectronics – Millman and Grabel; Electronic devices and circuit theory – Boylestead and Nashelsky; Microelectronic circuits – Sedra and Smith (Oxford Univ. Press)

CS 2100 Data Structures & Algo. [3-1-3-4]   Top

Review: Principles of good programming style, expression and documentation.  Control flow, stepwise refinement of both statements and data structures or top down programming. String Processing: Concatenation, Sub-strings.  Matching. Data Structures: Linear allocation (eg. Stacks, queues, deques) and linked allocation. Algorithms for manipulating linked lists.  Binary trees and AVL trees.  Algorithms for traversing and balancing trees.
Basic concepts of networks (plex structures). Internal Searching and Sorting: Methods such as binary radix, shell, quicksort, merge sort. Hash coding

CS 2200          Computer Organization                                                              [3-1-0-4]

   Top

Digital Elements: Multiplexers, Decoders, Registers, Sequential circuits. Binary Numbers: Binary, 2's complement notation, Adders, Floating point numbers and arithmetic. Instruction set architecture: Assembly and machine languages, instruction formats, addressing modes, control, subroutine calls, processor equivalences based on instruction sets. CPU Design: Single and multibus architectures, RTL decomposition of machine instructions, instruction fetch execution, microsteps, sequencing, control unit,
hardwired control design of hardwired control unit, ALU design, floating point arithmetic unit, introduction to microprogrammed control. Input-Output: I/O devices, components, interfacing, polled I/O, interrupt-driven I/O, interrupt service routines, Direct Memory Access. Memory System: Basics, address, buses, data, read, write. memory organization, address decoding, address ranges. cache memory, paged memory, virtual memory.
Preferred Text Books: Hamacher. Vranesic, Zaky. Computer Organization. 5th edition.

CS 1011          IT Workshop 2 – Scripting                                                           [2-0-3-3]

   Top

System administration for linux / window, shell scripts, regular expressions, make files, CVS, Pytaon, Perl –brief, Matlab/gnuplot/pytaon, Numerical analysis, Graph Plotting.

EE 1002          Electrical Science II                                                                      [3-1-0-2]

   Top

Instantaneous power, average power, effective values of voltage and current, apparent power and power factor, complex power. Mutual inductance, coupled circuits, dot convention. Topological Properties of Electrical Circuits, Topological matricies,  Loop current, node voltage and node-pair voltage methods of network analysis. Laplace Transform methods. Network functions for 1-port and 2-port networks, z,y,h,g and transmission
parameters, Interconnection of 2-port networks. Important filter types. Butterworth and Chebyshev filter approximations. Frequency transformations. Use of active RC networks for realization of filters.

Reference Books: “Engineering Circuit Analysis”, by Hayt and Kemmerley , Publisher: Tata McGraw Hill. “Network Analysis”, by M.E. Van Valkenburg, Prentice Hall of India, New Delhi. “Network Theory and Filter Design”, by V.K. Aatre, Wiley Eastern, New Delhi

MA 3200          Mathematics III (Discrete Math)                                                [4-1-0-5]   Top

Logic, Propositional Equivalences, Predicates and Quantifiers Sets, Set Operations, Functions, Sequences and Summations, Growth of Functions Mathematical Reasoning, Methods of Proof, Mathematical Induction, Recursive definitions, Recursive algorithms, Program correctness. Counting, Pigeonhole Principle, Permutations and Combinations, Discrete Probability, Probability Theory, Generalized Permutations and Combinations, Generating Permutations and Combinations. Recurrence Relations,
Generating Functions, Inclusion-Exclusion. Relations, Representing Relations, Equivalence Relations, Partial Orderings, Transitive Closure. Graphs, Isomorphism, Connectivity, Eulerian Paths, Hamiltonian Paths, Shortest Paths, Planar Graphs, Graph Coloring. Trees, Spanning Trees, Minimum Spanning Trees. Boolean Algebra, Boolean functions, logic gates, circuit minimization. Group Theory, Groups, Semi-groups, Rings, Fields

Preferred Text Books: Kenneth H. Rosen, Discrete Mathematics and Its Applications, McGraw-Hill. Ralph P. Grimaldi, Discrete and Combinatorial Mathematics, Pearson Education. Norman L. Biggs, Discrete Mathematics, Oxford University Press

Pre requisites: Computer Programming

ET 3105          Signals & Systems                                                                         [3-1-0-4]    Top

Basic continuous-time and discrete- time signals, systems and properties of systems, representation of signals in terms of impulses, convolution sum, convolution integral, properties of linear time invariant systems, system described by differential equations, representation of continuous-time periodic and aperiodic signals, Fourier
series and Fourier transform, properties of the Fourier transform, frequency response of systems characterized by linear constant coefficient differential equations, discrete-time signals, discrete-time  Fourier transform and Fourier series, convolution and modulation properties, periodic convolution, DFT.Representation of continuous time signals by its samples, sampling theorem, reconstruction of a signal from its samples using
interpolation, effect of undersampling, the Laplace transform, ROC for Laplace transform, the inverse laplace transform, properties of Laplace transform, characterization of LTI Systems using Laplace transform. Preferred Text books: A V Oppenheim, A S Willsky and I T Young “Signals and Systems” Prentice Hall of India, 1983(Third Printing in 1992).

CS 3300 Operating Systems [3-0-3-4] Top Introduction to operating system, Computer system architectures, Operating system structures, Processes, Threads, CPU scheduling, Process synchronization, Critical section problem, Semaphores, Monitors, Deadlocks, Memory management, Paging, Segmentation, Segmentation with paging, Virtual memory, Page replacement algorithms, Thrashing, File system interface, File system implementation, I/O
systems, Mass-storage structures, Protection and security, Case studies: LINUX and WINDOWS.
Preferred Text Books. A.Silberschatz, P.B.Galvin, G.Gagne, Operating System Concepts, John Wiley & Sons, 2002. William Stallings, Operating Systems, Prentice-Hall, 1998. A.Tanenbaum, Modern Operating Systems, Prentice-Hall, 2000.
Mandatory Tutorials: Introduction to Unix/Linux, System calls, Process implementation, Process communication, Process Synchronization, Memory management, Operating system case studies.
Mandatory Project: About eight lab experiments have to be completed. The experiments cover system calls, process creation, process communication, process synchronization, memory management and device drivers.
Pre-requisites: Computer organization, Computer programming

CS 2010 IT Workshop 3: Software Technologies [2-0-3-3]   Top

Brief Syllabus: GUI: Qt, wxPython, layout design, Networking: Socket Programming, Web-Programming: CGI, PHP, Sessions, Cookies, Zope, XML, DBMS: Database design, Normal forms, mySQL, ODBC, C++, templates, STL

Preferred Text books: Material on web

Mandatory Project: A real-world project carrying 60% weightage of course marks.

Pre requisites: ITWS2

SC 3300 Experimental Methods [0-0-4-2]   Top

Error analysis: Error types, propagation, estimation and elimination. Optional methods (Laboratory): Refraction – Using a Spectrometer – Analysis of spectra – dispersion – measurement of refractive index. Diffraction – Using a spectrometer(grating), Using an optical bench – measurement of small, Thicknesses Using biprism, Using Airy’s rings-measurement of apertures, diameters , Using a laser source , Interference – Using a Michelson interferometer-small thicknesses, Planarity , Polarisation – Using a
spectrometer, Brewster’s angle , Using polarisers – polarization by different media. Electrical methods(laboratory): Bridge measurements – resistance, capacitance and inductance , Resonance – LCR resonance, Q factor, Phase measurements, time delays, frequencies using Oscilloscope, Measurement of Hysteresis loss in magnetic materials

CS 3101 Theory of Computation [3-1-0-4]   Top

Mathematical preliminaries and notation: sets, proof techniques; Basic concepts of theory of computation: Language, Grammars, Automata; Finite Automata: DFA, NFA, Equivalence of DFA & NFA, Minimization of number of states in finite automata; Regular Languages & Regular Expressions: Relationship between regular languages and regular expressions, Properties of regular languages; Context-Free Languages: Context-free grammars, passing and ambiguities, methods for transforming context-free
grammars, properties of context-free languages; Pushdown Automata: NPDA, DPDA, Relationship between PDA and context-free languages; Turing Machines: Definition of a Turing machine, Variants of Turing machines; Hierarchy of formal languages: Recursively enumerable language, Recursive language, unrestricted grammars, context-sensitive grammars & languages; Limits of Algorithmic computation: Computability and Decidability, Halting problem, undecidability, reducing one undividable problem to
another, Post correspondence problem.
Preferred Text Books: (1)J.E. Hopcroft, R. Mohwani, J.D. Ullman: Introduction to Automata Theory, languages and computation. (2)P. Linz, An introduction to formal languages and automata.(3) M. Sipser. Introduction to the theory of computation.

Pre requisites: MA 3200: Discrete Mathematics.

CS 3400          Database Management System                                                 [3-0-3-4]

   Top

Database system concepts and architecture, EER data model, Relational Data model, relational algebra, tuple relational calculus, SQL, EER Relational data model mapping, and indices, relational algebra operation implementations, query optimization, transaction management, serializability theory, concurrency, control algorithms, recovery, and database security.

Preferred Text books: Elmasri & Navathe, Fundamentals of Database Systems, Addison Wesley, 2000, Raghu ramakrishnan DBMS, Korth, Silberstaz & Sudarshan DBMS.

Mandatory Tutorials: EER Data model, relational algebra, tuple relational calculus, SQL, normalization, file organization, indices, join algorithms, query optimization, serializability theory.

Mandatory Project: Three-phase project in groups of 3-5 students, can be a live project (with strict adherence to deadlines). Phase I: database and application requirements analysis and ER Model development, Phase II: translation to relational data model, normalization, and creation and population of database, Phase III: application development accessing the database.

CS 3110 Algorithms [3-0-3-4]   Top

Time complexity, Asymptotic Notation, Sets and Disjoint Set Union data structure, Divide and Conquer principle, Different algorithms and their analysis for Search, Finding maximum and minimum, sorting, and selection problems. Derivation of an O(n2.81) algorithm for matrix multiplication and Strassen’s algorithm. Greedy method, various algorithms and their analysis for fractional knapsack, job sequencing with deadlines, minimum cost spanning tree, optimal storage on tapes, optimal merge patterns, single
source shortest paths problems. Dynamic programming, principle of optimality, Algorithms and their analysis for multistage graph, all pairs shortest paths, optimal binary search trees, 0/1 knapsack, traveling salesperson, flow shop scheduling and reliability design problems. Method of Back Tracking, Bounding functions, Algorithms and their analysis for 8 – queens, sum of subsets, graph coloring, Hamiltonian cycles and knapsack problems. Method of Branch and Bound, various search methods, Algorithms
and their analysis for 0/1 knapsack and traveling salesperson problems. Overview of Lower Bound theory, Lower bound calculations using comparison trees, reduction techniques, and oracles and adverse arguments.

Preferrd Text Books: Horowitz, Sahni, and Rajasekaran; Fundamentals of Computer Algorithms, Galgotia Publications Private limited, New Delhi. Cormen, Leiserson, and Rivest; Introduction to Algorithms, Prentice Hall of India. Aho, Hopcroft, and Ullman; The Design and Analysis of Computer algorithms, Addison Wesley. Sara Baase and Allen Van Gelder; Computer Algorithms : Introduction to Design and Analysis, Pearson Education

Pre requisites: Computer Programming, Data Structures, and Discrete Mathematics

CS 3700          Artificial Intelligence                                                                                 [3-1-0-4]

   Top

Search – Uninformed strategies (BFS, DFS, etc.), Informed strategies (A* search, heuristic functions, hill-climbing, etc.), Game trees, Minimax algorithm, Alpha-Beta pruning, Knowledge representation & reasoning – Propositional logic, First order logic, Resolution, NLP, Learning – Decision trees, Naïve Bayes, Neural Networks, Uncertain reasoning, Expert Systems, Partial order planning

Preferred Text books: Stuart Russel and Peter Norvig, "Artificial Intelligence; A Modern Approach", Pearson: Patrick Henry Winston, "Artificial Intelligence", Third Edition, Addison Wesley; Elaine Rich & Kevin Knight, "Artificial Intelligence", 2nd edition, McGraw-Hill; Bharati, Akshar, Vineet Chaitanya and Rajeev Sangal, "Natural Language Processing: A Paninian Perspective", Prentice-Hall of India

CS 3350 Computer Networks [3-0-3-4]   Top Introduction to Computer Networks, Network Services and Layered Architectures: TDM, Statistical multiplrexing techniques, Packet-Switched Networks: Ethernet, Token ring protocols, The Internet and TCP/IP Networks: addressing, routing in TCP/IP networks, Circuit-Switched Networks: SONET, WDM, DSL etc., Asynchronous Transfer Mode .

Preferred Text Books: J. Walrand  and  P. Varaiya, “High-Performance  Communication  Networks” , Morgan, Kaufmann  Publishers,D. Bertsekas   and  R. Gallagher, “ Data  Networks, “  Prentice  Hall, J. Walrand , “Communication  Networks:  A  First  Course, “ Mc-Graw  Hill, A. S. Tanenbaum, “Computer  Networks, “ Prentice  Hall

CS 3155          Compilers                                                                                       [3-1-3-4]

   Top

Introduction overview of compilation, Lexical Analysis, Syntax analysis, Syntax Directed Translation, Run Tine Environment, Intermediate Representation, Trimaran Compiler Environment, Basic Block Instruction scheduling, Register Allocation, Multiprocessor Architecture, Introductory Data Flow Analysis, Loop Transformations, Software pipelining and Modulo Scheduling, Code generation.

Preferred Text books : Compilers Principles, Techniques and tools Alfred V Aho, ravi sethi and Jeffrey D Ullman. Engineering a compiler Keith D Cooper and Linda Torezon

1 of 4 Tuesday 17 May 2016 10:36 PM

 http://intranet.iiit.ac.in/Information/academic/sy...

CS 3105 Principles of Programming Languages [3-1-0-2] Top Introduction: Role of programming languages, Historical perspective, Evaluation of programming languages, Language design issues, Language paradigms. Language Description: Language definition, Syntactic structure, Semantic methods, Interpretation and translation. Imperative Programming: Types: Data types and typing, Elementary data types, Structured types, Type coercion, Type equivalence, Type
checking, Strong typing, Type compatibility statements, Need for structured programming, Expressions, Assignment statements, statement level control structures. Subprograms: Fundamentals of subprograms, Design issues of subprograms, Parameter evaluation and passing, Overloading, Generic functions, Coroutines. Functional Programming: Characteristic of Imperative Languages, Mathematical and Programming Functions, Functional Programming language. Values, bindings and functions, Lambda
Calculus, LISP, Data Objects, Functions and functional forms. Logic Programming: Predicate Calculus, Overview of Logic Programming, Basic Elements of prolog, Application of logic programming.

Preferred Text Books: (1) Robert W Sebesta “Concepts of Programming Languages” Fourth edition Addison Wesley, 1999. (2)Terrence W Pratt and Marvin V Zelkowitz “Programming Languages Design and Implementation” Fourth edition Prentice Hall India.

CS 3600          Software Engineering                                                                   [3-0-2-4]    Top

Software Engineering – An Introduction,           Product and Process Tools, Models and Methodologies, UML (Unified Modeling Language), RUP (Rational Unified Process) , XP (eXtreme Programming), OO Software Engineering,            Requirements Elicitation, Analysis, System Design, Object Design, Rationale Management,
Testing, Configuration Management, Project management. Preferred Text books: Object Oriented Software Engineering: Conquering Complex and Changing Systems By Bernd Bruegge, Allen H Dutoit, Prentice Hall.  Software Engineering: A practitioner’s Approach by Roger S. Pressman Mc Graw Hill, Code Complete: A Practical Handbook of Software Construction by Steve C McConnell, Microsoft Press, The Mythical Man-Month: Essays
on Software Engineering, by Frederick P. Brooks Addison-Wesley Pub Co

UG - ECE Core Courses

Course Code Course Name

MA 1000 Mathematic I
SC 1000 Physics I
ET 1000 Electrical Science I
CS 1200 Digital Logic Design
CS 1000 Computer Programming
CS 1010 IT Workshop I
MA 1010 Mathematics II
CS 1001 Physics II
ET2050 Electronic Circuits
CS 2100 Data Structures and Algorithms
CS 2200 Computer Organization
ET 1002 Electrical Science II
MA 3100 Linear Algebra
ET 3105 Signals and Systems
MA 3500 Probability and Random Processes
EC 3050 Analog and Digital Circuits
EC 2051 Electronic Workshop
EC 3300 Analog and Digital Communications
EC 3600 VLSI Design
EC 4100 Digital Signal Processing
EE 3100 Linear Control Systems
EC 3800 Communication Networks
EC 4300 Information Theory and Coding
EC 3200 Microprocessor based System Design
EE 3000 Networks and Transmission Lines

MA 1000 Maths I [3-1-0-4]   TOP

Convergent sequence of real numbers, Canchy’s Convergence, uniqueness of limit and boundedness of a convergent sequence. Bounded Monotone sequences their convergence. Convergence of series of real numbers, the ratio test, D’Alemberts test, root test and integral tests for convergence. Alternating Series, Absolutely Convergent Series, Dominated Series, Power Series and their radius of convergence, Abel’s theorem for Power
Series. Properties  of continuous and differentiable functions. Rolle’s Theorem, Lagrange & Canchy’s mean value theorems. Undeterminate forms, Taylor’s Expansion, Convex functions & points of inflection, Curvature of Plane Curves. Partial differentiation, Euler’s Theorem, Chain-Rule, Legendre Transformation with its application in transforming Lagrangian to Hamiltonian in Analytical Dynamics. Jacobians and their properties.
Directional-Derivative, Level Surfaces and Normal Derivative. Maxima-minima of function of two variables, Lagranges’s method of undetermined multipliers. Double, Triple, Line and Surface Integrals and their applications. Theorems of Green, Gauss and Stokes. Vector-Calculus and its applications in Tengential-normal, Radial-cross radial. Velocity and acceleration of a particle motion in two dimensions. Gradient, Divergence and Curl.
Serret-Frenet Formulae for a  three dimensional Curve. Differentiation under the sign of integration, Trapezoidal and Simpson’s rule for Numerical Calculation of Integrals.

SC 1000 Physics I [3-1-0-4]   TOP

Newtonian formulation: Frames of reference, Galilean transforms, Systems of particles , non-inertial frames and pseudo forces, rotational frames, applications – projectiles, cyclones. Lagrangian Formulation: Generalized coordinates; Lagrange’s equations from d’Alembert’s Principle, simple applications. Hamilton’s principle and Lagrange’s equations, conservation laws. Hamiltonian formulation: Principle of Least action; Hamilton equations, canonical coordinates, Poisson brackets, Hamilton equations in
Poisson bracket form. Thermodynamics and Statistical Physics Thermodynamic quantities, Concept of equilibrium and Zeroth law, First law . Kinetic theory of gases, Second law. Carnot cycle , Efficiency , thermodynamic temperature scale. Entropy and Claussius’ inequality. Entropy and disorder. Maxwell’s equations. Phase space, ensembles, Liouville’s theorem, Statistical definition of entropy. Partition function ,Maxwell- Boltzmann statistics, Fermi - Dirac and Bose-Einstein statistics.

Preferred Text Books: Classical Mechanics: H.Goldstein, Pearson Education(2002), Lagrangian & Hamiltonian Mechanics : M.G.Calkin, Allied Publishers(2000), Heat and Thermodynamics: Zemansky and Dittman , McGraw Hill (1981), Classical Mechanics: T.L.Chow, John Wiley(1995), Introduction to Classical Mechanics: R.G. Takwale and P.S. Puranik, TMH(2001), Mechanics: Kittel et al , Berkeley Physics Course Vol I, McGraw Hill, The Feynman Lectures on Physics : Vols I & II, Addison Wesley

ET 1000          Electrical Science    I                                                                    [3-1-0-2]

   TOP

Circuit Analysis:Kirchoff’s laws, analysis of single loop circuit, nodal analysis, mesh analysis, linearity and superposition, source transformations, Thevenin’s and Norton’s theorems. Reactive circuits: Inductance and capacitance combinations, RL, RC circuits, transient and steady state response, the LCR circuit, source free series and parallel circuits, damping, forced response and resonance, quality factor of a resonant circuit. Phasor concept and complex frequency : Complex forcing function, the phasor
relationships for R, L and C, impedance and admittance, complex frequency and complex frequency and complex frequency and complex frequency plane resonance. Average power and RMS values: Instantaneous power, average power, effective value values of voltage and current, apparent power and power factor complex power. Magnetic Circuits: Mutual inductance, coupled circuits, linear transformers, ideal transformers, hysteresis loss.

Preferred Text books: Engineering Circuits Analysis, by Hayt and Kemmerley, Publisher:Tata McGraw Hill. Electrical Engineering Fundamentals by Del Toro, Publiser: Prentic Hall of India.

CS 1200 Digital Logic Design [3-1-0-2]   TOP

Detailed Syllabus: Number systems – representation in radix-2,8,10,16 systems, conversion between systems, ones and twos-complement representation, arithmetic in different number systems. Codes – Binary, BCD, Excess-3, Gray, ASCII codes. Boolean algebra – Boolean logic, axioms and theorems, truth tables, logic gates. Boolean functions (BFs) - modeling problems; Canonic representations; Karnaugh maps; minimisation of completely and incompletely specified BF using Karnaugh maps. And the
Qunie-McCluskey algorithm; implementation using logic gates. Combinational logic circuits – Half and full adders, subtractors, encoders/decoders, multiplexers/demultiplexers, ROMs, PLAs. Implementations of BF using combinational logic circuits. Sequential circuits – Different types of flip-flops, clocked flip-flops, shift registers, counters; speed considerations

Preferred Text Books: Digital Logic and Computer Design by M Morris Mano

CS 1000          Computer Programming                                                               [3-1-3-4]   TOP An overview of Computer Organization identifying components and their functions, machine and assembly language, Programming Language and Programming – representation of integers, real characters, instructions, data type, constants, variables, arithmetic expressions, assignment statement, logical expression, sequencing,
alternation, iteration, Arrays, structures, sub-programmes and parameters.  Simple I/O programming projects utilizing concepts and emphasizing good programming style.Algorithm development – techniques of problem solving, flow-charting, stepwise refinement, simple numerical example, recursion, algorithms for searching(eg. Linear, binary), sorting (e.g. exchange, insertion, merging of ordered lists)

Preferred Text Books: Kelley. Al and Pohl. Ira “C by Dissection : The Essentials  of  C Programming” Benjamin/Cummings 1992. Kernigham Brain W and Ritchie. Dennis M “The C programming Language” PHI 1989 Wirth. Niklaus “Systematic Programming” An introduction. PH Int. 1972. Dahl, O.J. Dijkstra E.W. and Hoares C.A. “Structured Programming” A.P. 1972, Dromey R.G. “How to solve it by Computer” PHI 1988. Weiss. Mark A
“Efficient C Programming A Practical Approach” PH Int 1995

CS 1010          IT Workshop I                                                                                [2-0-2-2]    TOP

Introduction to Personal computers – PC configuration, processor, memory, storage devices, i/o devices, Familiarization with key board, using typing tutor; Introduction to OS – Overview, command line interface, Linux, DOS, Windows 98; LAN environment – introduction, telnet, ftp, finger, ping; Symbolic Mathematics-Overview,
introduction to various commands and tool boxes, programming using MATLAB/OCTAVE; Office Productivity Tools – overview of office automation suits like MS office 2000 and star office; Word Processing – Document editing, formatting, printing, working with tables, drawing objects with the use of Latex, MS word etc; Unix shell – Overview of Unix shell programming, Unix utilities & regular expression.   Unix utilities: grep, cut, paste, diff,
comm., sort, cat, head, tail, tr etc.  Shell scripts: filter, redirection, pipe, batch, Bash shell vars, if-then, vi, sed; Internet – Introduction to web, overview of HTML tags, creating FORMS, FRAMES, creating HTML using a text editor, using a HTML.; CAD-drawing Simple objects like lines, circles etc; Installing OS – Underlying m/c concepts ( Ex.partition); Installing & uninstalling various packages (RPM, make, tar, etc.); Configuring, managing
accounts, printing.

Preferred Text books: Introduction to computer-peter Norton, Getting  started with MATLAB 6: A quick introduction for Scientists and Engineers by Rudra pratap singh.

MA 1010 Mathematics II [4-1-0-5]   TOP

Ordinary Differential Equations: Equations of first order and first degree, Linear Second Order differential with  Constant Coefficients, Variation of Parameter method, Picords Iteration method; Fourier Series: Concepts of Orthogonality and completeness in L2 [a,b], Fourier Inequality, Parseval Relation, Fourier Series in real and complex forms; Partial Differential Equations: Product type solutions of ware equation and Heat Conduction
Equations; Elements of Vector Spaces: Vector Spaces, Sub-Spaces, Concepts of Linear Independence, Dimensions Basis etc., Linear Transformations , Normed Linear Spaces, Pre-hilbert Spaces, Gram-Schmidt Orthogonalisation Process; Complex Variables: Analytic functions, Caunchy-Riemann Equations, Conformal-Transformations, Cauchys Integral Theorem, Cauchy Inequality, Livoulle’s and Moreras theorem. Taylor & Laurent
Exoansions, Poles and Essential Singularities, Residues, Caunchy Residue Theorem, Contour-Integration; Matrices: Inversa of a Matrix, Echelon form of a Matrix, Rank, Eigen Values and Eigen-Vectors, Cayley-Hamilton theorem, Hermition and Unitory Matrices, Similar Matrices, Reduction of Quadratic forms to its canonical forms, necessary and sufficient condition for Diagonalisation of a real Square Matrix. Statistics & Probability: Mean,
Median & Mode, Standard Deviation. Elements of Probability Theory, Bayes Theorem, Random Variable, PDF & CDF, Transformation of Random Variable, PDF & CDF, Transformation of Random Variable, Binomial, Poisson, Normal and Hypergeometric, Probablistic distributions, Markov & Chebyshev Inequalities Chernoff Bound. Expectation, Covariance, Correlation, Moment Generating function and characteristic functions, Linear
Regression, Estimation.

Preferred Text Books: C.R.Wylie: Advanced Engineering Mathematics, Mc Graw-Hill; K.F.Riley: Hobson And Bence; Mathematical Methods for physics and Engineering, Cambridge University Press; G.B. Arfkhen, H.J. Weber: Mathematical Methods for Physicists: Prism Books Pvt. Ltd., Publishers, Bangalore; E.Kreyszig: Advanced Engineering Mathematics, John Wiley & Sons; P.V.O’Neil: Advanced Engineering Mathematics, Thompson Asia Pvt. Ltd., Singapore; S.M.Ross: Introduction to Probability Models,
Academic Press; A.Papoulis: Probability and Random Variables, and Stochastic Processes, Mc Graw Hill; Y.Viniotis: Probability and Random Processes, McGraw –Hill; R.J.Larsen, M.L.Marx: An Introduction to mathematical Statistics & its applications, Prentice Hall Publishers.

CS 1001 Physics II [3-1-0-2]   TOP

Coulombs Law, Electric field, Gauss’ law. Electric potential, Electrostatic energy. Boundary conditions. Electric field and potential due a charge distribution. Dielectrics and capacitance. Electric fields in mater, Polarization and Electric Displacement. Magnetic field, Lorentz force, Force on a current carrying conductor, Equation of continuity. Biot-Savart law. Ampere’s law. Magnetic vector potential. Boundary conditions, Magnetization, magnetic fields in matter. Ohms law, Electromagnetic Induction , Faraday’s law
and Lenz’ law. Displacement current . Maxwell’s equations in free space and in dielectrics. Boundary conditions . Electromagnetic waves in vacuum. Energy and momentum in E.M. waves. E.M. waves in matter , reflection , transmission and refraction.
Preferred Text Books : An Introduction to Electrodynamics : D.J.Griffiths, Prentice Hall of India (2000)

ET 2050 Electronic Circuits [3-1-3-4]

Diode theory:ideal diode,terminal characteristics of junction diodes, analysis of diode circuits, small-signal model and its application, operation in the reverse breakdown region-Zener diodes, limiting and clamping circuits; UJT, Tunnel diode, Diode Circuits: Half-wave, full-wave and bridge rectifiers with and without filters, ripple, regulation, series and shunt regulators, introduction to SMPS; Bipolar junction transistors (BJTs): operation of the npn transistor in the active mode, the pnp transistor, graphical
representation of transistor characteristics, analysis of transistor circuits at DC, the transistor as an amplifier, small-signal equivalent circuit model, the hybrid-PI model, the T model; Biasing the BJT for discrete-circuit design; basic single-stage BJT amplifier configurations- common-emitter, common-base and common-collector; a general large signal model for the BJT- the Ebers-Moll model: The amplifier transfer function, analysis of common-base, common-emitter and common - collector configurations,
cascode configuration, frequency response of different configurations; The BJT differential pair: small-signal operation of the BJT differential amplifier, the BJT differential amplifier with active load frequency response of the differential amplifier; multistage amplifiers; power BJTs; Field effect transistors(FETA), biasing, Simple stage FET amplifiers: common drain, common source, frequency response of FET amplifiers. Preferred text books: Electronic Principles – Malvino; Microelectronics – Millman and Grabel;
Electronic devices and circuit theory – Boylestead and Nashelsky; Microelectronic circuits – Sedra and Smith (Oxford Univ. Press)

CS 2100 Data Structures & Algo. [3-1-3-4] TOP

Review: Principles of good programming style, expression and documentation.  Control flow, stepwise refinement of both statements and data structures or top down programming. String Processing: Concatenation, Sub-strings.  Matching. Data Structures: Linear allocation (eg. Stacks, queues, deques) and linked allocation. Algorithms for manipulating linked lists.  Binary trees and AVL trees.  Algorithms for traversing and balancing trees.
Basic concepts of networks (plex structures). Internal Searching and Sorting: Methods such as binary radix, shell, quicksort, merge sort. Hash coding

CS 2200          Computer Organization                                                                [3-1-0-4]

   TOP

Digital Elements: Multiplexers, Decoders, Registers, Sequential circuits. Binary Numbers: Binary, 2's complement notation, Adders, Floating point numbers and arithmetic. Instruction set architecture: Assembly and machine languages, instruction formats, addressing modes, control, subroutine calls, processor equivalences based on instruction sets. CPU Design: Single and multibus architectures, RTL decomposition of machine instructions, instruction fetch execution, microsteps, sequencing, control unit,
hardwired control design of hardwired control unit, ALU design, floating point arithmetic unit, introduction to microprogrammed control. Input-Output: I/O devices, components, interfacing, polled I/O, interrupt-driven I/O, interrupt service routines, Direct Memory Access. Memory System: Basics, address, buses, data, read, write. memory organization, address decoding, address ranges. cache memory, paged memory, virtual memory.
Preferred Text Books: Hamacher. Vranesic, Zaky. Computer Organization. 5th edition.

EE 1002          Electrical Science II                                                                      [3-1-0-2]

   TOP

Instantaneous power, average power, effective values of voltage and current, apparent power and power factor, complex power. Mutual inductance, coupled circuits, dot convention. Topological Properties of Electrical Circuits, Topological matricies,  Loop current, node voltage and node-pair voltage methods of network analysis. Laplace Transform methods. Network functions for 1-port and 2-port networks, z,y,h,g and transmission
parameters, Interconnection of 2-port networks. Important filter types. Butterworth and Chebyshev filter approximations. Frequency transformations. Use of active RC networks for realization of filters.

Reference Books: “Engineering Circuit Analysis”, by Hayt and Kemmerley , Publisher: Tata McGraw Hill. “Network Analysis”, by M.E. Van Valkenburg, Prentice Hall of India, New Delhi. “Network Theory and Filter Design”, by V.K. Aatre, Wiley Eastern, New Delhi

MA 3100          Linear Algebra                                                                               [3-1-0-4]

   TOP

Sets and functions, groups and group homomorphisms, rings and fields, vector spaces and linear maps. direct products and internal direct sums, linear independence, bases and dimension, rank and nullity, Dual space, dual basis, transpose of a map. Matrices, linear systems, Gauss-Jordon elimination, row-echelon form, reduced row-echelon form, solution of linear systems using Gauss-Jordon elimination, matrix inversion by Gauss-Jordon
elimination, similar and equivalent matrices. Matrices as representations of linear maps, matrix of the composition of two maps, change of basis, Determinant as the multilinear alternating normalized map, properties of determinants, nonrecursive formula, determinant of a product, determinant of the inverse. Characteristic polynomial, Eigen values, eigen vectors, eigen basis, Cayley-Hamilton theorem, triangular form, characteristic
subspaces, nilpotent maps, Jordon canonical form, minimal polynomial.

EC 3105          Signals & Systems                                                                         [3-1-0-4]    TOP

Basic continuous-time and discrete- time signals, systems and properties of systems, representation of signals in terms of impulses, convolution sum, convolution integral, properties of linear time invariant systems, system described by differential equations, representation of continuous-time periodic and aperiodic signals, Fourier
series and Fourier transform, properties of the Fourier transform, frequency response of systems characterized by linear constant coefficient differential equations, discrete-time signals, discrete-time  Fourier transform and Fourier series, convolution and modulation properties, periodic convolution, DFT.Representation of continuous time signals by its samples, sampling theorem, reconstruction of a signal from its samples using
interpolation, effect of undersampling, the Laplace transform, ROC for Laplace transform, the inverse laplace transform, properties of Laplace transform, characterization of LTI Systems using Laplace transform. Preferred Text books: A V Oppenheim, A S Willsky and I T Young “Signals and Systems” Prentice Hall of India, 1983(Third Printing in 1992).

MA 3500 Probability and Random Process [3-1-0-4]   TOP

Probability, random variables, probability distribution and density functions, joint statistics, conditional statistics, independence. Functions of random variables and random vectors. Expectation, moments, characteristic functions. Convergence of a sequence of random variables, Laws of large numbers, central limit theorem. Random Processes, mean and autocorrelation, stationarity, ergodicity. Power spectral density. Response of memoryless and linear systems to random processes. Gaussian, Poisson,
Markov processes.

EC 3050 Analog & Digital Circuits [3-1-3-4]   TOP

Linear wave shaping circuits.Operational amplifiers, voltage to current and current to voltage converters. Field-effect devices: Structure and physical operation of the enhancement-type MOSFET, current-voltage characteristics of the enhancement MOSFET, the deletion-type MOSFET, the MOSFET as an amplifier, biasing in MOS amplifier circuits, basic configurations of IC MOS amplifiers- CMOS common-source, CMOS common-gate and the common-drain configurations, and their small signal analysis.
Digital IC terminology, TTL series characteristics, tristate TTL, CMOS series characteristics, open-drain and tristate outputs, CMOS transmission gate, IC interfacing, TTL driving CMOS, CMOS driving TTL.Astable, mono-stable and bi-stable multi-vibrators. AND, OR, NOT, NAND, NOR gates, design of RS, D, JK, MS Flip-Flops, astable and mono-stable circuits using NAND gates. Digital arithmetic circuits, parallel and serial binary adder circuits, fast adders, parallel binary adders/subtractor circuits using 1’s
and 2’s complement system, decimal adders/subtractors. Code converters, binary to BCD and BCD to binary code converters, LED, LCD display devices and decoders, priority encoders, magnitude comparators, parity generator/checker circuits, read-only memory- structure and its application
Preferred Text Books: Coughlin & Driscoll: ’Operational Amplifiess & Linear Integrated Circuits’.

EC 2051          Electronics Workshop                                                                  [2-0-3-3]

   TOP

This course aims to teach the art of design of Electronic Circuits using to Medium Scale integrated Circuits chips. The course is divided into 3-4 projects. Lectures cover concepts required for each project. Both analog and digital design methodology are covered. Bread boarding and soldering are also covered.

Preferred Text Books: Art of Electronics by Horowitz &Hill, OUP.

Pre requisites: Analog and Digital Electronics-Concurrent

EC 3300 Introduction to Analog & Digital Communication [3-1-3-4]   TOP

Representation of signals using ortho-normal basis functions, Hilbert transform, pre-envelope and complex envelope, representation of band-pass signals and systems Sampling theorem for band-limited stochastic processes, response of a band-pass system to a band-pass signal, representation of band-pass stationary stochastic processes, vector space concepts, signal space concepts. Time and frequency domain expression of AM, DSB, SSB and VSB, generation of linearly modulated signals, coherent
demodulation and envelope detection. nstantaneous frequency, phase and frequency modulation, single tome FM and its spectral analysis, NBFM and WBFM, bandwidth requirements of angle modulated signals, demodulation of angle modulated signals. Memoryless digital modulation methods- PAM, PM, QAM, orthogonal multi-dimensional signals. Optimum receivers for the AWGN channel- correlation demodulator, matched-filter demodulator, the optimum detector. Probability of error for binary modulation,
M-ary PAM, M-ary PSK, M-ary orthogonal signals, QAM, comparison of digital modulation methods, channel capacity.

EC 3600 VLSI Design [3-1-3-4]

   TOP
MOS structure, threshold voltage, NMOS, PMOS, CMOS. MOS IC technology: Masking steps in metal gate and silicon gate technologies, basic bipolar IC technology: masking steps, component isolation techniques, problems of metal cross over. Digital MOS circuits with saturated mode, triode mode and depletion mode loads and CMOS, static and dynamic performance, ratio-less logic. MOS circuit design on the chip for a given set of technology parameters and voltages, effect of tolerances or spreads,
mobility and temperature design, influence body effect on design, circuit layout in metal gate and silicon gate technologies, design using Lamda based design rules of Mead and Conway. Pass transistor logic in NMOS and CMOS systems, mapping from relay logic into silicon to evolve pass transistor logic, pass transistor ALU, tree network, multiplexer and de-multiplexer circuits, selector logic, tally circuits, delays in pass transistor logic. Use of stick diagrams for design of topology of layout, MOS PLAs, their
stick diagrams and layout, finite state machines, bottom up and top down design, custom design, various semi-custom design approaches
Preferred Text Books: Pucknell:Basic VLSI Design; Wolf: Modern VLSI Design.

EC 4100 Digital Signal Processing [3-1-0-4]    TOP INTRODUCTION - What is DSP and what is its importance?, Applications for DSP, Discrete vs digital signals; SAMPLING - Conversion of continuous signals to discrete signals, Sampling theorem Aliasing; MATHEMATICAL REPRESENTATION OF SIGNALS AND SYSTEMS - Classification of discrete-time signals and systems, Elementary signals, Representation of signals using elementary signals,
Representation of systems in the time domain, Instantaneous relationship, Simple signal transformations; LINEAR SYSTEMS - Linear shift invariant systems (LSI), Representation of LSI systems in the time domain, Difference equations, Block diagrams, Signal flow graphs, Properties of LSI systems; Z-TRANSFORM - Z-transform , ROC, Inverse Z-transform, Different methods for Inverse Z-transform, General method, Long division, Partial fraction; FOURIER ANALYSIS - DTFT of discrete signals, DFT of
discrete signals, Comparison of the transforms, Fast Fourier Trasforms; LTI SYSTEMS IN THE FREQUENCY DOMAIN - Representation of systems in the frequency domain, Analysis of systems in the frequency domain; DIGITAL FILTERS - Digital filters, IIR and FIR filters, Other types of filters, Filter structures, Design of digital filters, Multirate systems; PRACTICAL CONSIDERATIONS IN DSP - Data formats and their effects, Effect of finite word-length, Number precision and dynamic range, Data windowing,
Fast multiplication of complex numbers, Efficient computation of FFT of real sequences; DSP APPLICATIONS
Preferred Text Books: Signals and Systems by Ziemer, Tranter and Fannin,Signals and Systems by Oppenheim, Willsky and Young, Signals and Systems – Haykin and Van Veen

Mandatory Project: Implementation of assembly language programs(of say FIR / IIR Fitters) on Commercial Digital Signal processors.

Pre – requisites: Signals and Systems

EE 3100 Linear Control Systems [3-1-0-4]

   TOP
Basic Concepts: Notion of feed-back, open- and closed-loop systems. Modelling and representations of control systems, transfer functions, block diagrams, signal flow graphs, state-space representations. Performance and Stability: Time-domain analysis, second-order systems, characteristic equation and roots, Routh-Hurwitz criteria, frequency-domain techniques, root-locus methods, frequency responses, Bode-plots, gain-margin and phase-margin, Nyquist plots, compensator design, Proportional, PI and PID controllers, lead-lag c

EC 3800 Communication Networks [3-1-0-4]

   TOP
General issues in the transport of information over networks of communication links. Circuit switched and packet switched networks, and their relationships. The ISO-OSI layered architecture, and the evolution of packet switched networks (X.25, Frame Relay, ATM, TCP/IP networking). Digital transmission standards and hierachies. Various architectures for packet switching: relaying, bridging, routing. Data link layer: ARQ schemes and their analyses. Local area networks and their analyses: ALOHA, CSMA/CD (Ethernet), CSMA/CA (
Preferred Text Books: D. Bertsekas and R.G. Gallager: Data Networks. J.W. Walrand and P. Varaiya: High Performance Communication Networks. A. Kumar, D. Manjunath, J. Kuri: Communication Networking: An Analytical Approach
Prerequisites: Probability and random processes.

EC 4300 Information Theory and Coding [3-1-0-4]    TOP

Introduction: Basic communication system models, discrete and continuous discrete-time channels, waveform channels. Measure of information: entropy, relative entropy, mutual information. Source coding theory: lossy and lossless coding, Kraft's inequality, source coding theorems. Lossless source coding techniques: Huffman code, Fano code, arithmetic code, Ziv-Lempel code, run-length code. Channel coding theory: channel capacity and channel coding theorems, capacity of binary symmetric channel, differential entropy and ca

EC 3200 Microprocessor Based System Design [3-1-3-4]

   TOP
Introduction to microprocessor, primary memory- ROM, SRAM,Intel 8085 Microprocessor architecture, instruction set, instruction cycle, machine cycle.
Memory interfacing: I/O interfacing, I/O mapped I/O scheme, memory mapped I/O scheme, simple I/O ports, programmable peripheral interface chip, programmable communication interface chip,.Data transfer schemes: Programmed data transfer, interrupt driven data transfer, DMA data transfer, programmable interrupt controller, programmable DMA controller, design of a simple monitor programme, introduction to micro controllers. 8086/8088 microprocessor architecture, minimum and maximum mode 8086/8088 CPU module desig

2 of 4 Tuesday 17 May 2016 10:36 PM

 http://intranet.iiit.ac.in/Information/academic/sy...

EE 3000 Networks & Transmission Lines [3-1-0-4]

   TOP

Two port networks, Z, Y,h,g, ABCD parameters, equivalence of two ports, driving point transfer function, T-PI transformations. Image impedance, symmetrical and asymmetric T and PI sections, attenuation & phase functions, design of attenuators, impedance matching networks, system function, poles and zeros of network function, frequency response from poles and zeros. Properties of LC networks, Foster’s reactance theorem, constant-k filters, Low-pass, High-pass and Band-pass designs. Equalizers,
amplitude and phase equalization, all-pass filters, band-rejection and notch filters, Butterworth and Tchebysheff approximations and design of filters up to 2nd order. Properties of transmission lines, circuit representation, transmission line theory, input impedance, low loss RF and UHF lines, velocity of propagation, distortionless line, loading, standing waves, reflection coefficient and VSWR. Properties of lambda/4, lambda/2, lambda/8 lines, quarter wave transformer for matching, Smith Chart and its
applications to solve transmission line problems, single stub and double stub matching.

Elective courses

Course Code Course Name

EC 5101 Adaptive Signal Processing
CS 5765 Computer Vision
CS 4110 Cryptography and Network Security
EC 5303 Data Compression
SE 6301 Structural Dynamics

CS3725 Introduction to NLP

NLP Applications: Machine Translation
CS5728
and Information Extraction
CS4401 Distributed Database Management System
CS5405 Data Warehousing and Data Mining

CS4450 Web data & knowledge management

CS4750 Digital Image Processing

CS4650 Software Quality Management in Practice

AM 6201 Finite element method

CS 4462 Internals of Application Servers

CS 3150 Molecular Architecture
EE 3300 Error Correction Codes I

ET 4561 VLSI Algorithms

AM 6301 Continuum Mechanics

CS 5770 Machine Learning

CS 4740 Speech Technology
CS 3500 Computer Graphics
ET 3300 Introduction to Telecommunication
ET 4600 VLSI II - Advanced Logic Synthesis
VLSI III - Logic Design with
ET4601
Programmable Logic Devices
BS 6203 Applied Stress Analysis
MA 4578 Multivariate Analysis

ET 1111 Formal Verification

CS 4405 Applied Data Mining
CS 4175 Computational Geometry

CS 4200 Computer Architecture

CS 5400 Advanced topics in database systems
SE 6401 Earthquake Engineering
CS 4745 Designing Speech Systems
MA 4505 Biostatistics
Service Oriented Architectures with
CS 4464
Lisp
CS 4852 Performance Evaluation Concepts
CS 5460 Enterprise Information Systems Structures

EC 5101 Adaptive Signal Processing [3-1-0-4]   TOP Brief review of stochastic processes, response of linear systems to stochastic processes, eigenvalues and eigenvectors and their properties, Mean-square error (MSE) criterion, principle of orthogonality, extension to complex valued case, unconstrained Wiener filters, application in modeling, inverse modeling and noise cancellation, Method of steepest descent, Newton's method, convergence analysis,
Derivation of the LMS algorithm, average tap-weight behaviour of the LMS algorithm, MSE behaviour of the LMS algorithm, excess MSE and misadjustment, normalized LMS algorithm, LMS algorithm for complex-valued signals, Band-partitioning property of orthogonal transforms, orthogonalization property of orthogonal transforms, transform domain LMS algorithm, selection of the transform.

Preferred Text Books: Adaptive Filters: Theory and Applications - B. Farhang-Boroujeny, Wiley, 1998.

CS 5765 Computer Vision [3-1-0-4]   TOP

Relationship between computer vision, graphics and Image processing. Camera model: Imaging process 3D to 2D projection and loss of information, calibrated and un calibrated vision systems. Limitations of popular cameras and methods to overcome them. Multiple view geometry and imaging systems. Algebraic constraints, reconstruction, view synthesis. Recognition of objects from appearance, shape, partial view, occlusion, etc., Analysis of video, motion and recognizing dynamic activities.
Preferred text books: ‘Forsytn and Ponce’ Computer Vision: a modern approach , Pearsen Education Inc.
Pre requisites: Computer Graphics or Image processing

CS 4110 Cryptography and Network Security [3-1-0-4]   TOP

Different kinds of security attacks, Classical encryption techniques such as additive ciphers, multiplicative ciphers, affine ciphers, polyalphabetic ciphers, transposition ciphers etc. Strengths and weaknesses of aforementioned ciphers. Vigenere cipher. Different techniques to determine the keyword length of Vigenere cipher, Cryptanalysis of Vigenere cipher. Block cipher principles, Feistel cipher structure, Simplified DES, NDS System, Cryptanalysis of NDS system, DES, Differential and Linear cryptanalysis,
Block cipher modes of operation. Double DES, Meet in the middle attack, Triple DES, Triple DES with two keys, Attack on triple DES with two keys, IDEA. Primes and relatively prime numbers, modular arithmetic, Fermat’s and Euler theorems, testing for primality, Euclid’s algorithm, multiplicative inverse and its computation, Chinese remainder theorem, discrete logarithms. Principles of public key cryptosystems, applications for public key cryptosystems, requirements for public key cryptosystems. RSA
algorithm, encryption and decryption, key generation, security of RSA, factoring problem. Key management. Diffie Hellman key exchange.

Preferred Text Books: William Stallings, Cryptography and Network security : Principles and Practice, Prentice Hall

Pre requisites: Discrete Mathematics, Algorithms, Computer Programming

EC 5303 Data Compression [3-1-04]

Introduction-Lossless Compression, Lossy Compression, Measures of Performance, Modeling and Codin, Mathematical Preliminaries for Lossless Compression-A Brief Introduction to Information Theory, Derivation of Average Information, Models, Physical Models, Probability Models, Markov Models, Composite Source Model, Coding, Uniquely Decodable Codes, Prefix Codes, The Kraft McMillan Inequality, Huffman Coding - The Huffman Coding algorithm, Minimum variance Huffman Codes, Optimality of
Huffman Codes, Length of Huffman Codes, ExtendedHuffman Codes, Nonbinary Huffman Codes, Adaptive Huffman Coding, Update Procedure, Encoding Procedure, Decoding Procedure, Golomb Codes, Rice Codes, CCSDS Recommendation for Lossless Compression, Tunstall Codes, Applications of Huffman Coding, Lossless Image Compression, Text Compression, Audio Compression, Arithmetic Coding- Coding a Sequence, Generating a Tag, Deciphering the Tag, Generating a Binary Code,
Uniqueness and Efficiency of the Arithmetic Code, Algorithm Implementation, Integer Implementation, Comparison of Huffman and arithmetic Coding, Applications, Dictionary Techniques-Static Dictionary, Digram Coding, Adaptive Dictionary, The LZ77 approach, The LZ78 approach, Applications, File Compression, Image Compression – The Graphics Interchange Format, Compression over Modems – v.42 bis, Mathematcal Preliminaries for Lossy Coding Distortion Criteria, The Human Visual System,
Auditory Perception, Information Theory Revisited, Conditional entropy, Average Mutual Information, Differential Entropy, Rate Distortion Theory, Models, Probability Models, Linear System Models, Physical Models, Scalar Quantization-The quantization problem, Uniform quantizer, Adaptive quantizer, Forward adaptive quantization, Backward adaptive quantization, Nonuniform quantization, pdf-optimized quantization, companded quantization, Entropy Coded quantization Entropy coding of Lloyd-Max
quantizer outputs, Entropy constrained optimization, High rate optimum quantization

Prerequisite : Computer Programming

SE 6301          Structural Dynamics                                                                TOP         [3-1-0-4]

Introduction to structural dynamics , Single degree of freedom systems, Equation of motion, Methods of solution of differential equation , Free vibrations, Undamped free vibrations, Damped free vibrations, Decay of motion, Forced vibrations, Undamped, Damped forced vibrations, Resonance, Dynamic response factors, Role of damping, Response to arbitrary step function, Concept of response spectrum, Numerical methods, Generalized
single degree of freedom, Natural frequency, Energy principles in dynamics, Multi degree of freedom systems, Control of vibration, Active and passive dampers, Base Isolation

CS3725 Introduction to NLP [3-1-0-4]    TOP  Finite State Automaton: Morphological processing: Semantic analysis: Context free grammar, phrase structure trees, dependency-trees; Parsing; Feature structures, unification; Semantics: lexicon, subcategorization of verbs and cases; Corpus based statistical language processing; N-grams and smoothing; Mutual entropy; Probabilistic context free grammar; Part-of-speech tagging and Hidden Markov Models.
Preferred text books: Jurafsky and Martin: Speech and Langugage Procesing, Prentice Hall, 2000. Akshar Bharati, Rajeev Sangal and Vineet Chaitanya, Natural Language Processing: A Paninian Perspective on , Prentice-Hall of India, New Delhi, 1995.Mandatory Project: Project in groups of 2 on text mining, computational linguistics using English and Indian language corpora, statistical analysis using language corpora. Prerequisite: 3725 NLP Introduction, or 4726 NLP Semantics course

CS5728 NLP Applications : Machine Translation and Information Extraction [3-1-0-4]   TOP

Machine Translation: interlingua and transfer based approaches; Language comparison and contrasts; Lexical and  syntactic transfers; Machine learning of grammar and morphology; Machine learning from parallel corpora; Example based machine translation. Information Extraction: Introduction; Architecture for information extraction; Discovering and extracting terms; Similarity and variations in terms; Grammar based approaches;
Probabilistic grammars; Key word extraction. Prerequisite: 3725 NLP Introduction, or 4726 NLP Semantics course.

Preferred Text Book: Research papers from the following would be the primary reference: -  Journal of Computational Linguistics, ACL, NJ.-  Journal of Machine Translation -  Conf. proceedings: Annual meeting of ACL. -  Conf. proceedings: COLING -  Conf. proceedings: NLP Pacific Rim Symposium -  Various Workshop proceedings. Akshar Bharati, Rajeev Sangal and Vineet Chaitanya, Natural Language Processing: A Paninian Perspective,
Prentice-Hall of India, New Delhi, 1995. Jurafsky and Martin: Speech and Langugage Procesing, Prentice Hall, 2000. Manning and Schutze: Foundations of Statistical Natural Language Processing, example based learning of grammar, chunking and transformation learning from parallel corpora, term extraction, term variation.

Mandatory Project : example based machine translation and information extraction making extensive use of live corpora of texts.

Prerequisite: 3725 NLP Introduction, or 4726 NLP Semantics course.

CS4401 Distributed Database Management System [3-1-0-5]   TOP

The course will cover the basic concepts of distributed database system technology, and provide practical training of designing and implementing a distributed database system solution based application. Architectures of distributed database systems starting with classical homogeneous architecture, and then from heterogeneous database system architectures to architecture of web information systems. Notion of transparency and its various levels will be studied. Distributed database design fundamentals of
vertical and horizontal data partioning, and data allocation will be studied. Further, algorithms to achieve a vertical fragmentation, horizontal fragmentation, and data allocation will be covered along with a project on designing a distributed database for a specific application. Notion of data replication and algorithms to achieve data replication will be introduced. Query processing and optimization with focus on data localization techniques, and algorithms to optimize queries on distributed DBMSs System R*, and
SDD-1 will be studied. Further, a case study on commercial distributed query processing and optimization algorithms will be conducted. Transaction management with focus on architectures for distributed transaction management, concepts of distributed concurrency control, and algorithms for distributed concurrency control. Reliability of distributed database systems and techniques for failure atomicity, namely, two-phase commit protocol and three-phase commit protocol. Reliability techniques under network
partitioning will be studied. Notion of distributed data management and strategies such as data dissemination, and data requests and delivery in web information systems will be introduced.

Preferred Text books: M. Tamer Ozsu and Patrick Valduriez, Principles of Distributed Database Systems, 2nd Ed., Prentice-Hall International Inc., 1999 Stefano Ceri and Giuseppe Pelagatti, Distributed Databases: Principles & Systems, 1st Ed., McGraw-Hill Book Company, 1985.

Mandatory Project: Implement of distributed database system with a system catalog, query  processing, query events and update with simulated two phase commit.

CS5405           Data Warehousing and Data Mining                                           [3-1-2-5]

   TOP

Implementing Data Cubes Efficiently, Computation of Multi-dimensional Aggregates, User adaptive exploration of multi-dimensional data, Algorithms for Materialized View Design in Data Warehousing Environment, Efficiently Updating Materialized Views, Association rule mining algorithms: Apriori, Partition, Sampling, FP-Growth, ARMOR, etc., Interestingness measures, Closed itemsets, Classification algorithms: ID3, CART, C4.5, C5.0, SLIQ, SPRINT, Naïve Bayes, Bayesian Belief Networks, Maximum
Entropy Based Approaches, k-NN, Neural Networks, etc., accuracy measures, Clustering algorithms: k-means, k-medoids, PAM, CLARA, CLARANS, DBSCAN, BIRCH, CHAMELEON, etc.

Preferred Text books: Data Mining Concepts and Techniques, by Jiawei Han and Micheline Kamber

Mandatory Project: One research-oriented project to extend or use data mining techniques learnt in the course + One minor project to use existing mining toolkits

CS4450 Web data & knowledge management [3-1-1-5]   TOP

About 30 important research papers related to the following topics will be discussed. Introduction to Web mining, Web structure mining, search engine algorithms, Community extraction, Information retrieval, Web content mining, Recommendation systems, Web personalization, Web log mining, E-metrics, XML,
Preferred Text Books:.There is no textbook for this course. Research papers will be selected from variety of journals and conference proceedings, such as SIGKDD, SIGMOD, ICDE, W3C and so on.
Mandatory Project: The students have complete a mini-project. In this project each student should apply the data mining algorithm on the real data set and analyze the results.
Pre-requisites: Computer algorithms, Computer programming, operating systems
CS4750 Digital Image Processing [3-0-3-5]

   TOP
INTRODUCTION: Goal of Image processing and computer vision, Human visual perception – phenomena, Digital Image basics- Tessellation, Pixel and spatial resolutions, Image formation, Relations between pixels – neighbourhoods, connectivity, distances, Basic problems in IP – enhancement, compression, restoration, image analysis; SPATIAL DOMAIN PROCESSING: Point and neighbourhood operations, Image enhancement using above operations – contrast stretching, histogram proc., filtering, Geometric transformations, zoom

CS4650 Software Quality Management in Practice [2-0-1-2]   TOP

Quality and Quality Assurance-TQM, Software Productivity Issues, Software Measurements, Productivity, Estimation, Effort, Product Measures, CASE Tools, Software Reliability, Risk Management, Software Quality Models, CMM, ISO9000, Personal Software Process (PSP), Extreme Programming, Software Quality in Practice, Testing Strategies, Testing Techniques, Black box testing, White Box Testing, Stress Testing, Regression Testing, Automated Testing tools – Rational, Silk.

Preferred Text Books: Software Engineering – A practitioner’s approach – Pressman and Ince, 5th edition, McGraw Hill, Software Testing in the real world – Edward Kit, Addison Wesley, Managing the software Process – Watts S Humphrey, Addison Wesley, Software Metrics: A rigorous and practical approach – Fenton, N.E & Pfleeger S.L. 2nd edition, International Thompson Computer Press, 1997, Knowledge Management Toolkit - Amrit Tiwana, Prentice Hall PTR; ISBN: 0130128538 (A low priced Indian Edition is available for

AM 6201          Finite Element Method                                                                 [3-1-0-4]

   TOP

One dimensional boundary value problems, Two and three dimensional boundary value problems, Isoparametric elements, Mixed formulations, Plates and beams, Curved structural elements, Linear dynamics analysis

CS 4462 TOP
Internals of Application Servers [3-1-0-4]

Understand essence of middlewares and distributed object technology. J2EE Technology and Architecture overview. J2EE App Server architecture. Lifecycle of a J2Eeapplication- deployment thru running and undeployment. Web Container internals. EJB Container internals. Essentials of Clustering architecture, Project problems Discussions

CS 3150 Molecular Architecture [3-0-1-4]   TOP

Quantum mechanical structure of the atom:- Wave functions Electronic configuration, Bonding and intermolecular forces - Types of bond, Electron distribution, Hybridization, Resonance and aromaticity, Intermolecular forces, Molecular structure - Bonds lengths, bond angles and shape of molecules, Structural and stereo isomers, Configuration and conformation – Chirality and optical activity, prochirality, Representation of configuration and conformations, energy barriers and torsion angles, Structure and
properties of molecules – bond energy, Biomolecules – Types of Biomolecules, their properties , Identification of monomers of biopolymers, study of amino acids and proteins –, Investigation of dipeptides and torsion angles, Levels of protein structure and stabilizing forces involved, secondary structure and Ramachandran plot, folds, and packing of secondary structure elements – Detailed analysis of some protein structures, Study of nucleic acids - Base pairing and hydrogen bonding, Types of DNAs and
their structural parameters, RNA secondary structures and noncanonical base pairings. Structure determination methods - X-Ray and NMR (elementary ideas), Methods and techniques for representation, search and prediction of proteins and nucleic acid structures (basic concepts). Use of Rasmol, CHIME and SPDBV for the visualization and rendering of biomolecules, Use of Molden for building molecules, Creation of CHIME tutorials.

EE 3300          Error Correction Codes I                                                             [3-1-0-4]

   TOP
Motivation and elementary definitions, basic encoding and decoding principle, incomplete and complete decoder, some elementary codes, groups, rings, fields, vector spaces, linear algebra, finite fields and their properties, Generator and parity check matrix, systematic, encoding, dual codes, decoding using standard array, Singleton bound and MDS codes cyclic codes, Generator and parity check polynomials, Mattson-Solomon polynomial and spectral, techniques, BCH bound, BCH and RS codes, Encoding and decoding of BCH c
Preferred Text Books : Theory and Practice of Error Correcting Codes - R. E. Blahut

ET 4561 VLSI Algorithms [3-1-0-4]   TOP

Introduction to CAD flow. Architectural Level Synthesis and Optimization, Area and Performance Estimation. Scheduling Algorithms. Logic Synthesis: 2-Level Forms. Logic Synthesis: Multi-Level Forms. Sequential Logic Optimization, Retiming. Technology Mapping. Partitioning. Floorplanning. Placement. Global Routing. Detailed Routing. Compaction. Layout Analysis and Verification.

Preferred Textbooks: Giovanni De Micheli, “Synthesis and Optimization of Digital Circuits”, Mc-Graw Hill, 1994. Naveed Sherwani, “Algorithms for VLSI Physical Design Automation”, Kluwer Academic, 1998.

Pre-requisites: A course in Algorithms

AM 6301          Continuum Mechanics                                                                  [3-1-0-4]

   TOP

Vectors and tensors, Stress, Strain and deformation, General Principles, Constitutive equations, Linear Elasticity, Plasticity

CS 5770 Machine Learning [3-1-0-4]   TOP

Machine Learning is the study of compute algorithms that improve automaticall through experience. This course will expose various machine Learning, Paradigm- Concept learning, Decision trees, Neural Networks, Instance based learning, Reinforcement learning, Bayesian learning, etc. This course will also introduce fundamentals to analyze the learning schemes for convergence, correctness and generalization.

Preferred Text Books: In Tom M. Michell “ Machine Learning” McG Hill; In Duda, Hart & storx, “Pattern Clarification”, Wiley 10-15 research papers. Mandatory Project: A Project involving  significant theatrical or Practical aspect of machine learning Pre-requisites: Pattern Recognition, AI, Algorithms

CS 4740          Speech Technology                                                                                  [3-0-0-4]    TOP

Speech production mechanism, Nature of speech signal, Basics of speech signal processing, Feature Extraction, Speech Synthesis, Speech Recognition. Preferred Text Books: Rabiner and Juang, "Fundamentals of speech ecognition", Prentice-Hall Inc, NJ, 1993 Deller, Hansen and Proakis, "Discrete-time processing of speech signals", IEEE press 1993. Oppenhiem and Schafer, "Discrete-time signal processing", Prentice-Hall of India, New
Delhi, 1997. Dutoit, "An introduction to text-to-speech systems",Kluwer academic publications, 1997. D. Raj Reddy, "Speech recognition by Machine: A review", Proceedings IEEE, vol. 64 (4), pp. 501-531, 1970. S. Furui and M. Sondhi, "Recent progress in speech signal processing", New york, Markel-Dekker, 1990.

CS 3500 Computer Graphics [3-0-2-4]   TOP

2D Graphics: Basic Concepts, 2D Graphics on OpenGL, Algorithms for rasterization, clipping, filling, etc. 3D Graphics: Basic Concepts, 3D Graphics on OpenGL, Viewing and Projection, Hierarchical Modelling. Visible Surface Determination: Depth-Sort Algorithm, Z-buffer Algorithm, BSP-Tree, Octree, Visible Ray Tracing. Appearance: Intensity and Colours, Colour Models. Lighting and Shading: Shading Models, Simulating Realism, Shadows, Transparency. Represention: Curves, Surfaces, Solids.
Parametric, Mesh Representation, Spatial Paritioning, Octrees. Ray Tracing: Visibility & Shading. Advanced Topics: (if time permits)

Preferred Text Books: Computer Graphics: Principles and Practice by Foley, van Dam, Fiene, and Hughes Addison-Wesley

Pre-requisites: Sound programming in C/C++ and good knowledge of data

structures. Imagination and artistic bend help, but not essential.

ET 3300 Introduction to Telecommunication [3-1-0-4]   TOP

Elements of digital communication systems, Sampling Theorem, Quantization Noise: Source coding Techniques: PCM, DPCM, DM, LPC, Noise in PCM, DM Systems; Performance comparison of the above system. Analog modulation techniques: generation and demodulation of AM, FM and PM. Comparison of their performance in the presence of noise. Binary discrete channels: types of transmission errors, need for error control coding: linear block codes, Binary cyclic codes: characteristics of BCH codes,
convolutional codes, tree diagram, comparison of the above codes. Digital carrier modulation schemes: Optimum receiver: coherent and non-coherent ASK, FSK, PSK, DPSK, MSK and QPSK schemes: M-ary signaling schemes; synchronization methods. Spread spectrum Modulation Introduction, generation and characteristics of PN sequences. Direct sequence spread spectrum system. Frequency hopping spread spectrum system and their applications. TDM, FDM System, TDMA, FDMA, ALOHA, CSMA.
CDMA for spread spectrum, slotted Aloha. Introduction to Mobile cellular communication, fading phenomenon.
Preferred Text Books: Sham Shanmugham, K, Digital and Analog communication systems, Wiley International Edition, New York, 1979. Proakis, John G, Digital Communication, Mc-Graw Hill, new York, 3rd ed., 1995. Taub and Schilling, Principles of Communication systems, Mc-Graw Hill, New York, 2nd ed, 1986.

3 of 4 Tuesday 17 May 2016 10:36 PM

 http://intranet.iiit.ac.in/Information/academic/sy...

ET 4600 VLSI II Advanced Logic Synthesis [3-1-0-4] TOP

Technologies : CMOS, BiCMOS and ECL, Logic Gate Design and their Characteristics. Analysis and Synthesis of Sequential Circuits : Basic Models of Finite Sequential Machines (FSM) : Mealy and Moore; Equivalence and Minimization; Analysis of Asynchronous Circuits : Racing and Hazards (static and dynamic); Design of Race-free and Hazard-free Circuits, Synthesis of Asynchronous Sequential Circuits. Design of Sequential Circuits Using SM Charts : SM Flow Chart, Output Function Synthesis,
Next-State-Function Synthesis, Design Examples. Fault Diagnosis in Combinational Circuits : Fault Classes and Models, Fault Detection and Location Experiments, Path Sensitizing and Equivalent Normal Form Methods, Two-Level and Multi-Level Circuits Fault Detection. Fault Diagnosis in Sequential Circuits : State Identification and Fault Detection Experiments, Circuits-Test Approach, Design of Fault-Detection Experiments

Preferred Text Books: John F. Wakerly : Digital Design - Principles and Practices,  Prentice Hall International, 2000. Samuel C. Lee : Digital Circuits and Logic Design, Prentice Hall India, 2001. Charles H. Roth : Fundamentals of Logic Design, JAICO, 2001

ET 4601 VLSI III Logic Design with Programmable Logic Devices [3-0-1-4]    TOP

Programmable Logic Devices (PLDs) : Study of Architectures of Programmable Array Logic (PAL), Complex Programmable Logic Devices (CPLD) and Field Programmable Gate arrays (FPGA) Designing with PLDs : Combinational and Synchronous Logic Design: Designing a FIFO; State Machine Design : Designing a Memory Controller; Design Synthesis and Implementation in PLDs
HDL Synthesis : Simulation vs Synthesis, FPGA/ASIC Synthesis Issues; Guidelines for Reset (Synchronous vs Asynchronous), Incompletely Specified Outputs; Constraining Designs - Timing, area and Pin-Locking Constraints; Target Technology Selecton - Area, Performance and Testability Static Timing Analysis : Global Timing Parameters, Max. Clock Frequency, Clock-Skew, Set-up and hold time requirement; Delays : Clock-to-Output, Register-to-Register and Pin-to-Pin Combinational Delay; Guidelines
for Clock Structures, Register Load Control, Gated Clocks. Design for Testability : Testability : Trade-Offs, Controllability and Observability; Scan-Based Designs : Boundary Scan Test; Built-in-Self-Test Preferred Text Books: Kevin Skahill : VHDL for Programmable Logic, Addison Wesley, 1996. Charles H. Roth : Digital Systems Design Using VHDL, Brookes/Cole, 1998

BS 6203          Applied Stress Analysis                                                                 [3-1-04]

   TOP

Plane Elasticity: Governing equations, weak formulation, Finite element model Energy methods: Potential Energy, stffness matrix, rectangular and triangular elements, Frames: Space frames, space trusses and grids, Laplace and Poisson equations: Variational methods, weak formulation, Finite element models, triangular and rectangular element, stffness matrices, Torsion: Poisson and Neumann formulations, Finite element model and stiffness matrices, Plates: Classical theory of thin plates, triangular
element, Stiffness matrix

MA 4578          Multivariate Analysis                                                                    [3-1-0-4] 

   TOP

Basic review of Matrix algebra and random vectors: Random vectors and matrics, mean vectors and covariance matrices, matrix inequalities and maximization, Random Sampling and Multivariate Normal distribution: Sample mean , covariance, and correlatin Matrices. Linear combinations, Multivariate normal density, maximum liklihood estimation, Sampling distributions and assessing normality, Inferences about  a mean vector: Hotelling
and likelihood ratio tests, confidence regions and simultaneous confidence intervals, Comparison of several multivariate means: Paired comparions and one-way MANOVA, Linear regression models: Least squares estimation, inferences about regression model, inferences from the estimated regression function, Principal componens: Population principal components, summarizing sample variation, large sample inferences , Factor Analysis:
Orthogonal factor model, Methods of estimation, factor rotation, Canonical correlation analysis: Canonical variates, canonical correlations, interpretaion, Discrimination and classification: Separation and classification for two populations, classification with two multivariate normal populations, evaluating classification functions, Fishers's discriminant function, classifications with several populations.

ET 4750 Formal Verification [3-1-2-4]   TOP

Motivation of the module, Meaning of proofs, usages in programming, Meaning of requirements statements, specifications, Meaning of correctness, Predicate Logic: Propositions, Predicates, Conversions from English to propositions, predicates, Proofs using propositions, predicates. Inference systems – natural deduction. Verification methods: Dijkstra’s approach - introduction: Predicate transformer – wp, Hoare logic – introduction: The while language – introduction, Semantics of a (small) language: Predicate transformer

CS 4405          Applied Data Mining                                                                      [2-0-2-2]   TOP

Data Warehousing: Overview, Data Cubes, and Materialized views. Concept discovery: Understanding and generating concise descriptions of large data sets. Association Rule Mining: basic concepts, apriori algorithm, and comparison of different association rule mining techniques. Classification: basic concepts, techniques and applications. Clustering: basic concepts, techniques and applications. Novel Techniques: future of data mining.

CS 4175          Computational Geometry                                                           [3-1-0-4]

   TOP

Introduction, Convex Hulls, Line Segment Intersection, Polygon Partitioning and Triangulation, Orthogonal Range Searching, Point Location, Proximity Problems and Voronoi Diagrams, Arrangements, Duality Transformation, Delaunay Triangulation, Data Structures: Interval Trees, Priority Search Trees, Segment Trees, Advanced Topics: Generalized Intersection Searching, Simplex Range Searching, Partition Trees, Cutting Trees, Adding range restrictions, Applications: Sample applications from VLSI CAD
and Spatial Databases.Preferred Text books: Computational Geometry: Algorithms and Applications Second Edition by Mark de Berg, Otfried Schwarzkopf, Marc van Kreveld, Mark Overmars. ( http://www.cs.uu.nl/geobook ) Springer-Verlag. Computational Geometry: An Introduction by F.P. Preparata and Shamos. 2nd Edition. Springer-Verlag. Computational Geometry: An Introduction through Randomized Algorithms by Ketan Mulmuley, Prentice Hall.

CS 4200 Computer Architecture [3-1-0-4]   TOP

Introduction and overview, computer Design, Fundamentals and Basic Notation, technology, application measures, Instruction set architecture, trade of : examples, Instruction-Level Parallelism and its Dynamic Exploitation, Exploiting Instruction Level Parallelism with software approach, Memory hierarchy design, SIMD, Multiprocessors.

Preferred Text Books: ‘Computer Architecture A quantitative approach’ John L. Hemmessy & David A Patterson III Edition.

CS5400 Advanced topics in database systems [3-1-0-4]   TOP

About 30 important research papers related to the following topics will be discussed. Relational model, System R, and INGRES. Operating systems support to DBMS. Buffer Management. Access Paths and Indexes, Query Processing, Concurrency Control, Logging and Crash Recovery, Distributed database systems, Parallel database systems. About 30 research papers will be discussed.

Preferred Text Books: .Readings in Database Systems, Third Edition - edited by Michael Stonebraker and Joe Hellerstein, Morgan Kaufmann Publisher, March 1998. Gray, J., and Reuter, A., Transaction Processing: Concepts and Techniques, Morgan Kaufmann, 1993. The Benchmark Handbook for Database and Transaction Processing Systems, Second Edition - edited by Jim Gray, Morgan Kaufmann Publisher, 1993. Database System Implementation by Hector Garcia-Molina, Jeff Ullman, and Jennifer
Widom, Database System Concepts, Fourth Edition, Abraham Silberschatz Henry F. Korth S. Sudarshan. Database Management Systems by Raghu Ramakrishnan and Johannes Gehrke

Mandatory Project: About four lab experiments should be completed. These deal with the development different modules of MINIBASE database system.

Pre-requisites: Database Management Systems.

SE6401           Earthquake Engineering                                                              [3-1-0-4]   TOP

Introduction to earthquake engineering – Seismology, Origin of earthquakes, Plate tectonics, Seismic waves, Magnitude and intensity, Measurement of earthquakes, Characteristics of earthquakes, Response of structures, Concept of earthquake resistant design, Seismic code Provisions for design of buildings, Non-engineered constructions, Post-earthquake evaluation of structures & Retrofitting, Ductile detailing, Special topics

CS 4745 Designing Speech Systems [3-1-0-4]   TOP

Introduction to Speech Production and Speech Sounds. Feature Extraction from Speech Signal. Dynamic Programming Models for Speech Recognition. Hidden Markov Models for Speech Recognition.

Preferred Text Books: Spoken Language Processing: A Guide to Theory, Algorithm and System Development by Xuedong Huang, Alex Acero, Hsiao-Wuen Hon, Prentice-Hall.

PROJECT:The project in this course starts from the second week of the course. The programming assignments are defined in the course such that they are part of the project itself. A typical project would be to build an isolated word recognition system for a specific domain and the projects can be done in a group of 2-3 students. Some of the example domains in which students can take up to build speech recognition are: digit recognition system, voice commands for robots, channel/program switching in
TV/computers, name recognition for automatic dialing. Students are also encouraged to come up with their own novel domains.

      MA 4505    Biostatistics                                                                                   [3-1-0-4]

   TOP

Role of Statistics and Probability theory in Bioinformatics. Designing of Experiments. Preliminary data analysis: Definitions – Variables (discrete and continuous), Graphical representation of data, Frequency distributions – Relative and cumulative frequencies, Measures of central tendency: Arithmetic, Geometric and Harmonic Means, Median, Mode, Measures of dispersions – Mean deviation, Variance, Standard deviation, Moments, Skewness, Kurtosis; Probability Theory: Elements of Probability theory,
Conditional probability – Bayes Theorem, Discrete and Continuous probability distributions; Sampling Theory: Elementary sampling theory, Estimation of unknown parameters , Tests of Hypothesis and Significance – Type I & II errors, Tests of significance involving Normal & binomial distributions, involving sampling differences, Law of large numbers; Small Sampling Theory: t-distribution, chi-square distribution, f- distribution; Tests: Chi-square test, Nonparametric tests; Correlation and Regression: Curve fitting,
Method of least squares, Correlation Theory – Linear correlation, Measures of correlation – correlation coefficient, Linear Regression; ANOVA (Analysis of variance): Basic ideas – Partitioning of Sum of Squares, Multi-factor ANOVA (one- & two-factor), Interaction Effects, Analysis of Covariance (ANCOVA) – Fixed and Changing Covariates, Multivariate Designs (AMNOVA/MANCOVA) – one- & two-factor. Elementary Clustering Techniques: Hierarchical Tree Clustering, Two-way Joining Tree Clustering,
K-means Clustering, Distance Measures – Euclidean, Manhattan, Linkage Rules - Single linkage, Complete linkage, Unweighted pair-group average, Weighted pair-group average, Ward's method, Introduction to Markov chains.

Preferred Text books: Schaum’s Outlines: Statistics by Murray Spiegel and Larry J. Stephens.

CS 4464          Service Oriented Architectures with Lisp                                             [3-0-3-4]   TOP

Overview and Preliminaries: Introduction, Next Generation Software Applications, Nature of complexity in newer applications, Program Maintainability, Functional programming, Higher level Abstractions, Service Oriented Architectures – New Paradigm, Lisp as a better choice for SOA, Overview of Lisp. Service Oriented Architectures: Operations, Services, Business Processes, Work Flows, Enterprise Integration, Agent technology, Rules Engines, Need for Dynamic Languages to implement robust servers.
Data Types and Control Structures: Lists, Manipulating Lists, Anatomy of Lists, Numbers, strings, Symbols, Data Structures (arrays, hash tables, vectors, sequences etc.), Lisp development using Emacs, Blocks, Context, Conditionals, Iteration, Additional Control Structure, Binding, Scope and Extent, Aborts, Throw return (Non local exits)

CS 4852 Performance Evaluation Concepts [3-1-0-4]   TOP

Introduction to simulation, Discrete event simulation, Simulation examples, General principles, Simulation of computer systems. Common mistakes and how to avoid them, selection of techniques and metrics Types of workloads, The art of workload selection, Workload characterization techniques, Monitors, and accounting Types of workloads , Capacity planning and benchmarking, The art of data presentation, Ratio games,Summarizing the measured data. Preferred Text Books: Raj Jain, The art of computer
systems performance analysis,techniques for experimental design, measurement and modeling, Wiley, 1991. J. Banks, J.S Carson, B.L.Nelson, DM Nicol. Discrete-event system simulation, Prentice-hall of India, 2001. Pre requisite: Operating Systems, Algorithms, Computer Architecture,Programming Languages

CS5460 Enterprise Information Systems Structures [3-0-0-4]   TOP

This is a sequel to the course on Enterprise Information Systems. Only those who credited that course may register for this one. The course on Enterprise Information Systems presented a framework for discussing the pertinent details of such systems. This framework presented discussion of Enterprises at different layered levels of discourse, or abstraction. Each layered level of discourse on Enterprises is a system in its own right. Each such system localises properties of Enterprises that are evident at that
level. Further discussion of those properties at a layered level of discourse is based the configuration of the system at that level of understanding. The bottom layer in the framework represents the deployed Enterprise Information System that works in production mode. It aggregates all the properties of the systems established in each of the preceding layers. Deployed Enterprise Information Systems could consist of millions of lines of code. The process of development of such systems is phased, one phase
for each layer. Each phase has the responsibility of starting with the system presented by the preceding layer, structuring all of that description into a configuration that permits the discussion of properties pertinent to the current layer, and a process by means of which the current configuration is further developed so that these properties are established. The framework developed in the Enterprise Information Systems course gave a broad description of the configuration of systems for each layered level of
discourse. In this course, we will further develop the structure of these systems. The intent is to describe in detail the administration of operations in a business enterprise, the management of responsibilities in it, and the governance of the enterprise in relation to its environment. These topics will motivate and cover administrative operational aspects of an enterprise dealt with by ERP, SCM, and CRM systems, operational understanding of management in a business enterprise, and its governance. Every
organization sets itself long term and short term goals, usually called Vision and Mission. It is the values imbibed by the organization that give it a consistent character in the way it functions. The Vision and Mission prescribe the what of the organization, whereas the Values describe the how of its functioning in broad terms. The Values imbibed by the organization also express a commitment to quality and its journey towards excellence. Every layered level of discourse of the Enterprise has a back office
function that characterizes the information to be maintained in relation to the properties established at that layer, and the front office function that works with the back office whilst preserving the values imbibed by all. Traditional information systems usually concern themselves only with back office functions. We model the front office functions using Dr. Fukuda’s Deming Literature Prize winning framework, called P/O Matrix and SEDAC. The last three paragraphs describe the content to be covered in the
course. We will devote equal energies to the back office and front office functions every week

HSSM courses

Course Code Course Name

HS 3005 The Making of the Modern Mind
HS 3850 Introduction to Ethics
MG 4900 ICT for Development
MG 4551 Decision Support system
MG2100 Introduction to Economics
HS 2780 Science and Society
Religion,Society and Cultural Heritage of
HS 3051
India
Introduction to Computational Linguistics
HS 5090
-1
HS 5091 Computational Linguistics - 2
HS 2000 Introduction to Philosophy
HS 3720 Globalization and Social Development
HS 3201 Introduction to Accountancy and Finance

HS 3005 The Making of the Modern Mind [3-1-04]   TOP

Nation and Nationalism, Colonial Economy, Science and Technology: A criticism, Caste: Problems, Communalism, Gender Preferred Text Books: Partha Chatterjee, The Nation and Its Fragments Colonial and Postcolonial Histories Princeton University Press 1993. Bernard S Cohn, Colonialism and Its Forms of Knowledge, Princeton University Press, 1996. Benedict Anderson, Imagined Communities: Reflections on the Origin and Spread of Nationalism, Revised ledition London & NY: Verso, 1991. Edward
Said, Orientalism, Vintage,New York 1979

HS 3850 Introduction to Ethics [3-1-0-4]   TOP

Introduction: What is Ethics?, The Need and the Relevance of the course, The Very Possibility of Ethics. Various Traditional Ethical Theories: Teleological Ethics, Deontological Ethics. Various Branches of Ethics: Environmental Ethics, Business Ethics, Biomedical Ethical Issues: Abortion, Euthanasia, Surrogacy, Suicide, Genetic Engineering, Animal Rights. The Relationship between Religion and Morality. Ethics According to Various Schools of Indian Philosophy

MG 4900 ICT for Development [3-1-1-2]    TOP

To enrich the knowledge base of the senior students on the latest technological trends and innovations in the area of ICTs and its relevance to India. To provide the students with an understanding of the concepts and the various dimensions of e-Government for enabling development process. To enable the students to identify Government functions and activities that could possibly be IT-enabled, to facilitate Development & e-Governance.

Architecture of e-Governance Projects, their life cycle. Change management and need for Government Process Re-engineering. Case Studies of Indian efforts viz; Bhoomi, e-Seva, CARD,e-Procurement etc. Concepts and their application in E-Governance- G2G, G2C, G2B and G2E. IT policy issues and their implementation including Cyber Laws Security issues concerning Government transactions

Preferred text books: J Satyanarayana “e-Government …the science of possible” 2004 Publication ,Prentice Hall of India. APJ Abdul Kalam , AS Pillai “ Envisioning an Empowered Nation” TMH 2004. Subhash Bhatnagar “ e-government from vision to Implementation” 2004 Publication SAGE India . Kenneth Keniston & Kumar “ Digital Divide” 2003 Publication SAGE India. Kiren Bedi et al “Government @net” 2001 SAGE India Publication

MG 4551 Decision Support system [3-0-0-2]   TOP

Systems Approach. Introduction to Management Information Systems. Concept of DSS (Gorry-Scott Morton framework). Structured Analysis and Design Concepts. Approaches to DSS development. Critical Success Factor Approach to Information Systems planning.

Preferred Text Books: Senn James A., Analyses & Design of Information System, McGraw Hill International Edition. Davis Gordon B. & Olson Margrethe H., Management Information Systems – Conceptual Foundation, Structure & Development, McGraw Hill International Edition. Keen, Peter & Morton Michael Scott, Decision Support Systems, An organizational perspective, Addison Wesley. Gane C. & Sarson T., Structured Analyses and Design. Zwass Vladimir, Foundation of Information Systems, Irwin,
McGraw Hill International Edition. KC & Loudon J.P., Essentials of Management Information Systems, Prentice Hall. Rockart J., Critical Success Factor (Harvard Business Report, March-April, 1979)

MG2100 Introduction to Economics [3-1-0-4] TOPNature of economic problem: Evolution and essential features of economic ideas from Physiocrats to contemporary economics. Microeconomics – basic tools of economic decision making in a capitalist economy: Market, demand and supply for a single good; utility (consumer behaviour) and cost (firm’s behaviour); market structures; concept of general equilibrium. Theory of distribution: markets for factor
inputs - wages, rents and profits. Macroeconomics – economic system at work and under stress: aggregate (national) economic activity – measurement and determination; money, employment and output; government, controls, regulation, fiscal and monetary policy. Financial markets, institutions and tools – a quick survey. Open economy – balance of payments. An overview of Indian economy – the broad brush picture.

HS 2780 Science and Society [3-1-0-4] TOP

Knowledge and society: classical, colonial and contemporary. (from conformity tocritique), Extent and limits of politics: East and West. Nature of the relation between individual and society: Aristotle: society as prior to individual; Social contract philosophers (man and then society model); Liberalism (man in society model), Relation between religion and politics: St. Augustine. V.D. Savarkar
(iii) M.K. Gandhi, Universalism, relativisim and pluralism (truth, communities and identities), Relation between reason and emotion. Enlightenment individualism as he or she; bio-ethical discussions. Modernity, colonialism and post-colonialims: between progress and self-assertion. Secularism and its critiques.

HS 3051 Religion, Society and Cultural Heritage of India [3-1-0-4]   TOP

The Vedas, Purana’s, Mahabharatha, Ramayana, Hinduism, Yoga, Buddhism, Jainism, Temples in North India or South India, Devadasi System, Saivism, Vaishnavism, virsaivism, Important features of Bhakthi Movement, Kabir, Nanak, Mirabai, Tulsidas, Mahadevi Akka, Bahina bai, Chaitanya, Jahna bai, Military History (14th-16th centuries), Military History (17th to 18th Centuries), Miniature Painting under Mughals or in Deccan, Architecture Under Mughals with reference to Taj Mahal, Golconda Fort,
Salar Jung Museum, Education in Medieval India, History of Wildlife (Jahangir as Naturalist), Social Reform Movement, Dayanand Saraswati, Raja Ram Mohan Roy, Ishwar Chandra Vidyasagar, Ramakrishna Paramahamsa, Swami Vivekananda, Indian Congress, Muslim League, Mahatma Gandhi, Quit India Movement, Mohammad Ali Jinnah, Partition of India, Nehru, The RSS and its Growth, Rise of Communalism in India,

HS 5090          Introduction to Computational Linguistics - 1                         [3-1-0-4]

   TOP

Word classes - lexical categories, functional categories, POS tagging; Morphology - types of morphemes, inflectional morphology, derivational morphology; Morphological processes - affixation, compounding; word generation - concatenation, non-concatenative phenomena, morphotactics Computational morphology - finite state automata, paradigm tables, word meaning: Lexical semantics - hypernymy, hyponymy, synonymy, antonymy, lexicon and lexicography; machine readable dictionaries, SYNTAX :
Constituents, phrases and constituent structures, representing, phrase structures, deriving phrases using phrase structure rules (CFG), constraints on rules, syntactic dependencies; modifier modified trees -paninian approach, karakas.

Text Books: Natural Language Processing - A Paninian Perspective Akshar Bharathi, Vineet Chaitanya, Rajeev Sangal (1995), Linguistics - An intro to Language and Communication Adrian Akmajian, Richard Demers, Ann Farmer and Robert Harnish.

Reference Books : Linguistics - An introduction to Linguistic Theory Victoria Fromkin(Editor), The Oxford Handbook of Computational Linguistics Ruslan Mitkov (2003), Oxford Linguistic Press, Linguistics - An introduction Andrew Radford, Martin Atkinson, David Britian, Harald Clahsen and Andrew Spencer (1999)

HS 5091 Computational Linguistics - 2 [3-1-0-4]

   TOP

Some basic notions - meaning and denotation, meaning and concept, sense and reference, sense and meaning, vagueness; Linguistic meaning and speaker meaning; lexical relations - hyponymy, hypernymy, synonymy, antonymy, polysemy; semantic fields, ambiguity, componential analysis, extensions of meaning, Pragmatics: Performatives, speech acts, meaning, saying and implicating; presupposition, speaker reference Evaluation and use of available tools and resources : The tools and resources
mentioned here may change depending on the current research - Parsers - Minipar, link-parser, Collins-Parser, LDA, this component includes seminars in which students make presentations about the tools and resources etc.

Preferred Text Books: An Introduction to Language by Victoria Fromkin and Robert Rodman (1993) Chapter – 4, Pragmatics and Discourse : A resource book for students by Joan Cutting (2002)

Prerequisite : CL-1 or some course in NLP

HS 200 Introduction to Philosophy [3-1-0-4]   TOP

What is Philosophy?, The issues of Metaphysics of Reality, The issues of Epistemology: The theory of Knowledge, The Issues related to Ethics, The Philosophy of Science, Philosophy and Technology.

HS 3720 Globalization and Social Development [3-1-0-4]   TOP

On Globalization, Globalization and Production: The changing nature of the production process from Taylorism, Fordism to Post fordism, the most illuminating example being the global automobile industry. Globalization and Services: The consideration here is on B P O. this would be predominantly a students section. Output in the form of term papers, presentations and discussions are welcome. Corporations and Globalization: A shore history of the corporate form of business; Globalization and changing,
corporate business strategy and structure. Globalization Human Resources and Change.

HS 3201 Introduction to Accountance and Finance [3-1-0-4]   TOP

Introduction to accounting, Asset Liability Equation, Journalizing, Posting, Balancing, Subsidiary Books. Preparation of Trial Balance, Preparation of Profit and Loss Account, Preparation of Balance Sheet, Introduction to Corporate Finance. Financial Markets & Institutions, Time Value of Money, Risk & Return, Valuation of Securities, Capital Budgeting Decisions, Sources of Funds and Cost of Capital, Working Capital Management, Derivative Market – Futures and Options, Contemporary Issues

4 of 4 Tuesday 17 May 2016 10:36 PM