B.Tech Course Content CSE.pdf

8/20/2019 B.Tech Course Content CSE.pdf

1/32

Curriculum for B.Tech. Programs

NEW Programs

Indian Institute of Technology Jodhpur


2/32

Proposed CurriculumB.Tech. (Computer Science and Engineering)

Cat. Course Title L-T-P Credits Cat. Course Title L-T-P Credits

I Semester II Semester

H ME111 System Exploration--Drawing 3-0-3 4 H ME121 System Exploration--Workshop 3-0-3 4

H CS111 Computer Programming 3-1-3 5 H EE121 Basic Electronics Engineering 3-1-3 5

B PH 111 Electromagnetism and Optics 3-1-3 5 H ME122 Engineering Mechanics 3-1-3 5

B MA111 Linear Algebra and Calculus 4-1-0 5 B MA121 Complex Analysis & DifferentialEquation 4-1-0 5

C CS112 Discrete Mathematics 3-1-0 4 C CS121 Data Structures and Algorithms 3-1-3 5

L HS111 English / Foreign Language 3-0-0 3 L HS121 Rights, Responsibilities, Law andConstitution

3-0-0 3

S PE111 Physical Exercises I 0 S PE121 Physical Exercise II 0

Total 32 26 Total 35 27

III Semester IV Semester

H EE221 Basic Electrical Engineering 3-1-3 5 H EE222 Digital Logic and Design 3-0-3 4

B ME221 Thermodynamics 3-1-0 4 B MA221 Probability Statistics and RandomProcesses

4-1-0 5

B CY211 Chemistry 3-0-3 4 C CS222 Operating Systems 3-0-3 4

C EE213 Signals and Systems 3-1-0 4 C CS223 Principles of Database Systems 3-0-0 3

C CS212 Algorithm Design and Analysis 3-0-0 3 P CS299 B. Tech. Project 0-0-9 3

L HS211 Economics 3-0-0 3 L HS221 Management 3-0-0 3


V Semester VI Semester

C CS311 Data Communication 3-1-0 4 C CS321 Computer Networks 3-0-3 4

C CS312 Software Engineering 3-0-3 4 C CS322 Programming Languages & CompilerDesign

3-0-3 4

C CS313 Computer Organization andArchitecture

3-0-0 3 C CS323 System Programming 2-0-3 3

C CS314 Theory of Computation 3-0-0 3 C CS324 Artificial Intelligence 3-0-0 3

P CS398 B. Tech. Project 0-0-12 4 P CS399 B. Tech. Project 0-0-12 4

L HS311 Psychology 3-0-0 3 L HS321 Writing in Newspaper Column 3-0-0 3


VII Semester VIII Semester

E Elective 3-0-0 3 E Elective 3-0-0 3



P CS498 B. Tech. Project 0-0-24 8 P CS499 B. Tech. Project 0-0-24 8L HS411 Leadership 3-0-0 3 L HS421 Development of India 3-0-0 3


GRAND TOTAL 246 180

S.No. Category Course Category Title Total Courses Total Credits

1 H Hands-on Experience 7 32

2 B Basics 6 28

3 C Compulsory 14 51

4 E Electives 6 18

5 P Hands-on Project 5 27

6 L Life Skills 8 24

7 S Games & Sports/Social Service 2 0

Total 48 180

Important note:- LTPC calculation for students enrolled before July 2014 will be as per their regulations


3/32

I Semester

Course Title System Exploration - Drawing Course No. ME111Focus Group Mechanical Engineering L-T-P[C] 3-0-3[4]Offered for B.Tech Type CompulsoryPre-requisite To take effect from July 2014

Objectives: 1. To inculcate how to expresses ideas of technical naturewith a pragmatic intention.2. To explore from the first idea and intuitive concepts to thefinal development and evaluation of the quality of a product.3. Helping students understand the role of engineeringgraphics in a product design process.

Learning Outcomes: 1. To distinguish between the different types of projections,indicate the dimensions and tolerance of technical products,read print, and change drawings according to specificrequirements.2. To visualize, and communicate product design usinggraphics.3. To enable, optimize and digitize manufacturing of devicesand components through graphic modeling.

Contents:Lettering Two dimensional geometrical constructions Conics Representation of three-dimensional objects Principles of

projections Standard codes Projection of points.Projection of straight lines Projection of planes - Projection of solids Auxiliary projectionsSpatial geometry for design and analysis-Sections of solids and development of surfacesConversion of Projections: Orthographic projection Isometric projection of regular solids and combination of solids.Pictorial representation-Axonometric projection, Oblique projections and Perspective projectionsGeneral dimensioning practices, limit dimensioning and cylindrical fits, tolerances of location/form/profile/orientation,

designation of surface texture.Plan, Elevation and section of single storied residential (or) office building with flat/ with electrical wiring diagramFundamental practices of computer aided design and draftingIntroduction to AutoCAD/ Solid works Commands, Applied geometry using CAD, Technical Sketching, Editing techniques

and commands in CADOrthographic projection; graphical analysis , Sectional views , Basic dimensioning methods , Primary and secondary auxiliary

views in descriptive geometry

Definition of point, line, plane, Pictorial drawings, 3D drawings, Solid Modeling,Electronic drawings, typical block diagrams, control circuit layouts, Wiring diagrams, connection layout diagrams, printed

circuits.

Reference Books: 1. Fundamental of Engineering Drawing, W, J Luzzader, Jon M Duff, Prentice Hall. 20082. Elementary Engineering Drawing, N. D. Bhatt, Charoter Publishing, 2002,3. Engineering Graphics with Autocad, J. D. Bethune, Prentice Hall. 2007.


4/32

Course Title Computer Programming Course No. CS111Focus Group Computer Science and Engineering L-T-P [C] 3-1-3 [5]Offered for B.Tech Type Hands-on Experience for CSEPre-requisite To take effect from July 2014

Objectives 1. To understand computer programming and its roles inproblem solving2. To understand and develop well-structured programs usingC language3. To learn the basic data structures through implementing inC language

Learning Outcomes 1. Problem solving through computer programming2. Familiarity of programming environment in Linux operatingsystem3. Ability to use different memory allocation methods4. Ability to deal with different input/output methods5. Ability to use different data structures

Contents Introduction to digital computers, Number systems - binary, octal, hexa, and conversion between the number systems,

binary arithmeticIntroduction to programming, Problem solving and expression of solution through flow chart and algorithmParts of a program - primitive data types, variables, operators and their precedence, expressions, input/output, conditionals

and branching, looping statementsFunctions, Storage classes - scope and life time, recursionArrays, Pointers, User defined data types - structures, unions, Dynamic allocation, File Handling, Linear data structures List,

Stack, and Queue, Time and space requirementsLab: (i) Understanding Linux working environment, Practicing Linux commands related to file system, file handling, editors,

gcc compiler, gdb debugger; (ii) Basic data types, variables, input and output statements; (iii) Conditional and controlstructures; (iv) Arrays (one and two dimensional); (v) Functions and Recursion; (vi) Structures, Unions andEnumeration; (vii) Pointers; (viii) File handling; (ix) Dynamic memory allocation; (x) Linked Structures

Reference Books: 1. Brian W. Kernighan and Dennis M. Ritchie, The C Programming Language, Prentice Hall, India2. E. Balaguruswamy, Programming in ANSI C, Tata McGraw-Hill3. Byron Gottfried, Schaum's Outline of Programming with C, McGraw-Hill4. Seymour Lipschutz, Data Structures, Schaum's Outlines Series, Tata McGraw-Hill5. Ellis Horowitz, Satraj Sahni and Susan Anderson-Freed, Fundamentals of Data Structures in C, W. H. Freeman andCompany6. R. G. Dromey, How to Solve it by Computer, Prentice-Hall of India


5/32

Course Title Electromagnetism and Optics Course No. PH111Focus Group Physics L-T-P[C] 3-1-3[5]Offered for Type CorePre-requisite To take effect from July 20, 2014

