Home > Databases > Quizzes > DBMS Basics Practice Test: Indexing and Hashing
DBMS Basics Practice Test: Indexing and Hashing
Fast practice, instant feedback. Timer auto-submits when time’s up.
Avg score: 67% • Most missed: “The searching technique that takes O (1) time to find a data is”
Quiz questions on index definition, bitmap and ordered indices and various hashing techniques. Indexing and hashing are two important concepts in database management systems (DBMS) that improve database efficiency. Indexing improves efficiency by reducing the number of disk accesses needed to process queries. Hashing determines the direct location of a data record on a disk without the use of an index structure.  Indexing is used for rapid random lookups and efficient access of ordered records. It uses pre-organized data structures to speed up data retrieval, especially for range queries... Show more
DBMS Basics Practice Test: Indexing and Hashing
Time left 00:00
25 Questions

1. What is the purpose of the index in sql server?
2. Which one is true about clustered index?
3. While inserting the record into the index, if the search-key value does not appear in the index.
4. The traditional storage of data that is organized by customer, stored in separate folders in filing cabinets is an example of what type of ‘database’ system?
5. A hash function must meet ________ criteria.
6. Key value pairs is usually seen in
7. To identify the deleted records we use the ______________
8. What is true about indexes?
9. Bitmaps can be combined with regular B+-tree indices for relations where a few attribute values are extremely common, and other values also occur, but much less frequently.
10. The association role defines:
11. A(n) _________ can be used to preserve the integrity of a document or a message.
12. In ordered indices the file containing the records is sequentially ordered, a ___________ is an index whose search key also defines the sequential order of the file.
13. 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
14. If h is any hashing function and is used to hash n keys in to a table of size m, where n<=m, the expected number of collisions involving a particular key x is :
15. A _________________ index is the one which satisfies all the columns requested in the query without performing further lookup into the clustered index.
16. If an index is _________________ the metadata and statistics continue to exists
17. Indices whose search key specifies an order different from the sequential order of the file are called ___________ indices.
18. In B+ tree the node which points to another node is called
19. In _______________ index instead of storing all the columns for a record together, each column is stored separately with all other rows in an index.
20. Which of the following scenarios leads to linear running time for a random search hit in a linear-probing hash table?
21. The searching technique that takes O (1) time to find a data is
22. In a _______ clustering index, the index record contains the search-key value and a pointer to the first data record with that search-key value and the rest of the records will be in the sequential pointers.
23. The goal of hashing is to produce a search that takes
24. What is the best definition of a collision in a hash table?
25. A technique for direct search is

⚡ Recently practiced quizzes in this topic
Live quiz activity
DBMS Basics Practice Test: SQL - Queries, Constraints and Triggers Database Fundamentals Transact-SQL (T-SQL) Practice Test PostgreSQL Fundamentals Test SQL Server Vocab Redis Practice Test (NoSQL) Database Management System (DBMS) Practice Test: All Topics SQL Fundamentals Test SQL MCQs MariaDB Practice Test
 
❤ If you liked Fatskills, consider supporting us by checking out The Life Manuals You Never Got.

🌈  Our mission is to help improve your scores in any subject and exam withonline quizzes, practice tests, study guides, & advice for students. Since 2018.
About | Explore | User Guide | Topics | Subjects | Doubt Solver | Career Aptitude Test | Answers | Free Tools | OSHA Basics Quiz | What Should We Know?
Privacy | Terms |
Without work one finishes nothing. - Ralph Waldo Emerson
© 2026 Fatskills.com

All trademarks, logos and brand names are the property of their respective owners. All company, product and service names used in this website are for identification purposes only. Use of these names, trademarks and brands does not imply endorsement.