1.

Subject Code: EC261 Course Title: Analog Electronics

2. Contact Hours : L: 3 T: 0 P: 2

3. Examination Duration (ETE )(Hrs.) : Theory 3 Hrs Practical 0

4. Relative Weightage : CWS 15 PRS 15 MTE 30 ETE 40 PR 0

5. Credits : 4

6. Semester : III

7. Subject Area : AEC

8. Pre-requisite : NIL

9. Objective : To provide knowledge about the principles,

concepts and applications of analog electronics.

10. 10. Details of Course

S.No. Contents Contact

Hours
1. Review of Semiconductors: Energy band structure of Insulator, 8
Semiconductor and Metal, Intrinsic and extrinsic semiconductor.
P-NJunction Diodes, and its application:, clipping and clamping circuits,

2. Bipolar Junction Transistor (BJT): Introduction, Physical behavior, 8

Ebers-Moll model, Common Base and Common Emitter characteristics,

operations. DC Model.
Bias stabilization:
circuits,
3. 8

4. : Introduction, Common 8
source drain characteristics, operating point, biasing, MOSFETS
(enhancement & depletion type).
: Low frequency small signal model, AC analysis of

COE-40
 5. : Introduction, various feedback 4
arrangements & stability, R-C phase shift oscillators.

6. Ideal OPAMP, Basic OPAMP 6

circuitsstages, OPAMP Applications: Adders and Subtractor, Voltage
follower, Current to Voltage Converter, Voltage to Current converter,

generator
TOTAL 42

11. Suggested Books

S.No. Name of Books / Authors/ Publishers / Year of Publication/ Reprint

Text Books
1 J. Millman and A Grabel, “Micro Electronics” TMH, 1999
2 J. Millman and Halkias, “Integrated Electronics, Analog & Digital Circuits &
Systems” TMH, 1999
3. I J Nagrath, “ Electronics, Analog and digital, PHI,2009
Reference Books
1 B. Kumar and S B Jain, “Electronic Devices & Circuit” PHI, 2010
2 Sedra& Smith, “Micro Electronic Circuits” Oxford University Press, 2000

1. Subject Code: CO201 Course Title: Data Structures

2. Contact Hours : L: 3 T: 0 P: 2

3. Examination Duration (ETE )(Hrs.) : Theory 3 Hrs Practical 0

4. Relative Weightage : CWS 15 PRS 15 MTE 30 ETE 40 PR 0

5. Credits : 4

6. Semester : III

7. Subject Area : DCC

COE-41
8. Pre-requisite : Fundamentals of Programming

respective applications.

10. Details of Course

S.No. Contents Contact

Hours
1. Introduction: Introduction to Algorithmic, Complexity- Time-Space 8

and applications. Introduction to List data structure.

Arrays and Strings: Representation of Arrays in Memory: one
dimensional, Two dimensional and Multidimensional, Accessing of
elements of array, performing operations like Insertion, Deletion and
Searching. Sorting elements of arrays. Strings and String Operations.
Stacks and Queues: Introduction to data structures like Stacks
and Queues. Operations on Stacks and Queues, Array representation
of Stacks , Applications of Stacks : recursion, Polish expression and

expression, Operations of Queues, Representations of Queues

Applications of Queues, Priority queues.
2. Linked Lists: Singly linked lists, Representation of linked list, 6
Operations of Linked list such as Traversing, Insertion and Deletion,
Searching, Applications of Linked List. Concepts of Circular linked list
and Doubly linked list and their Applications. Stacks and Queues as
linked list.

3. Trees: Basic Terminology, Binary Trees and their representation, 8

binary search trees, various operations on Binary search trees like
traversing, searching , Insertion and Deletion , Applications of Binary
search Trees , Complete Binary trees, Extended binary trees. General
trees, AVL trees, Threaded trees, B- trees.
4. Searching and Sorting: Linear Search, Binary search, Interpolation 7
Search,Insertion Sort, Quick sort, Merge sort, Heap sort, sorting on

COE-42
 5. Graphs: Terminology and Representations, Graphs & Multi-graphs, 7
Directed Graphs, Representation of graphs and their Transversal,
Spanning trees, shortest path and Transitive Closure, Activity Networks,
Topological Sort and Critical Paths.
6. File Structure: File Organization, Indexing & Hashing, Hash Functions, 6
Collision Resolution Techniques.
TOTAL 42

11. Suggested Books

S.No. Name of Books / Authors/ Publishers / Year of Publication/ Reprint

