Courses
Dual Degree (CSE)
Course Structure of Dual Degree (CSE)
Semester  Course Code  Course name  LTPCredit  Offering Department  
Semester I  CE111  Engineering Drawing  1035  Civil  
EE101  Electrical Sciences  3108  Electrical  
HS103  Communicative English for Engineers  20.516  Humanities and Social Science  
MA101  Mathematics I  3108  Mathematics  
ME110  WorkshopI  0033  Mechanical  
PH103  Physics –I  3108  Physics  
PH 110  Physics Laboratory  0033  Physics  
Total credits: 41  
Semester II  CB102&CE102  Biology and Environmental Studies  3006  CB & CE  
CH103  Introductory Chemistry  3108  Chemistry  
CH110  Chemistry Laboratory  0033  Chemistry  
CS102  Programming and Data Structures  3006  CS  
CS112  Programming and Data Structures Laboratory  0033  CS  
EE103  Basic Electronics Laboratory  0033  EE  
MA102  Mathematics –II  3108  Mathematics  
ME102  Engineering Mechanics  3108  ME  
Total credits: 45  
Semester III  MA2XX  Mathematics III  3006  Mathematics  
HS2XX  HSS Elective – I  3006  Humanities and Social Science  
CS204  Algorithms  3006  CS  
CS224  Algorithms Laboratory  0033  CS  
CS203  Discrete Mathematics  3006  CS  
CS227  Digital Systems  2026  CS  
MAXXX  Optimization techniques  3006  Mathematics  
CS230  Software Lab/Tools  0033  CS  
Total credits: 42  
Semester IV  HS2XX  HSS Elective – II  3006  Humanities and Social Science  
XX2XX  Open Elective I (Prob. Theory and Random Processes)  3006  Mathematics  
CS321  Computer Architecture  3006  CS  
CS322  Computer Architecture Lab  0033  CS  
CS2XX  Theory of computation  3006  CS  
CS354  Database  3006  CS  
CS355  Database Lab  0033  CS  
Total credits: 36  
Semester V  XX3XX  Open ElectiveII  3006  Science/Egg.  
CS3XX  Computer Network  3006  CS  
CS3XX  Computer Network Lab  0033  CS  
CS3XX  Operating Systems  3006  CS  
CS3XX  Operating Systems Lab  0033  CS  
CS3XX  AlgorithmII  3006  CS  
CS3XX  Innovative Design Lab  0033  CS  
Total credits: 33  
Semester VI  HS3XX  HSS Elective–III  3006  Humanities and Social Science  
CS3XX  CS ElectiveI  3006  CS  
CS3XX  PPL + Compiler  3006  CS  
CS3XX  PPL + Compiler Lab  0033  CS  
CS3XX  Artificial Intelligence  3006  CS  
CS3XX  Artificial Intelligence Lab  0033  CS  
CSXXX  Machine Learning & DS  3006  CS  
CS3XX  Capstone Project  0033  CS  
Total credits: 39  
Semester VII 
CS4XX/CS5XX  Open Elective – III  3006  
CS4XX/CS5XX  CS ElectiveII  3006  CS  
CS4XX/CS5XX  CS ElectiveIII  3006  CS  
CS4XX/CS5XX  CS Elective – IV  3006  CS  
CS4XX/CS5XX  CS Elective – V  3006  CS  
CS4XX/CS5XX  ProjectI  0088  CS  
Total credits: 38  
Semester VIII  CS4XX/CS5XX  CS ElectiveVI  3006  CS  
CS4XX/CS5XX  CS ElectiveVII  3006  CS  
CS4XX/CS5XX  CS Elective VIII  3006  CS  
CS4XX/CS5XX  CS Elective IX  3006  CS  
CS4XX/CS5XX  ProjectII  001212  CS  
Total credits: 36  
Semester IX  CS5XX/CS7XX  CS ElectiveX  3006  CS  
CS5XX/CS7XX  CS Elective XI  3006  CS  
CS5XX/CS7XX  CS Elective XII  3006  CS  
CS5XX/CS7XX  ProjectIII  001818  CS  
Total credits: 36  
Semester X  CS5XX/CS7XX  CS ElectiveXIII  3006  CS  
CS5XX/CS7XX  CS Elective XIV  3006  CS  
CS5XX/CS7XX  ProjectIV  002222  CS  
Total credits: 34  
Total credits for Dual Degree CS: 380 
DETAILED SYLLABUS
Semester I
Geometrical construction of simple plane figure: Bisecting the line, draw perpendicular, parallel line, bisect angle, trisect angle, construct equatorial triangle, square, polygon, inscribed circle. Free hand sketching: prerequisites for freehand sketching, sketching of regular and irregular figures. Drawing scales: Engineering scale, graphical scale, plane scale, diagonal scale, comparative scale, scale of chord. Orthographic projection: Principle of projection, method of projection, orthographic projection, plane of projection, first angle of projection, third angle of projection, reference line. Projection of points, lines and plane: A point is situated in the first quadrant, point is situated in the second quadrant, point is situated in the third quadrant, point is situated in the fourth quadrant, projection of line parallel to both the plane, line contained by one or both the plane, line perpendicular to one of the plane, line inclined to one plane and parallel to other, line inclined to both the plane, true length of line. Missing views: Drawing of missing front view of a solid, missing top view of solids, missing side view of solids, Orthographic projection of simple solid: Introduction, types of solid, projection of solid when axis perpendicular to HP, axis perpendicular to VP, axis parallel to both HP and VP, axis inclined to both HP and VP. Orthographic projection of simple solid: Introduction, types of solid, projection of solid when axis perpendicular to HP, axis perpendicular to VP, axis parallel to both HP and VP, axis inclined to both HP and VP. Text and Reference Books:

