3CS8 DATA STRUCTURES LAB (Common to Comp. Engg. & Info. Tech)
S. No. List of Experiments
Write a simple C program on a 32 bit compiler to understand the concept of array
storage, size of a word. The program shall be written illustrating the concept of row
major and column major storage. Find the address of element and verify it with the
theoretical value. Program may be written for arrays upto 4-dimensions.
Simulate a stack, queue, circular queue and dequeue using a one dimensional array
as storage element. The program should implement the basic addition, deletion and
Represent a 2-variable polynomial using array. Use this representation to implement
addition of polynomials.
Represent a sparse matrix using array. Implement addition and transposition
operations using the representation.
Implement singly, doubly and circularly connected linked lists illustrating operations
like addition at different locations, deletion from specified locations and traversal.
6 Repeat exercises 2, 3 & 4 with linked structures.
7 Implementation of binary tree with operations like addition, deletion, traversal.
Depth first and breadth first traversal of graphs represented using adjacency matrix
9 Implementation of binary search in arrays and on linked Binary Search Tree.
10 Implementation of insertion, quick, heap, topological and bubble sorting algorithms.