Course Overview
In this course, students will develop their ability to analyze and design computer algorithms. In particular, students will analyze the time and space complexity of programs, solve difficult programming problems using algorithmic techniques, and prove that their solution is correct. The emphasis will be on developing the practical skills of analysis and design. Topics covered may vary each term.
- Not offered this term
- This course is not offered this term. Notify me to receive email notifications when the course opens for registration next term.
Learning Outcomes
Upon successful completion of this course, the student will be able to:
- Discuss the importance of algorithms in the problem-solving process.
- Choose the appropriate data structure or container for modeling a given problem.
- Describe, implement and use common data structures and algorithms.
- Design and implement new algorithms using several techniques e.g. Divide and Conquer, Greedy, Dynamic programming, Graph techniques, etc.
- Argue the correctness of their algorithms.
- Analyze pseudo-code using the Big-Oh notation.
- Deduce the complexity of a program by running different experiments.
- Discuss the computational efficiency of the principal algorithms for sorting, searching, and hashing.
Effective as of Winter 2019
Related Programs
Algorithm Analysis and Design (COMP 3760) is offered as a part of the following programs:
- Indicates programs accepting international students.
- Indicates programs eligible for students to apply for Post-graduation Work Permit (PGWP).
School of Computing and Academic Studies
- Computer Systems Technology
Diploma Full-time
Programs and courses are subject to change without notice. Find out more about BCIT course cancellations.