ACADEMIC PLAN FOR CSE III-SEMESTER (2011-12)

Subject: Applied Mathematics III Total Teaching weeks in Semester: 14 weeks Total Lecture Classes available : 40 Subject Code: ETMA-201 L T C 3 1 4 Total Tutorial Classes available : 14 Lectures 2 1 2 2 2 1 2 2 1 2 Lectures 2 2 1 2 2 1 2 4 Tutorials 1 1 1

First Term S. No. Topics to be covered 1. Fourier Series, Eulers Formula 2. Even and Odd functions 3. Functions having arbitrary periods 4. Half range expansion 5. Harmonic Analysis 6. Fourier Transform 7. Sine & Cosine Transform 8. Application of Fourier Transform to Differential equations 9. Beta & Gamma functions 10. Bessels function of first kind Second Term S. No. Topics to be covered 11. Recurrence relations 12. Modified Bessels Func. Of first kind 13. Ber & Bei functions 14. Legendres Polynomial 15. Rodrigues Formula 16. Orthogonal, Expansion of functions 17. Formation of first and second order linear partial differential equation 18. Initial and boundary value problems involving Laplace, Wave and Heat Condition Equations Third Term S. No. Topics to be covered 19. Laplace Transformation 20. Inverse Laplace Transformation 21. Convolution Theorem 22. Application of Linear differential equations with constant coefficients 23. Unit step and impulse functions 24. periodic functions

Tutorials

Lectures 1 1 1 1 1 1

Tutorials 1 1

Text Books: Advance Engineering Mathematics by E.Kresyig, 5th Ed. John Wiley & Sons, 1999

Reference Books: Elementary Engineering Mathematics by B. S. Grewal, 34th Ed., 1998 Advanced Engineering Mathematics by H.K.Dass, S. Chand & Co., 9th Revised Edition, 2001 Integral Calculus by Shanti Narayan, S.Chand & Co., 1999 Differential Calculus by Shanti Narayan, S.Chand & Co., 1998 Engineering Mathematics by Jaggi & Mathur Engineering Mathematics by V. P. Mishra Text Book of Mathematics by V. P. Mishra

ACADEMIC PLAN FOR CSE III-SEMESTER (2011-12)

SUBJECT : Analog Electronic I Total Teaching weeks in Semester: 15 weeks Total Lecture Classes available : 40 Subject Code: ETCS 203 L T C 3 1 4 Total Tutorial Classes available : 14

S.No.

TOPICS TO BE COVERED

Total No. of Lecture

Tutorial

FIRST TERM SEMICONDUCTOR DIODES & RECTIFIERS 1 Introduction, General Characteristics, Energy Levels 2 Extrinsic material n & p type, ideal diode, basic construction & characteristics, DC & AC resistance 3 Equivalent circuit, drift & diffusion current, transition & diffusion capacitance, reverse recovery times temperature effect, diode specification 4 Different types of diodes, zener, varactor, schoottky, power, tunnel, photo diode LED, Switch Mode power supply 5 Half wave rectifier & full wave rectifier BIPLOR JUNCTION TRANSISTOR 6 Introduction, construction, B.J.T operation 7 B.J.T Characteristics, load line, operation point, leakage current, saturation & cut off mode of operations, Ebers malls model SECOND TERM BIAS STABILIZATION 8 Need for stabilization, fixed bias, self bias, emitter bias 9 Bias stability with respect of variation in ICBO, , Stabilisation factors & 10 11 12 13 14 15
thermal stability SMALL SIGNAL AMPLIFIER Small signal amplifier (CB, CE, CC) Analysis Hybrid model for translator at low frequency , RC coupled amp ,mid band model & impedance FIELD EFFECT TRANSISTOR Introduction to FET, Classification & Characteristics, Operating point, biasing Depletion & Enhancement type MOSFETs OPERATIONAL AMPLIFIER OPAMP, OPAMP stages, OPAMP Parameters, Equivalent circuit, Ideal voltage transfer curve, Open Loop OPAMP Configuration, Closed loop OPAMP Configuration OPERATIONAL AMPLIFIER APPLICATIONS Comparator, Current sources, rectifiers, first & second order filters Adder, integrator, Differentiators, Clippers, Clamper, Waveform generators (square wave) Instrumentation amplifier log and antilog amplifier

1 1 1

1 1 1

2 2 2 3

1 1 1 1

3
3

2
1

3 2 1 2 2 4

THIRD TERM 16 17 18

2 2 2 2

Subject: Circuits & Systems

ACADEMIC PLAN FOR CSE III-SEMESTER (2011-12) Subject Code:

