# NIT Delhi ECE Syllabus Part I

# NIT Delhi ECE Syllabus PART I

**B.Tech ECE – Syllabus**

**Course No. MH 202 SIGNAL TRANSFORMATIONS Credits: 4**

Matrix theory: elementary row and column operations on a matrix – rank of matrix- caley-hamilton theorem. laplace transformation: laplace transform – inverse laplace transform – properties of laplace transform function – solution of ordinary differential equations. fourier series and fourier transforms: expansion of a function in fourier series for a given range – fourier transformation – sine and cosine transformation, gating functions.partial differential equations: solutions of wave equation, laplace’s equation by the method of separation of variables, Z Transform and Inverse Z Transform, properties of ZT, Region of Convergence

Books:

1. Advanced Engineering Mathematics, KREYSZIG E, Wiley Eastern.

* * *

Course No. EE 211 NETWORK ANALYSIS Credits: 4

– – –

Circuit elements and relations :types of sources and source transformations. network graphs and analysis: graph of a network, cutset and tieset matrices. time domain analysis: solution of network equations in time domain-classical differential equations approach. applications of laplace transforms in circuit theory: laplace transforms of various signals of excitation-waveform synthesis. steady state analysis of circuits for sinusoidal excitations:1-phase series, parallel, series – parallel circuits – solution of ac networks using mesh and nodal analysis. resonance and locus diagrams: series and parallel resonance – selectivity – bandwidth – q factors. locus diagrams for RL and RC circuits. network theorems and applications: thevenins and nortons theorems; reciprocity theorem, maximum power transfer theorem; their applications in analysis of networks.

Books:

1. Network Analysis, 3/e, M.E.VAN VALKEN BERG, Prentice Hall.

* * *

Course No. CS 202 DATA STRUCTURES Credits: 3

– – –

Introduction: complexity expression in different notations. abstract data types: lists, stacks and queues. trees: binary trees, binary search trees, introduction to AVL trees. hashing: hash table organization, hash functions, open hashing, closed hashing. priority queues: the model and binary heap. sorting: insertion sort, shell sort, heap sort, merge sort, quick sort and bucket sort methods. graph algorithms: topological sort, shortest path algorithms, network flow problems, minimum spanning trees.

Books:

1. Data Structures and Algorithm Analysis in C++, MARK ALLEN WEISS, Pearson, 2000

* * *

Course No. EC 201 ELECTRONIC DEVICES & CIRCUITS-I Credits: 4 – – – –

Semiconductors: review of band theory of solids. carrier concentrations of N and P type semiconductors. Hall effect and its applications. semiconductor diodes: band structure of P-N junction. volt-ampere

characteristics. zener and avalanche breakdowns. the principles of photo diode, LED & LCD. junction transistor: PNP and NPN junction transistors. characteristics of the current flow across the base regions. transistor biasing: DC bias and various stabilization circuits. thermal runaway & thermal stability. field effect transistors:jfet and its characteristics. MOSFET; enhancement , depletion modes. biasing of FETs. small signal low frequency transistor amplifier circuits: analysis of transistor amplifier circuits using ‘h’ parameters. RC coupled amplifier, effect of bypass and coupling capacitors on the low frequency response of the amplifier. FET amplifiers – low frequency

– 7 –

and high frequency models. rectifiers: diode as a rectifier, half wave, full wave and bridge rectifiers. electron dynamics: motion of charged particles in electric and magnetic fields. principle of CRT , deflection sensitivity.

Books:

1. Integrated Electronics, MILLIAN & HALKIAS, Mc Graw Hill.

* * * *

Course No. EC 202 NETWORKS & TRANSMISSION LINES Credits: 3

Networks: image and iterative impedances. Insertion loss. attenuators & pads. lattice network and its parameters. impedance matching networks. filters: low pass, high pass, band pass and band elimination filters. constant K and m derived sections. composite filters. equalisers: inverse impedances. series & shunt equalizers. T & bridged T equalisers. the lattice equalisers. transmission line theory: primary & secondary constants. phase & group velocities. transmission line equations. characteristics of LF lines. RF lines: RF lines, lossless lines, reflection coefficient & VSWR. smith chart. impedance matching with single and double stub.

Books:

1. Transmission Lines and Networks, JOHNSON, Mc-Graw Hill, 1950.

* * * *

Course No. EC 203 SWITCHING THEORY & LOGIC DESIGN Credits: 4

