Process of insertion into a heap-implemented priority queue

Assignment Help Data Structure & Algorithms
Reference no: EM135372

Q1 Consider the Hire Assistant problem. We interview n candidates and always hire the best qualified so far. Let n = 5 for our example.  Find the probabilities that we hire exactly 1 time, 2 times, 3 times, 4 times and 5 times. Define the probabilities as Pr(h=i), where i = 1 ... 5.

Q2 Repeat problem #1, but let n = 10. Find the expected number of candidates hired using your probabilities. You do not have to show each Pr(h=i), but you will need it for your E(H), where H =

, and therefore E(H) = .

Q3 We have studied heaps and its relationship with complete binary trees and arrays which implement those binary trees. Consider a max-heap implementing a priority queue, as we did in class.

a. Explain the process of insertion into a heap-implemented priority queue, and informally explain its complexity.

b. Explain the process of removal from a heap-implemented priority queue, and informally explain its complexity.

Q4 Suppose we implement a priority queue, as a straight array, that is, the higher priority elements are ahead of any lower priority elements.

a. Informally, find the complexity of inserting and removal from this structure and compare it to the heap-implemented priority queue.

b. Suppose that you were to perform m1 insert operations and m2 remove operations from a straight array priority queue implementation. Describe in words the situation where the best and worst case complexity will occur. Create the mathematical model when the average case will occur.

Questions Cloud

 Describe the discrete-time markov chain : Describe the discrete-time Markov chain (X(t)) and transition probability matrix What is the probability that a faculty member leaves the department on "bad terms"? Maximize effectiveness at the least cost : Determine the following prior deciding a prescription maximize effectiveness at the least cost Elucidate the marginal revenue from the fourth worker : Elucidate the marginal revenue from the fourth worker Examine the key factors affecting the demand : Examine the key factors affecting the demand for and the supply of a good or service Process of insertion into a heap-implemented priority queue : Explain the process of insertion into a heap-implemented priority queue, and informally explain its complexity and the process of removal from a heap-implemented priority queue, and informally explain its complexity. Maximize effectiveness at the least cost : Determine the following prior deciding a prescription - (a) maximize effectiveness at the least cost (b) maximize effectiveness at a fixed cost of \$10,000 Estimated regression equation : Estimated regression equation for which quantifies the demand for Widget Exposure to a variety of research in her field of study : Her program as well required, where she would spend four to six weeks in different labs, gaining experience also exposure to a variety of research in her field of study Evaluate the company''s weights of capital : Evaluate the company's weights of capital (debt, preferred stock and common stock) and estimate the company's before-tax and after-tax component cost of debt.

Write a Review

Implement an open hash table

In this programming assignment you will implement an open hash table and compare the performance of four hash functions using various prime table sizes.

Use a search tree to find the solution

Explain how will use a search tree to find the solution.

How to access virtualised applications through unicore

How to access virtualised applications through UNICORE

Recursive tree algorithms

Write a recursive function to determine if a binary tree is a binary search tree.

Determine the mean salary as well as the number of salaries

Determine the mean salary as well as the number of salaries.

Currency conversion development

Currency Conversion Development

Cloud computing assignment

WSDL service that receives a request for a stock market quote and returns the quote

Design a gui and implement tic tac toe game in java

Design a GUI and implement Tic Tac Toe game in java

Recursive implementation of euclids algorithm

Write a recursive implementation of Euclid's algorithm for finding the greatest common divisor (GCD) of two integers

Data structures for a single algorithm

Data structures for a single algorithm

Write the selection sort algorithm

Write the selection sort algorithm

Design of sample and hold amplifiers for 100 msps by using n

The report is divided into four main parts. The introduction about sample, hold amplifier and design, bootstrap switch design followed by simulation results.