S3 Data Structures Lab Experiments (KTU 2019 Scheme)

Experiments

Sl. No	Experiment
1	Stack using Array
2	Queue using Array
3	Circular Queue
4	DEqueue
5	Infix to postfix conversion
6	Postfix evaluation
7	Linear Search
8	Binary Search
9	Singly Linked List
10	Polynomial Addition using Array
11	Sparse Matrix Addition
12	Polynomial Addition and Multiplication using Linked List
13	Bubble Sort
14	Selection Sort
15	Insertion Sort
16	Heap Sort
17	Merge Sort
18	Quick Sort
19	Depth First Search (DFS)
20	Breadth First Search (BFS)
21	Binary Tree
22	Hashing

Name		Name	Last commit message	Last commit date
BFS.c		BFS.c
BinarySearch.c		BinarySearch.c
CircularQueue.c		CircularQueue.c
DFS.c		DFS.c
Dequeue.c		Dequeue.c
HashTable.c		HashTable.c
InfixtoPostfix.c		InfixtoPostfix.c
InsertionSort.c		InsertionSort.c
PolynomialAddition.c		PolynomialAddition.c
PolynomialAdditionMultiplication.c		PolynomialAdditionMultiplication.c
README.md		README.md
SelectionSort.c		SelectionSort.c
SparseAddition.c		SparseAddition.c
binaryTree.c		binaryTree.c
bubbleSort.c		bubbleSort.c
heapSort.c		heapSort.c
linearSearch.c		linearSearch.c
mergeSort.c		mergeSort.c
postfixEvaluation.c		postfixEvaluation.c
queue.c		queue.c
quickSort.c		quickSort.c
singlyLinkedList.c		singlyLinkedList.c
stack.c		stack.c