- Program for String operations without library functions
- Various operations on polynomials using structures
- Represent Sparse Matrix using array and perform Matrix Addition,Simple Transpose and Fast Transpose
- Simulation of Stack using Array
- Simulation of Queue using Array
- A program for Circular Queue using Array
- A program for Circular Dequeue using an Array
- Simulation of Stack using Linked List
- Queue represented using Linked List
- Queue represented using a Circular Linked List
- Dequeue represented using Linked List
- Various operations on Polynomials using linked List
- operations on sll (Singly Linked List)
- Infix to Prefix and Postfix with Evaluation
- Postfix to Infix and Prefix
- Prefix to Infix and Postfix
- Operations on Doubly Linked List
- Operations on CLL -Circular Linked List
- Program showing various operations on Binary Search Tree
- Program for AVL Tree
- Indegree,Outdegree,Total Degree of each Vertex and, BFS , DFS on a Graph represented using Adjacency Matrix
- DFS and BFS on Graph represented using Adjacency List
- BSF and DSF on a Graph represented using Adjacency Matrix
- Program for constructing a minimum cost spanning tree using Prim's algorithm
- Program for constructing a Minimum Cost Spanning Tree Kruskal Algorithm

## 0 Comments