This class was created by Brainscape user michal wozniak. Visit their profile to learn more about the creator.
By:
michal wozniak
- decks
- flashcards
- learners
Decks in this class (43)
Lecture 1 - Time Complexity Revision
No deck description has yet been added by the author.
16
cards
Lecture 1 - ADTs
No deck description has yet been added by the author.
15
cards
Lecture 1 - Comparison Sorts
No deck description has yet been added by the author.
13
cards
Lecture 1 - Radix Sort
No deck description has yet been added by the author.
11
cards
Lecture 1 - Tries
No deck description has yet been added by the author.
5
cards
Lecture 2 - Graph Basics
No deck description has yet been added by the author.
16
cards
Lecture 2 - Graph Representations
No deck description has yet been added by the author.
5
cards
Lecture 2 - BFS and DFS
No deck description has yet been added by the author.
11
cards
Lecture 2 - Weighted Graphs
No deck description has yet been added by the author.
3
cards
Lecture 2 - Dijkstra's
No deck description has yet been added by the author.
2
cards
Lecture 3 - Graph Recap
No deck description has yet been added by the author.
6
cards
Lecture 3 - Spanning Trees
No deck description has yet been added by the author.
7
cards
Lecture 3 - Prim-Jarnik Algorithm
No deck description has yet been added by the author.
5
cards
Lecture 3 - Dijkstra's Refinement
No deck description has yet been added by the author.
3
cards
Lecture 3 - Topological Ordering
No deck description has yet been added by the author.
15
cards
Lecture 4 - Text Compression Intro
No deck description has yet been added by the author.
8
cards
Lecture 4 - Huffman Encoding
No deck description has yet been added by the author.
21
cards
Lecture 4 - LZW Compression
No deck description has yet been added by the author.
11
cards
Lecture 4 - String Difference
No deck description has yet been added by the author.
23
cards
Lecture 5 - String/Pattern Search Intro
No deck description has yet been added by the author.
3
cards
Lecture 5 - Brute Force Algorithm
No deck description has yet been added by the author.
4
cards
Lecture 5 - KMP
No deck description has yet been added by the author.
20
cards
Lecture 5 - BM
No deck description has yet been added by the author.
20
cards
Lecture 6 - NP Intro
No deck description has yet been added by the author.
16
cards
Lecture 6 - NP-Completeness
No deck description has yet been added by the author.
11
cards
Lecture 6 - Hamiltonian Cycle
No deck description has yet been added by the author.
6
cards
Lecture 6 - Travelling Salesman Problem
No deck description has yet been added by the author.
3
cards
Lecture 6 - Clique Problem
No deck description has yet been added by the author.
5
cards
Lecture 6 - Graph Colouring Problem
No deck description has yet been added by the author.
4
cards
Lecture 6 - Satisfiability Problem
No deck description has yet been added by the author.
3
cards
Lecture 6 - Classes P and NP
No deck description has yet been added by the author.
13
cards
Lecture 6 - Polynomial Time Reductions
No deck description has yet been added by the author.
6
cards
Lecture 6 - What is NP-Complete? Formally?
No deck description has yet been added by the author.
11
cards
Lecture 7 - Computability Intro
No deck description has yet been added by the author.
13
cards
Lecture 7 - Halting Problem
No deck description has yet been added by the author.
7
cards
Lecture 7 - Models Of Computation
No deck description has yet been added by the author.
5
cards
Lecture 7 - DFA
No deck description has yet been added by the author.
28
cards
Lecture 8 - Intro
No deck description has yet been added by the author.
5
cards
Lecture 8 - Pushdown Automata
No deck description has yet been added by the author.
13
cards
Lecture 8 - Turing Machines
No deck description has yet been added by the author.
18
cards
Lecture 8 - Turing Machines P and NP
No deck description has yet been added by the author.
2
cards
Lecture 8 - Counter Programs
No deck description has yet been added by the author.
3
cards
Lecture 8 - Church-Turing Thesis
No deck description has yet been added by the author.
5
cards
More about
uofg_algorithmics_1
- Class purpose General learning
Learn faster with Brainscape on your web, iPhone, or Android device. Study michal wozniak's UOFG_Algorithmics_1 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....