Introductory digital design concepts: numbersystems, base conversion methods. switching algebra and switching functions: boolean algebra, minimisation of boolean functions. combinational logic: principles and practices: logic design of combinational circuits. sequential logic: review of flip-flops, finite state model of sequential circuits, tabulation methods, state assignment and hazards in asynchronous sequential circuits. fault detection: static and dynamic hazards. fault detection methods. logic design: binary addition, subtraction, multiplication & division. digital system design methods: introduction to VHDL: ASM chart notations, development of respective VHDL models.

Books:

1. An engineering approach to digital design, FLETCHER, P.H. India.

* * *

Course No. MH 252 NUMERICAL TECHNIQUES & GRAPH THEORY Credits: 4

Numerical Analysis: Curve fitting by the method of least squares. Newton’s forward & backward interpolation formulae, Numerical differentiation at the tabulated points with forward backward ¢ral differences, Numerical Integration with Trapezoidal rule, Simpson’s 3/8 rule and Romberg integration. Euler’s method, Runge-Kutta method of 2nd & 4th orders for solving first order ordinary

differential equations. Graph Theory:Introduction to Queuing Theory: Poisson process and exponential distribution. Poisson queues – Model (M/M/1):(?/FIFO) and its characteristics.

Books:

1. Fundamentals of Mathematical Statistics, S.C.GUPTA AND V.K.KAPOOR

* * * *

Course No. CS 261 OBJECT ORIENTED PROGRAMMING & OPERATING SYSTEMS

Credits: 3

Operating systems: introduction: early history, buffering and spooling, batch, time-sharing & real time systems. protection.

operating system structure: system components, operating system services, system structure. concurrent processes: process concept. the producer/ consumer problem. the critical section problem. semaphores. deadlocks: system model. dead lock characterisation, prevention. recovery from deadlock. file systems: file concept. operations. access methods. directory systems. directory structure organisation. object oriented programming: introduction-data hiding and member functions-object creation-adhoc polymorphism-visitation: iterators and containers-inheritance: subtyping and code reuse-parametric polymorphism-exceptions.

Books:

1., Operating Systems Concepts, A SILBERSCHATZ AND GALVIN, 4th Edition, Addison Wesley.

* * * *

Course No. EC 251 ELECTRONIC DEVICES & CIRCUITS- II Credits: 4

Multistage amplifiers: analysis of multistage amplifier. frequency response of amplifiers: high frequency response of a CE stage, frequency response of cascaded stages, analysis of difference amplifiers. feedback amplifiers: properties of negative feedback amplifiers, general analysis of multistage feedback amplifiers. stability and response of feedback amplifier: effect of feedback on bandwidth, stability, test of stability, compensation, phase margin and gain margin. oscillators: phase shift oscillator, wein bridge oscillators, crystal oscillators. power amplifer: class A, B, & AB power amplifier: push-pull amplifier, efficiency, cross over distortion. tuned amplifier: single tuned and double tuned interstage design. class b and class c tuned power amplifiers.

Books:

1. Integrated Electronics, J.MILLMAN & HALKIAS, TMH.

* * *

Course No. EC 252 SIGNALS AND SYSTEMS Credits: 4

Signals & systems: continuous time & discrete time signals, exponential & sinusoidal signals, continuous & discrete time systems. linear time invariant systems: discrete time LTI systems, continuous time LTI systems, properties of LTI systems. fourier series representation of periodic signals: response of LTI systems to complex exponentials, fourier series representation of CT periodic signals. continuous time fourier transform: representation of a periodic signals by continuous FT, FT of periodic signals, time and frequency characterization of signals and systems: magnitude and phase representation of FT, magnitude and phase response of LTI systems. discrete time fourier transform & discrete fourier transform: properties

of DTFT and DFT. sampling: sampling theorem, reconstruction of signal from its samples using interpolation. z-transform: inverse z transform, properties of ZT, signal flowgraphs: impulse response and transfer function of linear systems, block diagrams, signal flow graphs, basic properties of SFG, & SFG terms.

Books:

1. Signals & Systems- AV OPPENHEIM, AS WILLSKY, S HAMID NAWAB, PHI, 2000

2. Signals & Systems- S HAYKIN, J Wiley, 2000

3. Signals & Systems- MJ ROBERTS, TMH, 2003

4. Signals, Systems and transforms, 3/e, CL PHILLIPS et al, Pearson, 2004

## Recent Comments