A shopkeeper needs to maintain daily earnings in a data structure. Sometimes he wants to know money made between day i and day j. This is the only query the shopkeeper makes. Suppose the days are numbered in increasing order irrespective of months or years. Design a data structure for the shopkeeper with the fastest possible functions to add earnings to the data structure and make the query. Which of the following is/are true about this data structure? Soloot ono

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...
icon
Related questions
Question
A shopkeeper needs to maintain daily earnings in a data structure. Sometimes he
wants to know money made between day i and day j. This is the only query the
shopkeeper makes. Suppose the days are numbered in increasing order irrespective
of months or years.
Design a data structure for the shopkeeper with the fastest possible functions to add
earnings to the data structure and make the query.
Which of the following is/are true about this data structure?
Select one:
O a. The query can be implemented in O(n log n) time and insert is constant time
O b. Insert can be implemented in constant run time but query takes O(n) time
c. Insert and query both can be implemented with constant run-time
O d. Insert is O(n) time but the query can be performed in constant time
O e. None of the above
Transcribed Image Text:A shopkeeper needs to maintain daily earnings in a data structure. Sometimes he wants to know money made between day i and day j. This is the only query the shopkeeper makes. Suppose the days are numbered in increasing order irrespective of months or years. Design a data structure for the shopkeeper with the fastest possible functions to add earnings to the data structure and make the query. Which of the following is/are true about this data structure? Select one: O a. The query can be implemented in O(n log n) time and insert is constant time O b. Insert can be implemented in constant run time but query takes O(n) time c. Insert and query both can be implemented with constant run-time O d. Insert is O(n) time but the query can be performed in constant time O e. None of the above
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
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 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)
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
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY