BANNARI AMMAN INSTITUTE OF TECHNOLOGY

(An Autonomous Institution Affiliated to Anna University, Chennai)

SATHYAMANGALAM – 638 401

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

II YEAR/ III SEMESTER OUTCOME BASED LABORATORY TASKS

NAME OF THE LAB HANDLING FACULTY WITH MAIL ID:
1. KARTHIGA M, karthigam@bitsathy.ac.in
2. DIVYA P, divyap@bitsathy.ac.in
3. NIVEDITA V S, nivedita@bitsathy.ac.in
NAME OF THE LAB SUBJECT: DATA STRUCTURES AND ALGORITHMS
LAB SUBJECT CODE: 18CS307

S.NO LIST OF TASKS MAPPING WITH OUTCOME

EXPERIMENTS
(mention the
experiment number
alone)
1 You are working in a credit card 6,7,8,9,10,13 Analyze efficient
company. The company has algorithm in terms of time
records about the credit card users. complexity and space
complexity.
The company uses a hashing
technique to store the information
about the credit card users based
on their purchase priority.
According to the purchase priority
the customers are provided
suitable reward.
Determine an efficient sorting
algorithm among Selection sort,
bubble sort, quick sort, heap sort
and shell sort to sort the
customers eligible to obtain
rewards.
2 A Muddy City Problem: 11-12 Develop real time
applications based on
Non-linear data structures
 The city has no roads, making it
difficult (and muddy) to get
around. Enough streets must be
paved so it is possible to travel
from any house to any other
house, possibly via other houses.
The paving should be done at a
minimum cost. The diagram
indicates the number of paving
stones needed to connect each
house. The bridge requires a
paving slab.
Find the minimum number of
paving stones and the path needed
to connect all the houses in the
city and find the order of traversal
between the houses.

List of experiments:
1. Program to Solve Tower-of-Hanoi Problem using Recursion

2. a) Write a C program to implement a Stack ADT using array and write the routine for
push operation which represent a function PUSH(X, S), Check for the condition
whether S-full or not, if yes display the message otherwise insert the elements into the
Stack. Perform POP operation which represents a function POP(S), Check for the
condition whether S-Empty, if stack is empty, display the message otherwise delete an
element from the Stack. Test your program with at least 5 elements and provide the
output.
b) Write a C program to implement the Queue ADT using array and write the routine
to enqueue an element X into queue, Check for the conditions Q-full, if yes display
the message otherwise insert the data into the queue and dequeue an element from
queue, check for the conditions Q-empty, if yes display the message otherwise
 deleting the element from the queue and display the elements from the Queue ADT.
Test your program with at least 6 elements and provide the output

3. Linked List Implementation of stack and queue.

4. Write a function program to perform the following operations on a singly linked list
i. Create a list
ii. Insert an element to the list
iii. Delete the maximum element from the list
iv. Arrange the list as sorted order
v. Display the elements of the list
Write a main method to demonstrate the above functionalities.

5. Write a function program to perform the following operations on a doubly linked list
i. Create a list
ii. Insert an element to the list
iii. Delete the maximum element from the list
iv. Arrange the list as sorted order
v. Display the elements of the list
Write a main method to demonstrate the above functionalities.

6. Program to sort the elements in ascending order using selection sort and bubble sort

7. Implementation of quick sort.

8. Implementation of heap sort.

9. Implementation of shell sort.

10. Develop a program to perform linear and binary search

11. Program to construct an expression tree for a given expression and perform various
tree traversal methods.

12. Implement Prims algorithm with the following functionalities

i. Read a set of vertices minimum of six from the keyboard
ii. Get the number of edges and form the graph
iii. Find the value of each edge by using distance formula for two points.
iv. Develop a Minimum Spanning Tree for the graph
v. Find the total length of all edges.
Write a main method to execute the above functionalities

13. Implementation of hashing technique