- International Fees
International fees are typically three times the amount of domestic fees. Exact cost will be calculated upon completion of registration.
Course details
In this hands-on course, Java programming students who have also taken Discrete Math will develop their ability to analyze and design computer algorithms. In particular, learners will analyze the time and space complexity of programs, solve nontrivial 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 include: evaluating time and space complexity and designing solutions by using appropriate data structures or applying techniques such as recursion, parsing and graph algorithms.
Prerequisite(s)
Credits
4.0
Domestic fees
$605.27 - $632.38 See individual course offerings below for actual costs.
Course offerings
Spring/Summer 2024
Below are two offerings of COMP 3761 for the Spring/Summer 2024 term.
CRN 68045
Duration
Tue May 07 - Tue Jul 23 (12 weeks)
- 12 weeks
- CRN 68045
- Domestic fees $632.38International fees are typically three times the amount of domestic fees.
Class meeting times
| Dates | Days | Times | Locations |
|---|---|---|---|
| May 07 - Jul 23 | Tue | 18:00 - 21:00 | Downtown DTC Rm. 374 |
| May 07 - Jul 23 | N/A | N/A | Online |
Instructor
Frederic Guo
Course outline
Domestic fees
$632.38
Important information
- Departmental approval needed
- International fees are typically three times the amount of domestic fees. Exact cost will be calculated upon completion of registration.
-
Please email cstflex@bcit.ca for Departmental approval. Include your Student number (A0#) and COMP__ and preferred CRN __ and Program Declaration____. Course is 48 hours - 36 hours on campus and 12 hours asynchronous activities/labs. The class meets once per week for 3 hours on campus and requires an additional 1 hour per week asynchronously. Late registration is not permitted.
Status
CRN 68044
Duration
Mon May 06 - Mon Jul 22 (12 weeks)
- 12 weeks
- CRN 68044
- Domestic fees $605.27International fees are typically three times the amount of domestic fees.
Class meeting times
| Dates | Days | Times | Locations |
|---|---|---|---|
| May 06 - Jul 22 | Mon | 18:00 - 21:00 | Online |
| May 06 - Jul 22 | N/A | N/A | Online |
Instructor
Frederic Guo
Course outline
Domestic fees
$605.27
Important information
- Internet delivery format.
- Departmental approval needed
- Important course information will be sent to you prior to your course start date. Check your myBCIT email account to access this information.
- International fees are typically three times the amount of domestic fees. Exact cost will be calculated upon completion of registration.
-
Please email cstflex@bcit.ca for Departmental approval. Include your Student number (A0#) and COMP__ and preferred CRN __ and Program Declaration____. Course is 48 hours - 36 hours synchronous online classes and 12 hours asynchronous activities/labs. The class meets once per week for 3 hours online and requires an additional 1 hour per week asynchronously. Late registration is not permitted. Class in session May 20 (Victoria Day) and July 1 (Canada Day).
Status
Full
This course offering is full. Please check this page for other currently available offerings, subscribe to receive email updates or contact us with your comments or questions.
Learning Outcomes
Upon successful completion of this course, the student will be able to:
- Understand the basic framework of algorithm analysis.
- Analyze pseudo-code using asymptotic notations.
- Compare the order of growth of different algorithms.
- Understand the differences between nonrecursive and recursive algorithms.
- Describe some common algorithm design strategies: Divide and Conquer, Transform and Conquer, Greedy Technique, Graph Algorithm, dynamic programming, etc.
- Recognize different types of computing problems and how to solve them.
- Apply algorithm design techniques to solve some practical problems.
- Specify algorithms in pseudocode.
- Implement solutions by using appropriate data structures.
- Deduce the complexity of a program by running different experiments.
- Argue the correctness of the algorithms.
- Find lower bounds for some simple problems.
Effective as of Winter 2011
Related Programs
Algorithm Analysis and Design (COMP 3761) is offered as a part of the following programs:
- Indicates programs accepting international students.
- Indicates programs with a co-op option.
School of Computing and Academic Studies
- Computer Systems
Diploma Part-time
Contact Us
If you have a question or comment about this course, please complete and submit the form below.
Subscribe
Interested in being notified about future offerings of Algorithm Analysis and Design (COMP 3761)? If so, fill out the information below and we'll notify you by email when courses for each new term are displayed here.
Programs and courses are subject to change without notice.