EBK COMPUTER SCIENCE: AN OVERVIEW
12th Edition
ISBN: 8220102744196
Author: BRYLOW
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Concept explainers
Expert Solution & Answer
Chapter 9, Problem 61CRP
a.
Explanation of Solution
Advantage of a sequential file over an indexed file:
- In sequential file, the data or records is stored in the serial manner. So, the following operation will be fast.
- Searching records
- The binary search is implemented on sorted records. Hence, this operation will be fast.
- Updating records
- Here also, the binary search is implemented. Hence, this operation will be fast.
- Deleting records
- Searching the records is fast in this operation.
- Searching records
- In sequential file, the records are sorted on the value of one or more fields...
b.
Explanation of Solution
Advantage of a sequential file over a hash file:
- For accessing the record from the sequential file, direct key or record number can be specified but in hash file, hash function is needed to solve.
- A hash function is computed on some attribute of each record. It identifies the record location to be positioned.
- The sequential file is used to read or write a flat sequential file whereas hash file is used to read or write a hash file.
- In sequential file, the records will be loaded generally whereas in hash file, the data is loaded based on hash
algorithm ...
c.
Explanation of Solution
Advantage of an indexed file over a sequential file:
- In indexed file organization, the records address are stored in distinct file and their data is accessed by using pointers.
- Therefore, the record is accessed by less time while in sequential file the searching starts from first record until the record is found in key
database ...
d.
Explanation of Solution
Advantage of an indexed file over a hash file:
- In indexed file, the index records take less time to access when comparing with hash file.
- Indexing offers comparatively fast access to entries within a data storage structure but hash file takes more time to access the entries...
e.
Explanation of Solution
Advantage of a hash file over a sequential file:
- Comparing with sequential file, the hash file is more secured and takes less time to access records...
f.
Explanation of Solution
Advantage of a hash file over an indexed file:
- In index file, file index is generally stored as a distinct file on the similar storage device.
- Then the index is transferred to main me...
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
167.
The file organization which allows us to read records that would satisfy the join condition by using one block read is
a.
Heap file organization
b.
Sequential file organization
c.
Clustering file organization
d.
Hash file organization
1. An open hashing scheme requires the use of random access ( true /false ).
2. A good hashing function should ___ distribute the records amongthe buckets.
3. For an open hashing scheme with 100 buckets and 4000 records,the average number of record reads to locate a record is equal to___.
Task The Randomness of One-way Hash
To understand the properties of one-way hash functions, we would like to do the following exercise for MD5 and SHA256:
Create a text file of any length.
Generate the hash value H1 for this file using a specific hash algorithm.
Flip one bit of the input file. You can achieve this modification using ghex or Bless.
Generate the hash value H2 for the modified file.
Please observe whether H1 and H2 are similar or not. Please describe your observations in the lab
report.
Chapter 9 Solutions
EBK COMPUTER SCIENCE: AN OVERVIEW
Ch. 9.1 - Identify two departments in a manufacturing plant...Ch. 9.1 - Prob. 2QECh. 9.1 - Summarize the roles of the application software...Ch. 9.2 - Prob. 1QECh. 9.2 - Prob. 2QECh. 9.2 - Prob. 4QECh. 9.2 - Prob. 5QECh. 9.2 - Prob. 6QECh. 9.3 - Prob. 1QECh. 9.3 - What is a persistent object?
Ch. 9.3 - Identify some classes as well as some of their...Ch. 9.3 - Prob. 4QECh. 9.4 - Prob. 1QECh. 9.4 - Prob. 2QECh. 9.4 - Prob. 3QECh. 9.4 - Prob. 4QECh. 9.4 - Prob. 5QECh. 9.4 - Prob. 6QECh. 9.5 - Prob. 1QECh. 9.5 - Prob. 2QECh. 9.5 - Prob. 3QECh. 9.5 - Prob. 4QECh. 9.5 - Prob. 5QECh. 9.5 - Prob. 6QECh. 9.5 - Prob. 7QECh. 9.6 - Prob. 1QECh. 9.6 - Give an additional example of a pattern that might...Ch. 9.6 - Prob. 3QECh. 9.6 - How does data mining differ from traditional...Ch. 9.7 - Prob. 1QECh. 9.7 - Prob. 2QECh. 9.7 - Prob. 3QECh. 9.7 - Prob. 4QECh. 9 - Prob. 1CRPCh. 9 - Prob. 2CRPCh. 9 - Prob. 3CRPCh. 9 - Prob. 4CRPCh. 9 - Prob. 5CRPCh. 9 - Prob. 6CRPCh. 9 - Prob. 7CRPCh. 9 - Prob. 8CRPCh. 9 - Prob. 9CRPCh. 9 - Prob. 10CRPCh. 9 - Prob. 11CRPCh. 9 - Prob. 12CRPCh. 9 - Using the commands SELECT, PROJECT, and JOIN,...Ch. 9 - Answer Problem 13 using SQL. PROBLEM 13 13. Using...Ch. 9 - Prob. 15CRPCh. 9 - Prob. 16CRPCh. 9 - Prob. 17CRPCh. 9 - Prob. 18CRPCh. 9 - Prob. 19CRPCh. 9 - Empl Id Name Address SSN Job Id Job Title Skill...Ch. 9 - Empl Id Name Address SSN Job Id Job Title Skill...Ch. 9 - Prob. 22CRPCh. 9 - Prob. 23CRPCh. 9 - Prob. 24CRPCh. 9 - Prob. 25CRPCh. 9 - Write a sequence of instructions (using the...Ch. 9 - Prob. 27CRPCh. 9 - Prob. 28CRPCh. 9 - Prob. 29CRPCh. 9 - Prob. 30CRPCh. 9 - Prob. 31CRPCh. 9 - Prob. 32CRPCh. 9 - Prob. 33CRPCh. 9 - Prob. 34CRPCh. 9 - Prob. 35CRPCh. 9 - Prob. 36CRPCh. 9 - Prob. 37CRPCh. 9 - Prob. 38CRPCh. 9 - Prob. 39CRPCh. 9 - Prob. 40CRPCh. 9 - Prob. 41CRPCh. 9 - Prob. 42CRPCh. 9 - Prob. 43CRPCh. 9 - Prob. 44CRPCh. 9 - Prob. 45CRPCh. 9 - Prob. 46CRPCh. 9 - Prob. 47CRPCh. 9 - Prob. 48CRPCh. 9 - Prob. 49CRPCh. 9 - Prob. 50CRPCh. 9 - Prob. 51CRPCh. 9 - Prob. 52CRPCh. 9 - Prob. 53CRPCh. 9 - Prob. 54CRPCh. 9 - Prob. 55CRPCh. 9 - Prob. 56CRPCh. 9 - Prob. 57CRPCh. 9 - Prob. 58CRPCh. 9 - Prob. 59CRPCh. 9 - Prob. 60CRPCh. 9 - Prob. 61CRPCh. 9 - Prob. 62CRPCh. 9 - Prob. 1SICh. 9 - Prob. 2SICh. 9 - Prob. 3SICh. 9 - Prob. 4SICh. 9 - Prob. 5SICh. 9 - Prob. 6SICh. 9 - Prob. 7SICh. 9 - Prob. 8SICh. 9 - Prob. 9SICh. 9 - Prob. 10SI
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- 1. Given that F is a direct file with n = 2000 records and that the records are stored in orderof their keys. Determine how any record reads it would take to locate a particular record using:a. Sequential search (average case)b. Binary search (worst case)c. (open) hashing with 200 buckets (average case)d. (open) hashing with 400 buckets (average case) 2. Write the declarations to create a data type called: DICTIONARY that represents an openhashing scheme with 20 bucketsarrow_forward1. A hashing function converts a large ___ to a small ___. 2. A ___ occurs when two keys hash to the same address. 3. For an open hashing scheme, the records within each bucket are stored in key order ( true / false ). 4. For an open hashing scheme, the most recently inserted record will be on the front end of the bucket list ( true / false )arrow_forward1- Answer the following questions: a. What is an index on a file of records? b. Why do we need indexes? c. Explain the difference between Hash indexes and Tree-based indexes for range and equality queries.arrow_forward
- 134. What is heap file organization? a. Any record can be placed wherever there is a space for the record b. Records are stored in a sequential order according to a search key c. A hash function is computed on some attribute and that decides the block d. None of the mentionedarrow_forwardIn this question don’t change code, just in python postgreSQL but solve the question and follow the instructionsarrow_forwardA sorted file has the following details: Number of records = 13,10,720; record length = 200 bytes; size of the primary key field = 13 bytes; size of block pointer = 7 bytes; block size = 2048 bytes. For this file, we need to build a multi-level index on the primary key. The number of blocks in the first level index file isarrow_forward
- 4. Given input keys of a file 130, 60, 98, 28, 38, 55 and a hash function with table-size=10. Show the results of double hash with Hash (key) = key%10 and Hash2( key ) = P- (key mod P) %3Darrow_forwardDesign a direct file organization using a hash function, to store an item file withitem number as its primary key. The primary keys of a sample set of records ofthe item file are listed below. Assume that the buckets can hold two records eachand the blocks in the primary storage area can accommodate a maximum of fourrecords each. Make use of the hash function h(k) = k mod 8, where k represents thenumerical value of the primary key (item number).369 760 692 871 659 975 981 115 620 208 821 111 554 781 181 965arrow_forwardGiven the key-values: 14, 15, 16, 17, 18, 19, 20, 100, 101, 102, 103, 104, 105 and number of file positions 14, which of the following statement is true in hashing function using division method? Use the closest prime number less than or equal to the number of file positions. O We have collision and the minimum and the maximum addresses hashed by these key-values are 0 and 12 We have collision and the minimum and the maximum addresses hashed by these key-values are 1 and 12 We do not have collision Nonearrow_forward
- The purpose of this project is to assess your ability to: Implement a hash table Utilize a hash table to efficiently locate data Analyze and compare algorithms for efficiency using Big-O notation For this project, you will implement a hash table and use it to store words in a large text file. Your hash table should use chaining for collision resolution. You may design any hash function you wish. Your program will read a file and insert each word into a hash table. Once the table is populated, allow the user to enter words to search for. For each word entered, your program should report the number of elements inspected and whether or not the word was located. Provide an analysis of your insert and search algorithms using Big-O notation. Be sure to provide justification for your claims.arrow_forwardYou are required to propose FOUR functions to develop a complete student record management system. The function are insert, delete, search, update. In addition, you need to use linked list to complete the system development. Write a program by extending the code from the lab. Think and implement 4 more functions in the program (compulsory function is sorting and searching) Your must build on top of the following code. //FileName: Student.cpp //This program illustrates attributes of class Student using simple data structure #include <iostream.h> class Student { private: struct Data { char Name[25]; char Course[30]; int Result; } stdata; public: void SetData(); void GetData(); };//class Student void Student::SetData() { cout <<”Enter student name:”; cin>> stdata.Name; cout<< “Enter student course: “; cin>> stdata.Course; cout<< “Enter student result:”; cin>> stdata.Result; };//method SetData void Student::GetData() { cout<< “\n…arrow_forwardTo store an item file with the item number as its primary key, create a direct file organisation using a hash function. A sample set of records' primary keys for Below is a list of the item file. Assume that the blocks in the primary storage area can carry a maximum of four records per block and that the buckets can hold two records apiece. Use the hash function h(k) = k mod 8, where k is the main key's numerical value (item number).369 760 692 871 659 975 981 115 620 208 821 111 554 781 181 965arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Programming Logic & Design ComprehensiveComputer ScienceISBN:9781337669405Author:FARRELLPublisher:Cengage
Programming Logic & Design Comprehensive
Computer Science
ISBN:9781337669405
Author:FARRELL
Publisher:Cengage