Station 1 Match the letter with corresponding structure. Slide1.JPG

Write three sentences to talk to your ‘past self’ and tell them about their life in the future á / é / í / ó / ú 

The exam is 110 minutes. You will have an additional 15 minutes to print (if available), scan, and upload. If you submit after the allotted time, your exam will be considered late and may incur a late penalty.  After you complete your exam, scan your solutions into one .pdf file. Please upload your completed exam file by clicking on the “Add File” button underneath Question 1’s blank answer field. MASC504 EXAM 2 RULES: Closed book, closed notes (cheat sheet not allowed)Scientific calculators allowed If your exam utilizes Gradescope’s Student App, Do NOT upload to Gradescope. You will only upload your scanned exam file to this D2L quiz.

One significant advantage of Heap-Sort over Merge-Sort is its space efficiency. What is the auxiliary (extra) space complexity of an in-place Heap-Sort?

In the context of Open Addressing, what is “Primary Clustering” and which collision resolution strategy suffers most from it?

A complete hash function typically consists of two steps. What are they?

The load factor (α) of a hash table is defined as α = n / N. What do n and N represent, and why is this metric critical?

What sorting algorithm is represented by the following Java code snippet? // Assume n = S.length for (int i = 1; i < n; i++) { K cur = S; int j = i - 1; // Move elements of S, that are // greater than cur, to one position ahead while (j >= 0 && comp.compare(S, cur) > 0) { S = S; j–; } S = cur; }

Which data structure is typically used to store collisions in a “Separate Chaining” hash table?

What is the bworst-case/b time complexity of Bubble Sort?