This class was created by Brainscape user GABRIEL AARON CARREON.
By:
GABRIEL AARON CARREON
- decks
- flashcards
- learners
Decks in this class (22)
Stacks
Which structure allows you to rev...,
What happens when you push to a f...,
Which of the following is not a v...
35
cards
Queues
What condition indicates an empty...,
Which queue type is best suited f...,
What happens when a dequeue opera...
59
cards
Linked List
What does the following java code...,
What value does next hold in the ...,
Why is insertion at the head more...
40
cards
Big-O Notation
What is a major drawback of the e...,
According to the provided resourc...,
The theoretical method measures a...
8
cards
DSA EXAM
Write a java line of code that in...,
What will be the output of the re...,
What is an advantage of the linea...
40
cards
Trees
A tree is defined as a ______ 1,
In a rooted tree the number of ch...,
Which traversal visits nodes in t...
60
cards
SW10: Trees
An in order traversal of the expr...,
A collection of disconnected tree...,
The degree of a tree is defined by 3
84
cards
SW11: Binary Search Tree - BST
What is the key feature that dist...,
What is the space complexity of a...,
How does a findmin or minvaluenod...
18
cards
SW12: AVL Trees
Type or false the height of a nod...,
Type or false the worst case time...,
Type or false an avl tree s balan...
27
cards
SW13: AVL Insertion and Deletion
Type or false an rl imbalance cas...,
Multiple choice in the deletion v...,
True or false inserting the value...
20
cards
SW14: B-Trees
1 a leaf node is full with keys 1...,
2 if a b tree node contains the k...,
3 what is the primary performance...
20
cards
SW15: Heaps
True or false heap sort is an in ...,
When building a heap from an arra...,
In a 0 indexed array of length l ...
22
cards
SW16: Graph Terminologies & Fundamentals
Fill in the blanks in a connected...,
What is the maximum number of edg...,
Fill in the blanks _____ is the r...
23
cards
SW17: Graph Representations
True or false adjacency lists are...,
What is the time complexity to ch...,
True or false an adjacency matrix...
20
cards
SW18: Graph Traversals (BFS & DFS)
What is the time complexity of bf...,
Fill in the blanks an edge connec...,
Fill in the blanks a programming ...
20
cards
SW19: Shortest Paths (Dijkstra's Algorithm)
Fill in the blanks dijkstra s alg...,
Dijkstra s algorithm follows whic...,
What is the standard time complex...
20
cards
SW20: Minimum Spanning Trees (Prim's & Kruskal's)
Fill in the blanks both prim s an...,
In kruskal s algorithm what data ...,
True or false prim s algorithm st...
20
cards
SW21: Introduction to Hash Tables & Addressing
Fill in the blanks in _____ addre...,
Fill in the blanks if a hash tabl...,
True or false high load factors g...
20
cards
SW22: Hashing Functions
Fill in the blanks _____ changes ...,
Fill in the blanks _____ uses the...,
Fill in the blanks _____ adds sec...
20
cards
SW23: Collision Resolution (Open Addressing)
True or false double hashing elim...,
Fill in the blanks in double hash...,
True or false open addressing sto...
20
cards
SW24: Collision Resolution (Separate Chaining)
Fill in the blanks for separate c...,
True or false if the linked lists...,
True or false in separate chainin...
20
cards
SW25: Performance & Advanced Hashing
True or false a low load factor g...,
Fill in the blanks with h k k 7 a...,
Fill in the blanks the worst case...
20
cards
More about
DSA
- Full test name Unspecified
- Test acronym 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?
DEN1DSA
- 16 decks
- 783 flashcards
- 37 learners
Decks:
Hierarchy Of Structure, Organ Systems, Molecules Cells Cavities, And more!
CS2210: DSA
- 16 decks
- 217 flashcards
- 45 learners
Decks:
Week 1 Search Problem Linear Search Bina, Week 2 Analysis Of Algorithms, Week 2 Recursive Algorithm Time Complexi, And more!
DSA
- 3 decks
- 43 flashcards
- 9 learners
Decks:
Quiz 1 Prelim Exam, Quiz 2 Prelim Exam, Types Of Data Structure, And more!