Circuit Analysis Techniques, Circuit elements, Simple RL and RC Circuits, Kirchhoff’s law, Nodal Analysis, Mesh Analysis, Linearity and Superposition, Source Transformations, Thevnin's and Norton's Theorems, Time Domain Response of RC, RL and RLC circuits, Sinusoidal Forcing Function, Phasor Relationship for R, L and C, Impedance and Admittance. Semiconductor Diode, Zener Diode, Rectifier Circuits, Clipper, Clamper, Bipolar Junction Transistors, Transistor Biasing, Transistor Small Signal Analysis, Transistor Amplifier, Operational Amplifiers, Opamp Equivalent Circuit, Practical Opamp Circuits, DC Offset, Constant Gain Multiplier, Voltage Summing, Voltage Buffer, Controlled Sources, Instrumentation Circuits, Active Filters and Oscillators. Number Systems, Logic Gates, Boolean Theorem, Algebraic Simplification, Kmap, Combinatorial Circuits, Encoder, Decoder, Combinatorial Circuit Design, Introduction to Sequential Circuits. Magnetic Circuits, Mutually Coupled Circuits, Transformers, Equivalent Circuit and Performance, Analysis of ThreePhase Circuits, Electromechanical Energy Conversion, Introduction to Rotating Machines. Text and Reference Books:

In today’s ‘global village’, there are many who believe that ‘Communication is like breathing and life would cease to continue without it’. This particular course on communication skills imbibes the same and therefore, it aims to equip the students with getting the basics right of communication and presentation skills for academic and professional purposes. It is designed to help the second language learners acquire fluency in both spoken and written English to communicate information with clarity, precision and confidence especially in the professional sphere. It will introduce learners not only to the basic concepts in communication but also focus on providing them a handson experience of the same. It is hoped that after commanding the skills required in spoken and written English, learners will be able to express themselves more effectively. The course will have ten units and shall focus on the following topics: Unit 1: Language and Communication What is Communication Nature, Style and Process of Communication Communication Barriers Objectives and Importance of Communication Formal and Informal Communication Verbal and Non Verbal Communication Unit 2: English Language Remedial Skills Construction of Sentences SubjectVerb Agreement Tenses Active and Passive Voice Direct and Indirect Speech Common Errors Unit 3: Oral Skills Public Speaking Dealing with lack of confidence Making an Effective Presentation Telephone Etiquette Understanding GD Why conduct a GD? How to gear up for a GD? Different Phases of GD Unit 4: Listening Skills Meaning of Listening Different Types of Listening Barriers to Listening and Methods to overcome them Various strategies to develop effective Listening Semantic Markers Unit 5: Reading Skills What is Reading? Types of Reading Reading Comprehension Unit 6: Writing Skills Business Correspondence Element and Style of Writing Report Writing Notice, Agenda and Minutes Unit 7: Interview Techniques How to prepare for an Interview An Interview Text and Reference Books:

Properties of real numbers. Sequences of real numbers, monotone sequences, Cauchy sequences, divergent sequences. Series of real numbers, Cauchy’s criterion, tests for convergence. Limits of functions, continuous functions, uniform continuity, monotone and inverse functions. Differentiable functions, Rolle's theorem, mean value theorems and Taylor's theorem, power series. Riemann integration, fundamental theorem of integral calculus, improper integrals. Application to length, area, volume, surface area of revolution. Vector functions of one variable and their derivatives. Functions of several variables, partial derivatives, chain rule, gradient and directional derivative. Tangent planes and normals. Maxima, minima, saddle points, Lagrange multipliers, exact differentials. Repeated and multiple integrals with application to volume, surface area, moments of inertia. Change of variables. Vector fields, line and surface integrals. Green’s, Gauss’ and Stokes’ theorems and their applications. Text Books:
Reference Books:

Sheet Metal Working: Sheet material: GI sheets, aluminum, tin plate, copper, brass etc.; Tools: steel rule, vernier calipers, micrometer, sheet metal gauge, scriber, divider, punches, chisels, hammers, snips, pliers, stakes etc.; operations: scribing, bending, shearing, punching etc.; Product development: hexagonal box with cap, funnel etc. Pattern Making and Foundry Practice: Pattern material: wood, cast iron, brass, aluminum, waxes etc.; Types of patterns: split, single piece, match plate etc.; Tools: cope, drag, core, core prints, shovel, riddle, rammer, trowel, slick, lifter, sprue pin, bellow, mallet, vent rod, furnace etc. Moldings sands: green sand, dry sand, loam sand, facing sand etc., Sand casting: Sand preparation, mould making, melting, pouring, and cleaning. Joining: Classifications of joining processes; Introduction to Arc welding processes; power source; electrodes; edge preparation by using tools bench vice, chisels, flat file, square file, half round file, round file, knife edge file, scrapers, hacksaws, try squares; cleaning of job, Job: lap and butt joints using manual arc welding. Machining centre: Introduction to different machine tools; Working principle of lathe, milling, drilling etc.; Setting and preparation of job using lathe and milling; Performing different operations namely, straight turning, taper turning, knurling, thread cutting etc.; Introduction to dividing head, indexing, performing operation in milling using indexing mechanism. CNC centre: Introduction to CNC machines; Fundamentals of CNC programming using G and M code; setting and operations of job using CNC lathe and milling, tool reference, work reference, tool offset, tool radius compensation. Text and Reference Books:

Orthogonal coordinate systems and frames of reference, conservative and nonconservative forces, workenergy theorem, potential energy and concept of equilibrium; Rotation about fixed axis, translationalrotational motion, vector nature of angular velocity, rigid body rotation and its applications, Euler's equations; Gyroscopic motion and its application; Accelerated frame of reference, centrifugal and Coriolis forces. Harmonic oscillator damped and forced oscillations, resonance, coupled oscillations, small oscillation, normal modes, longitudinal and transverse waves, wave equation, plane waves, phase velocity, superposition wave packets and group velocity, two and three dimensional waves. Failure of classical concepts, Black body radiation, photoelectric effect, Compton effect, Davison and Germer's experiment, FrankHertz experiment, Bohr's theory, Sommerfeld's model, correspondence principle, Planck hypothesis, De Broglie's hypothesis, Hilbert space, observables, Dirac notation, principle of superposition, wave packets, phase and group velocities, probability & continuity equation, eigenvalues and eigen functions, orthonormality, expectation values, uncertainty principle, postulates of Quantum Mechanics, Schrodinger equation & its applications to 1D potentials, field quantization, periodic potential wells: Kronig Penny model and origin of band gap. Textbooks:

