11. 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.

11. 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.

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter10: Pointers

Section10.1: Addresses And Pointers

Problem 12E

See similar textbooks

Similar questions

How many bytes are needed to store a two-dimensional 10x20 array of words? Continued from the previous question, suppose the base of the array, say M, is memory location 2000, what is the memory location of M[7, 12]? (All the values in this question are decimal values. The answer should be a decimal value.)
For the following loop, assume the array arr2[][] has never been referenced before in the code. Also assume that a cache line is 32 Bytes, and an int is 4 Bytes. 1. How many memory references are there?2. How many cache misses are there?
Are there any implications for Symbian, Android, or iPhone operating systems when it comes to the algorithm employed to remove data?
The most important tables in the library information system are the following. Books (bid, author, title, publisher, year); Members (mid, name, surname, address, telephone); Rental (rid, mid, bid, eid, date); Employee (eid, name, surname, address, telephone) All tables are sorted according to the key. The following information is given. 1 page on the disk = 8KB |Books| = 1.000.000 records, 320 bytes, 25 records/page, 40000 pages |Members| = 10.000 records, 200 bytes, 40 records/page, 250 pages |Rental| = 300.000 records, 40 bytes, 200 records/page, 1500 pages |Employee| = 100 records, 200 bytes, 40 records/page, 3 pages We can have 25.000 pages in the buffer. QUESTION 2.1 B+ index is used on the attribute Books.publisher. The size of the record identifier is 8B, the size of the page identifier is 6B. Calculate the size of the B+ index whose pages are filled to their minimum capacity as accurately as possible. Write down all assumptions.
Consider a file of 16384 records. Each record is 32 bytes long and its key field is of size 6 bytes. The file is ordered on a non-key field, and the file organization is unspanned. The file is stored in a file system with block size 1024 bytes, and the size of a block pointer is 10 bytes. If the secondary index is built on the key field of the file, and a multilevel index scheme is used to store the secondary index, the number of first-level and second-level blocks in the multilevel index are respectively
Student information is being held in a data area, where each student record has the following format: The first nine bytes are the student number, held in ASCII The next byte is the course mark The next word is the section identifierThere are well over three hundred such student records that have been loaded sequentially into memory starting at address $10000. The last record loaded is a dummy record with a section identifier of $FFFF, to show the end of the records.Write an assembler subroutine GetMax that will scan the entire list and find the highest mark. If there is a tie, the first student in the list with the highest mark should be found. The subroutine should return the starting address of this record in address register a3.
What is the difference between cloning and copying when it comes to data sets?
Read question properly and give correct answer fastttt within 30 minutes.... will upvote Answer the questions below using the following information: Consider a disk with block size B = 512 bytes. A block pointer is P = 6 bytes long, and a record pointer is PR = 7 bytes long. A file has r = 30,000 EMPLOYEE records of fixed length. Each record hs the following fields: Name (30 bytes), SSN (9 bytes), Department_code (9 bytes), Address (40 bytes), Phone (9 bytes), Birth_date (8 bytes), Sex (1 byte), Job_code (4 bytes), Salary (4 bytes, real number). An additional byte is used as a deletion marker. Suppose that the file is not ordered by the key field SSN and we want to construct a B+-tree access structure (index) on SSN. Calculate: The orders p and pleaf of the B+-treeThe number of leaf-level blocks needed if blocks are approximately 69 percent full (rounded up for convenience)The number of levels needed if internal nodes are also 69 percent full (also rounded up)The total number of blocks…
SAME PARAMETERS: In the RENTALS table shown in fig 2, 40 customers have created 50 rental contracts over time. A RENTALS record is 122 bytes and the block size for your OS is set to 1024 bytes with each block having a 1 byte pointer to the next written block as well as a 1 byte pointer to the next physically consecutive block. Assuming spanned organization, how many blocks do you estimate the RENTALS file is using at its current size? multiple choice a.50 b.6 c.400 d.7
Follow the direction for each question. Your submission should be one PDF file which includes the MIPS source programs and the screenshots of your MARS execution windows. 1. Draw a picture illustrating the contents of memory, given the following data declarations: You need to mark all the memory addresses. Assume that your data segment starts at 0x1000 in memory. (10 points) Name: .asciiz "Jim Bond!"Age: .byte 24Numbers: .word 11, 22, 33Letter1: .asciiz 'M' 2. Create the data declaration part of the above by creating a file with MARS and assemble it to show the memory contents. You don't have to have .text part since this is just data declaration only. Capture your screen of MARS execution window by checking "ASCII" option of Data Segment part. (10 points)
Suppose that there is a file system with blocks of 512 bytes in size. For each inode, there are 20 direct blocks, 2 singly-indirect blocks, and 2 doubly-indirect blocks. The size of a pointer is 4 bytes. Calculate the maximum possible size of a file in bytes. Show your work.
Discuss the concept of memory fragmentation and the strategies used to address it in memory allocation algorithms.