ITSC 2214 REALIZEIT WEEK 10 (ALL) CORRECT!!

ITSC 2214 REALIZEIT WEEK 10 (ALL)
CORRECT!!




1 of 24

Term



the following array for a minHeap, what would the array look like
after adding 9 to the heap?


{8, 10, 60, 15, 12, 75,
61}


Give this one a try later!



{8, 10, 9, 15, 12, 75, {8, 9, 60, 10, 12, 75, 61,
61} 15}

, {8, 10, 60, 15, 9, 75, 61, 12} {8, 10, 60, 9, 12, 75, 61, 15}


Don't know?




2 of 24

Term



A heap can become unbalanced if the same number is
added repeatedly.


(T/F)



Give this one a try later!



False True




O(n) In-Order


Don't know?




3 of 24

Term



The number of nodes in a perfect binary tree of height of 4
is:



Give this one a try later!

, 6 63



127 31


Don't know?




4 of 24

Term


The divide and conquer algorithm breaks down the given
problem recursively into simpler sub-problems, then puts
together the
solutions to these sub-problems.




If your neighbor Leyna wants to sort a list of integers from
largest to smallest using the divide and conquer approach,
she will first break down the list into 2 lists and break it
down further if necessary. After she sorts each list, she will
combine the sorted sublists to generate the final result.




Which sorting algorithm does this resemble?



Give this one a try later!



Bucket Sort Quick Sort