SRM INSTITUTE OF SCIENCE AND TECHNOLOGY

FACULTY OF ENGINEERING AND TECHNOLOGY

SCHOOL OF COMPUTING
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
COURSE PLAN
Course Code : 15CS201J
Course Title : Data Structures
Semester : III
Course Time : Jan-May 2018
Slot :E
All Section students
Day
Hour Timing
DAY 1
DAY 2
DAY 3 9:45 - 10:35 2:20 - 3:10
(Batch 1) (Batch 2)
DAY 4
DAY 5 8:00 - 9:40 12:30 - 2:15
(Batch 1) (Batch 2)

Location : Tech Park

Faculty Details :
Group
Name Office Office hour Mail id
S.No
01 All Day Order BATCH 2 ganesh.ks@ktr.srmuniv.ac.in
TP211
Mr.S.Ganesh Kumar 9:30 - 5:00

Text Books:

1. Seymour Lipschutz, “Data Structures with C”, McGraw Hill Education, Special Indian Edition, 2014.
2. R.F.Gilberg, B.A.Forouzan, “Data Structures”, Second Edition, Thomson India Edition, 2005.

Reference Books

3. A.V.Aho, J.E Hopcroft and J.D.Ullman, “Data structures and Algorithms”, Pearson Education, First
Edition Reprint 2003.
4. Mark Allen Weiss, "Data Structures and Algorithm Analysis in C", 2nd Edition, Pearson Education,
5. Reema Thareja, “Data Structures Using C”, Oxford 2011. Higher Education , First Edition, 2011

Prerequisite : NIL

Instructional Objectives
1. Understand analysis of algorithm and its time complexity
2. Be familiar with and implement the Linked list data structure
3. Be familiar with and implement the Stack and Queue data structure
4. Have a comprehensive knowledge of Trees and their implementations
5. Learn advanced data structures like Graphs and their implementation, hash tables and Hashing methods

Assessment

Cycle Test – I : 15 Marks

Cycle Test – II : 25 Marks
Surprise Test – I : 5 Marks
Viva and Assignment : 5 Marks
Test Schedule

S.No. DATE TEST TOPICS DURATION

1 19/2/2018 onwards Cycle Test – I Unit I & II 2 Hours
2 17/04/2018 onwards Cycle Test – II Unit III,IV and V 3 Hours

Detailed Session Plan:

UNIT I: INTRODUCTION TO DATA STRUCTURES

Sessio Time Teaching

Topics to be covered Ref Testing Method
n No. (min) Method
Introduction : Basic terminology - Data 1 Group discussion
1 structures – Data structure operations 50 BB Quiz
ADT – Algorithms: Complexity, Time – 1 Group discussion
2 50 BB
Space trade off Quiz
Mathematical notations and functions 1 BB Group discussion
3 50
Illustration by examples
Asymptotic notations – Linear and Binary 1 BB Group discussion
4 50
search Quiz
Asymptotic notations – Bubble sort 1 BB Group discussion,
5 50 Illustration by examples
Asymptotic notations – Insertion sort 1 BB Group discussion,
6 50 Illustration by examples

UNIT II: ARRAYS AND LIST

Array : Operations on Arrays, Applications of 1 BB Group Discussion
7 50
Arrays Illustration by examples
Multidimensional Arrays : Sparse Matrix 2 BB Group Discussion,
8 50
Illustration by examples
Linked List : Insertion, Deletion and Search, 2 BB Group discussion
9 Cursor based implementation 50
Polynomial Arithmetic 1 BB Group discussion,
10 50 Quiz
Illustration by examples
Circular Linked List – Applications – 1 BB Group discussion,
11 50
Josephus Problem Illustration by examples
Doubly linked list: Insertion, Deletion and 2 BB Group discussion,
12 50
Search Illustration by examples
UNIT III: STACK AND QUEUE
Stack: Array implementation, Linked list 1 PPT Quiz
13 implementation 50 Group discussion

Applications of Stack – Infix to Postfix – 2 PPT Group discussion,

14 50
Evaluation of Postfix Illustration by examples
Application of Stack – Balancing symbols 1 PPT Group discussion ,
15 50
– Nested function calls Illustration by examples
Recursion – Towers of Hanoi 1 PPT Group discussion
16 50
Illustration by examples
Queue – Array implementation , Linked 1 PPT
17 50 Group discussion
List implementation
Circular Queue 1 PPT Quiz,
18 50
Illustration by examples
19 Applications of Queue – Priority queue – 50 2 PPT Group discussion,
 Double ended queue Illustration by examples

UNIT IV: TREES

General trees – Terminology – Representation 1 BB Group discussion
20 50
of trees – Tree traversal Quiz
Binary tree – Representation – Expression 1 PPT
Group discussion
21 tree – Binary tree traversal, Threaded Binary 50
Illustration by examples
Tree
Binary Search Tree – Construction - 2 BB Group discussion
22 50
Searching , Deletion Illustration by examples
AVL trees – Rotation, Insertion 2 PPT Group discussion
23 50
B-Trees, construction, searching, deletion 2 PPT Group discussion ,
24 50
Quiz
Splay trees 1 PPT Quiz
25 50
Group discussion
Red-Black Trees 2 PPT Group discussion ,
26 50
Quiz
UNIT V: GRAPHS AND HASH TABLES
Graph Terminology, Graph traversal, 1 PPT
27 50 Group discussion
Topological sorting
Minimum spanning tree – Prims - 2 PPT
28 50 Group discussion
Kruskals
Network flow problem 1 BB Group discussion,
29 50
Shortest Path Algorithm: Dijkstra 2 BB Group discussion
30 50
Illustration by examples
Graph Search: Depth First Search, Breadth 1 BB Group discussion,
31 50
First Search Quiz
Hashing: Hash functions, Collision avoidance, 1 BB Group discussion,
32 50
Separate chaining Illustration by examples
Open addressing: Linear probing, Quadratic 2 BB Group discussion
33 Probing, Double hashing, Rehashing, 50 Illustration by examples
Extensible Hashing

Prepared By Head of the Department

(S.Ganesh Kumar)