Question

Can you please help with the below?

1)   Which of the following is true about using a 2-3-4 tree?
a.   It is designed to minimize node visits while keeping to an O(log n) search performance
b.   It is designed to self-balance as new values are inserted into the tree
c.   As soon as a node becomes full, it performs the split routine
d.   None of the above

2)   Which of the following is true about a binary search tree?
a.   Delete is O(log n) unless the tree is balanced
b.   Insert is O(log n) if the data set being entered contains randomly distributed values
c.   Search is O(log n) in most cases because the algorithm is similar to the binary search algorithm
d.   None of the above

3)   Which of the following sort algorithms is usually implemented using recursion?
a.   Quicksort
b.   Mergesort
c.   Bubblesort
d.   None of the above

4)   Which of the following is true about the concept of recursion?
a.   It can simplify the amount of code that is written
b.   The base case of the function is where the recursion stops
c.   Recursive functions contain code that calls at least one function of the same name
d.   None of the above

5)   Which of the following is true about using a standard simple linked list?
a.   The insert at the front of the list function performs at O(n)
b.   The append function performs at O(n)
c.   The delete function, where it must first find the given value, performs at O(n)
d.   None of the above

6)   Which of the following is a reason to implement a stack as a linked list (with only a head pointer and no tail) instead of as an array?
a.   As a linked list, the stack will only use memory when it needs to
b.   The push function as a linked list will use the append function which makes the performance O(1)
c.   Stacks are not usually designed to perform searches for a particular value or displaying the contents in a certain order. This minimizes the disadvantages when using a linked list because search and display are not as important
d.   None of the above

7)   If a priority queue is implemented as a linked list, which of the following is true?
a.   If the insert function is O(1), the remove function will be O(n)
b.   If the insert function is O(n), the remove function will be O(1)
c.   If using a linked list, using an O(n) insert minimizes the performance cost because shifting elements does not require a loop to perform
d.   None of the above

8)   Which of the following is true about the manner in which items are added and removed with stacks and queues?
a.   A stack is FIFO (First In First Out)
b.   A queue is LIFO (Last In First Out)
c.   Stacks perform push and pop at O(n)
d.   None of the above

9)   Which of the following is true about the sorting algorithms?
a.   Selection sort is preferred over Bubble sort because the number of swaps is guaranteed to be O(n)
b.   Mergesort pays a price in memory usage because a duplicate size temporary array is necessary to perform the merging and sorting
c.   Quicksort is not as fast as Bubble sort
d.   None of the above

10)   Which of the following is true about the delete function for a binary search tree?
a.   If the node to delete is a leaf, it is simply removed
b.   If the node to delete has one child, the parent node adopts the child node of the node being removed
c.   If the node to delete has 2 children, the successor node can be the node that is closest in value and greater than the node that is being removed
d.   None of the above

Answer 1

1) A 23-y In designed to Nel -balance a, new v are inaoted into the trce Opton & correet Choice ExplinauHon e balancing data stuckuore hat common ly esed dlickionaries Heye, s,y 1a numben mean 2) Bino wie search 0 (Co?") rn most we be Caum th onithm sinulan to binary parch algorithn OpHon c th Correct choice oYT e Cwrsion It a dlividu and congur algove thim an beinpurn en fed using mercy e181f 4) Recusrs ive funch'on contouin Code that calls t Corn atleast one -tunckion same nome option-c Corredt choice