1. Simple array and sorting algorithm implementations.
2. Addition, multiplication and transpose of sparse matrices represented in array form.
3. Polynomial addition, multiplication (8th degree polynomials), using array & linked lists.
4. Implementation of stack and queue using array & linked lists.
5. Implementation of circular queue using array.
6. Infix to postfix/prefix conversion.
7. Binary search tree creation and traversing.
8. Generation of spanning trees for a given graph using BFS & DFS algorithms.
9. AVL tree implementation (creation, insertion, deletion).
10. Symbol table organization (Hash Table).