CSCI 255 Logo
1.0

Course Notes

  • 1. Algorithm Analysis
  • 2. Trees
  • 3. Heaps and Priority Queues
  • 4. Binomial Queues
  • 5. AVL Trees
  • 6. Red-Black Trees
  • 7. B-Trees
  • 8. Hashing
  • 9. Hash Table without Linked Lists
  • 10. \(O(1)\) Hash Tables
  • 11. Graph
  • 12. Graph Algorithms
  • 13. Dijsktra’s Algorithm
  • 14. A-Star
  • 15. Network Flow Problems
  • 16. Sorting
  • 17. Mergesort

Labs

  • 1. Java - Review
  • 2. Algorithm Analysis
  • 3. BST
  • 4. Heaps
  • 5. AVL Trees
  • 6. Red-Black Trees
  • 7. Hashing - I
  • 8. Hashing - II
  • 9. Graph
  • 10. Graph Algorithm

Assignments

  • 1. Coffee Shop
  • 2. Movie DB
  • 3. Sentiment Analysis
  • 4. Maze escape

Course Outline

  • Computer Science 255 — Advanced Data Structures
CSCI 255
  • »
  • Search

© Copyright 2022, Jean-Alexis Delamer.

Built with Sphinx using a theme provided by Read the Docs.