 Rayat Institute of Engineering
& Information Technology
Approved by AICTE, Affiliated to PTU, Jalandhar.

Data Structures Lab To understand how various data structures work. To understand some important applications of various data structures. To familiarize how certain applications can benefit from the choice of data structures. To understand how the choice of data structures can lead to efficient implementations of algorithms.

### List of practical exercises, to be implemented using object-oriented approach in C++ Language.

1.Write a menu driven program that implements following operations (using separate functions) on a linear array:
Insert a new element at end as well as at a given position
-Delete an element from a given whose value is given or whose position is given
-To find the location of a given element
-To display the elements of the linear array

2.Write a menu driven program that maintains a linear linked list whose elements are stored in on ascending order and implements the following operations (using separate functions): -Insert a new element
-Delete an existing element
-Search an element
-Display all the elements

3.Write a program to demonstrate the use of stack (implemented using linear array) in converting arithmetic expression from infix notation to postfix notation.

4.Program to demonstrate the use of stack (implemented using linear linked lists) in evaluating arithmetic expression in postfix notation.

5.Program to demonstration the implementation of various operations on a linear queue represented using a linear array.

6.Program to demonstration the implementation of various operations on a circular queue represented using a linear array.

7.Program to demonstration the implementation of various operations on a queue represented using a linear linked list (linked queue).

8.Program to illustrate the implementation of different operations on a binary search tree.

9.Program to illustrate the traversal of graph using breadth-first search.

10.Program to illustrate the traversal of graph using depth-first search.

11.Program to sort an array of integers in ascending order using bubble sort.

12.Program to sort an array of integers in ascending order using selection sort

13.Program to sort an array of integers in ascending order using insertion sort.

14.Program to sort an array of integers in ascending order using radix sort.

15.Program to sort an array of integers in ascending order using merge sort.

16.Program to sort an array of integers in ascending order using quick sort.

17.Program to sort an array of integers in ascending order using heap sort.

18.Program to sort an array of integers in ascending order using shell sort.

19.Program to demonstrate the use of linear search to search a given element in an array.

20.Program to demonstrate the use of binary search to search a given element in a sorted array in ascending order.

Rayat Institute of Engineering & Information Technology
Railmajra, Near Ropar , Distt. S.B.S Nagar, PIN-144533, Punjab
Email : rieit@rayatbahra.com
Home | Study Programmes | Placement | Facilities | Jobs | Online Grievance Cell | Web Mail | Contact Us