CSE 2050 EXAMSs BUNDLE WITH Questions Solved 100% Correct

Start at the beginning, sort the first 2 items in the list. Then, going through the list, add each next item into the sorted list, where it is supposed to be - Insertion sort Quick sort best case - O(nlogn) Quick sort average case - O(nlogn)

emoization - ANSWER Write the recursive function top-down. Alter the function to check if we've already calculated the value. If so, use the pre-calculated value, If not, do the recursive call. Fib - Memo - ANSWER def fib(n, fib_cache): if n in fib_cache: return fib_cache[n] fib_cache[n] = f...

Insertion Sort (O(n) - ANSWER Binary Search - Each item is taken in turn, compared to the items in a sorted list, and placed in the correct position. Merge Sort (O(n log n)) - ANSWER Divide-and-conquer paradigm - A list is split into individual lists, these are then combined (2 lists at a time). ...

Inheritance - ANSWER Is a relationship class Shape(Circle): pass class Shape is a Circle, inherits all methods from circle and is an instance of the circle class, circle is the superclass and shape is the subclass

nheritance - ANSWER Inheritance means that a class inherits the characteristics of a superclass Inheritance means "is a" unit test - ANSWER A single indivisible case that can test the individual components of a class

time complexity of downheap - ANSWER O(logn) heapify - upheap - ANSWER start with unordered heap, upheap each element until the heap is built. Built from top down time complexity of heapify with upheap - ANSWER O(nlogn)