Welcome to CSCI 255 — Winter 2022
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
Mon 10:15 - 11:05, MULH 4034
Wed 9:15 - 10:05, MULH 4034
Fri 8:15 - 9:05, MULH 4034
Lab Section
Tue 3:15pm - 5:05pm, MULH 4024
Office Hours
Office Hours Etiquette — Don’t Do This
- Jean-Alexis Delamer - Annex 9C
Monday, 9:00 – 10:00
Tuesday, 9:30 – 10:30
Course Notes
- Topic 1 - Introduction to C++
- Topic 1b - Templates
- Topic 2 - Algorithm Analysis
- Topic 3 - Tree Review
- Topic 4 - AVL Trees
- Topic 5 - Splay Trees
- Topic 6 - Red-Black Tree
- Topic 7 - Hashing
- Topic 8 - Hash Table without Linked Lists
- Topic 9 - \(O(1)\) Hash Tables
- Topic 10 - Queues
- Topic 10b - Priority Queues
- Topic 11 - Binomial Queues
- Topic 12 - Graph
- Topic 13 - Graph Algorithms
- Topic 14 - Sorting
- Topic 15 - Mergesort