This class was created by Brainscape user Luke Nelissen.

By:

Decks in this class (14)

Sorting
What is the worst case and best c...,
What is the best and worst case o...,
What is the best and worst case o...
17  cards
Searching
How many compares are used for se...,
How many compares to insert into ...,
How many compares does a search h...
28  cards
Binary Search Trees
What is the time for operations o...,
What is the operation for floor a...,
How does selection work in a bst 3
7  cards
2-3 Search Tree
What is a 2 3 search tree 1,
What are the amount of compares f...,
How do we search a 2 3 tree 3
5  cards
Red-black BST'
What is a rb tree 1,
What are the red and black links ...,
What is left and right rotation 3
9  cards
Hash Map
What are the 3 requirements for a...,
Why should array size m be prime 2,
How do we hash integers floating ...
14  cards
Introduction to Graphs
What are the conditions for a tree 1,
When is a graph sparse dense 2,
What is the space time of kruskal...
3  cards
Undirected Graphs
What is the input format used for...,
What are the two basic requiremen...,
What are the 3 data structures we...
11  cards
Directed Graphs
What is a directed cycle and a si...,
What is the adjacency list repres...,
What is the difference between th...
17  cards
Minimum spanning trees
What are the assumptions for msts 1,
What is the cut property 2,
What is a crossing edge of a cut 3
12  cards
Shortest Paths
What is a shortest path 1,
What is a shortest path tree spt 2,
What are the properties of shorte...
20  cards
String Sorts
How does key index counting work 1,
How does lsd string sort work 2,
How does msd work 3
5  cards
Substring search
What is the brute force approach ...,
What is the alternative brute for...,
What is the worst case for brute ...
7  cards
RE
Blank 1,
Blank 2
2  cards

More about
Computer Science 214

  • School Unspecified
  • Program type Unspecified
  • Course Unspecified
  • Instructor Unspecified
  • Standards Unspecified

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?

Computer Science
  • 26 decks
  • 668 flashcards
  • 231 learners
Decks: 111 Structure And Function Of The Proces, 112 Types Of Processor, 113 Input Output And Storage, And more!
Computers
  • 76 decks
  • 1935 flashcards
  • 105 learners
Decks: Glossary, Final Cut Pro X Shortcuts 2, Final Cut Pro X, And more!