Introduction to Data Structures and Algorithms at MiraCosta College. In this class we learn the most common and basic data structures that are used in CS. We, for example, learned about stacks and queues, linked lists, various tree structures such as an AVL tree hash tables and more. Least to say that I really loved this class. Checkout the Final Project, it's really great!
Every one of the folders has their own README which goes more in depth of what that homework entailed, so I will name the overarching theme of the homework and then link to that README.
- Homework 1: Big-O Runtime (I solved this O(1) using reflection and now am the example of what not to do lol)
- Homework 2: Here we were supposed to create a small website
- Homework 3: In this homework we learned using interfaces and were allowed to use the built in Linked List to create a simple Polynomial Calculator
- Homework 4: We had to create our own Linked List implementation
- Homework 5: Using the previous homework we had to create a doubly linked list
- Homework 6: In this homework we learned about Stacks
- Homework 7: Here we used a Queue and also started using recursion
- Homework 8: We were tasked with building a morse code tree, our first binary tree
- Homework 9: In this homework we built a Huffman tree for compression
- Homework 10: This homework made us build a hash table with chaining
- Homework 11: Our last homework had us build an self balancing AVL tree. (This was not fun)
- Group project 1: Big Integer Class using Linked List
- Group project 2: Calculator which uses Infix/Postfix
- Final Project: Built a route planning/map tool of MiraCosta using Djikstra's algorithm.