Ex 1 Decay of Current in A Capacitive Circuit Ex 2 QFactor of an LCR Circuit Ex 3 Study of Hall Effect Ex 4 Speed of Sound in Air Ex 5 ‘g’ by A Compound Pendulum Ex 6 Speed of Light in Glass Ex 7 Determination of e/m Ex 8 Interference of Light: Newton’s Ring Ex 9 Surface Tension of Water by Method of Capillary Ascent Ex 10 Determination of Plank’s constant by Photoelectric Effect 
Semester II
Module 1  Biology: 1. Cell – Structure and logic of optimization; 2. Blood – The following tissue – Basis and rationale; 3. Organs – Structure, function, interactions, failure; 4. Molecular basis of disorders – example: Diabetes; 5. Modern techniques of evaluations and corrections; 6. Open discussions – Feedback from students Module 2 – Environmental Science / Studies: 1.Ecology and Sustainable Development – Ecosystems, Natural cycles, Biodiversity, Man and environment; 2. Water Resources – Hydrologic cycle and its components, Groundwater and surface water, Water quality; 3. Environmental Sanitation: Conventional and ecological sanitation; 4. Environmental Pollution and Control – Air, Water, Soil, Noise Pollution, Solid and Hazardous Waste, Biomedical Waste, Ewaste: Sources, effect, treatment and control; 5. Environmental Legislations and Standards; 6.Current Environmental Issues: Greenhouse gases and global warming, Acid rain, Ozone layer depletion, Climate change Text Books:

PHYSICAL CHMEISTRY Thermodynamics: The fundamental definition and concept, the zeroth and first law. Work, heat, energy and enthalpies. Second law: entropy, free energy and chemical potential. Change of Phase. Third law. Chemical equilibrium, Chemical kinetics: The rate of reaction, elementary reaction and chain reaction. Electrochemistry: Conductance of solutions, equivalent and molar conductivities and its variation with concentration. Kohlrausch’s lawionic mobilities, Transference number of ions. activities, application of DebyeHuckel theory. The Walden’s rule. DebyeHuckelOnsager treatment. Electrochemical cells, Nernst equation. Application of EMF measurements. Liquid junction potential, commercial cells – the primary and secondary cells. Fuel cells. INORGANIC CHEMISTRY Coordination chemistry: ligand, nomenclature, isomerism, stereochemistry, valence bond, crystal field and molecular orbital theories. Bioinorganic chemistry: Trace elements in biology, heme and nonheme oxygen carriers, hemoglobin and myoglobin; organometallic chemistry. ORGANIC CHEMISTRY Stereo and regiochemistry of organic compounds, conformers. Bioorganic chemistry: amino acids, peptides, proteins, enzymes, carbohydrates, nucleic acids and lipids. Modern techniques in structural elucidation of compounds (UV – Vis, IR, NMR). Solid phase synthesis and combinatorial chemistry. Green chemical processes. Textbooks: P. W. Atkins, Physical Chemistry, ELBS, 5th Ed, 1994. J. O'M. Bockris and A. K. N. Reddy, Modern Electrochemistry, Vol. 1 and 2, Kluwer Academic, 2000. K. L. Kapoor, A Textbook of Physical Chemistry, Macmillan India, 2nd Ed, 1986. F. A. Cotton and G. Wilkinson, Advanced Inorganic Chemistry, Wiley Eastern Ltd, New Delhi, 3rd Ed, 1972 (reprint in 1998). D. J. Shriver, P. W. Atkins and C. H. Langford, Inorganic Chemistry, ELBS, 2nd Ed, 1994. S. H. Pine, Organic Chemistry, McGraw Hill, 5th Ed, 1987 Reference Books: Levine, Physical Chemistry, McGraw Hill, 4th Ed, 1995. J. E. Huheey, E. A. Keiter and R. L. Keiter, Inorganic Chemistry: Principle, structure and reactivity, Harper Collins, 4th Ed, 1993. L. G. Wade Jr., Organic Chemistry, Prentice Hall, 1987 
Estimation of metal ion: Determination of total hardness of water by EDTA titration. Experiments based on chromatography: Identification of a mixture containing two organic compounds by TLC. Experiments based on pH metry.: Determination of dissociation constant of weak acids by pH meter. Experiments based on conductivity measurement: Determination of amount of HCl by conductometric titration with NaOH. Synthesis and characterization of inorganic complexes: e.g. Mn(acac)3, Fe(acac)3, cisbis(glycinato)copper(II) monohydrate and their characterization by m. p. IR etc. Synthesis and characterization of organic compounds: e.g. Dibenzylideneacetone. Kinetics: Acid catalyzed hydrolysis of methylacetate. Verification of BeerLamberts law and determination of amount of iron present in a supplied solution. Experiments based on electrogravimetry and electroplating. Experiments based on magnetometry. 
Introduction to digital computers; introduction to programming  variables, assignments; expressions; input/output; conditionals and branching; iteration; functions; recursion; arrays; introduction to pointers; structures; introduction to dataprocedure encapsulation; dynamic allocation; linked structures; introduction to data structures stacks, queues and trees; time and space requirements. References: 1. B. W. Kernighan and D. Ritchie, The C Programming Language, Prentice Hall of India (2nd Edition). 2. A. Kelley and I. Pohl, A Book on C, Pearson Education (4th Edition). 3. P.J. Deitel and H.M. Deitel , C How To Program, Pearson Education (7th Edition). 
Introduction to Unix Commands; Introduction to Program development tools  vi editor, GNU compiler, testing and debugging, etc.; Implementation of programs in C language. 
Experiments using diodes and bipolar junction transistor (BJT): design and analysis of half wave and fullwave rectifiers, clipping circuits and Zener regulators, BJT characteristics and BJT amplifiers; experiments using operational amplifiers (opamps): summing amplifier, comparator, precision rectifier, a stable and mono stable multivibrators and oscillators; experiments using logic gates: combinational circuits such as staircase switch, majority detector, equality detector, multiplexer and demultiplexer; experiments using flipflops: sequential circuits such as non overlapping pulse generator, ripple counter, synchronous counter, pulse counter and numerical display. Reference Books:
India, 2002.