Objective:

To develop an understanding of the foundations of opticsand electromagnetism.

Learning Outcome:

The students will be able to relate theoretical concepts withproblem solving approach in electrodynamics and optics.

Contents:Electromagnetism

Vector Calculus: Physical interpretation of Gradient, Divergence and Curl, Line, Surface, and Volume integrals.Electrostatics: Coulomb's law, Gauss's theorem, electrostatic potential, Laplace's equation, conductors, capacitors and

dielectrics.Magnetostatics: Biot Savart's law, Ampere's law, Lorentz force.Magnetic Induction: Faraday's law, Lenz's law, Self and Mutual inductance, energy stored in magnetic field.Maxwell's equations: Displacement current, electromagnetic waves, plane wave solutions of Maxwell's equation, Poynting

vector.

OpticsWave Nature of Light: Interference, Fresnel and Fraunhoffer diffraction, ordinary and extraordinary rays, Plane, circular and

elliptically polarized light, Birefringence, half wave plates.

Reference Books: 1. Optics by A. K. Ghatak; Tata Mcgraw Hill, 2007.2. Introduction to Electrodynamics by D. J. Griffiths; Prentice-Hall of India, 2005.


6/32

Course Title Linear Algebra and Calculus Course No. MA111Focus Group Mathematics L-T-P[C] 4 1 0 5Offered for Type CompulsoryPre-requisite Effect from July 2014

Objectives: 1. To train the undergraduate students towards basic

understanding of Mathematics.2. To provide student with sufficient knowledge in calculus

which can be used by the students in their respective fields.3. To develop a working knowledge of central ideas of Linear

Algebra.

Learning Outcomes: 1. Understanding of different structures and their propertie

like, Dependence, Basis and Dimension.2. Linear transformations between two structures and it

representation by Matrices.3. Integration in higher dimension and Vector Calculus.

Contents Linear Algebra: Fields, Matrices, Elementary Matrices, Row-reduced Echelon Form, System of Linear equations, Vector

spaces, Subspaces, Linear Independent set, Basis, Dimension, Direct sum, Quotient spaces, Linear Transformations,Range Space, Null Space, Rank-Nullity Theorem, algebra of Linear Transformations, Inner product space, Orthogonalsets, Cauchy-Swartz Inequality, Orthonormal sets, Gram-Schmidt Orthogonalization Process. Eigenvalues andeigenvectors of a linear operator, Characteristic polynomials, Minimal polynomial, Cayley-Hamilton theorem,Diagonalization, Singular value Decomposition.

Sequences, Series, Power series, Limit, Continuity, Differentiability, chain Rule, Partial Derivatives, Gradient, Directional

Derivative, Mean value theorems and applications; Linear Approximation, fundamental theorems of calculus, Newtonand Picard method; Taylors theorem, Approximation by polynomials, Bisection method, false position method, fixedpoint method, Newton-Raphson method, secant method, Critical points, convexity, maxima and minima, Trapezoidaland Simpsons rule, Curve tracing, length, Area, Volume, Double and triple integrals, Differentiability of vectorfunctions, arc length, Curvature, Continuity and Differentiability of vector functions, Vector Calculus, Greens Theorem,Gauss Theorem, Stokes Theorems.

Reference Books 1. K. Hoffman & R. Kunze, Linear Algebra, PHI, 2nd Edition.2. G. Strang, Linear Algebra and its applications, 4th Edition.3. A Course in Calculus and Real Analysis, Sudhir R. Ghorpade, Balmohan V. Limaye, Springer, 20064. A Course in Multivarible Calculus and Analysis, Sudhir R. Ghorpade, Balmohan V. Limaye, Springer, 20095. Calculus and Analytic Geometry, George B. Autor Thomas, Ross L Autor Finney, Publisher, 1992, 9th Edition.


7/32

Course Title Discrete Mathematics Course No. CS112Focus Group Computer Science and Engineering L-T-P [C] 3-1-0 [4]Offered for B.Tech. Type CompulsoryPre-requisite To take effect from July 2014

Objectives 1. To learn about proof techniques

2. To learn about combinatorics and graph theory3. To learn about abstract algebra

Learning Outcome To be able to model the computer science problems using

discrete mathematical structures

Contents Mathematical Logic: Propositional Logic, First Order Logic, Proof techniques, Mathematical Induction [Set Theory and

Algebra: ] Sets, Relations, Functions, Partial Orders, Lattice, Boolean Algebra, Groups and Rings, Error-correctingcodes, Secret sharing [Combinatorics: ] Recurrence relations, common techniques for solving recursions, Permutations,Combinations, Counting, Polya Counting, Stirling numbers, Bell numbers, Combinatorial Sums [Graph Theory: ]Connectivity, Trees and its properties, Cut vertices & edges, Covering, Matching, Independent sets, Colouring,Planarity, Isomorphism

Reference Books 1. Discrete Mathematics and Its Applications, Kenneth H. Rosen, McGrawhill, 1999, Fourth Edition2. A Course in Combinatorics, J. H. van Lint, R. M. Wilson, Cambridge University Press, 2009, Second Edition3. A Computational Introduction to Number Theory and Algebra, Victor Shoup, Cambridge University Press, 2008, SecondEdition


8/32

II Semester

Course Title System Exploration - Workshop Course No. ME121Focus Group Mechanical Engineering L-T-P[C] 3-0-3[4]Offered for B.Tech Type Hands-on Experience for CSE,

ME, EE, BISS, SSPre-requisite To take effect from July 2014

Objectives: 1. To develop basic knowledge of handling tools in differentareas of manufacturing.2. To provide a practical exposure to the vocational tradeswithin basic practical activities associated with all branchesof engineering.3. To instill confidence to manufacture, assess quality and toperform maintenance or correction in product design.

Learning Outcomes: 1. The importance of quality and design of the product withrespect to material use, design dimensions and tolerances.2. Understanding the activities and practical difficulties ofskilled workman who ultimately are involved in producing allgoods in any industry.3. Understanding the various aspects of materials

Contents:Introduction: Classification of engineering materials and their important mechanical and manufacturing properties, Phase

diagrams, Gibbs phase rule, Lever rule, Iron-Iron carbide Phase diagram, T-T-T Diagram, General classification of

manufacturing processes, Selection of manufacturing processes, Manufacturing attributes of manufacturing processes.Introduction to bulk property enhancement and surface property enhancement processes.Casting: Principles of metal casting ( Alloy solidification, homogenous and heterogeneous nucleation, cooling curve, concept

of supercooling, grain growth, avrami equation) Patterns, Types of Patterns, Pattern Materials and pattern allowances,Types of Sands, Characteristics of molding sand, Types of cores, Chaplets and chills, their materials and functions,Casting Defects.

Geometric Tolerance design: Concept of limits fits and tolerances, hole based system, shaft based system, different types offits

Metal Forming and Sheet metal operations: Basic Operations and their description (Forging, Rolling, Drawing, Extrusion,Bending, Spinning, Stretching, Embossing and Coining, Die and Punch operation in press work, Shearing, Piercing andblanking, Notching, Lancing. )

Material Removal Processes: Principles of metal cutting, Introduction to orthogonal and oblique cutting, Chip formation,Cutting tools, their materials and applications, Geometry and nomenclature of single point cutting tool, Tool life,

Cutting fluids and their functions, Basic machine tools (Lathe, milling machine, Drilling Machine, Shaper, Planer) andtheir applications, Introduction to grinding processes. Introduction to non-traditional machining processes (EDM, USM,CHM, ECM, LBM, AJM, and WJM).

Joining Processes: Fundamentals of Electric arc welding (MMAW, SAW, GMAW, GTAW, PAW) Gas welding and cutting,Resistance welding and Thermit welding, Soldering, Brazing and Braze welding, Adhesive bonding, Mechanicalfastening (Riveting, Screwing, etc. ). Plastic Processing: Plastics, their types and manufacturing properties,Introduction to Compression molding, Injection molding and Blow molding, Additives in Plastics. Modern Trends InManufacturing: Introduction to numerical control (NC) and computerized numerical control (CNC) machines and RapidPrototyping Techniques

