DSA Projects

Maintaines patient records, appointment schedules, and medical history.

• Use of linked lists for efficient data storage
• Implementing a search algorithm for quick patient retrieval
• Easy to understand
• Time complexity of O(n)

Simple stack & queue implementation with memory efficiency & easy to understand implementation

• Used arrays (fixed) or linked lists (dynamic).
• Handled underflow and overflow.
• Used circular queue or two stacks.
• Implemented undo-redo or task scheduling.

Data structure that implements an associative stack abstract data type.

• Used Stack for postfix/infix evaluation.
• Optimized with two stacks for operators and operands.
• Handled invalid expressions and divide-by-zero.
• Solves mathematical expressions efficiently.

Algorithms that operate on graphs to solve problems like shortest path.

• Dijkstra's Algorithm
• Bellman-Ford Algorithm
• Kruskal's Algorithm
• Prim's Algorithm