DATA STRUCTURES LAB (Using C) LTPC

0 0 3 2

OBJECTIVES:
 To implement linear and non-linear data structures
 To understand the different operations of search trees
 To implement graph traversal algorithms
 To get familiarized to sorting and searching algorithms
 To identify and apply the suitable data structure for the given real world problem

LIST OF EXPERIMENTS
1. Implement the operations of List ADT using linked list and perform the following
i. Create a Linked list with the elements 11,22,44,55
ii. Insert 33 after 22
iii. Delete the element 22 from the list
iv. Display the elements.
2. Implement LIFO & FIFO structure. Use array Implementation.
3. Represent a polynomial as a linked list and write functions for polynomial addition.
4. Implement insertion and deletion on both sides of a list / application of queue ADT – DEQueue
5. Using binary search tree construct a Telephone directory with the information such as Phone Number, Name
and address and perform the following:
 Search for a phone number and print the customer name and address
 Remove a phone number from the directory
 Change the address of the customer whose phone number is given.
 Print the content of the directory
6. Implement AVL tree with insert, search, delete and traversal operations.
7. Implement an expression tree. Produce its pre-order, in-order, and postorder traversals.
8. Graph Traversals – Depth First and Breadth First search
 A person wants to visit some places. He starts from a vertex and then wants to visit every place
connected to this vertex and so on. What traversal methodology suits best for him and implement it
using C? (Breadth First Search).
 A person wants to visit some places. He starts from a vertex and then wants to visit every vertex till
it finishes from one vertex, backtracks and then explore other vertex from same vertex. What
traversal methodology suits best for him and implement it using C? (Depth First Search)
9. Applications of Graphs ( Minimum Spanning Tree)
10. Search the element in a list by using the searching method in divide and conquer Technique.
11. Implement of quick sort and merge sort.
12. Implement hashing with open addressing.
TOTAL: 60 PERIODS
Course Outcomes: At the end of this lab session, the student will
1. Develop the various linear data structures as such as List, Stack and Queue ADTs
2. Enlarge programming skills in design and implementation of non-linear data structures
3. Appropriately use the linear / non-linear data structure operations for a given problem
4. Design algorithms to solve the problems.
5. Develop applications using data structures.
6. Analyse the various searching and sorting algorithms.
7. Apply appropriate hash functions that result in a collision free scenario for data storage and
retrieval.