1. What is the primary purpose of an index in a database?

A . To sort data

B . To speed up data retrieval operations

C . To enforce data integrity

D . To create backups

Answer

2. Which indexing method is best suited for exact-match queries?

A . A) Tree-based indexing

B . B) Hash-based indexing

C . C) Bitmap indexing

D . D) None of the above

Answer

3. Which data structure is commonly used in Tree-based indexing?

A . Array

B . Linked List

C . B-Tree or B+ Tree

D . Hash Table

Answer

4.Which of the following queries is Hash-based indexing NOT well-suited for?

A . Equality queries

B . Range queries

C . Point queries

D . Both A and C

Answer

5. What is a ‘bucket’ in the context of Hash-based indexing?

A . A collection of databases

B . A collection of keys

C . A collection of tables

D . A slot where data can be inserted or retrieved

Answer

6. What is the key feature of B-Trees?

A . The tree is always balanced

B . The tree allows duplicates

C . The tree is unbalanced but can be balanced manually

D . The tree grows in a random fashion

Answer

7. Which of the following is NOT a type of indexing in DBMS?

A . Clustered Indexing

B . Unclustered Indexing

C . Bounded Indexing

D . Composite Indexing

Answer

8. What does a leaf node in a B+ Tree contain?

A . Only keys

B . Only data pointers

C . Both keys and data pointers

D . Neither keys nor data pointers

Answer

9. Which of the following can be a disadvantage of indexing?

A . Faster data retrieval

B . Increased storage space

C . Improved data integrity

D . Faster data insertion

Answer

10.In which type of index are data and index entries stored together?

A . Clustered Index

B . Non-Clustered Index

C . Hash Index

D . Bitmap Index

Answer

11. A unit of storage that can store one or more records in a hash file organization is denoted as

A . Buckets

B . Disk pages

C . Blocks

D . Nodes

Answer

12. 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

Answer

13. Which file organization allows records to be stored in any available location?

A . Sequential

B . Direct

C . Heap

D . Clustered

Answer

14. In which file organization are records stored sequentially based on a key field?

A . Sequential

B . Indexed Sequential

C . Direct

D . Heap

Answer

15. Which file organization is efficient for range queries?

A . Hashing

B . Heap

C . Indexed Sequential

D . Direct

Answer

16. In Hashing, the function used to determine the storage location of a record is called:

A . Hash Function

B . Key Function

C . Address Function

D . Sorting Function

Answer

17. Which of the following file organizations allows for quick retrieval based on a unique key?

A . Heap

B . Hashing

C . Indexed Sequential

D . Sequential

Answer

18. In Indexed Sequential Access Method (ISAM), what is used to locate primary and secondary records?

A . Key values

B . Indices

C . Hash Values

D . Memory Addresses

Answer

19. Which file organization does not require sorting of data?

A . Sequential

B . Indexed Sequential

C . Heap

D . Clustered

Answer

20. In which file organization is data stored in a sorted manner, but allows for additional data to be added easily?

A . Sequential

B . Direct

C . Heap

D . Dynamic Sequential

Answer

21. What is a drawback of sequential file organization?

A . Slow read

B . High storage cost

C . Slow insert and update

D . All of the above

Answer

22. In a Clustered file organization, records from multiple tables that share a common field are stored together in:

A . Blocks

B . Buckets

C . Pages

D . Clusters

Answer

23. Which type of index is created automatically when a primary key constraint is defined?

A . Clustered Index

B . Non-Clustered Index

C . Composite Index

D . Bitmap Index

Answer

24. What is the primary purpose of query optimization?

A . Reduce disk storage

B . Reduce query execution time

C . Ensure data integrity

D . None of the above

Answer

25. What is the disadvantage of using too many indexes on a table?

A . Reduced disk storage

B . Faster data retrieval

C . Slower data modification operations

D . Improved data integrity

Answer

26. 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 mentioned

Answer

27. What is sequential 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 mentioned

Answer

28. What is hashing 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 mentioned

Answer

29. What is the primary disadvantage of a clustered index?

A . Slower updates and inserts

B . Increased storage space

C . Slower data retrieval

D . None of the above

Answer

30. What is a secondary index primarily used for?

A . To enforce data integrity

B . To speed up data retrieval without affecting physical data order

C . To reduce storage space

D . To sort the data physically in the table

Answer

31. In a secondary index, each entry is a pair consisting of:

A . A secondary key and a list of block pointers

B . A primary key and a data pointer

C . A secondary key and a data pointer

D . A primary key and a list of block pointers

Answer

32. Which of the following types of index allows for non-unique values?

A . Primary Index

B . Clustered Index with a primary key

C . Secondary Index

D . None of the above

Answer

33. What does a clustered index do?

A . Sorts the data rows in the table

B . Creates a separate structure to hold index and data

C . Allows for faster bitmap operations