Laboratory Work: Woodworking (Pattern making exercise), Preparation of aluminum casting, Machining exercise (turningoperations), Welding exercise (Preparation of square butt joints, T-joints using arc welding), Sheet metal fabrication(Preparation of tray, funnel, etc. ), Fitting exercise and heat treatment of steels, Demonstration on CNC Lathe, CNC

Milling. Demonstration on Rapid Prototyping Technique and Electric Discharge Machine.

Reference Books: 1. Degarmo, E. P. , Kohser, Ronald A. and Black, J. T. , Materials and Processes in Manufacturing, Prentice Hall of India

(2008) 8th ed.2. Kalpakjian, S. and Schmid, S. R. , Manufacturing Processes for Engineering Materials, Dorling Kingsley (2006) 4th ed.3. Chapman W. A. J. Workshop Technology 5e (In 3 Vols. ), CBS Publishers & Distributors, 20014. Groover, M. P. , 1996, Fundamentals of Modern Manufacturing, Prentice Hall International.5. Campbell, J. S. , Principles of Manufacturing, Materials and Processes, Tata McGraw Hill Company (1999)


9/32

Course Title Basic Electronics Engineering Course No. EE121Focus Group Electrical Engineering L-T-P [C] 3-1-3 [5]Offered for B.Tech. Type CompulsoryPre-requisite To take effect from July 2014

Objectives 1. To introduce different components used in electronic

circuits and explain their terminal characteristics2. To teach various methods of electronic circuit analysis and

design

Learning Outcomes 1. Ability to do time-domain analysis of electronic circuits for

various branch currents and node voltages2. Ability to appreciate the use of discrete components in

designing application specific circuits

Contents Components and Sources: Passive components, Resistance, Inductance, Capacitance; lumped element model; series,

parallel combinations; Kirchhoffs law: voltage, current, linearity, Voltage and current sources; non ideal sources;representation under assumption of linearity; controlled sources: VCVS, CCVS, VCCS, CCCS; concept of gain,transconductance, transimpedance.

Basic Circuit and Transient Analysis: Node and loop analysis; Choice of nodes and branches for efficient analysis.Superposition theorm; Thevenin's theorm; Norton's theorem, RL and RC Circuits, Sinusoidal Steady State Analysis, RLCcircuits, Time domain response of RL and RC circuits, Two-port Networks and Transfer Function, Sinusoidal steady stateresponse; phasor; impedance; transfer function of two port networks. Frequency response: concept; amplitude andphase response; Bode plots.

Discrete components and Circuits: Discrete electronic devices: Diode, zener diode, BJT (Bipolar junction transistor), LED,Photodiode, Phototransistor, varactor; characteristics and operation using equivalent circuits, Diode circuits; clipper,clamper circuits. DC power supply: rectifier- half wave, full wave (center tapped, bridge), zener regulated powersupply, regulation, BJT biasing; CE-biasing circuits, operating point; large/small signal models of CE-BJT amplifier.

Operational Amplifiers: Basic model; virtual ground concept; inverting amplifier; non-inverting amplifier, Integrator;differentiator; Basic feedback theory; +ve and -ve feedback; concept of stability; oscillator. Waveform generator forSquare wave, triangular wave, Wien bridge oscillator, Schmitt trigger; astable multivibrator, Introduction to activefilters, 555 timer: description and data sheet.

Logic gates and Applications: Numbering system, OR, NOT, AND, NOR and NAND; universal gates; XOR and XNOR gate;Truth tables, Combinational circuits. Designing combinational circuits: SOP, POS form; K-map; Optimization,Multiplexer; Gate base implementation. Logic function representation using truth table, Sequential circuits, flip-flops, S-R flip-flop; JK master slave flip flop; D-flip flop,

Laboratory: Using Laboratory Instruments; Characterization of Passive Circuit Elements (R, L, C); Time Response of RC andRL Circuits; Frequency Response of RC and RLC Circuits; Equivalent Circuits and Audio Signals; Diode Characteristics andDC Power Supply; Bipolar Junction Transistor (BJT) Circuits: Inverter and Common Emitter Amplifier; OperationalAmplifiers; Basic Combinatorial Circuits; Any new circuit.

Reference Books 1. Ralph J. Smith, R. C. Dorf, Circuits, devices and systems, John Wiley, 5th Edition, 2009 reprint2. Hayt, Kammerly and Durbin, Engineering Circuit Analysis, Tata McGrawHill, 7th Edition, Special Indian Edition, 20103. R. L. Boylestad, L. Nashelsky, Electronic devices and circuit theory, Prentice Hall, 10th Edition, 20094. A. S. Sedra, K. C. Smith, Microelectronic circuits, Oxfort University Press, 6th Edition, 2011


10/32

Course Title Engineering Mechanics Course No. ME122Focus Group Physics L-T-P[C] 3-0-3[4]Offered for B.Tech Type Basic for CSE, ME, EE, SS, BISSPre-requisite To take effect from July 2014

Objectives: 1. To provide practice to apply knowledge in work, energyand momentum to study rigid body mechanics2. To educate about the forces and inertia and its effect ofmotion of rigid bodies.

Learning Outcomes: 1. To analyse forces and moments on static rigid body,moments on or between multiple static rigid bodies andinternal forces or moment within them2. To model practical structural problems using concepts offree body diagrams and equilibrium conditions

Contents:Basic dimensions in Mechanics, Law of dimensional homogeneity, Vector and Scalar Quantities, Elements of vector algebra.

Moment of force about a point/axis, Couple, Moment of Couple about a line. Free Body Diagram, Equations ofEquilibrium, Static indeterminacy, Equilibrium in three dimensions Coulomb Fraction, Surface contact friction,Transmission of power through belt. Screw jack, screw thread. Moment of area and centroid, Pappus-GuldinusTheorems, Second moments and product of Area, Transfer theorems, Principal axes. Inertial quantities, Mass-Inertia/Area-Inertia terminology, Translation of coordinate axes.

Kinematics of particles, Velocity and acceleration in terms of path variables, simple relative motion, motion of particle

relative to a pair of translating axes Newtons laws of rectangular coordinates/rectilinear translation, cylindricalcoordinate/Central force motion. Conservation of Mechanical Energy, Work-energy equations, Center of mass basedKinetic energy, Principle of virtual work. Impulse and Momentum relation of particles, Moment of momentumequations-single particle/system of particles Translation/Rotation of rigid bodies, Charles theorem, time derivative ofvector for different references. Parallel axis theorems, Rotational Pure rotation of a body of revolution about its axis ofrevolution/combined with translation. Three dimensional rotation, moment of inertia tensor, relation between angularmomentum and torque in three dimensions, Gyroscopic forces. Simple harmonic oscillator, phase and phase difference,phasor diagram, oscillator with constant friction/velocity dependent damping. Forced Oscillations, power adsorption,lightly damped oscillator Motion in non-inertial frames, centrifugal foce, Coriolis force/acceleration, rate of change ofvector in inertial and rotating frames.

Experiments: Vector Analysis with force table; Motion Studies Position Vs time, Velocity Vs Time; Measuring Accelerationdue to gravity; Projectile launch; Centripetal motion of Pendulum; Dynamics Atwood Machine; Dynamics experimentswith Friction; Sound Waves Frequency analysis;

Reference Books: 1. Engineering Mechanics, Irving Shames, Prentice Hall, 20032. Engineering Mechanics, Dietmar Gross, Werner Hauger, Jrg Schrder 2012, Springer3. Engineering Mechanics, J. L. Meriam, L. G. Kraige, John Wiley and Sons, 2002


11/32

Course Title Complex Analysis and Differential Equations Course No. MA121Focus Group Mathematics L-T-P[C] 4-1-0[5]Offered for Type CompulsoryPre-requisite To take effect

