Fastest Route Finder | C++ | Algorithms and data structures
- Created a C++ program to find the shortest route in a city transport network, represented as a graph.
- The project uses the Breadth-First Search (BFS) algorithm to find the shortest path and adjacency lists to store connections between stops. Key data structures like vector, list, and unordered map are used to manage stops, routes, and connections.
- The program takes user input to build the graph and finds the best path between stops. This project shows how algorithms and data structures can solve practical problems, tested with various example scenarios.
Java BASIC Interpreter | Java
- Implemented a programmable calculator in Java capable of interpreting and executing simple pseudo-language similar to BASIC with commands like LET, PRINT, GOTO.
- Verified its functionality by running test programs and checking different command combinations.
Home Product Storage UI (Currently working on)| React | team
- Designed a Home Product Storage UI by creating storyboards and use-case scenarios to make it user-friendly, built a prototype in Excalidraw, and now working on implementing it in React.