Linear Algebra: Vector spaces (over the field of real and complex numbers). Systems of linear equations and their solutions. Matrices, determinants, rank and inverse. Linear transformations. Range space and rank, null space and nullity. Eigenvalues and eigenvectors. Similarity transformations. Diagonalization of Hermitian matrices. Bilinear and quadratic forms. Ordinary Differential Equations: First order ordinary differential equations, exactness and integrating factors. Variation of parameters. Picard's iteration. Ordinary linear differential equations of nth order, solutions of homogeneous and nonhomogeneous equations. Operator method. Method of undetermined coefficients and variation of parameters. Power series methods for solutions of ordinary differential equations. Legendre equation and Legendre polynomials, Bessel equation and Bessel functions of first and second kind. Systems of ordinary differential equations, phase plane, critical point stability. Textbooks:
Reference Books:


Semester III
Complex Analysis: Complex numbers, geometric representation, powers and roots of complex numbers. Functions of a complex variable: Limit, Continuity, Differentiability, Analytic functions, CauchyRiemann equations, Laplace equation, Harmonic functions, Harmonic conjugates. Elementary Analytic functions (polynomials, exponential function, trigonometric functions), Complex logarithm function, Branches and Branch cuts of multiple valued functions. Complex integration, Cauchy's integral theorem, Cauchy's integral formula. Liouville’s Theorem and MaximumModulus theorem, Power series and convergence, Taylor series and Laurent series. Zeros, Singularities and its classifications, Residues, Rouches theorem (without proof), Argument principle (without proof), Residue theorem and its applications to evaluating real integrals and improper integrals. Conformal mappings, Mobius transformation, SchwarzChristoffel transformation. Fourier series: Fourier Integral, Fourier series of 2p periodic functions, Fourier series of odd and even functions, Halfrange series, Convergence of Fourier series, Gibb’s phenomenon, Differentiation and Integration of Fourier series, Complex form of Fourier series. Fourier Transformation: Fourier Integral Theorem, Fourier Transforms, Properties of Fourier Transform, Convolution and its physical interpretation, Statement of Fubini’s theorem, Convolution theorems, Inversion theorem Partial Differential Equations: Introduction to PDEs, basic concepts, Linear and quasilinear first order PDE, Second order PDE and classification of second order semilinear PDE, Canonical form. Cauchy problems. D’ Alembert’s formula and Duhamel’s principle for one dimensional wave equation, Laplace and Poisson equations, Maximum principle with application, Fourier method for IBV problem for wave and heat equation, rectangular region. Fourier method for Laplace equation in three dimensions. Text Books: 1. R. V. Churchill and J. W. Brown, Complex Variables and Applications, 5th Edition, McGrawHill, 1990. 2. K. Sankara Rao, Introduction to Partial Differential Equations, 2nd Edition, 2005. Reference Books: 3. J. H. Mathews and R. W. Howell, Complex Analysis for Mathematics and Engineering, 3rd Edition, Narosa, 1998. 4. I. N. Sneddon, Elements of Partial Differential Equations, McGrawHill, 1957. E. Kreyszig, Advanced Engineering Mathematics, 9th Edition, Wiley, 2005. 
Asymptotic notations, introduction to complexity (time/space) analysis of algorithms. Basic introduction to algorithmic paradigms like divide and conquer, recursion, greedy, dynamic programming, etc. Searching: binary search trees, balanced binary search trees, AVL trees and redblack trees, Btrees, hashing. Priority queues, heaps, Interval trees. Sorting: quick sort, heap sort, merge sort, radix sort, bucket sort, counting sort, etc and their analysis. Graph Algorithms: BFS, DFS, connected components, topological sort, minimum spanning trees, shortest paths, network flow. Reducibility between problems and NPcompleteness: discussion of different NPcomplete problems. Books M. A. Weiss, Data Structures and Problem Solving Using Java, 2nd Ed, AddisonWesley, 2002. T. H. Cormen, C. E. Leiserson, R. L. Rivest and C. Stein, Introduction to Algorithms, MIT Press, 2001. B. W. Kernighan and D. Ritchie, The C Programming Language, 2nd Ed, Prentice Hall of India, 1988. A. Aho, J. E. Hopcroft and J. D. Ullman, The Design and Analysis of Computer Algorithms, AddisonWesley, 1974. S. Sahni, Data Structures, Algorithms and Applications in C++, McGrawHill, 2001. M. T. Goodrich and R. Tamassia, Algorithm Design: Foundations, Analysis and Internet Examples, John Wiley & Sons, 2001. 
The laboratory component will emphasize two areas: Implementation of algorithms covered in class: This will involve running the algorithms under varying input sets and measuring running times, use of different data structures for the same algorithm (wherever applicable) to see its effect on time and space, comparison of different algorithms for the same problem etc. Design of Algorithms: This will involve design and implementation of algorithms for problems not covered in class but related to topics covered in class. The exact set of algorithms to design and implement is to be decided by the instructor. In addition, there will be at least one significantly large design project involving some real world application. An efficient design of the project should require the use of multiple data structures and a combination of different algorithms/techniques. The lab work can be carried out using any programming language. 
Propositional logic: Syntax, semantics, valid, satisfiable and unsatisfiable formulas, encoding and examining the validity of some logical arguments; Recurrences, summations, generating functions, asymptotic; Sets, relations and functions: Operations on sets, relations and functions, binary relations, partial ordering relations, equivalence relations, principles of mathematical induction, Finite and infinite sets, countable and uncountable sets, Cantor’s diagonal argument and the power set theorem; Introduction to counting: Basic counting techniques  inclusion and exclusion, pigeonhole principle, permutation, combination, generating function; Algebraic structures and morphisms: semigroups, groups, subgroups, homomorphism, rings, integral domains, fields; Introduction to graphs: paths, connectivity, subgraphs, isomorphic and homeomorphic graphs, trees, complete graphs, bipartite graphs, matchings, colourability, planarity, digraphs; Text Books: 1. J. P. Tremblay and R. P. Manohar, Discrete Mathematics with Applications to Computer Science, Tata McGrawHill, 1999. 2. C. L. Liu, Elements of Discrete Mathematics, 2nd Ed, Tata McGrawHill, 2000. 3. R. L. Graham, D. E. Knuth, and O. Patashnik, Concrete Mathematics, 2nd Ed, AddisonWesley, 1994. 4. N. Deo, Graph Theory with Applications to Engineering and Computer Science, Prentice Hall of India, 1974. 5. S. Lipschutz and M. L. Lipson, Schaums Outline of Theory and Problems of Discrete Mathematics, 2ndEd, Tata McGrawHill, 1999 
Number Systems, Boolean algebra, logic gates, minimization of completely and incompletely specified switching functions, Karnaugh map and QuineMcCluskey method, multiple output minimization, twolevel and multilevel logic circuit synthesis. Clocks, flipflops, latches, counters and shift registers, finite state machine model, synthesis of synchronous sequential circuits, minimization and state assignment, Programmable logic devices: memory design. Data path control path partitionbased design. Experiments: Combinational logic circuits: Design and implementation of combinational circuits such as ALU and 7segment LED display driver; Sequential Circuits: Design of sequence generators and detectors, counters, design of ASMs such as, traffic light controllers, lift controllers, etc. Digital design project: The students design and implement a final digital project of their choice.
References: 
Linear programming: Introduction and Problem formulation, Concept from Geometry, Geometrical aspects of LPP, Graphical solutions, Linear programming in standard form, Simplex, Big M and Two Phase Methods, Revised simplex method, Special cases of LPP. Duality theory: Dual simplex method, Sensitivity analysis of LP problem, Transportation, Assignment and travelling salesman problem. Integer programming problems: Branch and bound method, Gomory cutting plane method for all integers and for mixed integer LPP. Theory of games: saddle point, linear programming formulation of matrix games, twoperson zerosum games with and without saddlepoints, pure and mixed strategies, graphical method of solution of a game, solution of an game by simplex method. Computational complexity of the Simplex algorithm, Karmarkar's algorithm for LPP. Acquaintance to softwares like TORA and MATLAB. Text Books: 1. Hamdy A. Taha, Operations Research: An Introduction, Eighth edition, PHI, New Delhi (2007). 2. S.Chandra, Jayadeva, AparnaMehra, Numerical Optimization with Applications, Narosa Publishing House (2009). 3. A. Ravindran, D.T. Phillips, J.J. Solberg, Operation Research, John Wiley and Sons, New York (2005). 4. M. S. Bazaraa, J. J. Jarvis and H. D. Sherali, Linear Programming and Network Flows, 3rd Edition, Wiley (2004). Reference Books: 1. D. G. Luenberger, Linear and Nonlinear Programming, 2nd Edition, Kluwer, (2003). 2. S. A. Zenios (editor), Financial Optimization, Cambridge University Press (2002). 3. F. S. Hiller, G. J. Lieberman, Introduction to Operations Research, Eighth edition, McGraw Hill (2006). 
Bash shell programming – basic concepts, expressions, decision making selections, repetition, special parameters  positional parameters, shift, argument validation, script examples. Android Basics: Getting started with Android development, project folder structure, simple programming, running project, generating build/APK of the app from Android Studio First application: Creating Android Project, Android Virtual Device Creation, set up debugging environment, Workspace set up for development, launching emulator, debugging on mobile devices. Basic UI design: Basics about Views, Layouts, Drawable Resources, input controls, Input Events etc. understand the app idea and design user interface/wireframes of mobile app Set up the mobile app development environment 
Semester IV
Algebra of sets, probability spaces, random variables, cumulative distribution functions, mathematical expectations, conditional probability and expectation, moments and inequalities, special discrete and continuous probability distributions, function of a random variable, random vectors and their distributions, convolutions, joint, marginal and conditional distributions, product moments, independence of random variables, bivariate distributions and properties, order statistics and their distributions, sampling distributions, Central Limit Theorem, strong law of large numbers, sequence of random variables, modes of convergence, distributions of the sample mean and the sample variance for a normal population, chisquare, t and F distributions, method of moments and maximum likelihood estimation, concepts of unbiasedness, criteria for choosing estimators, consistency and efficiency of estimates, confidence intervals, pivotal quantities, confidence intervals for proportions, simple and composite hypothesis, null and alternative hypotheses, types of error, level and size of tests, the most powerful test and Neyman  Pearson Fundamental Lemma, tests for one and twosample problems for normal populations, tests for proportions, likelihood ratio tests, chisquare test for goodness of fit. discrete and continuous stochastic processes, markov chains, transition probability matrix, state spaces, classification of states, stationary distributions, ergodicity, Poisson process, birth and death process. Introduction to reliability analysis: Application of Bayes theorem in real life problem; Reliability analysis of simple system. Serial, parallel and combined systems; First order uncertainty and reliability analysis (FORM), First order second mom (FOSM) and Advanced FOSM methods; Applications of risk and reliability analysis in engineering systems. Text / Reference Books: Scheaffer, R. L., Mulekar, M. S. and McClave, J. T., (2011): Probability and statistics for Engineers, Fifth Edition, Broo Cole, Cengage Learning. Ang, A. HS., and Tang, W. H., (2006): Probability Concepts in Engineering, Volumes 1. John Wiley and Sons. Halder, A and Mahadevan, S., (2000): Probability, Reliability and Statistical Methods in Engineering Design, John Wiley Sons. Rao, S.S., (1992): ReliabilityBased Design, McGraw Hill, Inc. Harr, M.E., (1987): ReliabilityBased Design in Civil Engineering. McGraw Hill, Inc. Ang, A. HS, and Tang, W. H., (1975): Probability Concepts in Engineering Planning and Design, Volumes 2. John Wiley Sons Benjamin, J., and Cornell. A., (1963): Probability, Statistics, and Decision for Civil Engineers. McGraw Hill. 
CPU  registers, instruction execution cycle, RTL interpretation of instructions, addressing modes, instruction set. Case study  instruction sets of some common CPUs; Assembly language programming for some processor; Data representation: signed number representation, fixed and floating point representations, character representation. Computer arithmetic  integer addition and subtraction, ripple carry adder, carry lookahead adder, etc. multiplication – shiftandadd, Booth multiplier, carry save multiplier, etc. Division  nonrestoring and restoring techniques, floating point arithmetic; CPU control unit design: hardwired and microprogrammed design approaches, Case study  design of a simple hypothetical CPU; Pipelining: Basic concepts of pipelining, throughput and speedup, pipeline hazards; Memory organization: Memory interleaving, concept of hierarchical memory organization, cache memory, cache size vs block size, mapping functions, replacement algorithms, write policy; Peripheral devices and their characteristics: Inputoutput subsystems, I/O transfers  program controlled, interrupt driven and DMA, privileged and nonprivileged instructions, software interrupts and exceptions. Programs and processes  role of interrupts in process state transitions. 
Familiarization with assembly language programming; Synthesis/design of simple data paths and controllers, processor design using HDL like verilog/vhdl; Interfacing  DAC, ADC, keyboarddisplay modules, etc. Development kits as well as Microprocessors/PCs may be used for the laboratory, along with design/simulation tools as and when necessary. 
Regular Languages: Finite AutomataDeterministic and Nondeterministic, regular operations, Regular Expressions, Equivalence of DFA, NFA and Res, Nonregular Languages and pumping lemma ContextFree Languages: ContextFree Grammars, Chomsky Normal Form, Pushdown Automata, Non ContextFree Languages and pumping lemma, Deterministic ContextFree Languages Turing Machines: Definition of TM and its variants, Decidability, Reducibility. Complexity Theory: Time complexity and Space Complexity. Text Books: 1.Introduction to the Theory of Computation, by Michael Sipser 2. Computational Complexity, by Christos H. Papadimitriou, AddisonWesley publishers. 3. Computational Complexity: A Modern Approach, by Sanjeev Arora and Boaz Barak. 
Database system architecture: Data Abstraction, Data Independence, Data Definition and Data Manipulation Languages; Data models: Entityrelationship, network, relational and object oriented data models, integrity constraints and data manipulation operations; Relational query languages: Relational algebra, tuple and domain relational calculus, SQL and QBE; Relational database design: Domain and data dependency, Armstrong’s axioms, normal forms, dependency preservation, lossless design; Query processing and optimization: Evaluation of relational algebra expressions, query equivalence, join strategies, query optimization algorithms; Storage strategies: Indices, Btrees, hashing; Transaction processing: Recovery and concurrency control, locking and timestamp based schedulers, multiversion and optimistic Concurrency Control schemes; Recent Trends: XML Data, XML Schema, JSON and “NoSQL Systems, etc. Books: Abraham Silberschatz, Henry Korth, and S. Sudarshan, Database System Concepts, McGrawHill. Raghu Ramakrishnan, Database Management Systems, WCB/McGrawHill. Bipin Desai, An Introduction to Database Systems, Galgotia. J. D. Ullman, Principles of Database Systems, Galgotia. R. Elmasri and S. Navathe, Fundamentals of Database Systems, AddisonWesley. Serge Abiteboul, Richard Hull and Victor Vianu, Foundations of Databases. AddisonWesley 
Database schema design, database creation, SQL programming and report generation using a commercial RDBMS like ORACLE/SYBASE/DB2/SQLServer/INFORMIX. Students are to be exposed to front end development tools, ODBC and CORBA calls from application Programs, internet based access to databases and database administration. 
Semester V
Evolution of computer networks; Physical Layer: Theoretical basis for data communication, transmission media and impairments, switching systems Medium Access Control Sublayer: Channel allocation Problem, multiple access protocols, Ethernet Data link layer: Framing, HDLC, PPP, sliding window protocols, error detection and correction Network Layer: Internet addressing, IP, ARP, ICMP, CIDR, routing algorithms (RIP, OSPF, BGP); Transport Layer: UDP, TCP, flow control, congestion control; Introduction to quality of service; Application Layer: DNS, Web, email, authentication, encryption. Books: Peterson & Davie, Computer Networks, A Systems Approach: 5th Edition William Stallings Data and Computer Communication, Prentice Hall of India. Behrouz A. Forouzan, Data Communication and Networking, McGrawHill. Andrew S. Tanenbaum, Computer Networks, Prentice Hall. Douglas Comer, Internetworking with TCP/IP, Volume 1, Prentice Hall of India. W. Richard Stevens, TCP/IP Illustrated, Volume 1, AddisonWesley. 
Simulation experiments for protocol performance, configuring, testing and measuring network devices and parameters/policies; network management experiments; Exercises in network programming. 
Process Management: process; thread; scheduling. Concurrency: mutual exclusion; synchronization; semaphores; monitors; Deadlocks: characterization; prevention; avoidance; detection. Memory Management: allocation; hardware sup port; paging; segmentation. Virtual Memory: demand paging; replacement; allocation; thrashing. File Systems and Implementation. Secondary Storage: disk structure; disk scheduling; disk management. (Linux will be used as a running example, while examples will draw also from Windows NT/7/8.); Advanced Topics: Distributed Systems. Security. RealTime Systems. Books: A. Silberschatz, P. B. Galvin and G. Gagne, Operating System Concepts, 8th Ed, John Wiley & Sons, 2010. A. S. Tenenbaum, Modern Operating Systems, 2nd Ed, Prentice Hall of India, 2001. H. M. Deitel, P. J. Deitel and D. R. Choffness, Operating Systems, 3rd Ed, Prentice Hall, 2004. W. Stallings, Operating Systems: Internal and Design Principles, 5th Ed, Prentice Hall, 2005. M. J. Bach, The Design of the UNIX Operating System, Prentice Hall of India, 1994. M. K. McKusick et al, The Design and Implementation of the 4.4 BSD Operating System, Addison Wesley, 1996. 
Programming assignments to build different parts of an OS kernel. 
Models of computation: RAM model and its logarithmic cost. Formal introduction to algorithmic paradigms: divide and conquer, recursion, dynamic programming, greedy, branch and bound, etc. Special topics: Geometric algorithms (range searching, convex hulls, segment intersections, etc.) 
The objective of this lab would be to encourage and provide support to students for some innovative work. The work may focus on inventing a practical solution for a pure Computer Science or multidisciplinary problems. Depending on the nature of the work, it may be carried out in a group or individual mode. 
Semester VI
Introduction: History of Programming Languages; Evolution of the Major Programming Languages; Art of Programming Language Design; Properties and Success of Programming Languages. Programming LanguageParadigms: Imperative (e.g. C, Pascal, Fortran); Functional (e.g. LISP, HASKELL, OCaml); Object Oriented (e.g. JAVA, C++, Scala); Logicbased (e.g. Prolog); Multiparadigm programming languages (e.g. Python). Programming Language Concepts: Values and Data Types; Block Structure; Scope, Binding and Lifetime of Variables; Static vs. Dynamic Typing; Static vs. Dynamic Scoping; Memory Management; Procedural Abstraction; Data Abstraction; Concurrency; etc. Programming Language Syntax and Semantics: Syntax vs. Semantics; Brief Overview of Regular and Context Free Languages, Formal Semantics: denotational, operational, axiomatic semantics. Language Translation: Compiler vs. Interpreter; Various Phases of Compilers; Overview of Parsing Techniques; Syntax vs. Semantic Analysis; Intermediate Code Generation, Code Optimization Techniques; A Closer Look at Implementation  Building a Runnable Program. Text Books: 1. Michael L. Scott, “Programming Language Pragmatics”, Morgan Kaufmann, 3rd Edition. 2. Harold Abelson, Gerald Jay Sussman, Julie Sussman, “Structure and Interpretation of Computer Programs”, MIT Press, 2nd Edition. 3. Aho A., Sethi R., Ullman J.D., Compilers : Principles, Techniques and Tools, Addison Wesley, 1995 References: 1. Ravi Sethi, K.V. Vishwanatha, “Programming Languages: Concepts and Constructs”, 2/e, Pearson Education, 2007. 2. T.W. Pratt and M.V. Zelkowitz, “Programming Languages – Design and Implementation”, PrenticeHall. 3. Robert W. Sebesta, “Concepts of Programming Languages”, AddisonWesley. 4. D. A. Watt, “Programming Language Design Concepts”, John Wiley & Sons. 5. Kenneth C. Louden and Kennath A. Lambert, “Programming Languages: Principles and Practice”, Cengage Learning. 6. Recent Research Papers relevant to the course. 