fromJuly 2014

Objectives: 1. Understanding of fundamentals of complex analysis.

2. Understanding of fundamentals of differential equations.

Learning Outcomes: 1. Techniques for differentiation and integration of complex

valued functions.2. Finding analytical and series solution for ordinary andpartial differential equations.

Contents:Complex numbers, algebra of complex numbers, functions, continuous and analytic functions, Cauchy Riemann Equations,

elementary functions, Integral of a complex function, Cauchy-Goursat theorem, Cauchys Integral formula, derivatives ofanalytic functions, Moreras Theorem, Liouvilles theorem, maximum modulus principle, Taylor series, singularity, typesof singularities, Laurant series, Cauchys Residue Theorem, Jordans Lemma, Evaluation of Real integrals.

First Order Ordinary Differential Equations, Geometrical interpretation of solution, Solution methods for separableequations, Exact equations, Linear equations, Picards Theorem for IVP, Picards iteration method, Eulers Method,Improved Eulers Method. Second Order Linear differential equations: General solution of homogeneous equation,Existence and uniqueness of solution of IVP, Wronskian and general solution of nonhomogeneous equations, Euler-

Cauchy Equation, Extensions of the results to higher order linear differential equations; Power Series Method-application to Legendre equation, Legendre Polynomials, Frobenius Method, Bessel equation, Properties of Besselfunctions, Sturm-Liouville BVP, Orthogonal functions, System of first order ODE and its stability, Laplace Transform andFourier series.

Partial Differential equations of first order, solution to pde of first order, Cauchys method for first order pde, Charpitsmethod, Classification of second order equations, characteristics, Riemann Method, uniqueness theorem for hyperbolicequations with given initial and boundary conditions, Dirichlet and Neumann problems, Poisson Integral, Green andNeumanns Function, Heat Equation.

Reference Books: 1. Complex Analysis, Lars V Ahlfors, Tata McGraw Hill Education, 2013, 3rd Edition.2. James W. Brown, Ruel V. Churchill, Complex Variables and Applications, Seventh Edition.3. Serge Lang, Complex Analysis, Fourth Edition.4. G. F. Simmons, Differential Equations with applications and Historical Notes, TATA McGraw, 2nd Edition.5. William E. Boyce, Richard C. DiPrima, Elementary Differential Equations and Boundary Value Problems, Tenth Edition.6. K. Sankara Rao, Introduction to Partial Differential Equations.


12/32

Course Title Data Structures and Algorithms Course No. CS121Focus Group Computer Science and Engineering L-T-P [C] 3-1-3 [5]Offered for B.Tech. Type CompulsoryPre-requisite Computer Programming CS111 To take effect from July 2014

Objectives 1. To introduce algorithms analysis and design techniques

2. To understand algorithms of various data structures usedfor searching, sorting, indexing operation

Learning Outcomes 1. Ability in using the appropriate algorithm for searching,

sorting, indexing operations2. Designing of new algorithms3. Analyzing complexity issues of algorithms

Contents Algorithm analysis and complexity: Big/little -Oh, Omega, Theta notation, Recurrence equations [Sorting algorithms: ]

Bubble, Selection, Insertion, Shell, Quick, Merge sorting algorithms, Internal and external, stable sorting techniques[Abstract data types: ] List, Stack, Queue, Circular Queues, Tree, Binary trees and Tree traversal and applications ofvarious ADTs [Search trees: ] Binary search trees, Balanced search trees, AVL trees, Splay trees, B-Trees [Heaps: ] Heaporder property and min/max heaps; Sets: and basic operations on Sets [Hashing: ] Hash tables, hash function, Hashtable ADT and operations, Open and closed hashing, External and internal hashing, Closed hashing - Collision resolvingmethods, Rehashing, External hashing algorithms - extendible hashing [Graph algorithms: ] Definitions, Representation,Traversal, Shortest-path algorithms, Minimum spanning tree algorithm, Topological sorting, Graph matching[Algorithm design techniques: ] Divide and Conquer, Greedy, Dynamic Programming technique

Laboratory(i) Implementation of data structures using object oriented programming language(ii) Verifying run time performance and asymptotic behavior of various data structures and related algorithms(iii) Live applications of data structures

Reference Books: 1. Data Structures and Algorithms, by Alfred V. Aho, Jeffrey D. Ullman, John E. Hopcroft, Pearson press2. Data Structures and Algorithm Analysis in C++, by Mark Allen Weiss, Third edition, Pearson press3. Data Structures and Algorithms in Java, by Michael T. Goodrich and Roberto Tamassi, Wiley Publication


13/32

III Semester

Course Title Chemistry Course No. CY211Focus Group Chemistry L-T-P[C] 3 0 3 4Offered for Type CorePre-requisite To take effect from July 20, 2014

Objectives:

1. This is a course designed to relate the fundamentalprinciples of chemistry with practical problems encounteredfor engineers. Emphasis will be placed on problem-solving.2. This course will enable the students to scientific logics ofvarious laboratory safeties and fire in different type of labs.Laboratory will correlate with lecture material.

Learning Outcomes:

1. Understanding the behavior of matter and materials usingfundamental knowledge of their nature2. Predict potential complications from combining variouschemicals or metals in an engineering setting.3. Maintaining safe laboratory practice while working in laband otherwise.4. Keep notebooks of laboratory experiments and be able toevaluate results based on their own notes.

Contents:Thermodynamics of Chemical Processes: Concept of entropy, Chemical potential, Equilibrium conditions for closed systems,

Phase and reaction equilibria,

Maxwell relations, Real gas and real solution.Electrochemical Systems: Electrochemical cells and EMF, Applications of EMF measurements:Steady state approximation, Chain reactions, photochemical kineticsBasic Spectroscopy - Fundamentals of Microwave, IR and UV-VIS Spectroscopy: Basic concepts of spectroscopy, Selection

rule, Determination of molecular structure.Coordination Chemistry: Coordination numbers, Chelate effect, Coordination complexes and application.Bio-inorganic chemistry: Metal ions in Biological systems, environmental aspects of Metals, NOx, CO, CO2Organic Reaction Mechanism: Mechanisms of selected organic, bio-organic, polymerization and catalytic reactions.Stereochemistry of Carbon Compounds: Selected Organic Compounds: Natural products and BiomoleculesOrganic material: polymers, synthetic and natural polymers and their applications

Lab:

i) Aldol condensation (preparation of tetra phenyl cyclo pentadienone)

ii) Preparation of complex salt of (Co (en) 6) Cl3iii) Preparation of double salt crystal of ammonium copper (II) sulphate hexahydrateiv) Saponification (Preparation of soap)v) Preparation of Nylon-6, 6vi) To prepare hexamine coblt (III) Chloride (Co (NH3) 6)Cl3vii) Determination of dissolved oxygen in a water by Winklers methodviii) To use Fourier transform infrared (F. T. I. R) spectroscopy in combination with A. T. R. (Attenuated total reflectance)

technique for bio analysis of caffine in tea & coffee and also get IR spectrum of Aldol product and analysis of thespectrum.

ix) To plot the excitation and emission spectrum of curcumin in solvents respectively ethanol and hexaneand find stokes shiftby using fluorescence spectroscopy.

x) To determine the heat capacity, glass trasition temperature and the change in heat capacity for glass transition

temperature for polystyrene by using Differential scanning calorimetry (DSC).xi) To understand the theory and working principle of cyclic voltammetery and to perform CV on ferricyanide solution and toknow its electrical properties for example Ep, Ip and diffuse rate etc

xii) Determine of the Enantiomeric Purity of Naproxen and Ibuprofen.xiii) A General chemistry laboratory Experiment relating Electron configuration and Magnetic Behaviour.

Reference Books: 1. Chemistry: The molecular nature of Matter and Change 6th edition, Silberberg, Mc Graw Hill Education2. Chemistry 5th edition, McMurry and Fay, Pearson3. Laboratory Safety for Chemistry Students Laboratory Safety for Chemistry Students, 1st Edition, Robert H. Hill, DavidFinster, Wiley, 2010


