This class was created by Brainscape user Abdul Basit. Visit their profile to learn more about the creator.
By:
Abdul Basit
- decks
- flashcards
- learners
Decks in this class (40)
Chapter 1
Where the word algorithm come from,
What is algorithm,
Computer sciences mainly focus on...
7
cards
Chapter 2
What is the difference between se...,
What are basic ram operations,
What is maximal point
3
cards
Chapter 3
What are 2 analysis forms,
What is run time analysis,
What is talk time of cpu
9
cards
Chapter 4
Does the analysis of algorithm gi...,
What is polynomial algorithm,
What is exponential algorithm
6
cards
Chapter 5
What is the problem with brute fo...,
What are best sorting algorithms
2
cards
Chapter 6
What is asymptotic notation,
What is lower bound of asymptotic...,
What is upper bound of asymptotic...
3
cards
Chapter 7
Does f n en square,
What is definition of o notation ...,
What is o notation
8
cards
Chapter 8
Is merge sort recursive algorithm,
What is recurrence relation,
T n n
5
cards
Chapter 9
What are medians
1
cards
Chapter 10
What is sieve technique
1
cards
Chapter 11
What q n time algorithm do,
Array of objects sort on which at...,
What are slow o n2 sorting algori...
16
cards
Chapter 12
What procedure is used to root to...,
What is the total time for heapify,
What will happen if we call heapi...
5
cards
Chapter 13
What is the fastest sorting algor...,
What strategy quicksort follows,
What is the worst case time for q...
3
cards
Chapter 14
What is worst case of quick sort,
What is average case of quick sort,
What is induction hypothesis
12
cards
Chapter 15
What is stable sorting,
Does bubble sort selection sort a...,
Which sorting algorithm is stable...
14
cards
Chapter 16
Can counting sort use radix sort,
What is bucket sort algorithm,
What is radix sort algorithm
7
cards
Chapter 17
What algorithm is used by fibonac...,
What are 2 steps for dynamic prog...,
Does factorial have recursive fou...
6
cards
Chapter 18
What is edit transcript,
What happen in edit transcript of...,
What happen in edit transcript of...
4
cards
Chapter 19
What is chain matrix multiplication,
How much entries in matrix,
Each entry takes how much time in...
8
cards
Chapter 20
What is optimum time to compute a...
1
cards
Chapter 21
What is knapsack problem,
What is 0 1 problem
2
cards
Chapter 22
What approach used to deal with k...
1
cards
Chapter 23
Where greedy algorithm used,
Does greedy algorithm use recursion,
What is backtrack search
11
cards
Chapter 24
What happens inside huffman encoding,
Does graph have more than one pat...,
Does huffman encoding creates opt...
4
cards
Chapter 25
Does the binary tree constructed ...,
What is the first step of huffman...,
What is activity selection
4
cards
Chapter 26
What is the complexity of greedy ...,
Do we care about global in optima...,
What is induction
3
cards
Chapter 27
What is fractional knapsack problem,
What is knapsack problem,
Can we solve fractional knapsack ...
16
cards
Chapter 28
What is the formula of digraph an...,
What is path in graph,
What is the length of path
13
cards
Chapter 29
What is path finding algorithm,
What is fully connected graph,
What is breadth first search
9
cards
Chapter 30
What is the difference between st...,
What is total time of depth first...,
What is the time of finding all n...
4
cards
Chapter 31
Can we solve mazes using depth fi...,
What is dfs timestamp structure,
What we called to multiple trees
6
cards
Chapter 32
How we get a cycle in graph,
What is precedence constraint graph,
What is topological order
4
cards
Chapter 33
What is strong component,
What is component dag,
What is mutual reachability
15
cards
Chapter 34
Does a free tree with n vertices ...
1
cards
Chapter 35
0
cards
Chapter 36
Union find data structure support...,
How union find data structure works,
What is overall time of kruskal
3
cards
Chapter 37
What is un weighted graph,
What is dijkstra s algorithm,
What is relaxation
3
cards
Chapter 38
0
cards
Chapter 39
0
cards
Chapter 40
How we can prove the correctness ...,
What is bellman ford algorithm,
Does bellman ford based on relaxa...
3
cards
More about
Fundamentals of Algorithms - CS502
- Class purpose General learning
Learn faster with Brainscape on your web, iPhone, or Android device. Study Abdul Basit's Fundamentals of Algorithms - CS502 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.
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
- 127 learners
Decks:
Python Built In Data Structures, Python User Defined Data Structures, Python List Methods, And more!