1. Handson experience with various parsers, such as ANTLR, Lark, Lex, Yacc, etc.; 2. Design your own programming language, write its grammar, and implement its parser; 3. Programming assignments to build a compiler for a subset of a Clike programming language; 4. Class assignments on functional and logic programming languages, such as LISP, Prolog. 
1. Introduction, Motivation of the course 2. Problem Solving: Uninformed search, Informed search, Local Search, 3. Game Playing: Minmax, AlphaBeta Pruning, Constraint Satisfaction Problems: Factor Graphs, Backtracking Search, Dynamic Ordering, Arc consistency 4. Knowledge, Reasoning and Planning: Propositional and Predicate Calculus, Semantic Nets; Automated Planning 5. Machine Learning: Learning from examples and analogy 6. Association rule mining 7. Application Topics: Introduction to NLP, Introduction to Fuzzy Sets and Logic References:
Journals and Conference Proceedings: Artificial Intelligence, Machine Learning, ACL Anthology, ICML, ECML etc. 
Small projects based on the concepts and tools taught in AI class. 
The objective of this project would be to encourage and provide support to students for some innovative work. The work may focus on inventing a practical solution for a CS or multidisciplinary problems. Depending on the nature of the work, it may be carried out in a group or individual mode. 
Proposed Electives 

