Reference no: EM13968376
The 2-d heap is a data structure that allows each item to have two individual keys. deleteMin can be performed with respect to either of these keys. The 2-d heap is a complete binary tree with the following order property: For any node X at even depth, the item stored at X has the smallest key #1 in its subtree, while for any node X at odd depth, the item stored at X has the smallest key #2 in its subtree.
a. Draw a possible 2-d heap for the items (1,10), (2,9), (3,8), (4,7), (5,6).
b. How do we ?nd the item with minimum key #1?
c. How do we ?nd the item with minimum key #2?
d. Give an algorithm to insert a new item into the 2-d heap.
e. Give an algorithm to perform deleteMin with respect to either key.
f. Give an algorithm to perform buildHeap in linear time.
What the treatment is and how it is believed to help people
: For this assignment, locate a credible source of your own about a current or recent advancement in the treatment of a mental disorder. In 1-2 pages, explain what the treatment is and how it is believed to help people who have been diagnosed with t..
|
Implement the pairing heap
: 1. Use a k-d tree to implement deleteMin. What would you expect the average running time to be for a random tree? 2. Use a k-d heap to implement a double-ended queue that also supports deleteMin.
|
Implement a double-ended priority queue
: 1. Generalize the preceding exercise to obtain a k-d heap, in which each item can have k individual keys. You should be able to obtain the following bounds: insert in O(log N), deleteMin in O(2k log N), and buildHeap in O(kN). 2. Show that the k-d he..
|
Discuss any dual diagnosis issues
: Discuss any dual diagnosis issues that are likely with this diagnosis. (Please include at least one source external to the text, to support your conclusions regarding possible dual diagnosis)
|
Give an algorithm to perform deletemin
: Give an algorithm to insert a new item into the 2-d heap. Give an algorithm to perform deleteMin with respect to either key. Give an algorithm to perform buildHeap in linear time.
|
Find diffusion coefficient water at thermal neutron energy
: Calculate the diffusion coefficient (D) of (light) water at thermal neutron energy (i.e., 0.025eV). Present your answer in cm.
|
Write a paper on afganistan on political stance information
: Write a 4 page paper not counting title or refrence page in apa format on afganistan on the political stance information on military the economy social terrain features physical enviroment.
|
Describe the key components to the mental status exam
: Describe the key components to the Mental Status Exam (MSE). How do the results of an MSE apply to diagnosis and treatment planning
|
Implement the insertion and range
: 1. Suppose we call rotateWithLeftChild on an arbitrary 2-d tree. Explain in detail all the reasons that the result is no longer a usable 2-d tree. 2. Implement the insertion and range search for the k-d tree. Do not use recursion.
|