Welcome to CSCI 255 — Winter 2023
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:15am – 11:05am
Wednesday 9:15am – 10:05am
Friday 8:15am – 9:05am
Lab Section
Tuesday 3:15pm – 5:05pm
Office Hours
Monday 1:15pm – 3:15pm
Tuesday 9:00am – 11:00am
Thursday 9:00am – 11:00am
- 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)