1  Advanced topics on Database 
2  CAD for VLSI 
3  Computer and Network Security 
4  Distributed Systems 
5  Formal methods for analysis and verification 
6  Natural Language Processing 
7  Pattern Recognition 
8  Software Testing 
9  Wireless Networks 
10  Introduction to Network Science 
11  A Mathematical Introduction to Robotics 
12  Advanced Machine Learning 
13  Advanced Network Science, 
14  Advanced Operating Systems 
15  Advanced Signal Processing for AI and DS 
16  AI in Healthcare 
17  Applications of artificial intelligence in Chemistry 
18  Applied Time Series Analysis 
19  Big Data Computing 
20  Blockchain tech: A Software Engg. Perspective 
21  Cloud Computing 
22  Computational Geometry 
23  Conversational AI 
24  Conversational Artificial Intelligence, 
25  Cryptography 
26  Data Visualization 
27  Database & Data Mining 
28  Deep Learning for NLP 
29  Design and Analysis of Algorithms 
30  Discrete Differential Geometry 
31  Distributed Machine Learning 
32  Edge AI 
33  Estimation and Detection 
34  Estimation and Detection 
35  Foundation of Computer Security 
36  Foundations of Computer Systems 
37  Foundations of Machine Learning 
38  Foundations of Theoretical Computer Science 
39  Geometric and Topological Modelling for Scientists and Engineers 
40  Graph Representation Learning 
41  High Performance Computing 
42  Information Retrieval and Mining, 
43  information theory and coding 
44  Intro. Blockchain and Cryptocurreny 
45  Introduction to Computational Topology 
46  Introduction to Deep Learning 
47  Introduction to Network Science 
48  Machine Translation, 
49  Mobile Robotics 
50  Planning Algorithms 
51  Sentiment and Emotion Analysis 
52  Social Text Mining, 
53  Statistical signal processing 
54  Statistical signal processing 
55  Topological Data Analysis 
B. Tech. AI & DS
B.Tech (CS) Courses
Course Structure (IIV Sem. for 2021 Onwards and VVIII Sem. for 201920 Batches)
Course Structure
M.Tech Courses
M. Tech. CSE
M. Tech. AI
Ph.D. Courses
Distributed Systems and Alogorithms
CS701  Distributed Systems and Alogorithms  3006 

