CSE 2050 EXAMSs BUNDLE WITH Questions Solved 100% Correct

inary Search Running Times - ANSWER Best: O(1) Worst O(logn) Average O(logn) Bubble Sort running Times - ANSWER Best O(n) Worst O(n^2) Average O(n^2)

sorted() - ANSWER sorts and returns sorted list lexicographic - ANSWER if the key function returns a tuple, it will sort by the first element and break ties with subsequent elements ex: alphabetical order

Which of the following operations have a worst case asymptotic running time of O(logn) (no better, no worse) in a heap? - ANSWER insert, remove min, upheap, downheap Consider an undirected, unweighted graph. We want to visit all the vertices connected to a given start vertex, by order of non-decr...

Quadratic Sorting: Best at random distribution - ANSWER selection Quadratic Sorting: Worst at random distribution - ANSWER bubble Quadratic Sorting: Best at one big item at front - ANSWER bubble Quadratic Sorting: Worst at one big item at front - ANSWER selection

what is a potential drawback of using recursion without memoization for solving certain problems? - ANSWER it may involve redundant calculations and increased running time true or false: iterative solutions tend to use less memory compared to recursive solutions - ANSWER true true or false: gree...

Benefit of Using Selection Sort - ANSWER It only makes one swap per element (O(n)), which can reduce memory cost Best and Worst Case for Insertion Sort - ANSWER Best Case: only one object out of place O(n) swap Worst Case: reversed sorted (O(n^2))

We want to heapify an unordered collection in O(n).Which of the following method(s) is most likely to be useful? a. we can achieve this using upheap or downheap b. using upheap (but not downheap) c. using downheap (but not upheap) d. repeatedly calling put - ANSWER c. using downheap (but not up...