COMP 2002: Data Structures and Algorithms
This course is required for all computer science MAJ majors.
|Lab||In addition to classes, this course has one structured laboratory session per week.|
Availability: This course is usually in Fall and Winter semesters.
The objective of this course is to teach problem solving techniques via fundamental algorithms and data structures, basic design techniques and analysis. The course will be taught primarily in a language-neutral manner, with material presented mainly in pseudocode; however, it will incorporate a significant programming (implementation) component through its assignments and labs.
- Assignments 30%
- Lab Quizzes 15%
- Tests 20%
- Final Exam 35%
Representative Course Outline
- Algorithm analysis (5 hours)
- Algorithm design techniques (5 hours):
- dynamic programming
- Data structures (6 hours):
- binary search trees
- hash tables
- Fundamental algorithms (12 hours):
- shortest path
- Credit cannot be obtained for both Computer Science 2002 and the former Computer Science 2711.
- This course requires programming in Python.
Page last updated May 24th 2021