Basic concepts. Models of computation: shared memory and message passing systems, synchronous and asynchronous systems. Logical time and event ordering. Global state and snapshot algorithms, mutual exclusion, clock synchronization, leader election, deadlock detection, termination detection, spanning tree construction. Programming models: remote procedure calls, distributed shared memory. Fault tolerance and recovery: basic concepts, fault models, agreement problems and its applications, commit protocols, voting protocols, checkpointing and recovery, reliable communication. Security and Authentication: basic concepts, Kerberos. Resource sharing and load balancing. Special topics: distributed objects, distributed databases, directory services, web services.
Texts:
 B. W. Kernighan and D. Ritchie, The C Programming Language, 2nd Ed, Prentice Hall of India, 1988.
 N. Lynch, Distributed Algorithms, Elsevier India Private Limited, (2009)
 Hagit Attiya, Jennifer Welch, Distributed Computing: Fundamentals, Simulations and Advanced Topics, Wiley, (2006)
References:
 S.Ghosh, Distributed Systems: An Algorithmic Approach, Chapman & Hall, (2006)
 A. Kshemkalyani, M. Singhal, Distributed Computing: Principles, Algorithms, and Systems, Cambridge University Press, (2008)
 Gerard Tel, Introduction to Distributed Algorithms, 2nd edition, Cambridge University Press, (2004)
 Technical papers from major distributed systems journals and conferences
