Computer Science: An Overview (12th Edition)
12th Edition
ISBN: 9780133760064
Author: Glenn Brookshear, Dennis Brylow
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
Chapter 9, Problem 57CRP
Program Plan Intro
Sequential files:
- A sequential file is a file that has same order of organization of records in which they are entered.
- The order of records does not change in sequential file.
- The information is arranged in a row in sequential files.
- In a sequential file, we can write and read data in a sequence only.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Using linear hashing to insert the given values in the order provided with the hash function hi(K) = K mod 2i . Display how the file grows and the hash functions changes as the records are inserted. Draw the diagrams showing the loading of the data into buckets, overflows, and splits. Also, calculate the average number of block accesses for a random retrieval on the given records.
Given records are
2369, 3760, 4692, 4871, 5659, 1821, 1074, 7115, 1620, 2428, 3943, 4750, 6975, 4981 and 9208.
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___.
What are the causes of bucket overflow in a hash file organization? What can be done to reduce the occurrence of bucket overflows?
Chapter 9 Solutions
Computer Science: An Overview (12th Edition)
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
Similar questions
- To store an item file with the item number as its main key, create a direct file organization using a hash function. The following table lists the primary keys of a sample collection of item file records. Assume that the blocks in the main storage area can hold a maximum of four records per block and that the buckets can hold two records each. Utilize 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_forwardA hash function is bi-directional, it allows us to create a fingerprint of a file and also reverse the processes to get the contents of the file Group of answer choices True Falsearrow_forwardA hash file organization can have too many buckets. What are the reasons for this? What can be done to cut down on the number of bucket overflows?arrow_forward
- Given 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_forwardTask 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.arrow_forward1. There are n numbers of students in your class. Your class teacher wants to search a particular student information based on student ID. Consider the records are already arranged in ascending order. Explain the steps for the following operations using binary search. • Search for any record which is available in the list. • Search for a record which is not available in the list. 2. Use any Hashing Technique to explain the following for the above scenario. • Place all the records into the hash table. • Use any probing /chaining technique to eliminate collision. Rubrics: No. Criteria Marks Binary Search 1 Search for any available record 2 Search for any unavailable record Hashing Technique 3 Placing records into the list with proper collision avoiding 1.0 technique 3.0 1.0 Total Marks 5.0arrow_forward
- aarrow_forwardFor every block chain, what information is always registered within every block? (a)The previous block is hash, (b)The current block is hash, (c)The next block is hash, (d) all the previous block is hash?arrow_forwardWhat can be done to reduce the occurrences of bucket overflows in a hash file organization?arrow_forward
- Question 5 Assume you have a hash table of size 13, insert the following keys using open addressing with linear probing, assuming that the H(Key) = key % size and the bucket size is equal to 1. Keys: 25, 66, 710, 150, 82, 111, 70,17 a. index key 0 1 66 2 3 4 82 5 70 6 17 7 150 8 710 9 111 10 11 25 12 b. index key 1 2 66 3 4 5 82 6 70 7 17 8 150 9 710 10 111 11 12 13 25 c. index key 0 1 66 2 3 4 82 5 70 6 17 7 150 8 111 9 710 10 11 12 25 d. index key 0 1 66 2 3 4 82 5 70 6 17 7 150 8 710 9 111 10 11 12 25arrow_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_forwardDiscuss the advantages and disadvantages of using Hashed files. Which operations can be performed to handle collisions?arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill Education
Starting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSON
Digital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSON
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Programmable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education