Consider the block size (B) = 512 bytes for the student information table. A file has 40000 employee records of fixed length. Each record has the following fields:Name (50 bytes) SID (10 bytes) and address (41 bytes). Assume that unspanned organization is used to store records and SID takes block pointer 6 bytes. Suppose that the file is ordered by the key field SID and we want to construct a primary index ( sparse) on SID. Calculate the record size R in bytes and find the number of block access required to retrieve a record from the file using binary search
Consider the block size (B) = 512 bytes for the student information table. A file has 40000 employee records of fixed length. Each record has the following fields:Name (50 bytes) SID (10 bytes) and address (41 bytes). Assume that unspanned organization is used to store records and SID takes block pointer 6 bytes. Suppose that the file is ordered by the key field SID and we want to construct a primary index ( sparse) on SID. Calculate the record size R in bytes and find the number of block access required to retrieve a record from the file using binary search
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
Consider the block size (B) = 512 bytes for the student information table. A file has 40000 employee records of fixed length. Each record has the following fields:Name (50 bytes) SID (10 bytes) and address (41 bytes). Assume that unspanned organization is used to store records and SID takes block pointer 6 bytes. Suppose that the file is ordered by the key field SID and we want to construct a primary index ( sparse) on SID. Calculate the record size R in bytes and find the number of block access required to retrieve a record from the file using binary search
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 images
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