Topics in Computer Networks
CS741  Topics in Computer Networks  3006 

Overview of computer networks, the Internet and OSI model Responsibilities of the Data Link Layer, Network Layer and Transport Layer; Local Area Networks – Ethernet, Token Ring etc. Scheduling algorithms and MAC layer protocols (Link Layer) Routing protocols  BGP, RIP, OSPF, AODV etc. (Network Layer). Congestion control Algorithms (Transport Layer). Peertopeer and clientserver programming using sockets in TCP and UDP. Quality of Service (QoS) Provisioning Network Security
Texts:
 A. S. Tanenbaum, Computer Networks, 4th Ed, Prentice Hall, (2003)
References:
 B. A. Forouzan, Data Communications and Networking, 3rd Ed, McGraw Hill, (2004)
 W. Stallings, Data and Computer Communications, 7th Ed, Prentice Hall of India, (2004)
 J. F.Kurose and K. W. Ross,Computer networking: A Topdown Approach Featuring the Internet, 3rd Ed, AddisonWesley, (2005)
 W. Stevens and G. Wright, TCP/IP Illustrated, Volumes 13, (2002)
 Technical papers from major networking journals and conferences
Cryptography and Network Security
CS742  Cryptography and Network Security  3006 

Symmetric key encryption algorithm, Key distribution, Stream Ciphers, Pseudo Random Numbers, Public Key Cryptography, Hashes and Message Digests, Digital Signatures, Certificates, User Authentication. System authentication, IPSec, Virtual Private Networks Secure Socket layer, transport layer security.
Texts:
 W. Stalling: Cryptography and Network security Principles and Practices, 4th Edition PHI, (2006)
 D. R. Stinson: Cryptography theory and practices, 2nd Edition, CRC Press,(2006)
References:
 Technical papers from major reputed journals and conferences and internet resources
Advance in Alogorithms
CS702  Advance in Alogorithms  3006 

Algorithmic paradigms: Dynamic Programming, Greedy, Branchandbound; Asymptotic complexity, Amortized analysis; Graph Algorithms: Shortest paths, Flow networks; NPcompleteness; Approximation algorithms; Randomized algorithms; Linear programming; Special topics: Geometric algorithms (range searching, convex hulls, segment intersections, closest pairs), Numerical algorithms (integer, matrix and polynomial multiplication, FFT, extended Euclid's algorithm, modular exponentiation, primality testing, cryptographic computations), Internet algorithms (text pattern matching, tries, information retrieval, data compression, Web caching).
References:
 T. H. Cormen, C. L. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 2nd edition, Prenticehall Of India Pvt.. Ltd, (2007)
 J. Kleinberg and E. Tardos, Algorithm Design, AddisonWesley, (2008)
 Rajeev Motwani and Prabhakar Raghavan, Randomized Algorithms, Cambridge University Press, (1995)
 Vijay Vazirani, Approximation Algorithms, Springer, (2004)
 Soumen Chakrabarti, Mining the Web: Discovering Knowledge from Hypertext Data, Elsevier India Private Limited, (2005)
References:
 Technical papers from major reputed journals in the area of algorithms design.