This class was created by Brainscape user Aiden Dawes. Visit their profile to learn more about the creator.
By:
Aiden Dawes
- decks
- flashcards
- learners
Decks in this class (38)
1.1-2 Proof by induction recap
No deck description has yet been added by the author.
3
cards
1.3 Defining O-notation
No deck description has yet been added by the author.
13
cards
1.4 Properties of O-notation
No deck description has yet been added by the author.
7
cards
2.1 Greedy Algorithms
No deck description has yet been added by the author.
4
cards
2.2 Interval correctness proof
No deck description has yet been added by the author.
10
cards
2.3 The Bridges of K¨onigsberg
No deck description has yet been added by the author.
9
cards
2.4 When does a graph have a euler walk
No deck description has yet been added by the author.
4
cards
3.1 Directed Euler Walks
No deck description has yet been added by the author.
8
cards
3.2 Hamilton Cycles
No deck description has yet been added by the author.
4
cards
3.3 Shaking Hands
No deck description has yet been added by the author.
7
cards
3.4 Trees
No deck description has yet been added by the author.
9
cards
4.1 Graph representations
No deck description has yet been added by the author.
8
cards
4.2 Depth first search
No deck description has yet been added by the author.
7
cards
4.3 Breadth first search
No deck description has yet been added by the author.
6
cards
4.4 Dijkstra’s algorithm
No deck description has yet been added by the author.
8
cards
5.1 Matchings Definitions
No deck description has yet been added by the author.
3
cards
5.2 Finding maximum matchings
No deck description has yet been added by the author.
7
cards
5.3 Prims Algorithm
No deck description has yet been added by the author.
7
cards
5.4 Kruskal's algorithm
No deck description has yet been added by the author.
4
cards
6.1 Making Kruskal's fast
No deck description has yet been added by the author.
1
cards
6.2 The union-find data structure
No deck description has yet been added by the author.
9
cards
6.3 2-3-4 Trees I
No deck description has yet been added by the author.
4
cards
6.4 2-3-4 Trees II
No deck description has yet been added by the author.
3
cards
7.1 Linear Programming
No deck description has yet been added by the author.
7
cards
7.2 How to solve linear programs
No deck description has yet been added by the author.
7
cards
7.3 Flow Networks
No deck description has yet been added by the author.
8
cards
7.4 The Ford-Fulkerson algorithm
No deck description has yet been added by the author.
8
cards
8.1 Why the Ford-Fulkerson algorithm looks so familiar
No deck description has yet been added by the author.
3
cards
8.2 Applications of Ford-Fulkerson
No deck description has yet been added by the author.
5
cards
8.3 SAT and NP
No deck description has yet been added by the author.
9
cards
8.4 NP-completeness and 3-SAT
No deck description has yet been added by the author.
2
cards
9.1 Independent sets and vertex covers
No deck description has yet been added by the author.
5
cards
9.3 NP vs Co-NP
No deck description has yet been added by the author.
7
cards
9.4 Dealing with NP-hard problems
No deck description has yet been added by the author.
8
cards
10.1 Weighted Interval Scheduling
No deck description has yet been added by the author.
4
cards
10.2 Dynamic Programming
No deck description has yet been added by the author.
4
cards
10.3 The Bellman-Ford Algorithm
No deck description has yet been added by the author.
6
cards
10.4 The Real Bellman-Ford algorithm
No deck description has yet been added by the author.
4
cards
More about
algorithms ii
- Class purpose General learning
Learn faster with Brainscape on your web, iPhone, or Android device. Study Aiden Dawes's Algorithms II flashcards for their AISJ class now!
How studying works.
Brainscape's adaptive web mobile flashcards system will drill you on your weaknesses, using a pattern guaranteed to help you learn more in less time.
Add your own flashcards.
Either request "Edit" access from the author, or make a copy of the class to edit as your own. And you can always create a totally new class of your own too!
What's Brainscape anyway?
Brainscape is a digital flashcards platform where you can find, create, share, and study any subject on the planet.
We use an adaptive study algorithm that is proven to help you learn faster and remember longer....
Looking for something else?
Python Data Structures & Algorithms
- 13 decks
- 342 flashcards
- 106 learners
Decks:
Python Built In Data Structures, Python User Defined Data Structures, Python List Methods, And more!
Algorithms
- 10 decks
- 340 flashcards
- 3 learners
Decks:
Graphs, Sorting, Design Analysis Implementation, And more!
