24ES303 DATA STRUCTURES IN C LT P C
3003
OBJECTIVES:
To understand the concepts of ADTs
To Learn linear data structures – lists, stacks, and queues
To Learn Non linear data structures - Trees and Graphs
To understand sorting, searching and hashing algorithms
UNIT I LINEAR DATA STRUCTURES – LIST 9
Introduction to Data Structures - Abstract Data Types (ADTs) – List ADT – array-based
implementation – linked list implementation – singly linked lists- Doubly linked lists -
Applications of lists –Polynomial Addition.
UNIT II LINEAR DATA STRUCTURES – STACKS, QUEUES 9
Stack ADT(array implementation) – Operations - Applications - Evaluating arithmetic
expressions- Conversion of Infix to postfix expression - Evaluating postfix expressions-
Queue ADT(array implementation) – Operations - Circular Queue -Applications of queues.
UNIT III NON LINEAR DATA STRUCTURES – TREES AND GRAPHS 9
Tree ADT – Binary Tree ADT – Tree traversals - expression trees - Binary Search Tree ADT-
Insertion - Definition of Graph – Representation of Graph – Types of graph - Breadth-first
traversal - Depth-first traversal - Applications of graphs -Minimum spanning tree: Prim’s,
Kruskal.
UNIT IV SORTING 9
Sorting - Bubble sort - Selection sort - Insertion sort - Merge sort - Quick sort – Heap sort
UNIT V SEARCHING AND HASHING TECHNIQUES 9
Searching- Linear Search - Binary Search. Hashing- Hash Functions – Separate Chaining –
Open Addressing – Rehashing –Extendible Hashing.
TOTAL: 45 PERIODS
OUTCOMES:
At the end of the course, the student should be able to:
Implement abstract data types for linear data structures.
Apply the different linear and non-linear data structures to problem solutions.
Critically analyze the various sorting algorithms.
TEXT BOOKS:
1. Mark Allen Weiss, “Data Structures and Algorithm Analysis in C”, 2nd Edition,
PearsonEducation,1997.
2. Reema Thareja, “Data Structures Using C”, Second Edition , Oxford University Press,
2011
REFERENCES:
1. Thomas H. Cormen, Charles E. Leiserson, Ronald L.Rivest, Clifford Stein, “Introduction
toAlgorithms", Second Edition, Mcgraw Hill, 2002.
2. Aho, Hopcroft and Ullman, “Data Structures and Algorithms”, Pearson Education,1983.
3. Stephen G. Kochan, “Programming in C”, 3rd edition, Pearson Education.
4. Ellis Horowitz, Sartaj Sahni, Susan Anderson-Freed, “Fundamentals of Data Structures in
C”,Second Edition, University Press, 2008
Signed by Staff Signed by HOD
24ES312 DATA STRUCTURES IN C LAB
LT P C
0 0 3 1.5
OBJECTIVES
To implement stack and queue
To apply suitable data structures for a given problem statement
To implement binary trees, graphs and its traversals
To perform sorting using various algorithms
To experiment search techniqueues
LIST OF EXPERIMENTS
1. To implement List ADT using Array
2. To implement Singly Linked List ADT
3. To implement Stack ADT using Array
4. To implement various applications of Stack ADT ( Infix to Postfix
Conversion, Postfix Evaluation)
5. To implement Queue ADT using Array
6. To implement applications of Queue ADT (FCFS Scheduling)
7. To implement the insertion of a node in a Binary Search Tree
8. To implement Tree Traversals
9. To implement Graph Traversals (BFS and DFS)
10. To find out shortest path using Dijkstra’s Algorithm
11. To perform sorting (Insertion sort, Selection sort, Bubble sort, Merge sort,
Quick sort)
12. To implement Search operation(Linear search, Binary Search)
COURSE OUTCOMES
1. Implement various implementation of linear data structures
2. Apply linear and non linear data structures to real world problems.
3. Implement traversal techniques of non linear data structures
4. Apply sorting and searching techniques to given problem
5. Choose suitable data structures to solve the problem
Signed by staff Signed by HOD
