1 / 27

# Summer Final Solutions to last three problems - PowerPoint PPT Presentation

Summer Final Solutions to last three problems. Bryce Boe CS24 , Fall 2013. Problem 11. Draw the contents of the array that represents the following max-heap after calling dequeue 3 times. The following are the initial contents of the array. 60 40 10 25 0 3 1 4. Problem 11: Suggestions.

I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.

## PowerPoint Slideshow about ' Summer Final Solutions to last three problems' - fell

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript

### Summer FinalSolutions to last three problems

Bryce Boe

CS24, Fall 2013

Draw the contents of the array that represents the following max-heap after calling dequeue 3 times. The following are the initial contents of the array.

60 40 10 25 0 3 1 4

• Convert the array into a tree representation

• No required, but makes it more likely for you to receive partial credit if you make a mistake

• Show the resulting tree after each removal

• Convert the final tree back into the array form

Draw the contents of a hash table of size 8 with a linear probing constant of 3 after inserting the following items. Hash function: h(x) = x % 8

7 2 15 5 12 4

• Again it might be useful to show the complete contents after each insertion in the event you make a mistake.

(2) Second position occupied, try again

(1) Initial position occupied, try again

(1) Initial position occupied, try again

(3) Third position occupied, try again

(1) Initial position occupied, try again

(2) Second position occupied, try again

(5) Fifth position occupied, try again

(4) Fourth position occupied, try again

Assume we have a poorly implemented hash table of size 8 with a linear probing constant of 1 that does not properly record deletions. Beginning with the following filled hash table, which elements (numbers) are no longer accessible after removing both 10 and 14? Hash function: h(x) = x % 8

• Remove elements 10 and 14

• For each element test if it’s reachable

(1) 8 % 8 == 0

PASS

(2) (7 + 1) % 8 == 0

occupied -- next

7 % 8 == 7

occupied -- next

(3) (0 + 1) % 8 == 1

PASS

(1) 1 % 8 == 1

occupied -- next

(2) (1 + 1) % 8 == 2

unoccupied -- FAIL

(1) 12 % 8 == 4

PASS

(1) 2 % 8 == 2

unoccupied -- FAIL

(1) 6 % 8 == 6

unoccupied -- FAIL

• Items 1, 2, and 6 are no longer reachble