Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
Assume you are working in Grameenphone, and you are asked to manage records of 70 million users by their Phone numbers. You are asked to store these numbers and perform frequent searches, insertion and deletion on them. Each record size is about 10KB (Kilobytes). Any array in your system can hold at most 4GB (Gigabytes) of data. How would you design the data structure to hold the record? Answer this based on your data structure knowledge on Arrays, Various kind of linked lists, Trees, Graph and/or Hash Tables. Discuss your choice based on space and runtime complexity.

Assume you are working in Grameenphone, and you are asked to manage records of 70 million users by their Phone numbers. You are asked to store these numbers and perform frequent searches, insertion and deletion on them. Each record size is about 10KB (Kilobytes). Any array in your system can hold at most 4GB (Gigabytes) of data. How would you design the data structure to hold the record? Answer this based on your data structure knowledge on Arrays, Various kind of linked lists, Trees, Graph and/or Hash Tables. Discuss your choice based on space and runtime complexity.

Computer Networking: A Top-Down Approach (7th Edition)
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...
See similar textbooks
icon
Related questions
Question

Assume you are working in Grameenphone, and you are asked to manage records of 70 million users
by their Phone numbers. You are asked to store these numbers and perform frequent searches,
insertion and deletion on them.
Each record size is about 10KB (Kilobytes).
Any array in your system can hold at most 4GB (Gigabytes) of data.
How would you design the data structure to hold the record?
Answer this based on your data structure knowledge on Arrays, Various kind of linked lists, Trees, Graph
and/or Hash Tables. Discuss your choice based on space and runtime complexity.

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 2 images

SEE SOLUTIONCheck out a sample Q&A here
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
SEE MORE TEXTBOOKS