Subject: Applied Mathematics – III Subject Code: ETMA-201
FIRST TERM
1.Fourier Series, Euler’s 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.Bessel’s function of first kind
SECOND TERM
11.Recurrence relations
12.Modified Bessel’s Func. Of first kind
13.Ber & Bei functions
14.Legendre’s Polynomial
15.Rodrigue’s 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
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
SUBJECT : Analog Electronic I Subject Code: ETCS – 203
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 & thermal stability
SMALL SIGNAL AMPLIFIER
10.Small signal amplifier (CB, CE, CC) Analysis
11.Hybrid model for translator at low frequency ,
12.RC coupled amp ,mid band model & impedance
FIELD EFFECT TRANSISTOR
13.Introduction to FET, Classification & Characteristics, Operating point, biasing
14.Depletion & Enhancement type MOSFETs
OPERATIONAL AMPLIFIER
15.OPAMP, OPAMP stages, OPAMP Parameters, Equivalent circuit, Ideal voltage transfer curve, Open Loop OPAMP Configuration, Closed loop OPAMP Configuration
THIRD TERM
OPERATIONAL AMPLIFIER APPLICATIONS
16.Comparator, Current sources, rectifiers, first & second order filters
17.Adder, integrator, Differentiators, Clippers, Clamper, Waveform generators (square wave)
18.Instrumentation amplifier log and antilog amplifier
Subject: Circuits & Systems Subject Code: ETEC-205
FIRST TERM
1.Introduction of subject
2.Properties of systems
3.Types of signals
4.Wave from synthesis
5.Synthesis of periodic waveform
6.Initial and final condition in networks
7.Procedure for evaluating initial and final conditions
8.Classical method for the solution of differential equations
9.Classical method for the solution of network problems
10.Basic of Laplace transform
11.Properties of Laplace transform
12.Laplace transform for a waveform
13.Inverse Laplace transform
14.Application of Laplace to Linear differential equation
15.Application of Laplace to network problem
16.Graph Theory
17.Application of graph theory
18.Basic of two port network, relationships of two port variables
SECOND TERM
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
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
SUBJECT : FOUNDATION OF COMPUTER SCIENCE Subject Code: ETCS – 207
FIRST TERM
FORMAL LOGIC
1.1 Statement, Symbolic representation and tautologies
1.2 Quantifiers, predicator and validity
1.3 Normal form
1.4 Prepositional Logic
1.5 Predicate logic, logic programming, proof of correctors Proof, relations and analysis
1.6 Techniques of theorem proving: - Director proof, proof by contraposition, proof by exhausting cares, proof by correctors
1.7 Principle of mathematical induction, principle of complete induction
1.8 Recursive definitions, solution methods for linear, first order recurrence relations with constant coefficients.
1.9 Analysis of algorithm involving recurrence relations binary search, quick sort, solution for divide and conquer recurrence relation
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, Pascal’s 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
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
Graph Theory
4.1 Terminology, Isomorphic graphs, culer’s 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
Subject: Object Oriental Programming Using C++ Subject Code: ETIT-209
I TERM
1.Introduction:- Introduction Object Oriented Apprach related to other paradigms(functional, data decomposition )
2.Characteristics of Object oriented languages
3.Basics terms and Ideas:Abstraction,Encapsulation,information hiding,inheritance, polymorphism
4.Review of C,Difference between C and C++,Cin,Cout,New,Delete operators
5.Classes and Objects:Abstract data types,Object and classes,Attributes,Methods
6.C++ Class declaration <State identity And behaviour of an object
7.Constructors and destructors
8.Instantiation of objects,default parameters value,Copy constructor
9.Static class data,constant and classes
10.C++ Garbage collection,dyanmic memory allocation
II TERM
11.Inheritance and polymorphism: Inheritance
12.Types of inheritance, class hierarchy
13.Derivation - Private, Public and Protective
14.Aggregation, composition vs classification hierarchies
15.Polymorphism, types of polymorphism-compile time and run time
16.Method polymorphism , and polymorphism by parameter
17.Operator overloading
18.Parameteric polymorphism
19.Generi function-Template function
20.Function name overloading
21.Overiding inheritanca methods
III TERM
22.Files and Exceptional handling:Persistants objects
23.Streams and files,Namespaces
24.Exception Handling,Generic Classes
25.Standard tempate library: Standard tempate library
26.Overview ofStandard tempate library, containers
27.Algorithm Iterators
28.Other STL elements, The Container classes
29.General Theory of Operation , Vectors
Subject :Data Structure Subject Code: ETCS-211
FIRST TERM
Unit- 1
1.Big "O" notations, Time and Space complexity of algorithms
2.Elementary (Primitive) data structure and their applications
3.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- 2
12.Searching : Sequential searching, Binary search
13.Tree : Binary tree : Definition, Representation
14.Traversal (in-order, post-order, pre-order)
SECOND TERM
15.Trees : Binary Search tree, Insertion & deletion
16.Threaded binary tree, Counting binary tree
17.AVL Tree
Unit-3
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
Unit - 4
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