Text Books:
1. Horowitz and Sahni, “Fundamentals of Data structures”, Galgotia publications,
1983
2. Tannenbaum, “Data Structures”, PHI, 2007( Fifth Impression)
3. An introduction to data structures and application by Jean Paul Tremblay & Pal G.
Sorenson (McGraw Hill).
Reference Books
1. R.L. Kruse, B.P. Leary, C.L. Tondo, “Data structure and program design in C”, PHI,
2009( Fourth Impression)

1. Subject Code: CO203 Course Title: Object Oriented Programming

2. Contact Hours : L: 3 T: 0 P: 2

3. Examination Duration (ETE )(Hrs.) : Theory 3 Hrs Practical 0

4. Relative Weightage : CWS 15 PRS 15 MTE 30 ETE 40 PR 0

5. Credits : 4

6. Semester : III

7. Subject Area : DCC

8. Pre-requisite : NIL

COE-43
9. Objective : To provide knowledge of Object Oriented
programming features.

10. Details of Course

S.No. Contents Contact

Hours
1. Object oriented paradigm & C++ at a glance: Evolution of programming 8
paradigm, structured versus object-oriented development, elements of
object-oriented programming, Objects, classes, methods, popular OOP
languages, software reuse.
Classes and objects: Introduction, Class revisited, constant objects
and constructor, static data members with constructors and destructors,
constructor overloading, nested classes, objects as arguments, returning
objects , friend functions and friend classes, constant parameters and
member functions, static data and member functions.
2. Dynamic objects: Introduction, pointers to objects, array of objects, 7
pointers to object members, this pointer, self-referential classes
Operator overloading and Inheritance: overloading of new and delete
operators, conversion between objects and basic types, conversion

abstract classes, inheritance types , virtual base classes, virtual

functions, pointer to derived class objects, and base class objects,
pure virtual functions, virtual destructors.
Generic programming with templates: Introduction, function
templates, overloaded function templates, class templates, inheritance
of class template, class template containership, class template with
overloaded operators.
3. Introduction to byte code, security and portability, Data Types, variables, 6
operators, arrays, type conversion and casting, type promotion, Control
statements, standard input-output, Designing Classes, constructors,

packages and interfaces, Math, String, Vectors, and Array List classes,
polymorphism: function and operator overloading, function overriding,
abstract classes.
4. Exception Handling: exception types, nested try-catch, throw, throws 6

synchronization and priorities.

COE-44
 5. Java.io, stream classes, Byte 7
streams, character streams, serialization. Networking concepts:
Client server and socket programming, TCP/IP client and server
sockets.
6 Applets and Java Swing: Applet design, AWT packages, Applet 8
event handling, parameters to applets, AWT controls, layout manager,
Frames, container classes, Introduction to Java Beans, Swing and
Servlets.
TOTAL 42

11. Suggested Books

S.No. Name of Books / Authors/ Publishers / Year of Publication/Reprint

Text Books
1 Patrick Naughton, Herbert Schildt: “The Complete Reference: Java 2”, TMH.ISBN-
13 9780070495432
2 C Thomas Wu : “An Introduction to OO programming with Java”, TMH,ISBN-10:
0073523305
3. Balaguruswami, “Object oriented with C++”, TMH.
SBN 0070669074, 9780070669079, 2008
4 Budd, “Object Oriented Programming”, Addison Wesley
Reference Books
1. Mastering C++ K.R Venugopal Rajkumar, TMH.
2. C++ Primer, “Lip man and Lajole”, Addison Wesley.
3. Maria litvin, Gary litvin,“Programming in C++”, VPH.
4. D Samantha, “Object oriented Programming in C++ and Java “, PHI.

1. Subject Code: C0205 Course Title: DISCRETE STRUCTURES

2. Contact Hours : L: 3 T: 1 P: 0

3. Examination Duration (ETE) (Hrs.) : Theory 3 Hrs Practical 0

4. Relative Weightage : CWS 25 PRS 0 MTE 25 ETE 50 PR 0

COE-45
5. Credits : 4

6. Semester : III

7. Subject Area : DCC

8. Pre-requisite : Nil

9. Objective : To provide knowledge of combinatorial problems,

algebraic structures and graph theory required
for building mathematical foundation of computer
science.

10. Details of Course

S.No. Contents Contact

Hours
1. Formal Logic:Statement, Symbolic Representation and Tautologies, 3

Predicate Logic, Logic Programming and Proof of correctors

2. Proof, Relation and Analysis of Algorithm: 7
Technique for theorem proving : Direct Proof, Proof by Contra position,
proof by exhausting cases and proof by contradiction, Principle of
mathematical induction, principle of complete induction, recursive

rotations-recursive selection sort, binary search, quick sort, solution

method for a divide-and-conquer recurrence relation.
3. Sets and Combinations:Sets, Subsets, powersets, binary and unary 8
operations on a set, set operations/set identities, fundamental counting
principles, principle of inclusion, exclusion and pigeonhole, permutation
and combination, Pascal’s triangles, binomial theorem, representation
of discrete structures.
4. Relation/function and matrices:Rotations, properties of binary 7
rotations, operation on binary rotation, closures, partial ordering,
equivalence relation, properties of function, composition of function,
inverse, binary and n-ary operations, characteristics of permutation
function, composition of cycles, Boolean matrices, Boolean matrices
multiplication.

COE-46
 5. Lattices & Boolean Algebra: 7

particular, structures with binary operations) subs algebra, direct

product and homomorphism, Boolean function, Boolean expression,
representation & minimization of Boolean function.
6. Graph Theory 8
Terminology, isomorphic graphs, Euler’s formula (Proof) four color

Trees terminology, directed graphs, Computer representation of graphs,

Warshall’s algorithms, Decision Trees, Euler path & Hamiltonian circuits,

searches, analysis of search algorithm, trees associated with DFS

& BFS Connected components, in order, preorder & post order tree
traversal algorithms.
TOTAL 42

11. Suggested Books

S.No. Name of Books / Authors/ Publishers / Year of Publication/ Reprint

Text Books

1. Kenneth H. Rosen, “Discrete Mathematics and Its Applications”, TMH

ISBN: 9780070681880),1999

2. C.L. Liu, “Elements of Discrete Mathematics”, TMH (ISBN: 9780007043477),2000

3. Kolman, Busby & Ross, “Discrete Mathematical Structures”, PHI (ISBN- 978-
0132297516),1996

Reference Books

1. NarsinghDeo, “Graph Theory With Application to Engineering and Computer

Science”, PHI (ISBN: 9788120301450), 2004

2. J. P. Trembly& P. Manohar, “Discrete Mathematical Structures with Applications to

Computer Science”, McGraw Hill (ISBN: 0070651426),1997

COE-47
1. Subject Code: CO207 Course Title: Engineering Analysis and Design
(Modeling and Simulation)

2. Contact Hours : L: 3 T: 1 P: 0

3. Examination Duration (ETE )(Hrs.) : Theory 3 Hrs Practical 0

4. Relative Weightage : CWS 25 PRS 0 MTE 25 ETE 50 PR 0

5. Credits : 4

6. Semester : III

7. Subject Area : DCC

8. Pre-requisite : Nil

discrete event simulation modeling with example,

GPSS, SIMSCRIPT, SLAM, GASP, and SIMULA

software output.

10. Details of Course

S.No. Contents Contact

Hours
1. 8

simulation model - static, dynamic, deterministic stochastic continuous,

discrete models.
2. Discrete event simulation: Time Advance Mechanism, Components 11
and Organization of a Discrete Event Simulation Model, Selected
Illustrative Examples of Simulation Application Models
3. Simulation software: Modelling of Complex Systems, Use of a 12
Simulation Language such as GPSS, SIMSCRIPT, SLAM, GASP, and
SIMULA.

COE-48
 4. Evaluation of simulation output :Random Variables and their properties 11

Reduction Techniques, Validation of Simulation Models.

TOTAL 42

11. Suggested Books

S.No. Name of Books / Authors/ Publishers /Year of Publication/Reprint

Text Books
1. Simulation Modeling and Analysis, Kelton W.D. and Law A.M, II Edition, McGraw
Hill,1982
2. Interactive Dynamic System Simulation, G. A. Korn, McGraw Hill,1988
Reference Books
1. Theory of Modeling and Simulation: Integrating Discrete Event and Continuous
Complex Dynamic Systems, Bernard P. Zeigler, Herbert Praehofer, Tag Gon Kim,
Academic Press, 2000
2. Modelling and simulation : Exploring dynamic system behavior, Birta, publisher :
Yesdee, ISBN13 : 9788184893656,2012

1. Subject Code: HU201 Course Title: Engineering Economics

2. Contact Hours : L: 3 T: 0 P: 0

3. Examination Duration (ETE )(Hrs.) : Theory 3 Hrs Practical 0

4. Relative Weightage : CWS 25 PRS 0 MTE 25 ETE 50 PR 0

5. Credits : 3

6. Semester : III

7. Subject Area : HMC

8. Pre-requisite : NIL

9. Objective : Understand the fundamental concepts of

engineering economy.

COE-49