CSCI 162 — Winter 2026

This course emphasizes the use of abstraction in programming. Elementary data structures are introduced (stacks, queues, lists, trees) along with related algorithms. The data structures and other simple iterative and recursive algorithms are used (e.g. searching and sorting) are used to introduce algorithm analysis.

Professor

  • Dr. James Hughes

  • jhughes at stfx.ca

  • Annex 20B

GitHub Repo

  • The course content is available on GitHub

  • Feel free to submit issues, fork the repo, and submit pull requests

    • Follow the guidelines

  • In other words, feel free to make contributions to the course content

    • In fact, I encourage this

Class Times

  • Tue 11:30 – 12:20 (K4), MULH 4024

  • Wed 13:30 – 14:20 (K5), MULH 4024

  • Fri 12:30 – 13:20 (K6), MULH 4024

Labs

  • Lab Sec 11: Thr 14:30 – 16:20 (L8-A9), MULH 4024

  • Lab Sec 12: Fri 14:30 – 16:20 (C9-K9), MULH 4024

Office Hours

  • Tue 10:30 – 11:30, Annex 20B

  • Wed 10:30 – 11:30, Annex 20B

  • Thr 10:30 – 11:30, Annex 20B

  • Fri 11:30 – 12:30, Annex 20B

Course Notes

Labs

Assignments

Getting Started

Outline