14/32

Course Title Signals and Systems Course No. EE213Focus Group Electrical Engineering L-T-P [C] 3-1-0 [4]Offered for B.Tech. Type CompulsoryPre-requisite To take effect from July 2014

Objectives 1. Fundamentals of continuous-time and discrete-time linear

systems and their dynamical properties.2. Understanding of frequency domain transform analysis of

LTI systems.3. State space analysis of I/O systems.4. Design and analysis of various Filters.

Learning Outcomes 1. Understanding the practical relevance of system

properties such as linearity, time invariance, stability andcausality and use of mathematical transform methods toanalyze LTI systems.

2. Analyzing continuous time systems using Fouriertransform as well as Laplace transform and discrete timesystems using Discrete Time Fourier Transform as well asZ-transform.

3. Fundamentals of filter concepts

Contents Continuous and discrete time signals: Classification of signals, Signal Energy, Signal Power, Useful operation on signals and

signal models, even and odd functionsFrequency Domain Representation: Fourier series, Fourier, Laplace and Z transform techniques, DTFT, DFT.Sampling: Sampling Theorem, Signal Reconstruction, Application of the sampling theorem, Analog to Digital Conversion.LTI systems: Classification of Systems, I/O description, impulse response and system functions, pole/zero plots, state space

description, block diagram representation, Time and Frequency domain analysis, FIR and IIR Systems Analog Filters: Low-pass, high-pass, band-pass and band-stop (band-reject) filters. Filter characteristics, filter circuit transfer

function, and its poles and zeros. First order, second order active and passive filters and building blocks to constructhigher order filters.

Reference Books 1. Principles of Linear Systems and Signals, B. P. Lathi, Oxford University Press, 2009, Second Edition2. Signals and Systems, Simon Haykin and Barry Van Veen, WILEY, 2008, Second Edition3. Signals and Systems: Continuous and Discrete, Rodger E. Ziemer, William H. Tranter, and D. Ronald Fanin, Prentice Hall,

1998, Fourth Edition4. Fundamentals of Signals and Systems Using the Web and MATLAB, Edward W. Kamen and Bonnie S. Heck, Prentice-Hall,

Inc. , 2000, Second Edition5. Signals and Systems, Alan Oppenheim , and Alan S. Wilsky , PHI, 2e


15/32

Course Title Algorithm Design and Analysis Course No. CS212Focus Group Computer Science and Engineering L-T-P [C] 3-0-0 [3]Offered for B.Tech. Type CompulsoryPre-requisite To take effect from July 2014

Objectives

1. To learn about various algorithm design techniques2. To learn about advanced data structures3. To learn about complexity analysis of algorithms

Learning Outcomes

1. Ability to apply randomization to design algorithms2. Ability to solve intractable problems using approximationalgorithms3. To model optimization problems as Linear Program

Contents Advanced Data Structures: Amortized analysis, Binomial heaps, Fibonacci heaps, Splay Trees etc.Linear-programming: Definitions of canonical and standard forms, feasibility and optimization, Structure of Optima, Duality

Theory, Duality Applications, Simplex Algorithm, Ellipsoid algorithm Approximation Algorithms: Relative Approximations, PAS and FPAS Scheduling, etc.Randomized algorithms: Kargers min-cut, Balls and Bins model and its applications, Hashing, Bloom filters, Random Graphs,

Bounds: Markov, Chebyshev and Chernoff and their applications in finding upper bounds on algorithm errorsNumber Theoretic Algorithms: Primality testing, and applications to Cryptosystems: Diffie Hellman, RSA

Reference Books 1. Algorithm Design, Jon Kleinberg, Eva Tardos, Pearson Education Limited, 2014, First Edition2. Introduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, MIT, 2009, Third

Edition3. Probability and Computing: Randomized Algorithms and Probabilistic Analysis, Michael Mitzenmacher, Upfal, Cambridge

University Press, 20054. Approximation Algorithms, Vijay V. Vazirani, Springer, 2002


16/32

IV Semester Course Title Digital Logic and Design Course No. EE222Focus Group Electrical Engineering L-T-P [C] 3-0-3 [4]

Offered for B.Tech. Type CompulsoryPre-requisite To take effect from July 2014

Objectives 1. To introduce the basic concepts of digital system and the

use of Boolean algebra in logic analysis and design2. Understand the principles and methodology of digital logic

design at the gate and switch level, including bothcombinational and sequential logic elements.

3. To introduce basic tools of logic design and provide hands-on experience designing digital circuits and componentsthrough simple logic circuits to hardware descriptionlanguage and interface programming in C.

4. To appreciate the uses and capabilities of a modern FPGAplatform

Learning Outcomes Students will be able to

1. Apply Boolean algebra and other techniques to express andsimplify logic expressions.

2. Analyze and design combinational and sequential digitalsystems.

3. Use different techniques among them a hardwaredescription language and a programming language, todesign digital systems.

Contents

Number system: binary numbers, 1s and 2s complement, arithmetic operations in integer and floating point systems; ASCII,binary and gray codes;Boolean algebra: Boolean Equations, Minimization of Boolean functions; Designing combinational Circuits using gates and/or

MultiplexersCombinational circuit: Adder, decoder, multiplexers, code converters (binary, gray and BCD);Sequential circuit: Bistable, Monostable, latches and flip-flops, counters (binary, ring and Johnson), shift register, timer

circuits;Hardware Description Languages: Combinational Logic, Structural Modeling, Sequential Logic, More Combinational Logic,

Finite State Machines, Parameterized Modules, TestbenchesDigital IC families: DTL, TTL, ECL, MOS, CMOS and their interfacing. ADC and DAC: Sample and hold circuits, ADCs, DACs.Memories: semiconductor memories, PALs, PLAs and FPGAs; Pipelining and timing issues, PROMs;

LaboratoryPriority encoder, multiplexer and decoder; VHDL code for simulation of a 4- Bit fast look ahead carry adder; VHDL code for

simulation of an 8-bit signed integer multiplier.i) Familiarization with logic gates and logic building.ii) Encoders and decodersiii) Adder circuits: half adder and full adderiv) Flip-flops and countersv) Latches and memoriesvi) Seven segment displayvii) Arithmetic logic circuitsviii) Digital to analog convertersix) Analog to digital converters

x) Serial communicationxi) AND, OR and EX_ OR gates using Nand (7400) gates; BCD to 6-3-1-1 Code converter; 6-3-1-1 to Gray Code converter; fulladder circuit using AND, OR and XOR gates; a 4 - Bit comparator using logic gates; Pseudo-random bit generator; 4 - bitripple carry adder; Master - Slave J-K Flip-Flop using Logic gates; Bi - directional counter using J-K Flip-flops; using

Reference Books 1. Ronald J. Tocci, Neal Widmer, Greg Moss, Digital Systems: Principles and Applications, 10th edition, Pearson, 2009.2. M. Morris Mano, Michael D. Ciletti, "Digital Design: With an Introduction to the Verilog HDL", 5th edition, Prentice Hall of

India, 20123. D. M. Harris and S. L. Harris, Digital Design and Computer Architecture, Second Edition, Morgan Kuffmann


17/32

Course Title Probability, Statistics and Random Processes Course No. MA221Focus Group Mathematics L-T-P[C] 4-1-0[5]Offered for Type CompulsoryPre-requisite To take effect from July 2014

Objectives:

1. To equip the students with the broad perspective ofprobability theory.2. To develop the understanding of various discrete andcontinuous distributions along with their properties.3. To understand and differentiate among various statisticaland random processes techniques.

Learning Outcomes:

1. Ability to analyze and differentiate between deterministicand random environment.2. Ability to select an appropriate distribution for analyzingdata specific to an experiment.3. Understanding of various statistical and random processestechniques which can be applied to data arising in variousapplications.

