Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.


See full index

Algorithms

This class was created by Brainscape user Rasmus Johansson. Visit their profile to learn more about the creator.

By: Rasmus Johansson
Start Studying

Decks in this class (19)

Chaper 2 Basics of Algorithm Analysis
What two things does analysing an...,
How do you normally express resou...,
What is meant by a problem being ...
6  cards
6 Dynamic Programming
What is dynamic programming,
What programming technique is pre...,
When should you use dynamic progr...
5  cards
6.1 Weighted Interval Scheduling
What is the weighted interval sch...,
What is the function p i in the i...,
What is the opt function in the w...
8  cards
Skyline Problem
What is meant by the skyline problem,
What points are you interested in...,
Given n buildings what is the run...
4  cards
LN1 Algorithms in General and Time Complexity
What is an algorithm in the conte...,
Define the terms problem and inst...,
Why is an algorithm not the same ...
38  cards
LN2 Interval Scheduling and Greedy alg
What is the naive algorithm for t...,
What is a more efficient approach...,
Why is selecting the interval wit...
38  cards
Exam points
What is the time complexity of bf...,
What are the key steps in formula...,
What properties must a problem ha...
21  cards
Exam Questions
How can array top be found an ele...,
How can you show that a problem i...,
How can you prove that a dynamic ...
4  cards
LN3 Dynamic programming and WIS
Why does the earliest end first e...,
What is the key challenge in solv...,
What observation allows us to lim...
26  cards
LN4 Dynamic programming problems:
Subset Sum, Knapsack, Sequence Alignment
18  cards
LN5 Divide-and conquer
What is the goal of the sequence ...,
Define opt i j in the context of ...,
What are the three cases for defi...
24  cards
LN6 Problems
Median finding, Sorting
20  cards
LN7 Master Theorem, Counting Inversions, Fast Multiplication
What is the goal of the counting ...,
What is the naive solution for co...,
What is the main idea behind usin...
9  cards
LN8 Closest points
What is a problem reduction in th...,
Give an example of a reduction be...,
What are the two main purposes of...
22  cards
LN9 Graphs, Coloring and Bipartiteness
What is the first known np comple...,
Explain the difference between p ...,
What is cook s theorem and why is...
15  cards
LN10 Minimum Spanning Tree, Directed cycles and Topological Order
What is the goal of graph travers...,
What is the breadth first search ...,
How does bfs determine shortest p...
15  cards
LN11 Polynomial-time reductions
P, NP, NP-completeness, Satisfiability problem
15  cards
LN12 NP-complete problems
How can the shortest paths in a d...,
Why can we apply the same algorit...,
What is the union find data struc...
15  cards
LN13 Space-efficient sequence alignment, Union-and-Find
What is the space efficient metho...,
How does divide and conquer help ...,
What is the time complexity of th...
10  cards

More about
Algorithms

  • Class purpose General learning

Learn faster with Brainscape on your web, iPhone, or Android device. Study Rasmus Johansson's Algorithms flashcards 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.

Learn more about spaced repetition

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?

Algorithms
  • 17 decks
  • 374 flashcards
  • 176 learners
Decks: Two Sum, Sql Orm, Javascript, And more!
Find Flashcards
Make Flashcards
Brainscape helps you reach your goals faster, through stronger study habits.
© 2024 Bold Learning Solutions. Terms and Conditions