ETEC-205

Total Teaching Weeks in semester : 15 weeks Total Lecture Classes Available : 39

L T C 3 1 4 Total Tutorial Classes Available : 00

First Term
S. No. 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. 17. 18. Topics to be Covered Introduction of subject Properties of systems Types of signals Wave from synthesis Synthesis of periodic waveform Initial and final condition in networks Procedure for evaluating initial and final conditions Classical method for the solution of differential equations Classical method for the solution of network problems Basic of Laplace transform Properties of Laplace transform Laplace transform for a waveform Inverse Laplace transform Application of Laplace to Linear differential equation Application of Laplace to network problem Graph Theory Application of graph theory Basic of two port network, relationships of two port variables Lectures 1 1 1 1 1 1 1 1 2 1 1 1 1 1 1 1 1 1 Tutorials 2

Second Term S. No. Topics to be Covered 19. Determination of 2-port parameters 20. Condition for reciprocity & symmetry 21. Inter-relation between parameters 22. Interconnections of networks 23. Determination of overall parameters of interconnected network 24. Numerical bases on two port network 25. Reciprocity theorem 26. Super-position theorem 27. Thevenin's & Norton's Theorems 28. Maximum power transfer theorem 29. Millman's problem 30. Tellegan's theorem 31. Network functions 32. Transfer functions 33. Elements of network synthesis, Hurwitz polynomial 34. Positive real functions Third Term S. No. Topics to be Covered 35. Foster's I and II Cauer's I and II form 36. Synthesis of LC networks 37. Synthesis of RC networks 38. Synthesis of RL network 39. numerical based on network synthesis

Lectures 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Lectures 1 1 1 1 1

Tutorials 2

Tutorials

Text Books: Network Analysis by Valkenburg, PHI, 2000 Network & Systems by D. R. Choudhary, New Age International, 1999 Reference Books: Engineering Network Analysis & Filter Design by Bhis, Chadda & Kulshreshtha, Umesh Publication, 2000 Network Analysis & Synthesis by Kuo, John Weily & Sons, 2nd Ed.

ACADEMIC PLAN FOR CSE III-SEMESTER (2011-12)

SUBJECT : FOUNDATION OF COMPUTER SCIENCE
Total Teaching Weeks in semester : 15 weeks Total Lecture Classes Available : 39

Subject Code: ETCS 207

L T C 3 1 4 Total Tutorial Classes Available : 14

S.No.

TOPICS TO BE COVERED

Total No. of Lecture

Tutorial

FIRST TERM 1 FORMAL LOGIC Statement, Symbolic representation and tautologies Quantifiers, predicator and validity Normal form Prepositional Logic Predicate logic, logic programming, proof of correctors Proof, relations and analysis Techniques of theorem proving: - Director proof, proof by contraposition, proof by exhausting cares, proof by correctors Principle of mathematical induction, principle of complete induction Recursive definitions, solution methods for linear, first order recurrence relations with constant coefficients. Analysis of algorithm involving recurrence relations binary search, quick sort, solution for divide and conquer recurrence relation 2 Sets and Combinations 2.1 Sets, subset, power sets, binary & unary operations on set, identifiers of set, set identifiers on set 2.2 Fundamental counting principles, principles of inclusion exclusion and pigeon hole principle 2.3 Permutation & combination, Pascals triangle, binomial theorem representation SECOND TERM 2.4 Relation, properties of binary relation, closures, partial ordering equivalence relations. 2.5 Function, properties, composition, inverse, binary and n-ary operation characteristic 2.6 Permutation of composition of cycle, Boolean matrices, multiplication 3 Lattices and Boolean Algebra 3.1 Lattices, S sublattice 3.2 Director product, homomorphism 3.3 Boolean algebra, definition, properties, isomorphic structure 3.4 Subalgebra, direct product, homomorphism 3.5 Boolean Function, expression, representation and minimization THIRD TERM 4 Graph Theory 4.1 Terminology, Isomorphic graphs, culers formula, 4 color problem (without proof), chromatic number, 5-color theorem 4.2 Trees, directed graphs, computer representation, warshall algorithm, decision tree 4.3 Eulre path, Hamiltonian, shortest path minimal spanning tree, DFS, BFS analysis, tree-traversal associated with DFS & BFS, connected component, preorder & postorder traversal

1 1 2 1 2 1 1 1 2 1 1 2

1 1

1 1

2 2 2

1 2 2 2 2

1 1 1

4 3 4

1 2 1

ACADEMIC PLAN FOR CSE III-SEMESTER (2011-12)