Contents:Introduction to Probability, axioms of probability, Conditional probability, Bayes Theorem, Random Variable, Discrete andContinuous random variables, Distribution Function and Probability Density (Mass) Function, Expectation and Moments ofrandom variables, Moment Generation Function and Characteristic Function, Jointly distributed random variable,Transformation of Random Variables, Special Discrete distributions, Special Continuous distributions, Chebyshevs inequality,Law of large numbers, Central Limit Theorem,Regression Analysis, Parameter Estimation, Maximum Likelihood Estimator, Confidence Interval, Hypothesis Testing,Goodness of Fit test,Stochastic Processes, Markov Chain, Markov Processes, Queuing models.

Reference Books: 1. Sheldon M. Ross, Introduction to probability and statistics for engineers and scientists, Elsevier, 2012.2. Vijay K. Rohatgi and A. K. Md. Ehsanes Saleh, An Introduction to Probability and Statistics, Wiley, 2011.3. Richard A. Johnson, Miller and Freunds Probability and Statistics for Engineers, PHI Learning, 2010.4. Athanasios Papoulis and S. Unnikrishna, Probability, Random Variables, and Stochastic Processes, Tata Mc-gray Hill,2002.


18/32

Course Title Operating Systems Course No. CS222Focus Group Computer Science and Engineering L-T-P [C] 3-0-3 [4]Offered for B.Tech. Type CompulsoryPre-requisite To take effect from July 2014

Objectives 1. To learn about design principles of operating systems2. To do a case study of Operating System

Learning Outcomes 1. Ability to modify and compile OSs2. Ability to solve synchronization problems in OperatingSystems

Contents Overview of Operating Systems: Types of Operating Systems, System calls and OS structureProcesses Management: Process, Threads, CPU SchedulingProcess Coordination: Mutual Exclusion, Mutex Implementation, Semaphores, Monitors and condition variables, DeadlocksMemory Management: Swapping, Paging, Segmentation, Virtual Memory, Demand Paging, Page Replacement AlgorithmsStorage Management: I/O devices and drivers, Disks and File Systems, File layout and Directories, File system performance,

File system reliabilityProtection and Security: System Protection, System Security

Laboratory

(i) Designing a shell in Minix 3(ii) Multithreaded programming using pthread(iii) Solving the Sleeping-Barber problem(iv) Modification of scheduling algorithm in Minix 3(v) Solving the Producer-Consumer problem over a network(vi) Finding text, data, and stack segments of a process in Minix 3(vii) Implementation of page replacement algorithms(viii) Changing file attributes in Minix 3(ix) Implementing an encrypted file system in Minix 3(x) Implementing symbolic links in Minix 3

Reference Books 1. Operating System Concepts, Abraham Silberschatz, Peter Baer Galvin, Greg Gagne, John Wiley & Sons, Inc, 2009, Eighth

Edition2. Operating Systems Design and Implementation, Andrew S. Tenenbaum, Albert S. Woodhull, Pearson Prentice Hall, 2006,

Third Edition3. Operating Systems Internals and Design Principles, William Stallings, Prentice Hall, 2012, Seventh Edition


19/32

Course Title Principles of Database Systems Course No. CS223Focus Group Computer Science and Engineering L-T-P [C] 3-0-0 [3]Offered for B.Tech. Type CompulsoryPre-requisite To take effect from July 2014

Objectives 1. To understand the concepts of database management

system and its applications, data modeling, databasedesign, and query languages.

2. To understand different files structures, transactionmanagement, concurrency control, database recovery,query processing and optimization.

Learning Outcomes 1. Ability to apply different data modeling methods in

requirement analysis, design, and implementation ofdatabase system.

2. Ability to apply the normal forms for efficient designing ofrelational database

3. Ability to use appropriate storage and access structures4. Ability to use techniques for transaction management,

concurrency control, and recovery5. Ability to analyze complexity issues of query execution

Contents Database System Concepts and Architecture, Data Modeling Using the Entity-Relationship (ER) Model, The Enhanced Entity-

Relationship (EER) ModelRelational Data Model and Relational Database Constraints, Relational Database Design by ER-and EER-to-Relational

Mapping, Relational Algebra and Relational Calculus, SQL: Schema Definition, Constraints, Queries, and ViewsFunctional Dependencies and Normalization, Algorithms for Query processing and optimizationDisk Storage, Basic File Structures, and Hashing, Indexing Structures for FilesTransaction Processing Concepts and Theory, Concurrency Control Techniques and Protocols, Database Recovery

Techniques

Reference Books 1. Elmarsi R, & Navathe S B, Fundamental of Database System, 5/e, Pearson Education, 20072. Ramakrishna R. & Gehrke J, Database Management Systems, 3/e, Mc-Graw Hill, 20033. Hector G Molina, Jeffrey D. Ullman and Jennifer Widom, Database Systems The Complete Book, Pearson Education, 2001


20/32

Course Title B. Tech. Project Course No. CS299Focus Group Computer Science and Engineering L-T-P [C] 0-0-9 [3]

Offered for 5th to 8th Semester Type CompulsoryPre-requisite To take effect from July 2014

Objectives 1. To gain hands on experience on innovative technologyproject

2. To prepare the students to solve/work on the realworld/practical/theoretical problems involving issues incomputer science and engineering

Learning Outcomes 1. Ability to design and model a system2. Ability to plan and execute well defined objective3. Ability to work in team at component level and system

level4. Ability to troubleshoot5. Ability to reuse- or integrate with- existing components6. Ability to derive performance metrics and assess

quantitatively the performance of system7. Ability to report and present the findings in standard

formats


21/32

V Semester

Course Title Data Communication Course No. CS311Focus Group Computer Science and Engineering L-T-P [C] 3-1-0 [4]Offered for B.Tech. Type CompulsoryPre-requisite To take effect from July 2014

Objectives 1. To understand basic components of a data communicationsystem, the transmission and reception techniques forcommunications, and the channel impairments and theirinfluence on data transmission

2. To understand different types of channel, medium,resource sharing and access techniques

3. To understand issues of flow control and error control4. To introduction principles of packet switching techniques

and data networking

Learning Outcomes 1. Ability to identify basic components of data communicationsystem

2. Ability to distinguish various data transmission andmodulation techniques

3. Ability to analyse the impact of various channelimpairments on data transmission

4. Ability to identify different data networks and thenetworking hardware

Contents Communication problem and system models, components of communication systems, communication channels and their

characteristics, mathematical models for communication channels, multiple access techniques, link budget analysisRepresentation of deterministic and stochastic signals, random noise characterization in communication systems, signal-to-

noise ratio, characterization of communication signals and systems: signal space representations, representation ofanalog and digitally modulated signals, spectral characteristics of modulated signals

Optimal receivers: Receivers for signals corrupted by AWGN, Error performance Analysis of receivers for memory-lessmodulation, optimal receivers for modulation methods with memory, OFDM

Source coding: Huffman, Lempel-Ziv, runlength coding, PCM, ADPCM, DM, ADMChannel coding: Linear block codes, CRC, convolution codes, Viterbi decoding algorithmPrinciples of switching; Local area networks: Ethernet, Fast Ethernet, Token Ring, Introduction to Gigabit Ethernet and

Wireless LANs; Hubs, bridges and switches

Reference Books

1. U. Madhow, Fundamentals of Digital Communication, Cambridge University Press, 20082. B. P. Lathi and Z. Ding, Modern Digital and Analog Communication Systems, Oxford University Press, 20103. William Stallings, Data and Computer Communications, 8E, Prentice Hall, 20104. J. G. Proakis and M. Salehi, Digital communications, McGraw-Hill Higher Education, 2008


22/32

Course Title Software Engineering Course No. CS312Focus Group Computer Science and Engineering L-T-P [C] 3-0-3 [4]Offered for B.Tech Type CompulsoryPre-requisite To take effect from July 2014

Objectives 1. To understand the best practices in software

engineering.2. To develop the necessary skills to handle software

projects in a principled way.

Learning Outcomes 1. Ability to analyze and specify software requirements.2. Ability to apply software engineering principles and

techniques to develop large-scale software systems.3. Ability to plan and work effectively in a team.

Contents Introduction: industrial strength software, problem of software development, problem of scale, basic process-based

approach, etc.Software Process Models: concept of processes, process specification, different process models and when they are usefulRequirement analysis and specification: the basic problem, the sub-phases in the phase, analysis techniques (structured

analysis), specification, validation, function point analysisProject planning: effort, schedule, quality, project monitoring, and basic Configuration ManagementDesign principles and structured design methodology: partitioning, top-down and bottom-up, step-wise refinement, coupling

and cohesion

Coding: style, structured programming, verification conceptsTesting: testing purpose, levels of testing, black box testing, white box testing, different test case generation approaches Agile Software Development: The agile philosophy, agile process models, Agile project management

Laboratory(i) Preparing Software Requirements Specification Document(ii) UML designing(iii) Object oriented programming(iv) Software Testing

Reference Books 1. "An Integrated Approach to Software Engineering" by Pankaj Jalote, 3/e, Narosa Publishing House2. "Software Engineering: A Practitioner's Approach" by Roger S Pressman, 7/e, Tata McGraw Hill3. "Fundamentals of Software Engineering" by Rajib Mall, 4/e, PHI.


23/32

Course Title Computer Organization and Architecture Course No. CS313Focus Group Computer Science and Engineering L-T-P [C] 3-0-0 [3]Offered for B.Tech. Type CompulsoryPre-requisite Introduction to Electronics To take effect from July 2014

Objectives 1. To understand aspects of computer architecture and

program performance2. To provide essential understanding of different

subsystems of modern computer system and designaspects these subsystems

3. To understand the stages in instruction life cycle4. To understand performance enhancement methods in

instruction execution

Learning Outcomes 1. Ability to identify the basic components and design of a

computer, including CPU, memories, and input/outputunits

2. Ability to identify the issues involved in the instructionexecution and various stages of instruction life stage

3. Ability to identify the issues related to performanceimprovement

4. Ability to distinguish performance tradeoff betweendifferent memory units and instruction sets

Contents Basic functional blocks of a computer: CPU, memory, input-output subsystems, control unit. Instruction set architecture of a

CPU - registers, instruction execution cycle, RTL interpretation of instructions, addressing modes, instruction set,Instruction set architecture CISC, RISC, Case study - instruction sets of common CPUs

CPU Subblock, Datapath - ALU, registers, CPU buses; Control unit design: hardwired and microprogrammed designapproaches

Memory system design: semiconductor memory technologies, memory organization, cache memory hierarchyPeripheral devices and their characteristics: Input-output subsystems, I/O transfers - program controlled, interrupt driven and

DMA, Secondary storage devicesPrivileged and non-privileged instructions, software interrupts and exceptions, Programs and processes - role of interrupts in

process state transitionsPipelining: Basic concepts of pipelining, throughput and speedup, pipeline hazardsIntroduction to superscalar processors architecture: parallel pipelines, out of order execution, branch predictionIntroduction multithreaded processors architecture and multicore processors architecture

Reference Books 1. David A. Patterson and John L. Hennessy, Computer Organization and Design: The Hardware/ Software Interface, Elsevier2. C. Hamachar, Z. Vranesic and S. Zaky, Computer Organization, McGraw Hill3. John P. Hayes, Computer Architecture and Organization, McGraw Hill4. William Stallings, Computer Organization and Architecture: Designing for Performance, Pearson Edu5. Vincent P. Heuring and Harry F. Jordan, Computer Systems Design and Architecture, Pearson Edu6. Shen and Lipasti Modern Processor Design: Principles of Superscalar Processors, Tata-McGraw Hill


24/32

Course Title Theory of Computation Course No. CS314Focus Group Computer Science and Engineering L-T-P [C] 3-0-0 [3]Offered for B.Tech. Type CompulsoryPre-requisite To take effect from July 2014

Objectives 1. To learn about languages, grammars, and computation

models2. To learn about computability3. To learn about computational complexity

Learning Outcomes 1. To be able to distinguish between computable and un-

computable problems2. To be able to distinguish between tractable and

intractable problems

Contents Finite Automata and Regular Languages: DFA, NFA, Regular expressions, Equivalence of DFA and NFA, Closure properties of

Regular Languages, Regular Pumping lemma, Myhill-Nerode theorem and State minimizationPush-Down Automata and Context Free Languages: Designing CFGs, Ambiguity, Chomsky Normal Form, Closure properties,

CF Pumping LemmaComputability: Turing Machines, Church-Turing Thesis, Variants of Turing machines, non-determinism, enumerators,

Decidability, Halting problem, Reducibility, Rice's theorem, Undecidability, Godel's incompleteness theorem

Computational Complexity: The classes P and NP, Boolean circuits, NP Completeness (example problems: SAT)

Reference Books 1. Introduction to Automata Theory, Languages, and Computation, John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman,

Pearson, 2007, Third Edition2. Introduction to the Theory of Computation, Michael Sipser, Cengage Learning, 2013, Third Edition3. Elements of the Theory of Computation, Harry R. Lewis, Christos H. Papadimitriou, Prentice-Hall, 1997, Second Edition


25/32



Objectives 3. To gain hands on experience on innovative technology

project4.

To prepare the students to solve/work on the realworld/practical/theoretical problems involving issues incomputer science and engineering

Learning Outcomes 8. Ability to design and model a system9. Ability to plan and execute well defined objective10.

Ability to work in team at component level and systemlevel

11. Ability to troubleshoot12. Ability to reuse- or integrate with- existing components13.

Ability to derive performance metrics and assessquantitatively the performance of system

14. Ability to report and present the findings in standardformats


26/32

VI Semester

Course Title Computer Networks Course No. CS321Focus Group Computer Science and Engineering L-T-P [C] 3-0-3 [4]Offered for B.Tech. Type CompulsoryPre-requisite To take effect from July 2014

Objectives 1. To understand the organization of computer networks,

factors influencing on the performance of computernetworks, and the reasons for having variety of differenttypes of networks

2. To understand the Internet structure, various protocolsof the Internet and how these protocols address thestandard problems of networking and the Internet

3. Hands-on experience on networking fundamentalsthrough practical sessions

Learning Outcomes 1. Familiarity with the essential protocols of computer

networks and their operations2. Design and implementation of computer networks3. Identifying various design parameters such as latency,

bandwidth, error rate, throughput, and their influence onnode/link utilization and performance

Contents Layer approach, Packet switching techniques, Performance metrics delay, loss, throughput, bandwidth delay product,latency

Applications: Network programming, socket abstraction, client server architecture, naming and addressing, electronic mail,file transfer, remote login, world wide web, domain name service, journey of a packet

Transport Layer: Transmission Control Protocol flow control, error control, congestion control, header, services,connection management, timers, congestion control techniques; User Datagram Protocol

Network Layer: Internetworking, Tunneling, Encapsulation, Fragmentation, Internet Protocol and its operation, etc. ,Routing algorithms distance vector and link state algorithm and Routing protocols, the related protocols, ICMP, ARP,RARP, DHCP, IPv6, RIP, OSPF

Advanced Internetworking, Multicast routing, Queuing disciplines and buffer management techniquesData link layer: framing, medium access mechanismNetwork security: Public key and private key cryptography, digital signature, firewalls

Laboratory (1) Networking hardware

(a) Understanding cables, switches, routers(b) Setting up switching network(c) Setting up subnets and routing across the subnets

(2) Socket programming - Development of client-server application using sockets (possible examples, file transfer, peer-peerapplications, chat, network monitor etc. )

(3) Networking commands - ifconfig, route, arp, arping, ping, netstat. tcpdump, host, nslookup, dig, ftp, scp, ssh,finger, dhclient, dhcrelay etc. ,

