Data Structures and Algorithms Course. Repo contains projects and related work pertaining to course.
Implemented three methods for a LinkedList class. Methods were removeHead, insertAtTail and indexOf. Also created a JUnit testing suite to ensure proper functionality, considering numerous edge cases.
Implemented a PriorityQueue ADT using an array-based approach. It allows insertion of elements and removal of the highest priority element, leveraging the Comparable interface for comparing elements' priorities.
Implemented a Binary Search Tree. Homework assignment involved writing both recursive and iterative insert methods, as well as recursive methods for search, size, and toString.
Object-Oriented Programming Project in Java. Models a Roll-A-Coin Bank from the 1980s. Project involved refactoring old code to make it more reusable, robust, and readable. Behavior remained the same while implementation drastically changed. Unit tests done using JUnit Framework
Implemented a Sequence ADT. Tests done using JUnit Framework.
Refactored the Sequence ADT to be LinkedList based. Unit testing done using JUnit Framework
This project implements an infix to postfix converter using an array-based stack ADT. The infix expression is parsed, and operators are reordered according to postfix rules, leveraging the stack for operator precedence and operand handling.