Syllabus Sem 3-4-Pages
Syllabus Sem 3-4-Pages
Syllabus Sem 3-4-Pages
Module
No. Detailed Contents Hrs.
01 Complex Integration 7
1.1 Line Integral, Cauchy’s Integral theorem for simple connected and multiply
connected regions (without proof), Cauchy’s Integral formula (without proof).
1.2 Taylor’s and Laurent’s series (without proof).
1.3 Definition of Singularity, Zeroes, poles of f(z), Residues, Cauchy’s Residue Theorem
(without proof).
Term Work:
General Instructions:
Assessment:
Assessment consists of two class tests of 20 marks each. The first-class test (Internal Assessment I) is to be
conducted when approx. 40% syllabus is completed and secondclass test (Internal Assessment II) when additional
35% syllabus is completed. Duration of each test shall be one hour.
Module Unit
No. Contents Hrs
No.
Text Books:
1.Donald A. Neamen, “Electronic Circuit Analysis and Design”, TATA McGraw Hill, 2nd Edition.
2.Ramakant A. Gayakwad, “Op-Amps and Linear Integrated Circuits”, Pearson Prentice Hall, 4th Edition.
Reference Books:
Module Unit
Contents Hrs.
No. No.
Text Books:
1. I. J. Nagrath, M. Gopal, “Control System Engineering”, 5th edition, New Age International Publishers
2. B. S. Manke, “Linear Control Systems”, Khanna Publishers, New Delhi.
3. D. Patranabis, “Principle of Industrial Instrumentation”, Tata McGraw Hill.
4. A.K. Sawhney, “Electrical & Electronic Measurement & Instrumentation” – DRS. India
5. H.S.Kalsi, “Electronic Instrumentation”-TMH, 2nd Edition.
Reference Books:
1. K. Ogata, “Modern Control Engineering”, PHI, New Delhi
2. Norman S. Nise, “Control System Engineering”, John Wiley and Sons.
3. B. C. Kuo, “Automatic Control Systems”, PHI, New Delhi
4. C. S. Rangan, G. R. Sharma and V. S. Mani, ‘Instrumentation Devices and Systems’, Tata McGraw-Hill
Publishing Company Ltd.
5. Helfrick& Cooper, “Modern Electronic Instrumentation & Measuring Techniques” – PHI
Module Unit
Contents Hrs.
No. No.
Text Books:
1. 8086/8088 family: Design Programming and Interfacing: By John Uffenbeck (Pearson Education)
2. Microprocessor and Interfacing: By Douglas Hall (TMH Publication)
3. The 8051 Microcontroller and Embedded Systems Using Assembly and C: By M. A. Mazidi, J. C. Mazidi,
Rolin D. McKinlay, Pearson Education, 2ndEdition.
4. The 8051 Microcontroller: ByKenneth J. Ayala, Cengage Learning India Pvt. Ltd, 3rdEdition
Module Unit
Contents Hrs
No. No.
1 Set Theory and Logic 06
1.1 Set Theory: Fundamentals - Sets and Subsets, Venn Diagrams, Operations on sets,
Laws of Set Theory, Power Set,.
1.2 Principle of Inclusion and Exclusion, Mathematical Induction.
1.3 Propositions and Logical operations, Truth tables,Equivalence, Implications
1.4 Laws of Logic, Normal Forms, Inference
1.5 Predicates and Quantifiers
2 Relations and Functions 07
2.1 Relations- Definition, Properties of Relations
2.2 Types of binary relations (Equivalence and partial ordered relations),
2.3 Closures, Poset, Hasse diagram and Lattice
2.4 Functions-Definition,Types of Functions (Injective, Surjective and Bijective)
2.5 Identity and Inverse Functions
2.6 Pigeonhole Principle, Extended Pigeonhole Principle
3 Graph Theory 07
3.1 Graphs and their basic properties - degree, path, cycle, subgraphs, Types of graphs.
3.2 Definitions, Paths and circuits: Eulerian and Hamiltonian, Planner Graph.
3.3 Isomorphism of graphs, Dijkstra Shortest Path Algorithm
3.4 Trees, Types of Trees
4 Finite Automata 07
4.1 Introduction of Automata and its applications
4.2 Deterministic Finite Automata (DFA) and Nondeterministic Finite Automata (NFA):
Definitions, transition diagrams and Language recognizers, NFA to DFA
Conversion.
4.3 Eliminating epsilon-transitions from NFA.
4.4 FSM with output: Moore and Mealy machines.
5 Regular Expression (RE) and Regular Grammar (RG) 05
5.1 Regular Grammar and Regular Expression (RE): Definition,Equivalence and
Conversion from RE to RG and RG to RE.
5.2 Equivalence of RE and FA, Converting RE to FA and FA to RE.
6 Context Free Grammar (CFG) and Push Down Automata(PDA) 07
6.1 Grammars: Chomsky hierarchy, CFG- Definition, Sentential forms,
Leftmost and Rightmost derivations.
6.2 Context Free languages (CFL): Parsing and Ambiguity.
CFLs: Simplification and Applications.
6.3 Normal Forms: Chomsky Normal Form
6.4 PDA- Definition, Transitions (Diagrams, Functions and Tables), Design of PDA
with Graphical Notation and Instantaneous Descriptions.
Total 39