Study Guides (258,542)
CA (124,962)
McGill (5,032)
COMP (109)
COMP 251 (7)
Study Guide

COMP 251- Final Exam Guide - Comprehensive Notes for the exam ( 196 pages long!)
Premium

196 Pages
74 Views

Department
Computer Science (Sci)
Course Code
COMP 251
Professor
Adrian R Vetta

This preview shows pages 1-4. Sign up to view the full 196 pages of the document.
Page: of

Loved by over 2.2 million students

Over 90% improved by at least one letter grade.

Leah — University of Toronto

OneClass has been such a huge help in my studies at UofT especially since I am a transfer student. OneClass is the study buddy I never had before and definitely gives me the extra push to get from a B to an A!

Leah — University of Toronto
Saarim — University of Michigan

Balancing social life With academics can be difficult, that is why I'm so glad that OneClass is out there where I can find the top notes for all of my classes. Now I can be the all-star student I want to be.

Saarim — University of Michigan
Jenna — University of Wisconsin

As a college student living on a college budget, I love how easy it is to earn gift cards just by submitting my notes.

Jenna — University of Wisconsin
Anne — University of California

OneClass has allowed me to catch up with my most difficult course! #lifesaver

Anne — University of California
Description
[COMP 251] Comprehensive Winter guide including any lecture notes, textbook notes and exam guides.COMP 251 Course Overview Created by: Daniil Lisus Table of Contents Algorithm Analysis ................................................................................................................3 Time Complexity Notations + Examples..........................................................................................3 Graphs ..................................................................................................................................4 Adjacency Matrix Representation...................................................................................................4 Adjacency List Representation........................................................................................................4 Breadth First Search Traversal........................................................................................................4 Breadth First Search Traversal........................................................................................................4 Testing Bipartiteness......................................................................................................................5 Strongly Connected Graphs............................................................................................................5 Directed Acyclic Graphs + Topological Order...................................................................................5 Greedy Algorithms ................................................................................................................6 Interval Scheduling ........................................................................................................................6 Interval Partitioning.......................................................................................................................6 Scheduling to Minimize Lateness....................................................................................................6 Optimal Caching.............................................................................................................................6 Dijkstra’s Algorithm.......................................................................................................................7 Minimum Spanning Trees......................................................................................................7 Kruskal Algorithm..........................................................................................................................7 Reverse Deletion Algorithm ...........................................................................................................7 Pri▯’s Algorith▯............................................................................................................................7 Cut Property..................................................................................................................................7 Cycle Property ...............................................................................................................................8 Clustering Problem ........................................................................................................................8 Huffman Coding ....................................................................................................................8 Simple...........................................................................................................................................8 Prefix Codes as Binary Trees...........................................................................................................8 Divide and Conquer...............................................................................................................9 Masters Theorem...........................................................................................................................9 Mergesort......................................................................................................................................9 Counting Inversions .......................................................................................................................9 Closest Pair of Points......................................................................................................................9 Integer Multiplication: Recursive..................................................................................................10 I▯teger Multipli▯atio▯: Karatsu▯a’s Algorith▯...............................................................................10 Matrix Multiplication: Simple Algorithm.......................................................................................11 Matrix Multiplication: Divide and Conquer Slow...........................................................................11 Matrix Multiplication: Strassen Algorithm ....................................................................................11 Dynamic Programming........................................................................................................ 12 Weighted Interval Scheduling.......................................................................................................12 Knapsack Problem .......................................................................................................................12 RNA Secondary Structure.............................................................................................................13
More Less
Unlock Document
Subscribers Only


Only pages 1-4 are available for preview. Some parts have been intentionally blurred.

Unlock Document
Subscribers Only
You're Reading a Preview

Unlock to view full version

Unlock Document
Subscribers Only

Log In


OR

Don't have an account?

Join OneClass

Access over 10 million pages of study
documents for 1.3 million courses.

Sign up

Join to view


OR

By registering, I agree to the Terms and Privacy Policies
Already have an account?
Just a few more details

So we can recommend you notes for your school.

Reset Password

Please enter below the email address you registered with and we will send you a link to reset your password.

Add your courses

Get notes from the top students in your class.


Submit