Students learn the fundamentals of algorithm analysis and design through hands-on practice in this course. They study various algorithms and data structures frequently used in software development. Students learn to analyze the time and space complexities of algorithms and choose algorithms for non-trivial programming problems.
Data structures covered in this course include: arrays and vectors, lists, queues, stacks, and trees and graphs. Algorithms covered include: recursion, divide and conquer, greedy techniques and sorting algorithms.
Prerequisites
CSTP 1204 or equivalent, taken prior to or concurrently.
Course type
This course is offered as part of a VCC program and cannot be taken individually.
International students: Eligibility is determined at the program level. Visit the program page for international student requirements and application information.
- The fundamentals of algorithm analysis
- Vectors and Arrays
- Lists
- Iteration vs Recursion
- Common Sorting algorithms
- Time and space complexity analysis
- Divide and conquer and greedy algorithms
- Stacks and queues
- Graphs
- Binary trees and balanced binary trees
- Tree traversal algorithms
Course schedules
Select your program to see the available course schedules.
How to take this course
This course is offered as part of a VCC program only.
Contact us
If you have any questions, please email at [email protected].
† This information is intended as a guideline only. Program and course details are subject to change with the approval of VCC's Board of Governors.