Question

2) Questions about standard ADT's and their implementations that we have studied, including asymptotic analysis of their operations under various implementations. A DougPriority Queue uses time (real numbers, not ints) for its priorities. The bigger the time of an item the more important it is. Describe a good time-efficient implementation of DougPriorityQueue. What is the bigO performance of your implementation for the 2 most important operations. Show a picture of your implementation when the following 4 items are in your DougPriority Queue: name=Bob,time=2.31 name=Jim,time=17.2 name=Bill, time=11.1 and name=Tom,time=22.

          2) Questions about standard ADT's and their implementations that we have studied, including
asymptotic analysis of their operations under various implementations.
A DougPriority Queue uses time (real numbers, not ints) for its priorities. The bigger the time of an
item the more important it is.
Describe a good time-efficient implementation of DougPriorityQueue.
What is the bigO performance of your implementation for the 2 most important operations.
Show a picture of your implementation when the following 4 items are in your
DougPriority Queue: name=Bob,time=2.31 name=Jim,time=17.2 name=Bill, time=11.1 and
name=Tom,time=22.

Show more…

2) Questions about standard ADT's and their implementations that we have studied, including
asymptotic analysis of their operations under various implementations.
A DougPriority Queue uses time (real numbers, not ints) for its priorities. The bigger the time of an
item the more important it is.
Describe a good time-efficient implementation of DougPriorityQueue.
What is the bigO performance of your implementation for the 2 most important operations.
Show a picture of your implementation when the following 4 items are in your
DougPriority Queue: name=Bob,time=2.31 name=Jim,time=17.2 name=Bill, time=11.1 and
name=Tom,time=22.

Added by Ashley U.

Computer Science and Information Technology

Trishna Knowledge Systems 2018 Edition

Instant Answer

Solved by Expert Sophia Furfine

Step 1

A binary heap is a complete binary tree where each node is smaller (or larger) than its children. In our case, we will use a max heap, where the node with the highest priority (largest time) is at the root. To implement the DougPriorityQueue, we can use an Show more…

Show all steps

lock

Thanks for your feedback!

Questions about standard ADTs and their implementations that we have studied, including asymptotic analysis of their operations under various implementations. A DougPriorityQueue uses time (real numbers, not ints) for its priorities. The bigger the time of an item, the more important it is. Describe a good time-efficient implementation of DougPriorityQueue. What is the big O performance of your implementation for the two most important operations? Show a picture of your implementation when the following four items are in your DougPriorityQueue: name=Bob, time=2.31; name=Jim, time=17.2; name=Bill, time=11.1; and name=Tom, time=22.

Play audio

Feedback

Powered by NumerAI

Sophia Furfine and 57 other subject AP CS educators are ready to help you.

Ask a new question

Labs

Want to see this concept in action?

NEW

Explore this concept interactively to see how it behaves as you change inputs.

View Labs

Key Concepts

Recommended Videos

Recommended Textbooks

Ace is your personal tutor. It breaks down any question with clear steps so you can learn.

Start Using Ace

Continue solving this problem

Create a free account to:

View full step-by-step solution
Ask follow-up questions with Ace AI
Save progress and study later