Please explain A major airline decides it wants to board passengers passed on their priority status. The passengers will board the airplane one at a time in a single file order. The higher the priority passenger rating, the earlier they should board (assume there are no ties). What data structure should this airline use? How long will it take to board N passengers in Big-O? Note: We do not know when the passengers will arrive at the gate, but we will always want to allow the passenger with the highest priority to board first. Group of answer choices a. A priority queue is the best data structure. The priority queue uses a max-heap such that passengers with the highest priority will be at the top of the heap. In order to board N passengers, it will take O(nlog(n) time. N removals for each of the passengers and then log(n) time for each removal to rebuild the max-heap structure.
Please explain A major airline decides it wants to board passengers passed on their priority status. The passengers will board the airplane one at a time in a single file order. The higher the priority passenger rating, the earlier they should board (assume there are no ties). What data structure should this airline use? How long will it take to board N passengers in Big-O? Note: We do not know when the passengers will arrive at the gate, but we will always want to allow the passenger with the highest priority to board first. Group of answer choices a. A priority queue is the best data structure. The priority queue uses a max-heap such that passengers with the highest priority will be at the top of the heap. In order to board N passengers, it will take O(nlog(n) time. N removals for each of the passengers and then log(n) time for each removal to rebuild the max-heap structure.
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
Please explain
A major airline decides it wants to board passengers passed on their priority status. The passengers will board the airplane one at a time in a single file order.
The higher the priority passenger rating, the earlier they should board (assume there are no ties). What data structure should this airline use? How long will it take to board N passengers in Big-O?
Note: We do not know when the passengers will arrive at the gate, but we will always want to allow the passenger with the highest priority to board first.
Group of answer choices
a. A priority queue is the best data structure. The priority queue uses a max-heap such that passengers with the highest priority will be at the top of the heap.
- In order to board N passengers, it will take O(nlog(n) time.
- N removals for each of the passengers
- and then log(n) time for each removal to rebuild the max-heap structure.
b. A binary search tree is the best data structure. The binary search tree will search for the greatest value in a worse-case of O(n).
In order to board N passengers, it will take O(n*n) time.
- N removals for each of the passengers
- and then O(n) time for each search in the tree
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY