Syllabus Semester III PDF
Syllabus Semester III PDF
Syllabus Semester III PDF
Third Semester
MA201 Mathematics – III 3-1-0-8
CS201 Object Oriented Programming and Data Structures 3-0-3-9
HS2xx HSS Elective* 3-0-0-6
CS203 Discrete Mathematics 3-0-0-6
CS221 Digital Design 3-0-0-6
EE220 Signal, System and Networks 3-1-0-8
Total L-T-P-C 18-2-3-43
Third Semester
MA201 Mathematics – III 3-1-0-8
CS201 Object Oriented Programming and Data Structures 3-0-3-9
HS2xx HSS Elective* 3-0-0-6
EE200 Semiconductor Devices and Circuits 3-0-0-6
EE201 Digital Circuits and Microprocessors 3-0-0-6
EE202 Digital Circuits Laboratory 0-0-3-3
EE220 Signal, System and Networks 3-1-0-8
Total L-T-P-C 18-2-6-46
Third Semester
MA201 Mathematics – III 3-1-0-8
CS201 Object Oriented Programming and Data Structures 3-0-3-9
HS2xx HSS Elective* 3-0-0-6
ME 201 Solid Mechanics 2-1-0-6
ME 204 Fluid Mechanics 2-1-0- 6
ME 205 Thermodynamics 3-1-0-8
ME 211 Machine Drawing 0-0-4-4
Total L-T-P-C 15-4-7-47
* HSS Electives
HS201 Introductory Microeconomics 3-0-0-6
HS221 Fundamentals of Linguistics Science 3-0-0-6
HS231 Introductory Sociology 3-0-0-6
B.Tech. II year (Semester III) Course Syllabi
Prerequisites: Nil
Complex Analysis: Complex numbers, geometric representation, powers and roots of complex numbers.
Functions of a complex variable: Limit, Continuity, Differentiability, Analytic functions, Cauchy-Riemann
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 Maximum-Modulus 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, Schwarz-Christoffel
transformation.
Fourier series: Fourier Integral, Fourier series of 2π periodic functions, Fourier series of odd and even
functions, Half-range 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 quasi-linear first order
PDE, Second order PDE and classification of second order semi-linear PDE, Canonical form.. Cauchy
problems. D’ Alemberts 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.
Texts:
1. R. V. Churchill and J. W. Brown, Complex Variables and Applications, 5th Edition, McGraw-Hill,
1990.
nd
2. K. Sankara Rao, Introduction to Partial Differential Equations, 2 Edition, 2005.
References:
1. J. H. Mathews and R. W. Howell, Complex Analysis for Mathematics and Engineering, 3rd
Edition, Narosa, 1998.
2. I. N. Sneddon, Elements of Partial Differential Equations, McGraw-Hill, 1957.
3. E. Kreyszig, Advanced Engineering Mathematics, 5th / 8th Edition, Wiley Eastern / John Wiley,
1983/1999.
Pre-requisites: CS101
From C to Java: basics of Java, introduction to the object oriented programming (OOP) concepts (such
as classes, objects, constructors, destructors, inheritance, polymorphism, operator overloading) using
Java, JVM, applets, APIs, GUI Programming. From Java to C++: the OOP concepts using C++.
Performance of algorithms: space and time complexity, asymptotics. Fundamental Data structures: linked
lists, arrays, matrices, stacks, queues, binary trees, tree traversals. Algorithms for sorting and searching:
linear search, binary search, insertion-sort, bubble-sort, quicksort. Priority Queues: lists, heaps. Graphs:
representations, depth first search, breadth first search. Hashing: separate chaining, linear probing,
quadratic probing. Search Trees: binary search trees, red-black trees, AVL trees, splay trees, B-trees.
Texts:
nd
1. M. A. Weiss, Data Structures and Problem Solving Using Java, 2 Ed, Addison-Wesley,
2002.
2. T. H. Cormen, C. E. Leiserson, R. L. Rivest and C. Stein, Introduction to Algorithms, MIT
Press, 2001.
References:
rd
1. J. Gosling, B. Joy, G. L. Steele and G. Bracha, The Java Language Specification, 3 Ed,
Addison-Wesley, 2005.
rd
2. B. Stroustrup, The C++ Programming Language, 3 Ed, Addison-Wesley Longman Reading
MA, 1997.
th
3. S. B. Lippman, C++ Primer, 4 Ed, Addison-Wesley, 2005.
nd
4. S. Prata, C++ Primer Plus: Teach Yourself Object Oriented Programming, 2 Ed, Waite
Group Press Corte Madera CA, 1995.
5. T. Budd, C++ for Java Programmers, Addison Wesley, 1999.
6. M. C. Daconta, Java for C/C++ programmers, John Wiley & Sons, 1996.
7. M. J. Augenstein, Y. Langsam and A. M. Tenenbaum, Data Structures Using Java, Prentice
Hall, 2003.
8. A. H. Aho, J. E. Hopcroft and J. Ullman, Data Structures and Algorithms, Addison-Wesley,
1983.
Introduction: Why Economics, The Central Economic Problem, Production Possibility Curve (PPC)
Overview of Markets: Demand and Supply, Elasticity, Efficiency and Equity, Markets in Action
Determinants of Demand and Supply: Utility and Demand, Production and Costs
Markets for Goods and Services: Competition, Monopoly, Monopolistic Competition and Oligopoly
Markets and Government: Externalities, Public Goods and Taxes, Factor markets, Income distribution
Texts:
References:
1. Alex Inkeles, What is Sociology? An Introduction to the Discipline and Profession New Delhi:
Prentice-Hall of India, 1997
2. Anthony Giddens, Sociology (Sixth Edition) Cambridge: Polity Press, 2009
3. M.N.Srinivas, Social Change in Modern India, New Delhi: Orient Longman, 1985
4. S. C. Dube, Indian Village London: Routledge, 1955
Signals: classification of signals; signal operations: scaling, shifting and inversion; signal properties:
symmetry, periodicity and absolute integrability; elementary signals.
Systems: classification of systems; system properties: linearity, time/shift-invariance, causality, stability;
continuous-time linear time invariant (LTI) and discrete-time linear shift invariant (LSI) systems: impulse
response and step response; response to an arbitrary input: convolution; system representation using
differential and difference equations; Eigen functions of LTI/ LSI systems, frequency response and its
relation to the impulse response. Signal representation: signal space and orthogonal bases; Fourier
series representation of continuous-time and discrete-time signals; continuous-time Fourier transform and
its properties; Parseval's relation, time-bandwidth product; discrete-time Fourier transform and its
properties; relations among various Fourier representations.
Sampling: sampling theorem; aliasing; signal reconstruction: ideal interpolator, zero-order hold, first-
order hold; discrete Fourier transform and its properties. Laplace transform and Z-transform: definition,
region of convergence, properties; transform-domain analysis of LTI/LSI systems, system function: poles
and zeros; stability. Review of network theorems: superposition, Thevenin’s, Norton’s, reciprocity,
maximum power transfer, Millman’s and compensation theorems;
Network topology: definition of basic terms, incidence matrix, tie-sets, cut-sets; Two port networks:
characterization in terms of impedance, admittance, transmission, hybrid parameters and their
relationships, interconnection of two port networks; Symmetrical two port network: T and • equivalents,
image impedance, characteristic impedance and propagation constant.
Texts:
References:
1. A.V. Oppenheim, A.S. Willsky and H.S. Nawab, "Signals and Systems", Prentice Hall of India,
2006.
2. R.F. Ziemer, W.H. Tranter and D.R. Fannin, "Signals and Systems - Continuous and
Discrete", 4/e, Prentice Hall, 1998.
3. Simon Haykin, Barry van Veen, "Signals and Systems", John Wiley and Sons, 1998.
4. F. F. Kuo, Netwok Analysis and Synthesis, 2/e, Weily India, 2007.
5. K. S. Suresh Kumar, Electric Circuits and Networks, Pearson Education, 2009.
CORE COURSES (COMPUTER SCIENCE AND ENGINEERING)
CS203 DISCRETE MATHEMATICS (3-1-0-8)
Set theory: sets, functions, relations, partial orders, lattices. Logic: propositional logic (formulae, truth
tables, proof systems, soundness and completeness of proof systems), predicate logic (formulae,
interpretations, proof systems, soundness and completeness of proof systems).
Combinatorics: permutations, combinations, partitions, Stirling numbers. Recurrences, summations,
generating functions, asymptotics.
Graph Theory: paths, connectivity, subgraphs, isomorphic and homeomorphic graphs, trees, complete
graphs, bipartite graphs, matchings, colourability, planarity, digraphs.
Algebraic Structures: semigroups, groups, subgroups, homomorphisms, rings, integral domains, fields.
Texts:
J. P. Tremblay and R. P. Manohar, Discrete Mathematics with Applications to Computer Science, Tata
McGraw-Hill, 1997.
References:
1. C. L. Liu, Elements of Discrete Mathematics, 2nd Ed, Tata McGraw-Hill, 2000.
2. R. L. Graham, D. E. Knuth, and O. Patashnik, Concrete Mathematics, 2nd Ed, Addison-Wesley,
1994.
3. N. Deo, Graph Theory with Applications to Engineering and Computer Science, Prentice Hall of
India, 1974.
4. S. Lipschutz and M. L. Lipson, Schaum’s Outline of Theory and Problems of Discrete
nd
Mathematics, 2 Ed, Tata McGraw-Hill, 1999.
Number Systems: representations of numbers (binary, octal, decimal, and hexadecimal), arithmetics of
signed and unsigned numbers. Boolean Algebra and logic gates: gate level minimization of Boolean
functions.
Combinational logic circuits: design and analysis, some standard combinational circuits (encoders,
decoders, multiplexers). Sample and hold Circuits, Analog-to-Digital Converter, Digital-to-Analog
Converter.
Synchronous sequential logic circuits: design and analysis; flip-flops, registers, counters; finite state
model: state tables and state diagram, state minimization.
Asynchronous sequential logic circuits: design and analysis; incompletely specified machines;
reduction of states and flow tables; race free state assignments. Programmable logic devices: memory,
PLA, PAL. Representation and synthesis using ASM charts.
Texts:
rd
M. M. Mano, Digital Design, 3 Ed, Pearson Education Asia, 2002.
References:
1. S. Brown and Z. Vranesic, Fundamentals of Digital Logic - With Verilog Design, Tata McGraw-
Hill, 2002
2. S. Brown and Z. Vranesic, Fundamentals of Digital Logic - With VHDL Design, Tata McGraw-Hill,
2002
3. J. P Uyemura, A First Course in Digital System Design - An Integrated Approach, Vikas
Publishing House, 2001.
nd
4. Z. Kohavi, Switching and Finite Automata Theory, 2 Ed, Tata McGraw-Hill, 1995.
CORE COURSES (ELECTRICAL ENGINEERING)
Energy bands; semiconductors; charge carriers: electrons and holes, effective mass, doping. Carrier
concentration: Fermi level, temperature dependence of carrier concentration. Drift and diffusion of
carriers: excess carriers; recombination and life time, Five equations of carrier transport. p-n Junction:
depletion region, forward and reverse-bias, depletion and diffusion capacitances, switching
characteristics; breakdown mechanisms; SPICE model. BJT: carrier distribution; current gain, transit time,
secondary effects; SPICE model. Metal-semiconductor junctions: rectifying and ohmic contacts.
MOSFET: MOS capacitor; Cv-Iv characteristics; threshold voltage; SPICE model. Single stage amplifiers:
CE-CB-CC and CG-CD-CS modes of operation, large signal transfer characteristics of BJT and MOSFET,
Different types of biasing for BJT and MOSFET, Small signal parameters, Body effect in MOSFET,
Parasitic elements, frequency response of CE and CS amplifiers. Analog ICs: DAC, ADC, VCO, PLL and
555-timer.
Texts:
References:
1. M. S. Tyagi, Introduction to Semiconductor Materials and Devices, John Wiley & Sons Inc.
2. Michael Shur, Introduction to Electronic Devices, John Wiley & Sons Inc., 2000
3. R. T. Howe and C. G. Sodini, Microelectronics: An Integrated Approach, Prentice-Hall Inc. 1997.
4. Ben G. Streetman, Solid State Electronic Devices, PHI, 5/e, 2001.
5. J. Singh, Semiconductor Devices - Basic Principles; John Wiley & Sons Inc., 2001.
Texts:
1. C. H. Roth Jr., Fundamentals of Logic Design, 4/e, Jaico Publishers, 2002.
2. J. F. Wakerly, Digital Design principles and practices, 4/e, Pearson Education; 2006.
3. Z. Kohavi, Switching and Finite Automata Theory, 2/e, Tata McGraw-Hill, 2008.
4. R. K. Gaonkar, Microprocessor Architecture, Programming and Applications with the 8085,
Penram International Publishing (India), 2000.
References:
1. M. D. Ercegovac, T. Lang, and J.H. Moreno, Introduction to Digital Systems, John Wiley, 2000.
2. V. P. Nelson, H. T. Nagle, B. D. Carroll & J. D. Irwin, Digital Logic Circuit Analysis and Design,
Prentice-Hall, 1995.
3. D. V. Hall, Microprocessors and Interfacing: programming and hardware, TMH, 1995.
EE202 DIGITAL CIRCUITS LABORATORY (0-0-3-3)
Combinational Logic design using decoders and multiplexers; design of arithmetic circuits using adder
ICs; Flip flop circuit (RS latch, JK & master slave) using basic gates; Asynchronous Counters, Johnson &
Ring counters; Synchronous counters; Sequential Circuit designs (sequence detector circuit), DAC circuit;
Assembly language programming of 8085: a) sorting and code conversion, b) matrix multiplication; 8085
interfacing: a) parallel port interface (square wave generation), b) counter and timer interface (polling and
using interrupts); ADC/DAC interfacing with 8085.
Text/References:
Introduction to Stress and strain: Definition of Stress, Normal Stress in axially loaded Bar, Stress on
inclined sections in axially loaded bar, Shear Stress, Analysis of normal and shear stress, Deterministic
design of members, probabilistic basis for structural design. Tension test and normal Strain, Stress strain
relation and Hooke’s law. Poisson’s ratio, Thermal strain and deformation.
Stress as a tensor: stress at point, Cauchy stress tensor, equilibrium equations, analysis of deformation
and definition of strain components,
compatibility relations: One-to-one deformation mapping, invertiblity of deformation gradient, Compatibility
condition.
Some properties of Stress and Strain Tensor: Principal stresses and strains, stress and strain
invariants, Mohr’s circle representation.
Constitutive relations: An short introduction to material symmetry transformations, Isotropic material,
true and engineering stress-strain curves, Material properties for isotropic materials and their relations.
Theories of failures for isotropic materials.
Application of Mechanics of Material in Different Problems: Shear Force and Bending Moment
diagrams; Axially loaded members; Torsion of circular shafts; Stresses due to bending: pure bending
theory, combined stresses. Deflections due to bending: moment-curvature relation, load-defection
differential equation, area moment method, and superposition theorem; Stresses and deflections due to
transverse shears.
Energy Methods: Strain energy due to axial, torsion, bending and transverse shear. Castigliano’s
theorem, reciprocity theorem etc.
Introduction to fluids: Definition of fluid, Difference between solid and fluid, Application of fluid dynamics
Properties of fluids: Intensive and Extensive properties, Continuum, density, specific gravity, specific
heat, viscosity, surface tension etc.
Fluid statics: pressure, manometer, hydrostatic forces on submerged on plane surfaces, stability of
immersed and floating bodies, fluids in rigid body motion etc.
Fluid kinematics: Lagrangian and Eulerian description of fluid flow, Velocity and Acceleration Fields,
Fundamentals of flow visualization, streamlines, stream tubes, pathlines, streaklines and timelines,
deformation of fluid elements, vorticity and rotationality.
Inviscid incompressible flows: Stream function, velocity potential for 2D, irrotational, incompressible
flows;
Dimensional analysis and similitude: Nature of dimensional analysis, Buckingham-pi theorem,
significant dimensionless groups in fluid mechanics, flow similarity and model studies.
Integral relations for a control volume: Reynolds transport theorem, conservation equations for mass,
momentum and energy;
Differential relations for a fluid particle: conservation equations for mass momentum and
energy in differential form
External incompressible viscous flow: boundary layer concept, fluid flow about immersed bodies.
Internal Incompressible viscous flow: Fully developed laminar flow in a pipe, major and minor losses in
a pipe flow etc., flow measurement-constriction meters, rotameters, anemometer etc.
Conventional representation of Machine Components: screw threads, spring, gears, bearings, splined
shaft,
Assembly and Part Drawings: couplings, clutches, bearings, gear assemblies, I.C. Engine components,
valves, machine tools, etc.;
Limits, tolerances and Fits, Surface finish: Fundamental deviations for holes and shafts. Types of fits,
IS/ISO codes for limit and tolerances,
Symbols: Symbols for surface roughness, Weldments, process flow, electrical and instrumentation units
Solid Modeling: Introduction to solid modelers, solid modeling of various machine parts,
Project: A drawing project.
Texts: