CS-0445: Algorithms and Data Structures - 1
Recitations, Fall 2023
- Recitation 1: Deep and shallow copy. Handout: Rec1. Copying Objects. Starter code: starter.zip.
- Recitation 2: Abstract Classes. Handout: Rec2. Extending Progressions. Starter code: starter.zip.
- Recitation 3: Algorithm analysis. Handout: Rec3. Running time of algorithms.
- Recitation 4: Linked Lists. Handout: Rec4. Implementing a Minimalistic Linked List. Note that this implementation will be used for the Programming Assignment 2.
- Recitation 5: Testing and Debugging. Handout: Rec5. Testing and debugging. Note that you will use similar procedures to auto-test your Assignment 2 (the tests will be provided to you).
- Recitation 6: Linked Lists: practice. Handout: Rec6. Linked Lists. Solutions: LINK.
- Recitation 7: Java HashMap. Handout: Rec7. Java HashMap with custom keys. Solution: LINK
- Recitation 8: My Own Hash Map. Handout: Rec8. Hash table with Separate Chaining. Note that this implementation will be used for the Programming Assignment 3.
- Recitation 9: Recursion Exercises. Handout: Rec9. Recursive challenge. Solutions: LINK
- Recitation 10: Divide-Conquer Algorithms. Handout: Rec10. Binary-Search challenge. Solutions: LINK