- International Fees
International fees are typically three times the amount of domestic fees. Exact cost will be calculated upon completion of registration.
Course details
The objective of this course is to apply concepts and problem-solving techniques that are used in the design and analysis of efficient algorithms. This course will provide students with exposure and practice to more advanced data structures and algorithmic strategies used in software development. Students will identify real world problems and apply a heuristic approach to solve them. After reviewing basic data structures and algorithms, students will apply advanced analysis techniques and algorithms. Particular emphasis will be placed on efficiency and optimization.
Credits
3.0
Domestic fees
$824.03
Course offerings
Spring/Summer 2024
Below is one offering of COMP 8042 for the Spring/Summer 2024 term.
CRN 66092
Duration
Wed Apr 03 - Wed Jun 19 (12 weeks)
- 12 weeks
- CRN 66092
- Domestic fees $824.03International fees are typically three times the amount of domestic fees.
Class meeting times
Dates | Days | Times | Locations |
---|---|---|---|
Apr 03 - Jun 19 | Wed | 18:00 - 21:45 | Burnaby SE12 Rm. 325 |
Instructor
Sayyedhassan Shavarani
Course outline
Credits
3
Domestic fees
$824.03
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.
-
1. Please email compBSc@bcit.ca for departmental approval. Include your full name, student number (A0#), course number (e.g. COMP 7000), and CRN #. 2. This is a BScACS course. BScACS courses are also open to non-bachelor program students, if approval is granted by the BScACS Program Head. 3. BScACS program students have up to seven (7) years to complete the program starting from the date of their first technical degree-level course or the date of acceptance to the BScACS program, whichever comes first.
Status
In Progress and Full
This course offering is in progress and full. Please check back next term or subscribe to receive email updates.
Learning Outcomes
Upon successful completion of this course, the student will be able to:
- Design and analyze data structures (including advanced tree data structures, dictionaries, hash tables, heaps, and priority queues)
- Apply a heuristic approach to problem solving.
- Apply the most appropriate and optimal solution for problem solving using fundamental algorithms (including greedy, divide-and-conquer, and dynamic programming) and advanced algorithms.
- Apply mapping of real-world problems to algorithmic solutions (including graph problems).
- Apply advanced techniques to algorithms (including probabilistic and Big O analysis).
- Design finite state machines for practical problems.
- Develop (design and implement) optimized software applications using the most appropriate data structures and algorithmic strategies
Effective as of Winter 2020
Related Programs
Advanced Algorithms and Data Structures Design and Analysis (COMP 8042) 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
- Applied Computer Science (Database Option)
Bachelor of Science Part-time
- Applied Computer Science (Games Development Option)
Bachelor of Science Full-time
- Applied Computer Science (Human Computer Interface Option)
Bachelor of Science Part-time
- Applied Computer Science (Network Security Administration Option)
Bachelor of Science Part-time
- Applied Computer Science (Network Security Applications Development Option)
Bachelor of Science Full-time/Part-time
- Applied Computer Science (Wireless and Mobile Applications Development Option)
Bachelor of Science Part-time
Subscribe
Interested in being notified about future offerings of Advanced Algorithms and Data Structures Design and Analysis (COMP 8042)? 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.