s3.dslabKTU
Data Structures Lab
KTU 2019 Sylabus
Table of contents
1) Application of Arrays | Basic programs
2) sparse matrix
3) Stack
4) Linked List
5) Queue
6) Double Linked List
7) Trees
8) Sorting Techniques
1) Basic programs
</br>
2) sparse matrix
</br>
## 3) stack
- stack using array
- multiple stack
- min element in stack
- check if it is balanced
- decimal to binary
- infix to postfix
- infix to prefix
- check if it is palindrome
- postfix evaluation
- sorted stack
</br>
## 4) linked list
- implement linked list
- stack using linked list
- delete node, data is given
- insert at the given position
- insert before a node
- insert after a node
- reverse a linked list
- search in a linked list
- smallest element in a linked list
- sorted linked list
</br>
## 5) queue
- queue using array
- queue using linked list
- priority queue
- dequeue using DLL
- circular queue using linked list
- circular queue using array
</br>
6) Double Linked List
- circular linked list
- delete a node, data given
- delete a node, position is given
- delete smallest element
- DLL
- insert after a node
- insert node at a position
- insert before a node
- polynomial addition
- polynomial subtraction
- polynomial multplication
</br>
## 7) Trees
</br>
## 8) Searching techniques
- binary search
- bubble sort
- exchange sort
- heap sort
- insertion sort
- linear search
- merge sort
- quick sort
- selection sort
</br>