Reading...
Play button
Play button
Use LEFT and RIGHT arrow keys to navigate between flashcards;
Use UP and DOWN arrow keys to flip the card;
H to show hint;
A reads text to speech;
11 Cards in this Set
- Front
- Back
|
Difference between binary TREE and binary SEARCH
|
TREE is data structure
SEARCH is algorithm |
|
|
log function
|
Defines the exponent required to power the base to get the input number.
log2(8)=3 log2(16)=4 log10(1000)=3 |
|
|
Binary search
|
Allows us to search a ordered array.
Start at 50%... check... then go to 25% or 75%... etc |
|
|
What is a heterogeneous linked list
|
linked list contains different data types in its nodes , typically joined by a void pointer
|
|
|
Priority queue
|
A collection where each element has a priority. The element with highest priority is typically popped first.
|
|
|
What is the data structures used to perform recursion?
|
Stack.
|
|
|
In tree construction which is the suitable efficient data structure?
|
Linked list
|
|
|
Types of sorting algorithms
|
Bubble
Modified Bubble Selection Insertion Heap Merge Quicksort |
|
|
Bubble sort
|
Loop and swap, repeat until no more swaps are detected
|
|
|
Insertion sort
|
Needs a secondary list supporting inserting
for each item insert into the correct location of secondary list |
|
|
Selection sort
|
Search the smallest item in list,
Put a index 0, Search again Put at index 1 etc |