D . Stores data out-of-order for optimized retrieval

Answer

---

Relevant Materials :

☞ Database Management System Objective Type Question Bank-Unit-1 - [ DBMS ]

☞ Database Management System Objective Type Question Bank-Unit-2 - [ DBMS ]

☞ Database Management System Objective Type Question Bank-Unit-3 - [ DBMS ]

☞ Database Management System Objective Type Question Bank-Unit-4 - [ DBMS ]

☞ Database Management System Objective Type Question Bank-Unit-5 - [ DBMS ]

---

Similar Materials :

☞ R - Programming MCQs - Unit-1 - [ R-Programming ]

☞ R - Programming MCQs - Unit-2 - [ R-Programming ]

☞ R - Programming MCQs - Unit-3 - [ R-Programming ]

☞ R - Programming MCQs - Unit-4 - [ R-Programming ]

☞ R - Programming MCQs - Unit-5 - [ R-Programming ]

☞ Formal Languages and Automata Theory (FLAT) MCQs - Unit-1 - [ FLAT ]

☞ Formal Languages and Automata Theory (FLAT) MCQs - Unit-2 - [ FLAT ]

☞ Formal Languages and Automata Theory (FLAT) MCQs - Unit-3 - [ FLAT ]

☞ Formal Languages and Automata Theory (FLAT) MCQs - Unit-4 - [ FLAT ]

☞ Formal Languages and Automata Theory (FLAT) MCQs - Unit-5 - [ FLAT ]

☞ PPS MCQs - Unit-1 - [ PPS ]

☞ PPS MCQs - Unit-2 - [ PPS ]

☞ PPS MCQs - Unit-3 - [ PPS ]

☞ PPS MCQs - Unit-4 - [ PPS ]

☞ PPS MCQs - Unit-5 - [ PPS ]

☞ Object Oriented Programming through Java MCQs - Unit-1 - [ OOP_JAVA ]

☞ Object Oriented Programming through Java MCQs - Unit-2 - [ OOP_JAVA ]

☞ Object Oriented Programming through Java MCQs - Unit-3 - [ OOP_JAVA ]

☞ Object Oriented Programming through Java MCQs - Unit-4 - [ OOP_JAVA ]

☞ Object Oriented Programming through Java MCQs - Unit-5 - [ OOP_JAVA ]

☞ Design and Analysis of Algorithms MCQs - Unit-1 - [ DAA ]

☞ Design and Analysis of Algorithms MCQs - Unit-2 - [ DAA ]

☞ Design and Analysis of Algorithms MCQs - Unit-3 - [ DAA ]

☞ Design and Analysis of Algorithms MCQs - Unit-4 - [ DAA ]

☞ Design and Analysis of Algorithms MCQs - Unit-5 - [ DAA ]

☞ Software Engineering MCQs - Unit-1 - [ SE ]

☞ Software Engineering MCQs - Unit-2 - [ SE ]

☞ Software Engineering MCQs - Unit-3 - [ SE ]

☞ Software Engineering MCQs - Unit-4 - [ SE ]

☞ Software Engineering MCQs - Unit-5 - [ SE ]

☞ Data Mining MCQs - Unit-1 - [ DM ]

☞ Data Mining MCQs - Unit-2 - [ DM ]

☞ Data Mining MCQs - Unit-3 - [ DM ]

☞ Data Mining MCQs - Unit-4 - [ DM ]

☞ Data Mining MCQs - Unit-5 - [ DM ]

☞ Computer Organization and Architecture (COA) Objective Question Bank-Unit-1 - [ COA ]

☞ Computer Organization and Architecture (COA) Objective Question Bank-Unit-2 - [ COA ]

☞ Computer Organization and Architecture (COA) Objective Question Bank-Unit-3 - [ COA ]

☞ Computer Organization and Architecture (COA) Objective Question Bank-Unit-4 - [ COA ]

☞ Computer Organization and Architecture (COA) Objective Question Bank-Unit-5 - [ COA ]

☞ Data Structures Objective Type Question Bank-Unit-1 - [ DS ]

☞ Data Structures Objective Type Question Bank-Unit-2 - [ DS ]

☞ Data Structures Objective Type Question Bank-Unit-3 - [ DS ]

☞ Data Structures Objective Type Question Bank-Unit-4 - [ DS ]

☞ Data Structures Objective Type Question Bank-Unit-5 - [ DS ]

☞ Cyber Forensics Objective Type Question Bank-Part-2 - [ Cyber Forensics ]

☞ Cyber Forensics Objective Type Question Bank-Part-1 - [ Cyber Forensics ]

☞ Java Programming Objective Type Question Bank - [ Java Programming ]

☞ Java Programming Objective Type Questions-Part-1 - [ Java Programming ]

☞ Java Programming Objective Type Questions-Part-2 - [ Java Programming ]