Welcome to CSCI 255 — Winter 2024
NOTE: All posted/mentioned times mentioned related to this course are in Atlantic Time.
This course provides a deep investigation of foundational data structures and algorithms. Criteria for selecting appropriate data structures and algorithms for a given problem are presented. General problem solving is emphasized throughout the course. Specific topics include stacks, queues, lists, trees, searching, sorting, traversals, recursion, graphs, hashing, and complexity analysis.
Professors
Dr. Jean-Alexis Delamer
jdelamer at stfx.ca
Class Times
Lecture Section
Monday 10:30am – 11:15am
Wednesday 9:30am – 10:15am
Friday 8:30am – 9:15am
Lab Section
Tuesday 3:30pm – 5:15pm
Office Hours
Monday 9:00am – 10:00pm
Tuesday 1:00pm – 3:00pm
Thursday 9:30am – 10:30am
- 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
Useful links
Learning Java: CSCI-162
Installing Java: Getting set up (CSCI-162)