Maker LogoSuper Survey Maker
Survey MakerSurvey TemplatesContactPrivacy & Security

CS STUDY

The following figure shows the merge sort tree for sorting 8 elements. When sorting n elements, the asymptotically tight bound for the height of the merge sort tree is _____
O(logn)
O(nlogn)
O(n)
O(n^2)
All operations of binary search tree starts at the _____
Internal nodes
Leaves
Root
Sibling
Although not getting into the details, we have mentioned in the class several balanced trees, which of the following are not one of them?
AVL trees
2-4 trees
Binary search trees
Red-black trees
The insertion of an element into a binary search tree starts with an _____
Deletion in the tree
Search in the tree
Addition of a second root
Restructure of the tree
A heap storing n elements has a height of ______
1
[logn]
N-1
N
The ____ sort algorithm cannot be easily implemented as an in-place sorting algorithm
Merge
Insertion
Heap
Quick
The _____ traversal of a binary search tree renders all elements in sorted order of the keys
Eulur-order
Pre-order
Post-order
In-order
A divide - and - conquer algorithm is always a ____ algorithm.
Mathematical
Recursive
Tree
Sorting
Worst case performance of the quick sort algorithm happens _________.
Only when the pivot is always either the minimum or maximum value in the sequence to be sorted.
Only when the pivot is always the average of all the values in the sequence to be sorted.
Only when the pivot is always the minimum value in the sequence to be sorted.
Only when the pivot is always the maximum value in the sequence to be sorted.
Because of the ______, the element with the smallest key can always be found at the root of a minHeap.
Both heap order and complete binary tree properties
Complete binary tree property
Either heap order or complete binary tree property
Heap order property
Both the merge sort and quick sort are _______ algorithms.
Parallel
Mathematical
Sequential
Divide-and-conquer
The best asymptotically tight bound for insertion sort is _________
O(n^2)
O(logn)
O(nlogn)
O(n)
In general, hash functions consist of two components, they are ______
Hash codes and compression functions
Comparison and calculation functions
Mapping and unmapping functions
Conversion and reduction functions
Because of the _____, a heap can be efficiently represented by an array-based sequence
Complete binary tree property
Either heap order or complete binary tree property
Heap order property
Both heap order and complete binary tree properties
There are three steps in divide-and-conquer algorithms. They are:
Combine, divide, and conquer
Conquer, combine, and divide
Divide, combine, and conquer
Divide, conquer, and combine
Which of the following implementation of hash table allows a load factor greater than 1
Double hashing
Drop lists
Seperate chaining
Linear probing
If we use a heap to implement the priority queue ADT and use the priority queue to implement the priority queue sort algorithm, then the resulting algorithm is _______ sort.
Heap
Selection
Insertion
Quick
The asymptotically tight bound for worse case performance in comparison based sorting algorithms cannot be better than ______
O(n^2)
O(logn)
O(nlogn)
O(n)
{"name":"CS STUDY", "url":"https://www.quiz-maker.com/QPREVIEW","txt":"The following figure shows the merge sort tree for sorting 8 elements. When sorting n elements, the asymptotically tight bound for the height of the merge sort tree is _____, All operations of binary search tree starts at the _____, Although not getting into the details, we have mentioned in the class several balanced trees, which of the following are not one of them?","img":"https://www.quiz-maker.com/3012/images/ogquiz.png"}

More Surveys

Rave survey
1260
Water-Based Dispersions
320
How Good was I?
1050
Desk Jobs & Diabetes Pre-survey
20100
Greetings! We are graduating students from University of the East-Caloocan in the strand of Accountancy, Business and Management (ABM). We are currently conducting a marketing research for our business plan. Our business plans to offer and serve mango graham pie as our product and this survey will help us determine whether our product will be patronized. We would like to appreciate your assistance and cooperation in this study. Thank you very much!
1366
Visual Novel Game Survey
9444
Halloween 2021 Heathrow/Windsor Marriott
100
Sociological perspectives
3230
Make your own Survey
- it's free to start.
Super Survey Logo
Powered by
Super Survey Maker | Super Templates Make your own Survey