Brainscape's Knowledge GenomeTM

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


See full index

Comp 2140

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

By: Adam A
Start Studying

Decks in this class (14)

Algorithms
Insertionsort how does it work wh...,
Quicksort1 how does quicksort wor...,
What is worst case running time o...
35  cards
ADTs
How do you implement a count func...,
Why use dummy nodes,
For trailer and header nodes wher...
31  cards
Tables and Hashing
What is a adt table data,
What are a tables standard operat...,
What are the posibiities for impl...
18  cards
Hash Tables Collision Resolution
What are bad examples of solving ...,
What is the difference between cl...,
What is separate chaining
10  cards
Binary Search Trees
What are the common tree features,
In this example what are descenda...,
What is an interior node
9  cards
Tree Traversals
What is the definition of a tree ...,
What are the 3 standard ways to t...,
Define a preorder traversal
20  cards
BST Insertion
What is the first step of a bst i...,
What are the two cases for bst in...,
What does root look like before a...
12  cards
BST Searching
What is the psudo code to use a b...,
What would the path be to find 68...,
What is the code to implement a b...
8  cards
BST Deletion
What is the first step when delet...,
After you have searches for the i...,
How do you delete a leaf in a bst
14  cards
BST 6 Efficiency of BST Operations
If the bst contains n nodes how m...,
In a bst how many of the items do...,
What does a worst case tree look ...
9  cards
LeafBased23Trees
What is a 2 3 tree what is its gu...,
What is the recursive definition ...,
1 is this tree a 2 3 tree shape
33  cards
Priority Queues and Heaps
What is a priority queue and what...,
What are the applications of a pr...,
How does a priority queue compare...
27  cards
Graphs
What is the definition of a graph,
What does adjacent mean in a grap...,
What is the definition of an undi...
33  cards
O Notation and Run Times
Calculate the run time of the fol...,
Calculate the run time of the fol...,
What is the known sum
3  cards

More about
Comp 2140

  • Class purpose General learning

Learn faster with Brainscape on your web, iPhone, or Android device. Study Adam A's Comp 2140 flashcards for their University of manitoba class 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?

PHA-2140 final
  • 1 decks
  • 33 flashcards
  • 5 learners
Decks: Mii, And more!
Chi Comp
  • 10 decks
  • 642 flashcards
  • 7 learners
Decks: 3rd Q 1 Meanings, 3rd Q 1 Pinyin, 3rd Q 2 Meanings, And more!
BIOL 2140 Exam 2
  • 1 decks
  • 188 flashcards
  • 2 learners
Decks: Biol 2140 Exam 2, And more!
Find Flashcards
Make Flashcards
Brainscape helps you reach your goals faster, through stronger study habits.
© 2024 Bold Learning Solutions. Terms and Conditions