SRM UNIVERSITY

FACULTY OF ENGINEERING AND TECHNOLOGY

SCHOOL OF COMPUTING
DEPARTMENT OF CSE
COURSE PLAN

Course Code : CS1201

Course Title : DATA STRUCTURES
Semester : VII
Course Time : Jul – Nov 2017

Day 2 3rd and 4th Hour

Day 4 6th Hour
Faculty Details
Name Office Office hour Mail id
Tech Park(8th jeya.r@ktr.srmuniv.ac.in
R.Jeya 8.00-4.00 P.M
Floor)

Textbook
1. Seymour Lipschutz, "Data Structures with C", second edition, Schaum's outlines, McGraw Hill
Education Private Limited,2014.
References
1. Richard Gilberg, Behrouz A. Forouzan, "data structures A pseudocode approach with C++", Cengage
Learning, 2011 reprint
2. Mark Allen weiss, "Data structures and algorithm analysis in C", Pearson Education, 1997, reprint
2010

Prerequisite : NIL

Objectives
1. To understand several data structures concepts like stack, queues, linked list, trees and files
2. To know the applications of data structures
3. To get familiarized with solving problems using data structure tools and techniques

Assessment Details

Component Assessment tool Weight age

Test-I 20%
Test-II 20%
Surprise test I 5%
Assignment 5%
Theory component End Semester Examination 50%
 Test Schedule

S.No. DATE TEST TOPICS DURATION

1 Cycle Test - I Unit I & II 2 periods
As per calendar
2 Cycle Test - II Unit III ,IV& V 3 Hrs

Outcomes
Students who have successfully completed this course will have full understanding of the
following concepts

Course outcome Program outcome

To learn about analyzing and designing algorithms An ability to understand and analyze the
algorithms

To learn various data structure concepts like To understand the concepts of Stack, Queue and
Stacks, Queues, Linked List and Hashing. Linked List

To Learn advanced Data structures such as

To implement Sorting, Search tree and Hash
balanced search trees, hash tables and priority
tables.
queues and sorting algorithms.

To study various graph processing algorithms To understand various types of Graph

Algorithms

Detailed Session Plan

UNIT I– Introduction
Data structure- Definition, Types, Operations -Primitive and composite Data types-Algorithmic
notations-Complexity of Algorithms- Arrays, Operation on arrays-Order lists.
Session Time Teaching
Topics to be covered Ref Testing Method
No. (min) Method
Introduction- Data structure T1 Quiz
1 50 PPT
Definition ,Types , Operations T1 Quiz
2 50 PPT
Primitive and composite Data types T1 Quiz
3 50 PPT
Brain storming
Algorithmic notations T1 Quiz
4 50 BB,PPT
Surprise Test
Complexity of Algorithms T1 BB,PPT Quiz
5 50
Surprise Test
Arrays T1 BB,PPT Quiz
6 50
Surprise Test
Operation on arrays T1 Group discussion
7 50 PPT
Quiz
Operation on arrays T1 Group discussion, Quiz
8 50 PPT
 Order lists T1 Quiz, Assignment
9 50 PPT

UNIT II - STACKS AND QUEUES

STACKS:Array implementation – Operations on stacks - Applications of Stack -Infix to Postfix
Conversion, Evaluation of Postfix expression, Recursion.
QUEUES: Array implementation - Operations on Queues -Queue Applications,Circular Queue.

STACKS:Array implementation Quiz

10 50 T1 BB,PPT Group discussion

Operations on stacks Quiz

T1 50 T1 BB,PPT
Group discussion
12 Applications of Stack- Recursion 50 T1 BB,PPT Quiz
Infix to Postfix Conversion Quiz
13 50 T1,R1 BB,PPT
Surprise Test
Evaluation of Postfix expression Quiz
14 50 T1 BB,PPT
Group discussion
QUEUES: Array implementation Quiz
15 50 T1 BB,PPT
Operations on Queues Quiz
16 50 T1 BB,PPT
Group discussion
17 Queue Applications 50 T1 BB,PPT Quiz
Circular Queue.
50 T1 BB,PPT Group discussion
18

UNIT III - LINKED LISTS

Singly Linked List: Implementation - Operations - Application - Representation of a Polynomial,
Polynomial Addition - Doubly Linked List: Implementation – Operations – Circular linked lists.

LINKED LISTS - Introduction Group discussion

19 50 T1 BB
Assignment
Singly Linked List: Implementation Group discussion
20 50 T1 BB
Singly Linked List :Operations Group discussion
21 50 T1 BB
Quiz
Application - Representation of a Group discussion
22 50 T1 BB
Polynomial Assignment
23 Polynomial Addition 50 T1,R1 BB,PPT
Doubly Linked List: Implementation Group discussion
24 50 T1 BB
Assignment
25 Doubly Linked List: Operations 50 T1,R1 BB,PPT Group discussion
Circular linked lists Quiz
26 50 T1 BB,PPT Group discussion

27 Circular linked lists 50 T1 BB,PPT Group discussion

UNIT IV - TREES AND GRAPHS
TREES: Binary Trees - Conversion of General tree to Binary Tree, Operations - Tree Traversals – GRAPH:
Definition, Types of Graphs, Hashing Tables and Hashing Functions, Graph Traversal -Depth first
traversal, Breadth first traversal

TREES: Binary Trees Group discussion

28 50 T1 BB
Conversion of General tree to Binary Objective type test
29 50 T1 BB
Tree
30 Operations on Binary Trees 50 T1 BB Brain storming

31 Operations on Binary Trees

Tree Traversals
32 50 T1 BB Brain storming
GRAPH: Definition, Types of Graphs Surprise test
33 50 T1 BB
Quiz
Hashing Tables and Hashing Functions
34 50 T1 BB Group discussion
35 Graph Traversal -Depth first traversal 50 T1 BB Group discussion
36 Breadth first traversal
UNIT V - SORTING AND SEARCHING
Sorting concepts - Types - Insertion sort - Selection sort - Bubble sort – Merge sort - Quick sort - Heap sort
Searching concepts - Linear search - Binary search..

Sorting concepts - Types - Insertion sort Quiz

37 50 T1 BB
38 Selection sort Quiz
50 T1 BB
Bubble sort Quiz
39 50 T1 BB
Brain storming
Merge sort Quiz
40 50 T1 BB
Surprise Test
Quick sort Quiz
41 50 T1 BB
Surprise Test
Heap sort- Introduction Quiz
42 50 T1 BB
Surprise Test
Heap sort Group discussion
43 50 T1 BB
Quiz
44 Searching concepts- Linear search 50 T1 BB Group discussion, Quiz

45 Binary search 50 T1 BB Quiz

 BB-Black Board
 PPT-Power Point

Signature of Staff Signature of HOD

CSE Department