A hash table can store a maximum of 10 records, currently there are records in location 1, 3,4,7,8,9,10. The probability of a new record going into location 2, with hash functions resolving collisions by linear probing is(a) 0.1(b) 0.6(c) 0.2(d) 0.5This question was addressed to me in an international level competition.This key question is from Hashing techniques in chapter Indexing and Hashing of Database Management

A hash table can store a maximum of 10 records, currently there are re

1.	A hash table can store a maximum of 10 records, currently there are records in location 1, 3,4,7,8,9,10. The probability of a new record going into location 2, with hash functions resolving collisions by linear probing is(a) 0.1(b) 0.6(c) 0.2(d) 0.5This question was addressed to me in an international level competition.This key question is from Hashing techniques in chapter Indexing and Hashing of Database Management
Answer» Right option is (b) 0.6 The best EXPLANATION: Hashing is used to index and retrieve items in a database because it is easier to find the item using the SHORTENED hashed KEY than using the ORIGINAL value.

Discussion

No Comment Found

Related InterviewSolutions

In _______________ index instead of storing all the columns for a record together, each column is stored separately with all other rows in an index.(a) Clustered(b) Column store(c) Non clustered(d) Row storeThe question was posed to me during a job interview.My question is taken from Index Definition in SQL topic in portion Indexing and Hashing of Database Management
A hash function must meet ________ criteria.(a) Two(b) Three(c) Four(d) None of the mentionedI got this question during an online interview.My question comes from Ordered Indexing and Hashing topic in section Indexing and Hashing of Database Management
Incase the indices values are larger, index is created for these values of the index. This is called(a) Pointed index(b) Sequential index(c) Multilevel index(d) Multiple indexI have been asked this question during an interview.I want to ask this question from Ordered Indices in chapter Indexing and Hashing of Database Management
Which of the following scenarios leads to linear running time for a random search hit in a linear-probing hash table?(a) All keys hash to same index(b) All keys hash to different indices(c) All keys hash to an even-numbered index(d) All keys hash to different even-numbered indicesThe question was posed to me in an internship interview.I'd like to ask this question from Hashing techniques topic in division Indexing and Hashing of Database Management
A tablespace is further broken down into ________(a) Tablespace(b) Segments(c) Extents(d) BlocksThis question was posed to me in unit test.The origin of the question is Bitmap Indices topic in chapter Indexing and Hashing of Database Management
Bitmap indices are a specialized type of index designed for easy querying on ___________(a) Bit values(b) Binary digits(c) Multiple keys(d) Single keysI had been asked this question during an interview for a job.My question is based upon Bitmap Indices in division Indexing and Hashing of Database Management
What is the main limitation of Hierarchical Databases?(a) Limited capacity (unable to hold much data)(b) Limited flexibility in accessing data(c) Overhead associated with maintaining indexes(d) The performance of the database is poorThis question was addressed to me in an online interview.The question is from Ordered Indexing and Hashing topic in portion Indexing and Hashing of Database Management
Does index take space in the disk?(a) It stores memory as and when required(b) Yes, Indexes are stored on disk(c) Indexes are never stored on disk(d) Indexes take no spaceThe question was posed to me during an interview.My doubt stems from Index Definition in SQL topic in chapter Indexing and Hashing of Database Management
The association role defines:(a) How tables are related in the database(b) The relationship between the class diagram and the tables in the database(c) The tables that each attribute is contained(d) Which attribute is the table’s primary keyI have been asked this question in a national level competition.The question is from Ordered Indexing and Hashing in chapter Indexing and Hashing of Database Management
If an index is _________________ the metadata and statistics continue to exists(a) Disabling(b) Dropping(c) Altering(d) Both Disabling and DroppingThe question was asked by my school principal while I was bunking the class.The above asked question is from Index Definition in SQL in portion Indexing and Hashing of Database Management

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment