Text Books/References
1 J.L. Bansal and H.S. Dhami, Differential Equations (Vols.-II),
Jaipur Publishing House, Jaipur (2005).
2 N.P. Bali and Manish Goyal, A Text book of Engineering
Mathematics (VII Edition), Laxmi Publication Pvt. Ltd., New Delhi.
3 S.C. Gupta and V.K. Kapoor, Mathematical Statistics, Sultan
Chand & Sons, New Delhi.
CS 243 (ESC) - DATA STRUCTURE
Cr. Hrs. 3( 3+0+ 0 )
L T P
Credit 3 0 0
Hours 3 0 0
Course Outcomes: Students will be able to
CO1: Understand and analyze the implementation and application of
basic data structures such as arrays and linked lists.
CO2: Evaluate and analyze the implementation and application of
various ADTs such as stacks and queues.
CO3: Evaluate and analyze the implementation and application of
tree based data structures Binary Tree, BST, AVL tree, m-way
tree etc.
CO4: Evaluate and analyze the implementation and application of
graph and hashing based data structure.
Unit-I
Concepts. Data Representation: Linear Lists, Formula based
representation, Linked List Representations, Circular and Doubly Linked
Lists, Indirect Addressing.
Unit-II
Stacks: Abstract Data Type, Derived Classes and Inheritance,
Formula based Representation, Linked Representation. Applications.
Queues: Abstract Data type, Formula based Representation, Linked
List Representation.
66
Unit-III
Trees: Introduction, Binary Trees, Formula based and Linked
Representation of Binary Trees, Common Operation and Traversal,
Abstract Data Type Binary Tree. Priority Queues and Tournament
Trees. Search Trees: Binary Search Tree, ADT (abstract Data Type)‟s
BS Tree and Indexed BS Tree. AVL Trees. B-Trees, m-way tree search,
B-Tree order of m, Height, Searching, Insertion and deletion in B-Tree.
Node Structure in B-Tree.
Unit-IV
Graphs: Definitions and Applications. ADTs Graph and Disgraph.
Graphs Iterators, Graph Search Methods. Skip Lists and hashing.
Linear List Representation, Skip List Representation.
Text Books/References
1. Sartaj Sahni. Data Structure, Algorithms and Applications in C++,
WCB McGraw- Hill.
EE 243 (ESC) - CONTROL SYSTEM ENGINEERING
Cr. Hrs. 3( 3+0 + 0 )
L T P
Credit 3 0 0
Hours 3 0 0
Course Outcomes: Students will be able to
CO1: Make measurements of a system and determine a transfer function.
CO2: Implement a proportional control system and make performance
predictions, including SSE, response speed and relative stability.
CO3: Understanding of stability, transient, and steady-state behaviour
of linear dynamic systems.
CO4: Demonstrate the ability to identify a dynamic system from its
time or frequency response
67