ENGINEERING MATHEMATICS III 3.4.

Theorems on Laplace transform and its inverse

3.5. Convolution and related problems
SH 501 3.6. Applications of Laplace Transform to ordinary differential
Lecture : 3 Year : II equations
Tutorial : 2 Part : I
Practical : 0 4. Fourier Series ` (5 hours)
4.1. Fourier Series
Course Objective: 4.2. Periodic functions
The purpose of this course is to round out the students’ preparation for more 4.3. Odd and even functions
sophisticated applications with an introduction to linear algebra, Fourier Series, 4.4. Fourier series for arbitrary range
Laplace Transforms, integral transformation theorems and linear programming. 4.5. Half range Fourier series

1. Determinants and Matrices (11 hours) 5. Linear Programming (9 hours)

1.1. Determinant and its properties 5.1. System of Linear Inequalities in two variables
1.2. Solution of system of linear equations 5.2. Linear Programming in two dimensions: A Geometrical Approach
1.3. Algebra of matrices 5.3. A Geometric introduction to the Simplex method
1.4. Complex matrices 5.4. The Simplex method: Maximization with Problem constraints of
1.5. Rank of matrices the form “≤”
1.6. System of linear equations 5.5. The Dual: Maximization with Problem Constraints of the form “≥”
1.7. Vector spaces 5.6. Maximization and Minimization with mixed Constraints. The two‐
1.8. Linear transformations phase method(Analternative to the Big M Method)
1.9. Eigen value and Eigen vectors
1.10. The Cayley‐Hamilton theorem and its uses
References :
1.11. Diagonalization of matrices and its applications
1. E. Kreszig, "Advance Engineering Mathematics", Willey, New York.
2. Line, Surface and Volume Integrals (12 hours) 2. M.M Gutterman and Z.N.Nitecki, "Differential Equation, a First Course",
2.1. Line integrals 2nd Edition, saunders, New York.
2.2. Evaluation of line integrals
2.3. Line integrals independent of path Evaluation Scheme:
2.4. Surfaces and surface integrals
2.5. Green’s theorem in the plane and its applications The questions will cover all the chapters of syllabus. The evaluation scheme will
2.6. Stoke’s theorem (without proof) and its applications be as indicated in the table below:
2.7. Volume integrals; Divergence theorem of Gauss (without proof) Chapters Hours Marks distribution*
and its applications 1 11 20
2 12 20
3. Laplace Transform (8 hours) 3 8 15
3.1. Definitions and properties of Laplace Transform 4 5 10
3.2. Derivations of basic formulae of Laplace Transform 5 9 15
3.3. Inverse Laplace Transform: Definition and standard formulae of
Total 45 80
inverse Laplace Transform
*There may be minor deviation in marks distribution.
1
 OBJECT ORIENTED PROGRAMMING 3.7 Preprocessor Directives
3.8 Namespace
CT 501 3.9 User Defined Constant const
Lecture : 3 Year : II 3.10 Input/Output Streams and Manipulators
Tutorial : 0 Part : I 3.11 Dynamic Memory Allocation with new and delete
Practical : 3 3.12 Condition and Looping
3.13 Functions
Course Objective: 3.13.1 Function Syntax
The objective of the course is to familiarize students with the C++ programming 3.13.2 Function Overloading
language and use the language to develop pure object oriented programs. 3.13.3 Inline Functions
3.13.4 Default Argument
1. Introduction to Object Oriented Programming (3 hours)
3.13.5 Pass by Reference
1.1 Issues with Procedure Oriented Programming
3.13.6 Return by Reference
1.2 Basic of Object Oriented Programming (OOP)
3.14 Array, Pointer and String
1.3 Procedure Oriented versus Object Oriented Programming
3.15 Structure, Union and Enumeration
1.4 Concept of Object Oriented Programming
1.4.1 Object 4. Objects and Classes (6 hours)
1.4.2 Class 4.1 C++ Classes
1.4.3 Abstraction 4.2 Access Specifiers
1.4.4 Encapsulation 4.3 Objects and the Member Access
1.4.5 Inheritance 4.4 Defining Member Function
1.4.6 Polymorphism 4.5 Constructor
1.5 Example of Some Object Oriented Languages 4.5.1 Default Constructor
1.6 Advantages and Disadvantages of OOP 4.5.2 Parameterized Constructor
4.5.3 Copy Constructor
2. Introduction to C++ (2 hours)
4.6 Destructors
2.1 The Need of C++
4.7 Object as Function Arguments and Return Type
2.2 Features of C++
4.8 Array of Objects
2.3 C++ Versus C
4.9 Pointer to Objects and Member Access
2.4 History of C++
4.10 Dynamic Memory Allocation for Objects and Object Array
3. C++ Language Constructs (6 hours) 4.11 this Pointer
3.1 C++ Program Structure 4.12 static Data Member and static Function
3.2 Character Set and Tokens 4.13 Constant Member Functions and Constant Objects
3.2.1 Keywords 4.14 Friend Function and Friend Classes
3.2.2 Identifiers
5. Operator Overloading (5 hours)
3.2.3 Literals
5.1 Overloadable Operators
3.2.4 Operators and Punctuators
5.2 Syntax of Operator Overloading
3.3 Variable Declaration and Expression
5.3 Rules of Operator Overloading
3.4 Statements
5.4 Unary Operator Overloading
3.5 Data Type
5.5 Binary Operator Overloading
3.6 Type Conversion and Promotion Rules
2
 5.6 Operator Overloading with Member and Non Member Functions 9. Templates (5 hours)
5.7 Data Conversion: Basic – User Defined and User Defined – User 9.1 Function Template
Defined 9.2 Overloading Function Template
5.8 Explicit Constructors 9.2.1 Overloading with Functions
9.2.2 Overloading with other Template
6. Inheritance (5 hours)
9.3 Class Template
6.1 Base and Derived Class
9.3.1 Function Definition of Class Template
6.2 protected Access Specifier
9.3.2 Non‐Template Type Arguments
6.3 Derived Class Declaration
9.3.3 Default Arguments with Class Template
6.4 Member Function Overriding
9.4 Derived Class Template
6.5 Forms of Inheritance: single, multiple, multilevel, hierarchical,
9.5 Introduction to Standard Template Library
hybrid, multipath
9.5.1 Containers
6.6 Multipath Inheritance and Virtual Base Class
9.5.2 Algorithms
6.7 Constructor Invocation in Single and Multiple Inheritances
9.5.3 Iterators
6.8 Destructor in Single and Multiple Inheritances
10. Exception Handling (4 hours)
7. Polymorphism and Dynamic Binding (4 hours)
10.1 Error Handling
7.1 Need of Virtual Function
10.2 Exception Handling Constructs (try, catch, throw)
7.2 Pointer to Derived Class
10.3 Advantage over Conventional Error Handling
7.3 Definition of Virtual Functions
10.4 Multiple Exception Handling
7.4 Array of Pointers to Base Class
10.5 Rethrowing Exception
7.5 Pure Virtual functions and Abstract Class
10.6 Catching All Exceptions
7.6 Virtual Destructor
10.7 Exception with Arguments
7.7 reinterpret_cast Operator
10.8 Exceptions Specification for Function
7.8 Run‐Time Type Information
10.9 Handling Uncaught and Unexpected Exceptions
7.8.1 dynamic_cast Operator
7.8.2 typeid Operator
8. Stream Computation for Console and File Input /Output (5 hours)
8.1 Stream Class Hierarchy for Console Input /Output
Practical:
8.2 Testing Stream Errors
8.3 Unformatted Input /Output There will be about 12 lab exercises covering the course. At the end of the
8.4 Formatted Input /Output with ios Member functions and Flags course students must complete a programming project on object oriented
8.5 Formatting with Manipulators programming with C++.
8.6 Stream Operator Overloading
8.7 File Input/output with Streams
8.8 File Stream Class Hierarchy
8.9 Opening and Closing files
8.10 Read/Write from File References :
8.11 File Access Pointers and their Manipulators 1 Robert Lafore, “Object Oriented Programming in C++”, 4th Edition 2002,
8.12 Sequential and Random Access to File Sams Publication
8.13 Testing Errors during File Operations
3
2 Daya Sagar Baral and Diwakar Baral, “The Secrets of Object Oriented
Programming in C++”, 1st Edition 2010, Bhundipuran Prakasan
3 Harvey M. Deitel and Paul J. Deitel, “C++ How to Program”, 3rd Edition
2001, Pearson Education Inc.
4 D. S. Malik, “C++ Programming”, 3rd Edition 2007, Thomson Course
Technology
5 Herbert Schildt, “C++: The Complete Reference”, 4th Edition 2003, Tata
McGraw Hill

Evaluation Scheme:
The questions will cover all the chapters of the syllabus. The evaluation scheme
will be as indicated in the table below:
Chapters Hours Marks distribution*
1,2,4 11 20
3 6 10
5 5 10
6 5 10
8 5 10
7,9,10 13 20
Total 45 80
*There may be minor deviation in marks distribution

4
 ELECTRIC CIRCUIT THEORY 3.6.2 Exponential excitation
EE 501 3.6.3 Sinusoidal excitation
3.7 Response of series R‐L‐C circuit with
Lecture : 3 Year : II
3.7.1 DC excitation
Tutorial : 1 Part : I 3.7.2 Exponential excitation
Practical : 1.5 3.7.3 Sinusoidal excitation
3.8 Response of parallel R‐L‐C circuit with DC excitation
Course Objectives:
To continue work in Basic Electrical Engineering including the use of the
Laplace Transform to determine the time and frequency domain responses of 4. Transient analysis in RLC circuit by Laplace Transform (8 hours)
electric circuits. 4.1 Introduction
4.2 The Laplace Transformation
4.3 Important properties of Laplace transformation
1. Network Analysis of AC circuit & dependent sources (8 hours) 4.4 Use of Partial Fraction expansion in analysis using Laplace
1.1 Mesh Analysis Transformations
1.2 Nodal Analysis 4.5 Heaviside's partial fraction expansion theorem
1.3 Series & parallel resonance in RLC circuits 4.6 Response of R‐L circuit with
1.3.1 Impedance and phase angle of series Resonant Circuit 4.6.1 DC excitation
1.3.2 Voltage and current in series resonant circuit 4.6.2 Exponential excitation
1.3.3 Band width of the RLC circuit. 4.6.3 Sinusoidal excitation
1.3.4 High‐Q and Low‐Q circuits 4.7 Response of R‐C circuit with
4.7.1 DC excitation
2. Initial Conditions: 4.7.2 Exponential excitation (2 hour
2.1 Characteristics of various network elements 4.7.3 Sinusoidal excitation
2.2 Initial value of derivatives 4.8 Response of series R‐L‐C circuit with
2.3 Procedure for evaluating initial conditions 4.8.1 DC excitation
2.4 Initial condition in the case of R‐L‐C network 4.8.2 Exponential excitation
4.8.3 Sinusoidal excitation
4.9 Response of parallel R‐L‐C circuit with exponential excitation
3. Transient analysis in RLC circuit by direct solution (10 hours) 4.10 Transfer functions Poles and Zeros of Networks
3.1 Introduction
3.2 First order differential equation
3.3 Higher order homogeneous and non‐homogeneous differential 5. Frequency Response of Network (6 hours)
equations 5.1 Introduction
3.4 Particular integral by method of undetermined coefficients 5.2 Magnitude and phase response
3.5 Response of R‐L circuit with 5.3 Bode diagrams
3.5.1 DC excitation 5.4 Band width of Series & parallel Resonance circuits
3.5.2 Exponential excitation 5.5 Basic concept of filters, high pass, low pass, band pass and band
3.5.3 Sinusoidal excitation stop filters
3.6 Response of R‐C circuit with
3.6.1 DC excitation
5
6. Fourier Series and transform (5 hours) - measure amplitude and phase response and plot bode diagrams
6.1 Basic concept of Fourier series and analysis for RL, RC and RLC circuits
6.2 Evaluation of Fourier coefficients for periodic non‐sinusoidal - relate Bode diagrams to transfer functions and pole zero
waveforms in electric networks configuration circuit
6.3 Introduction of Fourier transforms
References:
7. Two‐port Parameter of Networks (6 Hours) 1. M. E. Van Valkenburg, "Network Analysis", third edition
7.1 Definition of two‐port networks Prentice Hall, 2010.
7.2 Short circuit admittance parameters 2. William H. Hyat. Jr. & Jack E. Kemmerly, "Engineering
7.3 Open circuits impedance parameters Circuits Analysis", Fourth edition, McGraw Hill International
7.4 Transmission Short circuit admittance parameters Editions, Electrical Engineering Series, 1987.
7.5 Hybrid parameters 3. Michel D. Cilletti, "Introduction to Circuit Analysis and
7.6 Relationship and transformations between sets of parameters Design", Holt, Hot Rinehart and Winston International
7.7 Application to filters Edition, New York, 1988.
7.8 Applications to transmission lines
7.9 Interconnection of two‐port network (Cascade, series, parallel)

Evaluation Scheme:
Practical: The questions will cover all the chapters of the syllabus. The evaluation
1. Resonance in RLC series circuit scheme will be as indicated in the table below:
- measurement of resonant frequency Chapters Hours Marks distribution*

2. Transient Response in first Order System passive circuits 1 8 12

- measure step and impulse response of RL and RC circuit using 2 2 6
oscilloscope 3 10 16
- relate time response to analytical transfer functions calculations 4 8 12
5 6 12
3. Transient Response in Second Order System passive circuits 6 5 10
- measure step and impulse response of RLC series and parallel 7 6 12
circuits using oscilloscope Total 45 80
- relate time response to transfer functions and pole‐zero * There could be a minor deviation in the marks distribution.
configuration

4. Frequency Response of first order passive circuits

- measure amplitude and phase response and plot bode diagrams
for RL, RC and RLC circuits
- relate Bode diagrams to transfer functions and pole zero
configuration circuit

5. Frequency Response of second order passive circuits

6
 THEORY OF COMPUTATION 5. Undecidability (5 hours)
CT 502 5.1 The Church‐Turing thesis.
5.2 Halting Problem, Universal Turing machine.
Lecture : 3 year : II
5.3 Undecidable problems about Turing machines, grammars.
Tutorial : 1 Part : I 5.4 Properties of Recursive, Recursively enumerable languages.
Practical : 0
6. Computational Complexity (2 hours)
Course Objectives: 6.1 Class P, Class NP, NP‐complete problems.
To provide basic understanding of theory of automata, formal languages, turing
machines and computational complexity. References
1. Introduction (4 hours) 1. H. R. Lewis, C. H. Papadimitriou, “Elements of theory of computation”,
1.1 Set, relation, function, Proof techniques. Pearson Education.
1.2 Alphabets, language, regular expression. 2. Michael Sipser, “Introduction to the Theory of Computation”, Thomson
Course Technology.
2. Finite Automata (12 hours)
2.1 Deterministic Finite Automata. Evaluation Scheme
2.2 Non‐Deterministic Finite Automata. The questions will cover all the chapters of syllabus. The evaluation scheme
2.3 Equivalence of regular language and finite automata. will be as indicated in the table below:
2.4 Regular language, properties of regular language. Chapters Hours Marks distribution*
2.5 Pumping lemma for regular language. 1 4 7
2.6 Decision algorithms for regular languages. 2 12 21
3 12 21
3. Context free language (12 hours) 4 10 17
3.1 Context free grammar. 5 5 9
3.2 Derivative trees, simplification of context free grammar. 6 2 5
3.3 Chomsky normal form. Total 45 80
3.4 Push down automata. * There could be a minor deviation in the marks distribution.
3.5 Equivalence of context free language and push down automata.
3.6 Pumping lemma for context free language.
3.7 Properties of context free language.
3.8 Decision algorithms for context free language.

4. Turing machine (10 hours)

4.1 Definition of Turing machine, notation for Turing machine.
4.2 Computing with Turing machine.
4.3 Extensions of Turing machine.
4.4 Unrestricted grammar.
4.5 Recursive function theory.

7
 ELECTRONIC DEVICES AND CIRCUITS 4.3 Class B Output Stage
4.4 Class AB Output Stage
EX 501 4.5 Biasing the Class AB Stage
Lecture : 3 Year : II 4.6 Power BJTs
Tutorial : 1 Part : I 4.7 Transformer‐Coupled Push‐Pull Stages *
Practical : 3/2 4.8 Tuned Amplifiers
5. Signal Generator and Waveform‐Shaping Circuits (6 hours)
Course Objectives: 5.1 Basic Principles of Sinusoidal Oscillator
• To introduce the fundamentals of analysis of electronic circuits 5.2 Op Amp‐RC Oscillator Circuits
• To provide basic understanding of semiconductor devices and analog 5.3 LC and Crystal Oscillators
integrated circuits 5.4 Generation of Square and Triangular Waveforms Using Astable
1. Diodes (5 hours) Multivibrators
1.1 The Ideal Diode 5.5 Integrated Circuit Timers
1.2 Terminal Characteristics of Junction Diodes 5.6 Precision Rectifier Circuits
1.3 Physical Operation of Diodes 6. Power Supplies, Breakdown Diodes, and Voltage Regulators* (6 hours)
1.4 Analysis of Diode Circuits 6.1 Unregulated Power Supply
1.5 Small Signal Model and Its Application 6.2 Bandgap Voltage Reference, a Constant Current Diodes
1.6 Operation in the Reverse Breakdown Region ‐ Zener Diodes 6.3 Transistor Series Regulators
2. The Bipolar Junction Transistor (10 hours) 6.4 Improving Regulator Performance
2.1 Operation of the npn transistor in the Active Mode 6.5 Current Limiting
2.2 Graphical Representation of Transistor Characteristics 6.6 Integrated Circuit Voltage Regulator
2.3 Analysis of Transistor Circuits at DC
2.4 Transistor as an Amplifier Practical:
2.5 Small Signal Equivalent Circuit Models 1. Bipolar Junction Transistor Characteristics and Single Stage Amplifier
2.6 Graphical Load Line Analysis 2. Field‐Effect Transistor Characteristics and Single Stage Amplifier
2.7 Biasing BJT for Discrete‐Circuit Design 3. Power Amplifiers
2.8 Basic Single‐Stage BJT Amplifier Configurations (C‐B, C‐E, C‐C) 4. Relaxation Oscillator and Sinusoidal Oscillator
2.9 Transistor as a Switch – Cutoff and Saturation 5. Series and Shunt Voltage Regulators
2.10 A General Large‐Signal Model for the BJT: The Ebers‐Moll Model
3. Field‐Effect Transistor (9 hours)
3.1 Structure and Physical Operation of Enhancement‐Type MOSFET References:
3.2 Current‐Voltage Characteristics of Enhancement‐Type MOSFET 1. A.S. Sedra and K.C. Smith, “Microelectronic Circuits”, 6th Edition, Oxford
3.3 The Depletion‐Type MOSFET University Press, 2006
3.4 MOSFET Circuits at DC 2. David A. Bell, “ Electronics Device and Circuits ”, PHI; 3rd Edition, 1999.
3.5 MOSFET as an Amplifier 3. Robert Boylestad and Louis Nashelsky, “ Electronic Device and Circuit
3.6 Biasing in MOS Amplifier Circuits Theory”, PHI; 9th Edition, 2007
3.7 Junction Field‐Effect Transistor 4. Thomas L. Floyd, “Electronic Devices”, 8th Edition, Pearson Education Inc.,
4. Output Stages and Power Amplifiers (9 hours) 2007
4.1 Classification of Output Stages 5. Mark N. Horenstein, “Microelectronic Circuits and Devices”, PHI; 2nd
4.2 Class A Output Stage Edition, 1997

8
6. Paul Horowitz and Winfield Fill, “The Art of Electornics”, Cambridge
Publication; 2 Edition
7. Jacob Millman and Christos C. Halkias,and Satyabrata Jit “Millman’s
Electronic Device and Circuits”, Tata McGraw‐ Hill; 2nd Edition, 2007

Evaluation Scheme:
The questions will cover all the chapters of the syllabus. The evaluation scheme
will be as indicated in the table below
Chapters Hours Marks distribution*
1 6 8
2 10 16
3 9 16
4 9 14
5 6 8
6 6 8
1,2, 3, 4, 5, 6 10
Total 45 80
* There could be a minor deviation in the marks distribution.

9
 DIGITAL LOGIC 3.8. Product‐of‐Sums Simplification
3.9. Hazards and Hazard Covers
EX 502
3.10. HDL Implementation Models
Lecture : 3 Year : II
Tutorial : 0 Part : I 4. Data Processing Circuits (5 hours)
Practical : 3 4.1. Multiplexetures
4.2. Demultiplexetures
Course Objective: 4.3. Decoder
To introduce basic principles of digital logic design, its implementation and 4.4. BCD‐to‐Decimal Decoders
applications. 4.5. Seven‐Segment Decoders
4.6. Encoder
1. Introduction (3 hours) 4.7. Exclusive‐OR Gates
1.1. Definitions for Digital Signals 4.8. Parity Generators and Checkers
1.2. Digital Waveforms 4.9. Magnitude Comparator
1.3. Digital Logic 4.10. Read‐Only Memory
1.4. Moving and Storing Digital Information 4.11. Programmable Array Logic
1.5. Digital Operations 4.12. Programmable Logic Arrays
1.6. Digital Computer 4.13. Troubleshooting with a Logic Probe
1.7. Digital Integrated Circuits 4.14. HDL Implementation of Data Processing Circuits
1.8. Digital IC Signal Levels
1.9. Clock wave form 5. Arithmetic Circuits (5 hours)
1.10. Coding 5.1. Binary Addition
1.10.1. ASCII Code 5.2. Binary Subtraction
1.10.2. BCD 5.3. Unsigned Binary Numbers
1.10.3. The Excess – 3 Code 5.4. Sign‐Magnitude Numbers
1.10.4. The Gray Code 5.5. 2’s Complement Representation
5.6. 2’s Complement Arithmetic
2. Digital Logic (1 hours) 5.7. Arithmetic Building Blocks
2.1. The Basic Gates – NOT, OR, AND 5.8. The Adder‐Subtracter
2.2. Universal Logic Gates – NOR, NAND 5.9. Fast Adder
2.3. AND‐OR‐INVERT Gates 5.10. Arithmetic Logic Unit
2.4. Positive and Negative Logic 5.11. Binary Multiplication and Division
2.5. Introduction to HDL 5.12. Arithmetic Circuits Using HDL
3. Combinational Logic Circuits (5 hours) 6. Flip Flops (5 hours)
3.1. Boolean Laws and Theorems 6.1. RS Flip‐Flops
3.2. Sum‐of‐Products Method 6.2. Gated Flip‐Flops
3.3. Truth Table to Karnaugh Map 6.3. Edge‐Triggered RS Flip‐Flops
3.4. Pairs, Quads, and Octets 6.4. Egde Triggered D Flip‐Flops
3.5. Karnaugh Simplifications 6.5. Egde Triggered J K Flip‐Flops
3.6. Don’t Care Conditions 6.6. Flip‐Flop Timing
3.7. Product‐of‐Sums Method 6.7. J K Mater‐ Slave Flip‐Flops
10
 6.8. Switch Contacts Bounds Circuits 10.7. External Drive for TTL Lods
6.9. Varius Representation of Flip‐Flops 10.8. TTL Driving External Loads
6.10. Analysis of Sequencial Circuits 10.9. 74C00 CMOS
10.10. CMOS Characteristics
7. Registers (2 hours)
10.11. TTL‐ to –CMOS Interface
7.1. Types of Registers
10.12. CMOS‐ to‐ TTL Interface
7.2. Serial In – Serial Out
7.3. Serial In – Parallel Out 11. Applications (2 hours)
7.4. Parallel In – Serial Out 11.1. Multiplexing Displays
7.5. Parallel In – Parallel Out 11.2. Frequency Counters
7.6. Applications of Shift Registers 11.3. Time Measurement
8. Counters (5 hours)
8.1. Asynchronous Counters
Practical:
8.2. Decoding Gates
1. DeMorgan’s law and it’s familiarization with NAND and NOR gates
8.3. Synchronous Counters
2. Encoder, Decoder, and Multiplexer
8.4. Changing the Counter Modulus
3. Familiarization with Binary Addition and Subtraction
8.5. Decade Counters
4. Construction of true complement generator
8.6. Presettable Counters
5. Latches, RS, Master‐Slave and T type flip flops
8.7. Counter Design as a Synthesis Problem
6. D and JK type flip flops
8.8. A Digital Clock
7. Ripple Counter, Synchronous counter
9. Sequential Machines (8 hours) 8. Familiarization with computer package for logic circuit design
9.1. Synchronous machines 9. Design digital circuits using hardware and software tools
9.1.1. Clock driven models and state diagrams 10. Use of PLAs and PLDs
9.1.2. Transition tables, Redundant states
9.1.3. Binary assignment References:
9.1.4. Use of flip‐flops in realizing the models 1. Donald P. Leach, Albert Paul Malvino and Goutam Saha, “ Digital
9.2. Asynchronous machines Principles and Applications”, 6th edition , Tata McGraw‐Hill, 2006
9.2.1. Hazards in asynchronous system and use of redundant 2. David J Comer “Digital Logic And State Machine Design” 3rd edition,
branch Oxfored University Press, 2002
9.2.2. Allowable transitions 3. William I. Fletcher “An Engineering Approach to Digital Design” Printice
9.2.3. Flow tables and merger diagrams Hall of India, New Delhi 1990
9.2.4. Excitation maps and realization of the models 4. William H. Gothmann, “Digital Electronics, An Introduction to Theory and
Practice”, 2nd edition, PHI, 2009
10. Digital Integrate Circuits (4 hours)
10.1. Switching Circuits
10.2. 7400 TTL
10.3. TTL parameters
10.4. TTL Overvew
10.5. Open Collecter Gates
10.6. Three‐state TTL Devices

11
Evaluation Scheme:
The questions will cover all the chapters of the syllabus. The evaluation scheme
will be as indicated in the table below
Chapters Hours Marks distribution*
1 3 6
2 1 4
3 5 8
4 5 10
5 5 8
6 5 8
7 2 4
8 5 8
9 8 12
10 4 8
11 2 4
Total 45 80
* There could be a minor deviation in the marks distribution.

12
 ELECTROMAGNETICS 3.8 Magnetic force, magnetic torque, magnetic moment, magnetic
EX 503 dipole, magnetization.
3.9 Magnetic boundary condition.
Lecture : 3 year : II
Tutorial : 1 Part : I 4. Wave equation and wave propagation (12 hours)
Practical : 3/2 4.1 Faraday’s law, transformer emf, motional emf.
4.2 Displacement current.
Course Objectives: 4.3 Maxwell’s equations in integral and point forms.
To provide basic understanding of the fundamentals of Electromagnetics. 4.4 Wave propagation in lossless and lossy dielectric.
4.5 Plane waves in free space, lossless dielectric, good conductor.
1. Introduction (3 hours) 4.6 Power and pointing vector.
1.1 Co‐ordinate system. 4.7 Reflection of plane wave at normal and oblique incidence.
1.2 Scalar and vector fields.
1.3 Operations on scalar and vector fields. 5. Transmission lines (5 hours)
5.1 Transmission line equations.
2. Electric field (11 hours) 5.2 Input impedance, reflection coefficient, standing wave ratio.
2.1 Coulomb’s law. 5.3 Impedance matching, quarter wave transformer, single stub
2.2 Electric field intensity. matching, double stub matching.
2.3 Electric flux density.
2.4 Gauss’s law and applications. 6. Wave guides (4 hours)
2.5 Physical significance of divergence, Divergence theorem. 6.1 Rectangular wave guide.
2.6 Electric potential, potential gradient. 6.2 Transverse electric mode, transverse magnetic mode.
2.7 Energy density in electrostatic field.
2.8 Electric properties of material medium. 7. Antennas (1 hour)
2.9 Free and bound charges, polarization, relative permittivity, electric 7.1 Introduction to antenna, antenna types and properties.
dipole.
2.10 Electric Boundary conditions. Practical:
2.11 Current, current density, conservation of charge, continuity 1. Teledeltos (electro‐conductive) paper mapping of electrostatic fields.
equation, relaxation time. 2. Determination of dielectric constant, display of a magnetic Hysteresis loop
2.12 Boundary value problems, Laplace and Poisson equations and their 3. studies of wave propagation on a lumped parameter transmission line
solutions, uniqueness theorem. 4. microwave sources, detectors, transmission lines
2.13 Graphical field plotting, numerical integration. 5. Standing wave patterns on transmission lines, reflections, power patterns
3. Magnetic field (9 hours) on transmission lines, reflections, power measurement.
3.1 Biot‐Savart’s law. 6. Magnetic field measurements in a static magnetic circuit, inductance,
3.2 Magnetic field intensity. leakage flux.
3.3 Ampere’s circuital law and its application.
3.4 Magnetic flux density.
3.5 Physical significance of curl, Stoke’s theorem.
3.6 Scalar and magnetic vector potential.
3.7 Magnetic properties of material medium.

13
References:
1. W. H. Hayt, “Engineering Electromagnetics”, McGraw‐Hill Book Company.
2. J. D. Kraus, “Electromagnetics”, McGraw‐Hill Book Company.
3. N. N. Rao, “Elements of Engineering Electromagnetics”, Prentice Hall.
4. Devid K. Cheng, “Field and Wave Electromagnetics”, Addison‐Wesley.
5. M. N. O. Sadiku, “Elements of Electromagnetics”, Oxford University Press.

Evaluation Scheme
The questions will cover all the chapters of the syllabus. The evaluation scheme
will be as indicated in the table below
Chapters Hours Marks distribution*
1 3 5
2 11 20
3 9 16
4 12 21
5, 6, 7 10 16
Total 45 80
* There could be a minor deviation in the marks distribution.

14
 ELECTRICAL MACHINES 3. DC Generator (6 hours)
EE 554 3.1 Constructional Details and Armature Winding
3.2 Working principle and Commutator Action
Lecture : 3 Year : II
3.3 EMF equation
Tutorial : 1 Part : II 3.4 Method of excitation: separately and self excited, Types of DC
Practical : 3/2 Generator
3.5 Characteristics of series, shunt and compound generator
Course Objectives: 3.6 Losses in DC generators
To impart knowledge on constructional details, operating principle and 3.7 Efficiency and Voltage Regulation
performance of Transformers, DC Machines, 1‐phase and 3‐phase Induction
Machines, 3‐phase Synchronous Machines and Fractional Kilowatt Motors. 4. DC Motor (6 hours)
4.1 Working principle and Torque equation
1. Magnetic Circuits and Induction (4hours) 4.2 Back EMF
1.1 Magnetic Circuits 4.3 Method of excitation, Types of DC motor
1.2 Ohm’s Law for Magnetic Circuits 4.4 Performance Characteristics of D.C. motors
1.3 Series and Parallel magnetic circuits 4.5 Starting of D.C. Motors: 3 point and 4 point starters
1.4 Core with air gap 4,6 Speed control of D.C. motors: Field Control, Armature Control
1.5 B‐H relationship (Magnetization Characteristics) 4.7 Losses and Efficiency
1.6 Hysteresis with DC and AC excitation
1.7 Hysteresis Loss and Eddy Current Loss 5. Three Phase Induction Machines (6 hours)
1.8 Faraday’s Law of Electromagnetic Induction, Statically and 5.1 Three Phase Induction Motor
Dynamically Induced EMF 5.1.1 Constructional Details and Types
1.9 Force on Current Carrying Conductor 5.1.2 Operating Principle, Rotating Magnetic Field, Synchronous
Speed, Slip, Induced EMF, Rotor Current and its frequency,
2. Transformer (8 hours) Torque Equation
2.1 Constructional Details, recent trends 5.1.3 Torque‐Slip characteristics
2.2 Working principle and EMF equation 5.2 Three Phase Induction Generator
2.3 Ideal Transformer 5.2.1 Working Principle, voltage build up in an Induction
2.4 No load and load Operation Generator
2.5 Operation of Transformer with load 5.2.2 Power Stages
2.6 Equivalent Circuits and Phasor Diagram
2.7 Tests: Polarity Test, Open Circuit test, Short Circuit test and 6. Three Phase Synchronous Machines (6 hours)
Equivalent Circuit Parameters 6.1 Three Phase Synchronous Generator
2.8 Voltage Regulation 6.1.1 Constructional Details, Armature Windings, Types of Rotor,
2.9 Losses in a transformer Exciter
6.1.2 Working Principle
2.10 Efficiency, condition for maximum efficiency and all day efficiency
2.11 Instrument Transformers: Potential Transformer (PT) and Current 6.1.3 EMF equation, distribution factor, pitch factor
Transformer (CT) 6.1.4 Armature Reaction and its effects
2.12 Auto transformer: construction, working principle and Cu saving 6.1.5 Alternator with load and its phasor diagram
2.13 Three phase Transformers 6.2 Three Phase Synchronous Motor
6.2.1 Principle of operation
6.2.2 Starting methods
15
 6.2.3 No load and Load operation, Phasor Diagram References:
6.2.4 Effect of Excitation and power factor control 1 I.J. Nagrath & D.P.Kothari,” Electrical Machines”, Tata McGraw Hill
2 S. K. Bhattacharya, “Electrical Machines”, Tata McGraw Hill
7. Fractional Kilowatt Motors (6 hours)
3 B. L. Theraja and A. K. Theraja, “Electrical Technology (Vol‐II)”, S. Chand
2.14 Single phase Induction Motors: Construction and Characteristics
4 Husain Ashfaq ,” Electrical Machines”, Dhanpat Rai & Sons
2.15 Double Field Revolving Theory
5 A.E. Fitzgerald, C.Kingsley Jr and Stephen D. Umans,”Electric Machinery”,
2.16 Split phase Induction Motor
Tata McGraw Hill
7.1.1 Capacitors start and run motor
6 B.R. Gupta & Vandana Singhal, “Fundamentals of Electrical Machines, New
7.1.2 Reluctance start motor
Age International
2.17 Alternating Current Series motor and Universal motor
7 P. S. Bhimbra, “Electrical Machines”’ Khanna Publishers
2.18 Special Purpose Machines: Stepper motor, Schrage motor and
8 Irving L.Kosow, “Electric Machine and Tranformers”, Prentice Hall of India.
Servo motor
9 M.G. Say, “The Performance and Design of AC machines”, Pit man & Sons.
10 Bhag S. Guru and Huseyin R. Hizirogulu, “Electric Machinery and
Practical:
Transformers” Oxford University Press, 2001.
1. Magnetic Circuits
- To draw B‐H curve for two different sample of Iron Core
- Compare their relative permeability
2. Two Winding Transformers Evaluation Scheme
- To perform turn ratio test
The questions will cover all the chapters of syllabus. The evaluation scheme will
- To perform open circuit (OC) and short circuit (SC) test to determine
be as indicated in the table below
equivalent circuit parameter of a transformer and hence to determine
the regulation and efficiency at full load Chapters Hours Marks distribution*
3. DC Generator 1 4 8
- To draw open circuit characteristic (OCC) of a DC shunt generator 2 8 16
- To draw load characteristic of shunt generator 3 6 12
4. DC Motor 4 6 12
- Speed control of DC Shunt motor by (a) armature control method (b) 5 6 10
field control method 6 6 10
- To observe the effect of increasing load on DC shunt motor’s speed, 7 6 12
armature current, and field current. Total 42 80
5. 3‐phase Machines
- To draw torque‐speed characteristics and to observe the effect of rotor * There could be a minor deviation in the marks distribution.
resistance on torque‐speed characteristics of a 3‐phase Induction
Motor
- To study load characteristics of synchronous generator with (a)
resistive load (b) inductive load and (c) capacitive load

6. Fractional Kilowatt Motors

- To study the effect of a capacitor on the starting and running of a
single‐phase induction motor
- Reversing the direction of rotation of a single phase capacitor induct
16
 NUMERICAL METHODS 5. Numerical Differentiation and Integration (6 hours)
SH 553 5.1. Numerical Differentiation formulae
5.2. Maxima and minima
Lecture : 3 Year : II
5.3. Newton‐Cote general quadrature formula
Tutorial : 1 Part : II 5.4. Trapezoidal, Simpson's 1/3, 3/8 rule
Practical : 3 5.5. Romberg integration
5.6. Gaussian integration ( Gaussian – Legendre Formula 2 point and 3
Course objective: point)
The course aims to introduce numerical methods used for the solution of 6. Solution of ordinary differential equations (6 hours)
engineering problems. The course emphasizes algorithm development and 6.1. Euler's and modified Euler's method
programming and application to realistic engineering problems. 6.2. Runge Kutta methods for 1st and 2nd order ordinary differential
1. Introduction, Approximation and errors of computation (4 hours) equations
1.1. Introduction, Importance of Numerical Methods 6.3. Solution of boundary value problem by finite difference method
1.2. Approximation and Errors in computation and shooting method.
1.3. Taylor's series 7. Numerical solution of Partial differential Equation (8 hours)
1.4. Newton's Finite differences (forward , Backward, central 7.1. Classification of partial differential equation(Elliptic, parabolic,
difference, divided difference) and Hyperbolic)
1.5. Difference operators, shift operators, differential operators 7.2. Solution of Laplace equation ( standard five point formula with
1.6. Uses and Importance of Computer programming in Numerical iterative method)
Methods. 7.3. Solution of Poisson equation (finite difference approximation)
2. Solutions of Nonlinear Equations (5 hours) 7.4. Solution of Elliptic equation by Relaxation Method
2.1. Bisection Method 7.5. Solution of one dimensional Heat equation by Schmidt method
2.2. Newton Raphson method ( two equation solution)
2.3. Regula‐Falsi Method , Secant method
2.4. Fixed point iteration method
2.5. Rate of convergence and comparisons of these Methods Practical:
3. Solution of system of linear algebraic equations (8 hours) Algorithm and program development in C programming language of following:
3.1. Gauss elimination method with pivoting strategies 1. Generate difference table.
3.2. Gauss‐Jordan method 2. At least two from Bisection method, Newton Raphson method, Secant
3.3. LU Factorization method
3.4. Iterative methods (Jacobi method, Gauss‐Seidel method) 3. At least one from Gauss elimination method or Gauss Jordan method.
3.5. Eigen value and Eigen vector using Power method Finding largest Eigen value and corresponding vector by Power method.
4. Interpolation (8 hours) 4. Lagrange interpolation. Curve fitting by Least square method.
4.1. Newton's Interpolation ( forward, backward) 5. Differentiation by Newton's finite difference method. Integration using
4.2. Central difference interpolation: Stirling's Formula, Bessel's Simpson's 3/8 rule
Formula 6. Solution of 1st order differential equation using RK‐4 method
4.3. Lagrange interpolation 7. Partial differential equation (Laplace equation)
4.4. Least square method of fitting linear and nonlinear curve for 8. Numerical solutions using Matlab.
discrete data and continuous function
4.5. Spline Interpolation (Cubic Spline)

17
References:
1. Dr. B.S.Grewal, " Numerical Methods in Engineering and Science ",
Khanna Publication, 7th edition.
2. Robert J schilling, Sandra l harries , " Applied Numerical Methods for
Engineers using MATLAB and C.", 3rd edition Thomson Brooks/cole.
3. Richard L. Burden, J.Douglas Faires, "Numerical Analysis 7th edition" ,
Thomson / Brooks/cole
4. John. H. Mathews, Kurtis Fink ," Numerical Methods Using MATLAB 3rd
edition " ,Prentice Hall publication
5. JAAN KIUSALAAS , " Numerical Methods in Engineering with MATLAB" ,
Cambridge Publication
Evaluation scheme:
The questions will cover all the chapters of the syllabus. The evaluation scheme
will be as indicated in the table below
Chapters Hours Marks distribution*
1
9 16
2
3 8 16
4 8 16
5 6 10
6 6 10
7 8 12
Total 45 80
* There could be a minor deviation in the marks distribution

18
 APPLIED MATHEMATICS
SH 551 2. The Z‐Transform (9 hours)
2.1 Introduction
Lecture : 3 Year : II
2.2 Properties of Z‐Transform
Tutorial : 1 Part : II 2.3 Z‐ transform of elementary functions
Practical : 0 2.4 Linearity properties
Course Objective 2.5 First shifting theorem, second shifting theorem, Initial value
This course focuses on several branches of applied mathematics. The students theorem,
are exposed to complex variable theory and a study of the Fourier and 2.6 Final value theorem, Convolution theorem
Z‐Transforms, topics of current importance in signal processing. The course 2.7 Some standard Z‐ transform
concludes with studies of the wave and heat equations in Cartesian and polar 2.8 Inverse Z‐Transform
coordinates. 2.9 Method for finding Inverse Z‐Transform
2.10 Application of Z‐Transform to difference equations
1. Complex Analysis (18 hours)
1.1 Complex Analytic Functions 3. Partial Differential Equations (12 hours)
1.1.1 Functions and sets in the complex plane 3.1 Linear partial differential equation of second order, their
1.1.2 Limits and Derivatives of complex functions classification and solution
1.1.3 Analytic functions. The Cauchy –Riemann equations 3.2 Solution of one dimensional wave equation, one dimensional heat
1.1.4 Harmonic functions and it’s conjugate equation, two dimensional heat equation and Laplace equation
1.2 Conformal Mapping (Cartesian and polar form) by variable separation method
1.2.1 Mapping
1.2.2 Some familiar functions as mappings 4. Fourier Transform (6 hours)
1.2.3 Conformal mappings and special linear functional 4.1 Fourier integral theorem, Fourier sine and cosine integral; complex
transformations form of Fourier integral
1.2.4 Constructing conformal mappings between given domains 4.2 Fourier transform, Fourier sine transform, Fourier cosine
1.3 Integral in the Complex Plane transform and their properties
1.3.1 Line integrals in the complex plane 4.3 Convolution, Parseval’s identity for Fourier transforms
1.3.2 Basic Problems of the complex line integrals 4.4 Relation between Fourier transform and Laplace transform
1.3.3 Cauchy’s integral theorem
1.3.4 Cauchy’s integral formula
1.3.5 Supplementary problems References:
1.4 Complex Power Series, Complex Taylor series and Lauren series
1. E. Kreyszig, “Advance Engineering Mathematics”, Fifth Edition, Wiley, New York.
1.4.1 Complex power series
2. A. V. Oppenheim, “Discrete‐Time Signal Processing”, Prentice Hall, 1990.
1.4.2 Functions represented by power series
3. K. Ogata, “Discrete‐Time Control System”, Prentice Hall, Englewood Cliffs,
1.4.3 Taylor series, Taylor series of elementary functions
New Jersey, 1987.
1.4.4 Practical methods for obtaining power series, Laurent series
1.4.5 Analyticity at infinity, zeros, singularities, residues, Cauchy's
residue theorem
1.4.6 Evaluation of real integrals

19
Evaluation Scheme
The questions will cover all the chapters of the syllabus. The evaluation scheme
will be as indicated in the table below:
Chapter Hour Marks distribution*
1 18 30
2 9 20
3 12 20
4 6 10
Total 45 80
*There may be minor deviation in marks distribution.

20
 INSTRUMENTATION I 4.1 Basic Op‐amp characteristics
EE 552 4.2 Instrumentation amplifier
4.3 Signal amplification, attenuation, integration, differentiation,
Lecture : 3 Year : II network isolation, wave shaping
Tutorial : 1 Part : II 4.4 Effect of noise, analog filtering, digital filtering
Practical : 3/2 4.5 Optical communication, fibre optics, electro‐optic conversion
devices
Course Objectives:
5. Analog ‐ Digital and Digital ‐ Analog Conversion (6 hours)
Comprehensive treatment of methods and instrument for a wide range of
5.1 Analog signal and digital signal
measurement problems.
5.2 Digital to analog convertors ‐ weighted resistor type, R‐2R ladder
type, DAC Errors
1. Instrumentations Systems (2 hours)
5.3 Analog to digital convertors ‐ successive approximation type,
1.1 Functions of components of instrumentation system
ramp type, dual ramp type, flash type, ADC errors
introduction, signal processing , Signal transmission ,output
6. Digital Instrumentation (5 hours)
indication
6.1 Sample data system, sample and hold circuit
1.2 Need for electrical, electronics, pneumatic and hydraulic working
6.2 Components of data acquisition system
media systems and conversion devices
6.3 Interfacing to the computer
1.3 Analog and digital systems
7. Electrical equipment (8 hours)
2. Theory of measurement (10 hours)
7.1 Wattmeter
2.1 Static performance parameters ‐ accuracy, precision, sensitivity,
7.1.1 Types
resolution and linearity
7.1.2 Working principles
2.2 Dynamic performance parameters ‐ response time, frequency
7.2 Energy meter
response and bandwidth
7.2.1 Types
2.3 Error in measurement
7.2.2 Working principles
2.4 Statistical analysis of error in measurement
7.3 Frequency meter
2.5 Measurement of voltage & current (moving coil & moving iron
7.3.1 Types
instruments)
7.3.2 Working principles
2.6 Measurement of low, high & medium resistances
7.4 Power factor meter
2.7 AC bridge & measurement of inductance and capacitance
7.5 Instrument transformers
3. Transducer (8 hours)
3.1 Introduction Practical:
3.2 Classification 1. Accuracy test in analog meters
3.3 Application 2. Operational Amplifiers in Circuits
3.3.1 Measurement of mechanical variables, displacement, - Use of Op amp as a summer, inverter, integrator and
strain. velocity. acceleration and vibration differentiator
3.3.2 Measurement of process variables ‐ temperature pressure, 3. Use resistive, inductive and capacitive transducers to measure
level, fluid flow, chemical constituents in gases or liquids, displacement
pH and humidity. - Use strain gauge transducers to measure force
3.3.3 Measurement of bio‐physical variables blood pressure and 4. Study of Various transducers for measurement of Angular
myoelectric potentials displacement, Angular Velocity, Pressure and Flow
4. Electrical Signal Processing and transmission (6 hours)
21
 - Use optical, Hall effect and inductive transducer to measure
angular displacement
- Use tacho ‐ generator to measure angular velocity
- Use RTD transducers to measure pressure and flow
5. Digital to Analog Conversion
- Perform static testing of D/A converter
6. Analog to Digital Conversion
- Perform static testing of A/D converter

References:
1. D.M Considine "Process Instruments and Controls Handbook" third
edition McGraw Hill, 1985
2. S. Wolf and R.F.M. Smith "Students Reference Manual for Electronics
Instrumentation Laboratories", Prentice Hall, 1990
3. E.O Deobelin "Measurement System, Application and Design" McGraw
Hill, 1990
4. A.K Sawhney "A Course in Electronic Measurement and Instrumentation
" Dhanpat Rai and Sons,1988
5. C.S. Rangan, G.R Sharma and V.S.V. Mani, "Instrumentation Devices and
Systems" Tata McGraw Hill publishing Company Limited New
Delhi,1992.
6. J.B. Gupta. "A Course in Electrical & Electronics Measurement &
Instrumentation, thirteenth edition, 2008, Kataria & Sons.

Evaluation Scheme:
The questions will cover all the chapters of the syllabus. The evaluation scheme
will be as indicated in the table below:
Chapters Hours Marks distribution*
1 2 6
2 10 16
3 8 16
4 6 10
5 6 10
6 5 10
7 8 12
Total 45 80
* There could be a minor deviation in the marks distribution.

22
 DATA STRUCTURE AND ALGORITHMS 6.3 Tree search, insertion/deletions
CT 552 6.4 Tree traversals (pre‐order, post‐order and in‐order)
6.5 Height, level and depth of a tree
Lecture : 3 Year : II 6.6 AVL balanced trees and Balancing algorithm
Tutorial : 0 Part : II 6.7 The Huffman algorithm
Practical : 3 6.8 B‐Tree
6.9 Red Black Tree
Course Objectives:
• To provide fundamental knowledge of various data structures and their 7. Sorting ( 5 hours )
implementation 7.1 Types of sorting: internal and external
7.2 Insertion and selection sort
• To provide the fundamental knowledge of various algorithms and their analysis
7.3 Exchange sort
1. Concept of data structure (2 hours) 7.4 Merge and Redix sort
1.1 Introduction: data types, data structures and abstract data types 7.5 Shell sort
1.2 Introduction to algorithms 7.6 Heap sort as a priority queue
7.7 Big ‘O’ notation and Efficiency of sorting
2. The Stack and Queue (6 hours)
2.1 Stack operation 8. Searching ( 5 hours )
2.2 Stack application: Evaluation of Infix, Postfix and Prefix expressions 8.1 Search technique
2.3 Operations in queue, Enqueue and Dequeue 8.2 Sequential, Binary and Tree search
2.4 Linear and circular queue 8.3 General search tree
2.5 Priority queue 8.4 Hashing
8.4.1 Hash function and hash tables
3. List ( 3 hours )
8.4.2 Collision resolution technique
3.1 Definition
3.1.1 Static and dynamic list structure 9. Growth Functions ( 2 hours)
3.1.2 Array implementation of lists Asymptotic notations: θ , O, Ω , o, ω notations and their properties
3.1.3 Queues as list
10. Graphs ( 6 hours )
4. Linked lists ( 5 hours ) 10.1 Representation and applications
4.1 Dynamic implementation 10.2 Transitive closure
4.2 Operations in linked list 10.3 Warshall’s algorithm
4.3 Linked stacks and queues 10.4 Graphs type
4.4 Doubly linked lists and its applications 10.5 Graph traversal and Spanning forests
5. Recursion ( 4 hours ) 10.5.1 Depth First Traversal and Breadth First Traversal
5.1 Principle of recursion 10.5.2 Topological sorting: Depth first, Breadth first topological
5.2 TOH and Fibonacci sequence sorting
5.3 Applications of recursion 10.5.3 Minimum spanning trees, Prim’s, Kruskal’s and Round‐
Robin algorithms
6. Trees ( 7 hours ) 10.6 Shortest‐path algorithm
6.1 Concept 10.6.1 Greedy algorithm
6.2 Operation in Binary tree 10.6.2 Dijkstra’s Algorithm
23
Practical: Evaluation Scheme:
There shall be 10 to 12 lab exercises based on C or C++
1. Implementation of stack The questions will cover all the chapters of the syllabus. The evaluation scheme
2. Implementations of linear and circular queues will be as indicated in the table below:
3. Solutions of TOH and Fibonacci sequence by Recursion Chapters Hours Marks distribution*
4. Implementations of linked list: singly and doubly linked list 1 2 4
5. Implementation of trees: AVL trees, and balancing 2 6 10
6. Implementation of Merge sort 3 3 6
7. Implementation of search: sequential, Binary and Tree search 4 5 10
8. Implementation of Graphs: Graph Traversals 5 4 8
9. Implementation of hashing
6 7 12
10. Implementation of Heap
7 5 8
8 5 8
9 2 4
10 6 10
Total 45 80
References
* There could be a minor deviation in the marks distribution.
1. Y. Langsam, M. J. Augenstein and A. M Tenenbaum, “Data Structures
using C and C++”, PHI
2. T. H. Cormen, C. E. Leiserson, R. L. Rivest, C. Stein, “Introduction to
Algorithms”, PHI
3. G.W. Rowe, “Introduction to Data Structure and Algorithms with C and
C++”, PHI
4. R. L. Kruse, B. P. Leung, C. L. Tondo, “Data Structure and Program design
in C”, PHI
5. G. Brassard and P. Bratley, “Fundamentals of Algorithms”, PHI

24
 MICROPROCESSORS 3.2 Addressing Modes of 8086
3.3 Assembly Language Programming
EX 551 3.4 High Level versus Low Level Programming
Lecture : 3 Year : II 3.5 Assembly Language Syntax
Tutorial : 1 Part : II 3.5.1 Comments
Practical : 3 3.5.2 Reserved words
3.5.3 Identifiers
Course Objective: 3.5.4 Statements
The objective of the course is to familiarize students with programming, hardware 3.5.5 Directives
and application of microprocessor. 3.5.6 Operators
3.5.7 Instructions
3.6 EXE and COM programs
1. Introduction (4 hours)
3.7 Assembling, Linking and Executing
1.1 Introduction and History of Microprocessors
3.8 One Pass and Two Pass Assemblers
1.2 Basic Block Diagram of a Computer
3.9 Keyboard and Video Services
1.3 Organization of Microprocessor Based System
3.10 Various Programs in 8086
1.4 Bus Organization
3.10.1 Simple Programs for Arithmetic, Logical, String
1.5 Stored program Concept and Von Neumann Machine
Input/Output
1.6 Processing Cycle of a Stored Program Computer
3.10.2 Conditions and Loops
1.7 Microinstructions and Hardwired/Microprogrammed Control Unit
3.10.3 Array and String Processing
1.8 Introduction to Register Transfer Language
3.10.4 Read and Display ASCII and Decimal Numbers
3.10.5 Displaying Numbers in Binary and Hexadecimal Formats
2. Programming with 8085 Microprocessor (10 hours)
2.1 Internal Architecture and Features of 8085 microprocessor
4. Microprocessor System (10 hours)
2.2 Instruction Format and Data Format
4.1 Pin Configuration of 8085 and 8086 Microprocessors
2.3 Addressing Modes of 8085
4.2 Bus Structure
2.4 Intel 8085 Instruction Set
4.2.1 Synchronous Bus
2.5 Various Programs in 8085
4.2.2 Asynchronous Bus
2.5.1 Simple Programs with Arithmetic and Logical Operations
4.2.3 Read and Write Bus Timing of 8085 and 8086
2.5.2 Conditions and Loops
Microprocessors
2.5.3 Array and Table Processing
4.3 Memory Device Classification and Hierarchy
2.5.4 Decimal BCD Conversion
4.4 Interfacing I/O and Memory
2.5.5 Multiplication and Division
4.4.1 Address Decoding
4.4.2 Unique and Non Unique Address Decoding
3. Programming with 8086 Microprocessor (12 hours) 4.4.3 I/O Mapped I/O and Memory Mapped I/O
3.1 Internal Architecture and Features of 8086 Microprocessor 4.4.4 Serial and Parallel Interfaces
3.1.1 BIU and Components 4.4.5 I/O Address Decoding with NAND and Block Decoders
3.1.2 EU and Components (8085, 8086)
3.1.3 EU and BIU Operations 4.4.6 Memory Address Decoding with NAND, Block and PROM
3.1.4 Segment and Offset Address Decoders (8085, 8086)
25
 4.5 Parallel Interface Practical:
4.5.1 Modes: Simple, Wait, Single Handshaking and Double There will be about 12 lab exercises to program 8085 and 8086
Handshaking microprocessors.
4.5.2 Introduction to Programmable Peripheral Interface (PPI)
4.6 Serial Interface
4.6.1 Synchronous and Asynchronous Transmission References:
4.6.2 Serial Interface Standards: RS232, RS423, RS422, USB 1. Ramesh S. Gaonkar, “Microprocessor Architecture, Programming and
4.6.3 Introduction to USART Application with 8085”, 5th Edition 2002, Prentice Hall
4.7 Introduction to Direct Memory Access (DMA) and DMA Controllers 2. Peter Abel, “IBM PC Assembly Language and Programming”, 5th Edition
2001, Pearson Education Inc.
5. Interrupt Operations (5 hours) 3. D. V. Hall, “Microprocessor and Interfacing, Programming and
5.1 Polling versus Interrupt Hardware”, 2nd Edition 1999, Tata McGraw Hill
5.2 Interrupt Processing Sequence 4. John Uffenbeck, “Microcomputers and Microprocessors, The 8080,
5.3 Interrupt Service Routine 8085 and Z‐80 Programming, Interfacing and Troubleshooting” 3rd
5.4 Interrupt Processing in 8085 Edition 1999, Prentice Hall
5.4.1 Interrupt Pins and Priorities 5. Walter A. Triebel and Avtar Singh, “The 8088 and 8086
5.4.2 Using Programmable Interrupt Controllers (PIC) Microprocessors, Programming, Interfacing, Software, Hardware and
5.4.3 Interrupt Instructions Applications”, 4th Edition 2003, Prentice Hall
5.5 Interrupt Processing in 8086 6. William Stalling, “Computer Organization and Architecture”, 8th Edition
5.5.1 Interrupt Pins 2009, Prentice Hall
5.5.2 Interrupt Vector Table and its Organization
5.5.3 Software and Hardware Interrupts Evaluation Scheme:
5.5.4 Interrupt Priorities
The questions will cover all the chapters of the syllabus. The evaluation scheme
will be as indicated in the table below:
6. Advanced Topics (4 hours)
6.1 Multiprocessing Systems Chapters Hours Marks distribution*
6.1.1 Real and Pseudo‐Parallelism 1 4 8
6.1.2 Flynn’s Classification 2 10 16
6.1.3 Instruction Level, Thread Level and Process Level Parallelism 3 12 16
6.1.4 Interprocess Communication, Resource Allocation and
4 10 16
Deadlock
6.1.5 Features of Typical Operating System 5 5 8
6.2 Different Microprocessor Architectures 6 4 8
6.2.1 Register Based and Accumulator Based Architecture 1,2,3,4,5,6 ‐ 8
6.2.2 RISC and CISC Architectures Total 45 80
6.2.3 Digital Signal Processors
*There could be a minor deviation in Marks distribution

26
 DISCRETE STRUCTURE 4. Graph Theory (15 hours)
CT 551 4.1. Undirected and Directed Graphs
4.2. Walk Paths, Circuits, Components
Lecture : 3 Year : II
4.3. Connectedness Algorithm
Tutorial : 0 Part : II 4.4. Shortest Path Algorithm
Practical : 0 4.5. Bipartite Graphs, Planar Graphs, Regular Graphs
4.6. Planarity Testing Algorithms
Course Objectives: 4.7. Eulerian Graph
• To gain knowledge in discrete mathematics and finite state automata in 4.8. Hamiltonian Graph
an algorithmic approach. 4.9. Tree as a Directed Graph
• To gain fundamental and conceptual clarity in the area of Logic, 4.10. Binary Tree, Spanning Tree
Reasoning, Algorithms, Recurrence Relation, Graph Theory, and Theory 4.11. Cutsets and Cutvertices
of Automata. 4.12. Network Flows, Maxflow and Mincut Theorem
1. Logic, Induction and Reasoning (12 hours) 4.13. Data Structures Representing Trees and Graphs in Computer
1.1. Proposition and Truth function 4.14. Network Application of Trees and Graphs
1.2. Propositional Logic 4.15. Concept of Graph Coloring
1.3. Expressing statements in Logic Propositional Logic
1.4. The predicate Logic References:
1.5. Validity 1. Kenth Rosen, “Discrete Mathematical Structures with Applications to
1.6. Informal Deduction in Predicate Logic Computer Science”, WCB/ McGraw Hill
1.7. Rules of Inference and Proofs 2. G. Birkhoff, T.C. Bartee, “Modern Applied Algebra”, CBS Publishers.
1.8. Informal Proofs and Formal Proofs 3. R. Johnsonbaugh, “Discrete Mathematics”, Prentice Hall Inc.
1.9. Elementary Induction and Complete Induction 4. G.Chartand, B.R.Oller Mann, “Applied and Algorithmic Graph Theory”,
1.10. Methods of Tableaux McGraw Hill
1.11. Consistency and Completeness of the System 5. Joe L. Mott, Abrahan Kandel, and Theodore P. Baker, “Discrete
Mathematics for Computer Scientists and Mathematicians”, Prentice‐Hall
2. Finite State Automata (10 hours) of India
2.1. Sequential Circuits and Finite state Machine
2.2. Finite State Automata
2.3. Language and Grammars Evaluation Scheme:
2.4. Non‐deterministic Finite State Automata The questions will cover all the chapters of the syllabus. The evaluation scheme
2.5. Language and Automata will be as indicated in the table below:
2.6. Regular Expression and its characteristics
Chapters Hours Marks distribution*
3. Recurrence Relation (8 hours)
1 12 24
3.1. Recursive Definition of Sequences
2 10 16
3.2. Solution of Linear recurrence relations
3 8 8
3.3. Solution to Nonlinear Recurrence Relations
3.4. Application to Algorithm Analysis 4 15 32
Total 45 80
*There could be a minor deviation in Marks distribution
27