- decks
- flashcards
- learners
Decks in this class (8)
Lecture 1
What is a computer 1,
What is an algorithm 2,
What is a computer programming la...
5
cards
Lecture 2
What do you compare algorithms us...,
What are experimental studies 2,
Limitations of experimental studi...
6
cards
lecture 4 (Unfinished)
Why sorting 1,
What is selection sort 2,
What is a linear search 3
8
cards
Lecture 5
What is list 1,
What are the two types of lists 2,
What is an array 3
15
cards
Lecture 6
Why bother with sorting alogirthms 1,
How do u conduct bubble sort 2,
What is quick sort 3
6
cards
Lecture 7 (Unfinished)
Different types of graphs 1,
What is depth first traversal 2,
What is mst 3
3
cards
Lecture 8 (Unfinished)
What is djikitras algorithm 1
1
cards
Lecture 9
In the classes of algorithms diag...,
Define search problem 2,
What is a heuristic 3
3
cards
More about
Brunel - CS2004 (Algorithms)
- Class purpose General learning
The creator of this class did not yet add a description for what is included in this class.
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?
Brunel-Introduction to Computing
- 12 decks
- 181 flashcards
- 4 learners
Decks:
Lecture 1, Lecture 2, Lecture 4, And more!