(4) Protocol analyzer - closely looking at protocols (HTTP, TCP, UDP, ICMP, 802. 3, DHCP, DNS etc. ) headers and analyzingthe interactions between client and server of different applications

(5) QualNet simulator/Packet Tracer(a) Implementation of ARQs - Stop-and-wait, Sliding Window goback N etc.(b) Verifying operations of routing protocols(c) Verifying influence of congestion on end users performance(d) Verifying basic congestion control algorithms Reno, New Reno, Cubic(e) Verifying router buffer size on end users performance

Reference Books 1. William Stallings, Data and Computer Communications, 8E, Prentice Hall, 20102. Perterson & Davie, Computer Networks: A Systems Approach, 4E, Morgan Kaufmann, 20083. Ross & Kurose, Computer Networks: A Top Down Approach, 4E, Pearson Education 2010


27/32

Course Title Programming Languages and Compiler Course No. CS322Focus Group Computer Science and Engineering L-T-P [C] 3-0-3 [4]Offered for B.Tech. Type CompulsoryPre-requisite To take effect from July 2014

Objectives

1. To learn about different types of grammars used inCompilers

2. To learn about different phases of a Compiler

Learning Outcomes

1. Ability to use Lex for designing lexical analyzers2. Ability to use Yacc for designing syntax Analyzers3. Ability to design parsing tables from grammars

Contents Introduction: Structure of a Compiler, Different types of Programming Languages: Imperative Languages, Block Structured

Languages, Functional Programming Languages, Declarative Programming Languages, Object-oriented ProgrammingLanguages

Lexical Analysis: Input Buffering, Token Specification, Token Recognition, LexSyntax Analysis: Context Free Grammars, Top-Down Parsing, Bottom-Up Parsing, SLR Parser, LR(1) Parser, LALR Parser,

Removing Ambiguity in Grammar, YaccSyntax Directed Translation: Syntax Directed Definition, Syntax Directed Translation, L-attributed SDD

Intermediate Code Generation: Syntax Trees, Three Address Code, Expression Translation, Control FlowRun Time Environments: Storage Organization, Stack Allocation, Heap Management, Garbage CollectionCode Generation: Programs, Instructions, Addresses, Basic Blocks and Flow Graphs, Optimization of Basic Blocks, Register

Allocation and AssignmentMachine Independent Optimizations: Sources of Optimization, Data Flow Analysis

Laboratory (1) Designing a Lexical Analyzer in C(2) Designing a Lexical Analyzer using Lex(3) Designing a Recursive-Descent Parser(4) Designing an SLR Parser(5) Using Yacc to design an Intermediate Code Generator

Reference Books 1. Compilers Principles Techniques and Tools, Alfred V. Aho, Monica S. Lam, Ravi Sethi, Jeffrey D. Ullman, Addison Wesley,

2006, Second Edition2. Programming Languages Concepts and Constructs, Ravi Sethi, Addison Wesley, 1996, Second Edition


28/32

Course Title System Programming Course No. CS323Focus Group Computer Science and Engineering L-T-P [C] 2-0-3 [3]Offered for B.Tech. Type CompulsoryPre-requisite To take effect from July 2014

Objectives 1. To introduce basic aspects of working in Kernel

programming2. To introduce development of device drivers and loadable

kernel modules3. To give exposure to best programming practices and

tools used in kernel development

Learning Outcomes 1. Ability configure, compile, and install a Linux kernel from

sources2. Ability to navigate and read the Linux kernel sources3. Ability to design and implement kernel modules and

device drivers, modify, or design and implement fromscratch

Contents Kernel Module Programming: Compiling kernel - Configuring Kernel and compilation, Bootloader and boot process and

booting kernel, Kernel code browsers; Static linking , dynamic linking of modules, User space , kernel space concepts,system calls, writing simple modules, writing Makefiles for modules, Debugging with GDB, Other tools like strace/ltraceetc, version controls system

Linux kernel internals: Process and process control blocks. Scheduling, Memory Management, VFS Virtual File SystemCharacter device driver: Driver concepts, Writing character drivers, Synchronization, proc and sysfs interfaces, Interrupt

Handling, Kernel threads and Work Queues, Timers, Kernel linked list implementation, Interfacing with hardware

Kernel debugging techniques: Interpreting kernel OOPS, KDN, KGDB, remote debugging using KGDBBlock drivers: Block devices design and addressing, Concepts of mounting and partitioning, Buffer cache and page cache,

overview of SCSI, block driver developmentNetwork drivers: Connecting to the Kernel, net_device structure, Packet Reception and transmission, Socket buffers,

Interrupt handling, Custom ioctl commands

Laboratory (1) Kernel configuration and compilation(2) Implementation of a simple character device driver(3) Extending the functionality of a given block device driver(4) Implementation of a simple kernel module to deal with networking protocol stack or netfilter framework(5) Extending the functionality of kernel modules related to networking, like tcp_probe

Reference Books 1. Robert Love, Linux Kernel Development, Addison-Wesley Professional, 3rd Edition2. Jonathan Corbet, Allessandro Rubini & Greg Kroah-Hartman, Linux Device Drivers, O'Reilly, 3rd Edition


29/32

Course Title Artificial Intelligence Course No. CS324Focus Group Computer Science and Engineering L-T-P [C] 3-0-0 [3]Offered for B.Tech. Type CompulsoryPre-requisite To take effect from July 2014

Objective To provide the foundations for AI problem solving techniques

and knowledge representation formalisms

Learning Outcomes 1. Ability to identify and formulate appropriate AI methods

for solving a problem2. Ability to implement AI algorithms3. Ability to compare different AI algorithms in terms of

design issues, computational complexity, and assumptions

Contents Un-informed search strategies: Breadth first search, Depth-first search, Depth-limited search, Iterative deepening depth-first

search, bidirectional searchInformed search and exploration: Greedy best-first search, A search, Memory-bounded heuristic searchLocal search algorithms and Optimization: Hill climbing, Simulated Annealing, Local beam search, Genetic AlgorithmsConstraint Satisfaction Problems: Backtracking search for CSPs, Local search for CSPs Adversarial Search: Optimal Decision in Games, The minimax algorithm, Alpha-Beta pruningKnowledge and Reasoning: Propositional Logic, Reasoning Patterns in propositional logic; First order logic: syntax,

semantics, Inference in First order logic, unification and lifting, backward chaining, resolutionKnowledge Representation: Ontological engineering, categories, objects, actions, situations, Situation Calculus, semantic

networks, description logics, reasoning with default systemsPlanning: Planning with state space search, Partial-Order Planning, Planning Graphs, Planning with Propositional Logic,

hierarchical task network planning, non-deterministic domains, conditional planning, continuous planning, multi-agentplanning

Miscellaneous Topics: Fuzzy logic systems, Natural Language Processing

Reference Books 1. "Artificial Intelligence: A Modern Approach" 3rd Edition by Stuart Russel and Peter Norvig2. "Artificial Intelligence" by Elaine Rich, Kevin Knight and Shivashankar B Nair


30/32

Course Title B. Tech. Project Course No. CS399Focus Group Computer Science and Engineering L-T-P [C] 0-0-9[3]


Objectives 5. To gain hands on experience on innovative technologyproject





formats


31/32

VII Semester


Offered for 5

th

to 8

th

Semester Type CompulsoryPre-requisite To take effect from July 2014

Objectives 7.

To gain hands on experience on innovative technologyproject


Learning Outcomes 22.

Ability to design and model a system23. Ability to plan and execute well defined objective24. Ability to work in team at component level and system


quantitatively the performance of system

28.

Ability to report and present the findings in standardformats


32/32

VIII Semester



Objectives 9. To gain hands on experience on innovative technology

project10. To prepare the students to solve/work on the real

world/practical/theoretical problems involving issues incomputer science and engineering




formats

Date post:	07-Aug-2018
Category:	Documents
Upload:	tapanbhtngr
View:	240 times
Download:	0 times

B.Tech Course Content CSE.pdf

Documents