Matrices and Vector spaces: Rank of matrix, Echelon and normal form, Solutions of linear systems of algebraic equations, Eigen values and Eigen vectors, Cayley- Hamilton theorem (no proof). Vector Spaces- Subspaces,-Linear Independence of vectors-Linearspan-Dimension and Basis. Linear transformations.
Fourier series and Fourier integrals: Fourier series of Periodic functions-Euler formulae for Fourier coefficients- functions having period 2π , arbitrary period- even and odd functions-half range expansions, Fourier integral, Fourier cosine and sine transformations, linearity property, transform of derivatives, convolution theorem (no proof)
Laplace transforms: Linearity property, transforms of elementary functions, Laplace transforms of derivatives and integrals, differentiation and integration of transforms,convolution theorm (no proof), use of Laplace transforms in the solution of initial value problems, unit step function, impulse function - transform of step functions, transforms of periodic functions.
Vector calculus : Scalar and Vector point functions-Gradient and directional derivative of a scalar point functions.- Divergence and Curl of a vector point functions- their physical meanings.Evaluation of line integral, surface integral and volume integrals, Gauss’s divergence theorem,. Stoke’s theorem (No Proof of these theorem), conservative force fields,scalar potential.
1. R.K. Jain, S.R.K Iyengar: Advanced Engineering Mathematics, Narosa publishers.19912. C.R. Wilie & L.C. Barrett: Advanced Engineering Mathematics, MGH Co.
1. Larry C Andrews, Ronald C Philips: Mathematical Techniques fo Engineers & Scientists, PHI2. M.C. Potter, J.L. Goldberg: Advanced Engineering Mathematics, Oxford universitypress3. B. S. Grewal: Higher Engineering Mathematics, Khanna publishers,1986
Introduction : Digital System-Binary Numbers-Base conversions-Octal and Hexa decimal numbers-compliments-Signed binary numbers- Binary codes-Binary storage and Registers-Binary Logic.Boolean algebra and logic gates: Axiomatic definition of boolean algebra-Basic theorems and properties-Boolean functions-Canonical and standard forms-Logic operations-Digital Logic gates Gate level minimisation: Karnough map-two,three,four and five variable maps-POS simplification-Don't care conditions-NAND and NOR implementation-Exclusive OR function-QuineMcClusky Technique
Combinational Logic : Combinational Circuits-Analysis procedure-Design procedure-Binary adder-subtracter-Fast adders-Decimal adder-Binary multiplier-Magnitude comparator-Decoders-Encoders-Multiplexers and demultiplexer Synchronous sequential circuits: Sequential circuits-Latches and Flipflop-Analysis of clocked sequential circuits-State reduction and analysis-Design procedure
Registers and Counters: Registers-Shift Registers-Ripple counters-Synchronous counters-Counter with unused states-Ring counter-Johnson counter Memory and Programmable Logic: Random Access Memory-Memory decoding-Error detection and correction-Read Only Memory-Programmable Logic Array-Programmable Array Logic-Sequential programmable devices
Asynchronous Sequential circuits: Analysis procedure-Circuits with Latches-Hazards Digital Integrated circuit: IC digital logic families-Characteristics:-Fan out-Power dissipation-Propagation delay-Noise Margin. RTL and DTL circuits-Transistor Transistor Logic-Emitter coupled Logic-CMOS Logic-CMOS transmission gate circuit
1. Yarbrough, “Digital Logic Apllications And Design” , Thomson Learning, India
1. Taub & Schilling ,”Digital Integrated Electronics”, Mc Graw Hill 2. Samuel C Lee ,”Digital Circuits and logic Design”,Precentice Hall3. A p Malvino , “ Digital Computer Electronics “, Tata Mc Graw Hill4. Morris Miller ,”Design with TTL integrated Circuit”, Mc Graw hill5. Peatman, ”Digital Hardware Design “,”, Mc Graw 6. Ronald J Tocci ,”Digital Systems ,Principles and Applications”, Prentice 7. Lloyd ,”Digital Fundamentals “, universal , N .8. Mercins , “Switching Circuits “, Prentice Hall9. MOS-LSI Circuits , Publication of Texas Instruments10. Douglas v hall ,” Digital Circuits and Systems “, Mc Graw Hill11. R P Jain , Principles of Digital Electronics12. Mike Toolay, “Electronic Circuits – Fundamentals and Applications”, Elsevier, New Delhi
Logics and Proofs ,propositions, conditional propositions and logical equivalences,quantifiers, proofs resolution, mathematical induction ,sets ,relations ,equivalence relations ,functions.
Algorithms introduction, notations, recursive algorithms, complexity of algorithm,counting methods and pigeon hole principle, recurrence relations.
Graph theory, paths and cycles, Hamiltonian cycles, representation of graphs, Eulerian paths, traveling sales man problem, trees, characterization, spanning trees, game trees.
Algebraic systems semi groups, monoid, subgroups, homomorphism, isomorphism automorphism , rings, sub rings, posets, lattice, hasse diagrams
1. Richard Johnsonbaugh - Discrete Mathematics Pearson Education fifth edition 2. Satinder Bal Gupta - Discrete mathematical structures Laxmi publications III edition
1. Malik D. S., Sen S. K - Discrete Mathematical Structures , Thomson Learning2. Garry Haggard, John Schlipf, Sue Whitesides, Discrete Mathematics for Computer Science, Thomson Learning3. Bernard Kolman, Robert C Busby, Sharon Cutler Ross, Nadeem-ur-rehman Discrete mathematical structures, Pearson Education4. J P Tremblay and Manohar Mc Graw Hill - Discrete mathematical structures with applications to computer science 5. John Truss Addison Wesley- Discrete mathematical structures for Computerscience
Object oriented technology, comparison with procedural programming (C and C++),key concepts of object programming, input and output in C++, declarations ,control structures, functions
Classes and Objects, declaring objects, accessing member variables, defining member function, inline functions, statics member variables and functions, friend functions,overloading, constructors and destructors, overloading constructors, copy constructors anonymous objects, dynamic initialization using constructors, dynamic operators and constructors, recursive constructors encapsulation
Inheritance, types of inheritance, virtual base class, abstract class, advantages and disadvantages of inheritance, pointers and arrays, C++ and memory
Binding, polymorphism and virtual functions, generic programming with templates,exception handling, string handling and file handling
1. Ashok N Kamthane , Pearson education - Object oriented programming wit ANSI and TURBO C++2. Saurav Sahay - Object oriented programming wit C++, Oxford
1. Malik, Thomson Learning C++ Programming :From Problem Analysis To Program Design2. Forouzan, Thomson Learning - Computer Science :A Structured Approach UsingC++,2nd Ed.
Programming domains. Language Evaluation.Programming paradigms -Imperative programming,Functional programming,Object oriented programming,Logic programming. Formal methods of describing syntax and semantics - Backus Naur Form,Attribute grammars. Describing semantics - Denotational semantics.
Data types, Names, Variables, Bindings, Scope and lifetime, Referencing Environments-Named Constants-Variable Initialization-Subprograms-Parameter Passing-Coroutines.
Data abstraction and encapsulation. Polymorphism and inheritance. Features of objectoriented languages - Smalltalk,C++ and Java.Design and implementation issues.Exception handling.
Functional programming languages - Lambda calculus - Introduction to pure LISP .Application of functional programming languages. Logic programming languages - a brief introduction to predicate calculus - Horn clauses - Logic programming.Introduction to Prolog. Applications of Logic programming.
1. Robert W.Sebesta, Concepts of Programming Languages.2. Ravi Sethi, Programming Languages-concepts and constructs, Addison Wesley,Second Edition , 1996.
1. Michael L. Scott, Programming Language Pragmatics – Elsevier, New Delhi 2. Thomson Learning, Kenneth.C.Louden, Programming Languages:Principles AndPractices ,2nd Ed.3. Terence W. Pratt Programming Languages, Prentice Hall Ninth edition1996.4. Michael J Gordon, “Programming Language Theory and its implementation,Prentice Hall ,19915. Bjarn Stroustrup, “Design and Evolution of C++”, Addison Wesley, 19916. “Symbolic Logic and Logic programming”, Learning Material Series, Indian Society fo Tech. Education, 19967. James Gosling “Java Programming Language”, Addison Wesley,
DC power supplies - power transformers - rectification - half wave , full wave, bridge - expression for ripple factor, efficiency, comparison, diode ratings. filters - capacitor - inductor LC filters- use of bleeder resistor - voltage multipliers - dual power supplies - zener and avalanche diodes - simple and series voltage regulator. Special semiconductor devices: Principles and operation of photodiodes, PIN diodes, phototransistors, LED, UJT. MOSFET- Enhancement and depletion types - NMOS, PMOS and CMOS -basic principles & characteristics.
Small Signal amplifiers: Bipolar junction transistor – configurations, characteristics - current amplification factors - relations between alpha & beta – comparison. BJT amplifiers: Biasing techniques of BJT- stabilization of operating point - h-parameters - CE RC coupled amplifier - concept of load lines- frequency response of RC coupled amplifier - lower cut-off frequency - upper cut-off frequency - 3 db bandwidth.FET Amplifiers: Principle of operation, characteristics, Common source amplifier, frequency response-applications
Power amplifier - classification - class A, B, AB and C power amplifiers-tuned amplifier- pushpull and complementary symmetry power amplifier .Feed-back amplifiers: concept of Negative and positive feedback – Bark Hausen criteria -low frequency sinusoidal oscillators High frequency oscillators – types- LC, Crystal oscillators –circuit diagram-description-applications
Pulse Circuits:-Different types Pulse circuits - pulse characteristics - Pulse shaping using RC circuits - Differentiating and integrating circuits –applications. Clipping and clamping circuits using diodes - Transistor as a switch– simple sweep circuits-bootstrap sweep Multivibrators-astable, monostable and bistable ciruits using BJTs-applications
1. Boylestead & Neshelsky: ,”Electronic Devices & Circuit Theory”, PHI2003 2. Millman & Halkias, ”Electronic Devices & Circuits”, TMH, New Delhi.19963. Taub & Schilling, Pulse, Digital and Switching ciruits, TMH, New Delhi4. Bapat Y N, ”Electronic Devices & Circuits”, Tata McGraw Hill, New Delhi.19955. Allan Mottorshed, ” Electronic Devices & Circuits”, PHI, New Delhi.6. Schilling & Belove “Electronic Circuits, Discrete & Integrated”, TMH, New Delhi 19897. Theodore F.Bogart: “Electronic Devices & Circuits” Universal Book Stall, New Delhi 1992
1. Study of Multimeter, Signal generators, CRO etc. and measurement of electrical quantities2. Testing of Passive and Active components - Resistors, Capacitors, inductors, Transformers, diodes, Transistors, etc.3. Characteristics of Active devices –Diode, CE of BJT4. Rectifying circuitsi) HW rectifierii) FW rectifieriii) FW Bridge rectifieriv) Filter circuits - Capacitor filter,(Measurement of ripple factor)5. Differentiating circuit and integrating circuit.6. Clipping & Clamping circuits.7. Amplifying circuits Simple common emitter amplifier configuration - gain and bandwidth.8. Oscillators – RC phase shift or Wein Bridge 9. Multivibrators – Astable only.
Exercises to make the students understand the following conceptsDifference between struct and classs/Data abstraction/Data encapsulation and information hiding/Inheritance/Single inheritance/Multiple inheritance/Multilevel inheritance/Hierarchical inheritance/Abstract classs/Operator overloading/Function overloading/Over-riding/Pointers and arrays/Files