Professional Documents
Culture Documents
School of Computing Department of Cse: SRM University Faculty of Engineering and Technology
School of Computing Department of Cse: SRM University Faculty of Engineering and Technology
SCHOOL OF COMPUTING
DEPARTMENT OF CSE
COURSE PLAN
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
Outcomes
Students who have successfully completed this course will have full understanding of the
following concepts
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
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
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..
BB-Black Board
PPT-Power Point