Subject: Object Oriental Programming Using C++ Total Teaching Weeks in semester : 15 weeks Total Lecture Classes Available : 39 First Term S. No. Topics to be Covered I TERM Subject Code: ETIT-209 L T C 3 1 4 Total Tutorial Classes Available : 00 Lectures Tutorials

1. 2 3 4 5. 6 7 8 9 10

UNIT-1 MOULDING Introduction:- Introduction Object Oriented Apprach related to other paradigms(functional, data decomposition ) Characteristics of Object oriented languages Basics terms and Ideas:Abstraction,Encapsulation,information hiding,inheritance, polymorphism Review of C,Difference between C and C++,Cin,Cout,New,Delete operators Classes and Objects:Abstract data types,Object and classes,Attributes,Methods C++ Class declaration <State identity And behaviour of an object Constructors and destructors Instantiation of objects,default parameters value,Copy constructor Static class data,constant and classes C++ Garbage collection,dyanmic memory allocation II TERM Inheritance and polymorphism: Inheritance Types of inheritance, class hierarchy Derivation - Private, Public and Protective Aggregation, composition vs classification hierarchies Polymorphism, types of polymorphism-compile time and run time Method polymorphism , and polymorphism by parameter Operator overloading Parameteric polymorphism Generi function-Template function Function name overloading Overiding inheritanca methods III TERM Files and Exceptional handling:Persistants objects Streams and files,Namespaces Exception Handling,Generic Classes Standard tempate library: Standard tempate library Overview ofStandard tempate library, containers Algorithm Iterators Other STL elements, The Container classes General Theory of Operation , Vectors

2 1 2 2 2 2 2 1 1 2

11 12 13 14 15 16 17 18 19 20 21

1 1 1 1 2 1 2 1 2 2 1

22 23 24 25 26 27 28 29

1 1 1 1 1 1 1 1

ACADEMIC PLAN FOR CSE III-SEMESTER (2011-12)

Subject :Data Structure
Total Teaching Weeks in semester : 15 weeks Total Lecture Classes Available : 40

Subject Code: ETCS-211

L T C 3 1 4 Total Tutorial Classes Available : 00

First Term S. No. 1. 2. 3.

Topics to be Covered (UNIT I)

Lectures 1 1 1 1 1 1 1 2 1 1 1 1 1 2 Lectures 2 1 1 2 1 1 1 1 1 1 1 1 1 1 Lectures 2 2 1 2

Tutorials

Big "O" notations, Time and Space complexity of algorithms Elementary (Primitive) data structure and their applications Arrays : ordered lists, representation of array, sparse matrices 4. Link List : Singly Linked List 5. Double Link List 6. Circular Link List 7. Circular - Double Link Lists 8. Stack, Queues (Without link list representation) Multiples stack and queues 9. Applications : Polynomial arithmetic 10. Infix, postfix, and prefix 11. Arithmetics expression conversion and evaluations UNIT II 12. Searching : Sequential searching, Binary search 13. Tree : Binary tree : Definition, Representation 14. Traversal (in-order, post-order, pre-order) Second Term S. No. Topics to be Covered Trees : Binary Search tree, Insertion & deletion Threaded binary tree, Counting binary tree AVL Tree UNIT III 18. Graphs : Representation 19. Connected components, shortest path and transitive closure 20. Topological short, activity network 21. Critical path, path enumration 22. Dijikstra's Algorithm 23. Floyd Warshall's Algorithm 24. Minimum spanning tree 25. Sorting (A): Internal sorts : insertion sort, Exchange sort 26. Selection sort, Radix sort 27. Quick sort, sheel sort 28. Merge sort, Heap sort Third Term S. No. Topics to be Covered (UNIT IV) 29. Sorting (B) : external sort, K-Way, merge sort, balanced merge sort, polyphase merge sort 30. Hashing : Hash function, Hash table 31. Filter :Files, Queries and sequential organization, cylinder surface, Hashed index 32. Tree Indexing, B-Tree, Tric Indexing, Sequential file organizational, random file organization, Hashed file organization, Inverted file, Cellular partition
Text Books: E.Horowitz & S. Sahani, Fundamentals of Data Structures, Galghotia Booksource Pvt. Ltd., 1999 R.L.Kruse, B.P.Leung, C.L.Tondo, Data Structure and Program Design in C, PHI, 200 Reference Books: Schaum's Outline Series, Data Structure, TMH, 2002 Y.Langsum et. al., Data Structure using C and C++, PHI, 1999 Yashwant Kanetkar, Data Structure through C, BPB, 2005

Tutorials

15. 16. 17.

Tutorials