Data Structures and Graph Algorithms, grades 9-10* 


*Refers to the level of mathematics and not to the actual age.

Pre-requisites:

Prior experience with computer programming is required. This course is suitable for students who have passed our enrichment courses Computer Algorithms I or Computer Algorithms II.

Course description:

This course is a sequel to Computer Algorithms I course. Coding in this course will be done in C, with an option to use Python for home assignments. We will use online platforms to run the code, thus installing software on your computer is not required.

The following topics will be covered:

  • Algorithms review – flowchart and pseudocode
  • Abstract Data Types – Stacks, Queues and Trees
  • Implementation of Stacks, Queues and Trees (Coding)
  • Matrices review – Representation of Adjacency matrix
  • Examples of graph algorithms that could be covered:
    • Minimal Spanning Tree – Prim’s and Kruskal algorithm
    • Maximum Flow – Ford-Fulkerson algorithm
    • Shortest path – Dijkstra’s algorithm
  • Implementation of graph algorithms (Coding)
  • Analysis of graph algorithms


2021/22 Course Information


This course is cancelled for 2021/22. We plan to offer it in 2022/23.


100% refund prior to August 31st
95% refund prior to September 30th
75% refund prior to October 31st
50% refund prior to November 30th

To request refund, please complete this form before the deadline.

Inquiries

For details please write to as.algorithms@gmail.com.
**Please note we are unable to answer any enquiries by phone.**

Need Directions?

Carleton University Campus Map