Data Structures Lab S3

This repository contains solutions of all Data Structures Lab programs (S3 KTU Model Engineering College)

Cycle-1

1)Polynomial addition using arrays.Solution

2)Polynomial evaluation.Solution

3)Sparsity of a matrix.Solution

4)Sparse matrix addition.Solution

5)Transpose of sparse matrix.Solution

Cycle-2

1)Stack implementation using arrays.Solution

2)Conversion of infix to postfix expression.Solution

3)Postfix evaluation.Solution

4)Queue implementation using array.Solution

5)Circular queue using array.Solution

6)Priority queue.

Cycle-3

1)Stack implementation using linked list.Solution

2)Queue implementation using linked list.Solution

3)Deque implementation using linked list(DLL).Solution

4)Polynomial addition using linked list(SLL/DLL).Solution

5)Implement a circular linked list(DLL).Solution

Cycle-4

1)Bubble sort.Solution

2)Insertion sort.Solution

3)Selection sort.Solution

4)Quick sort.Solution

5)Merge sort.Solution

6)Heap sort.Solution

7)Linear search.Solution

8)Binary search.Solution

Cycle-5

1)Implementation of all operations on a binary tree(insertion,deletion,traversal).Solution

Cycle-6

1)Implementation of BFS and DFS for graph representation(adjacency matrix/adjacency list).Solution

2)Implementation of hash table using your own mapping functions and observe collision and resolution schemes.Solution

External Exam Questions

1)Binary Search Tree: Insert, Delete, Traversal (all 3).Solution

2)In Singly Linked List, difference between 2 node values.Solution

3)Stack using linked list.Solution

4)Program to calculate no of leaf nodes in a BST.Solution

5)Display alternate elements in a singly linked list.Solution

6)Singly linked list Remove duplicate elements, Find maximum and minimum element Find Sum of all elements Make a copy of the linked list and display.Solution

7)Polynomial multiplication using linked list.Solution

8)Check whether a given doubly linked list is palindrome or not.Solution