Welcome to COMP 250! This on-demand course was put together especially for COMP 250 at McGill. Use the video lessons and notes to understand your lecture topics better, and the practice questions to cement your knowledge. And don't hesitate to leave a question in the Q&A box under each lesson if you need additional help with anything. Happy studying!
COMP 250
McGill
Course Overview
Lessons & Practice
1. Important Exam Information
2min2. Linear Data Structures
36min3. Recursion
26min4. Non-linear Data Structures
1.1hr4.3.1. Binary Trees: Explained4.3.2. Tree Traversal: Breadth-First Search or BFS4.3.3. Tree Traversal: Breadth-First Search or BFS (Similar to Fall 2015 final exam question #5)4.3.4. Tree Traversal: Depth-First Search or DFS (Pre-Order Traversal)4.3.5. Tree Traversal: DFS (Pre-Order Traversal) (Similar to Fall 2012 final exam question #5)4.3.6. Tree Traversal: Depth-First Search or DFS (In-Order Traversal)4.3.7. Tree Traversal: DFS (In-Order Traversal) (Similar to Fall 2015 final exam question #5)4.3.8. Tree Traversal: Depth-First Search or DFS (Post-Order Traversal)4.3.9. Tree Traversal: DFS (Post-Order Traversal) (Similar to Fall 2015 final exam question #5)
5. Mathematical Tools for Analysis of Algorithms
6min6. Object Oriented Design in Java
15minMock Exam
COMP 250 Overview
0:00 / 0:00
Get Started
Up Next
Course Notes
Wizeprep's course notes with hundreds of easy-to-understand explanations, diagrams, and practice problems.
Mock Exams
On-Demand Mock Exams
A realistic, online mock exam based on past exams from your course. Includes detailed step-by-step solutions from our expert instructors.
On-Demand Exam Detailed Solutions
Mock Exam
19 Questions, ~46 minutes
Course Notes
Wizeprep's course notes with hundreds of easy-to-understand explanations, diagrams, and practice problems.