CPSC 200 — Winter 2024 —
Algorithm Analysis and Development

Important information may be posted here from time to time.

2024-02-27

Howmework assignments have been updated to echo moodle.

2024-02-13

The final exam schedule has been posted. The final exam information is

DAte	Thursday, 11 April 2024
Time	09:00–12:00
Location	5-173

Sun, 2023-11-26

Web site created.

Students in this course who, because of a disability, may have a need for special academic accommodations should discuss this with the instructor, or contact the Access Resource Centre located in the Library Building in Room 5-157.

There are no assigned lab or tutorial times. Office hours have tentatively been scheduled for M   F 10:00–11:30, but may be re-arranged based on student schedules.

• Systematically code an algoritm starting from its specification.
• Estimate the aymptotic time and space complexity of simple algoritms
• experimentally verify the time complexity of algorithms
• explain the trade-offs between various classical sorting algorithms

• Course introduction, loop invariants. (1 week)
• Algorithm analysis and asymptotic complexity (2 weeks).
• Java generics, strict week order. (1 week)
• Sorting algorithms, recursive algorithms (2 weeks).
• Containers, linked lists, stacks, queues, deques and iterators (2 weeks).
• Tree classes (1 week).
• Introduction to decidability, complexity, and complexity classes (1 week).

Other dates can be found on the University web-site here.

1. I reserve the right to change the weight of any portion of this marking scheme. If changes are made, your grade will be calculated using the original weighting and the new weighting, and you will be given the higher of the two.