======================================================================
DBMS MCQ QUESTIONS
MODEL PAPER – 3
=======================================================================
1. Which of the following is not a file organization
method in DBMS?
a. Heap (Unordered)
b. Sequential
c. Indexed Sequential
d. Binary Tree
Answer: d. Binary Tree
2. In which file organization
method are records stored in a random order?
a. Sequential
b. Heap (Unordered)
c. Indexed Sequential
d. Hashed
Answer: b. Heap (Unordered)
3. What is the main disadvantage
of sequential file organization?
a. Efficient for range queries
b. Slow access for individual record retrieval
c. Requires complex indexing
d. Limited storage capacity
Answer: b. Slow access for individual record retrieval
4. Which file organization method
uses an index table to speed up data retrieval?
a. Sequential
b. Heap (Unordered)
c. Indexed Sequential
d. Hashed
Answer: c. Indexed Sequential
5. What is the purpose of hashing
in file organization?
a. To arrange records in a sequential order
b. To create a tree structure for efficient retrieval
c. To convert a key into an address for direct access
d. To encrypt sensitive data
Answer: c. To convert a key into an address for direct access
6. Which of the following is an
advantage of the indexed file organization?
a. Efficient for range queries
b. No need for an index table
c. Records are stored in a random order
d. Limited search capabilities
Answer: a. Efficient for range queries
7. What is a primary consideration when choosing
a file organization method?
a. Cost of storage
b. Type of data
c. Speed of retrieval
d. Encryption requirements
Answer: c. Speed of retrieval
8. In which file organization method are records
stored in a sorted order based on a key field?
a. Heap (Unordered)
b. Sequential
c. Hashed
d. Clustering
Answer: b. Sequential
9. What is the disadvantage of the hashed file
organization?
a. Efficient for range queries
b. Limited search capabilities
c. Slow access for individual record retrieval
d. Requires a complex indexing structure
Answer: b. Limited search capabilities
10. Which file organization
method is suitable for applications where data is constantly inserted and
deleted?
a. Sequential
b. Heap (Unordered)
c. Indexed Sequential
d. Hashed
Answer: d. Hashed
11. What is the primary advantage
of the clustered file organization?
a. Efficient for range queries
b. Fast access for individual record retrieval
c. No need for an index table
d. Random arrangement of records
Answer: b. Fast access for individual record retrieval
12. In the context of file organization, what does
"clustering" refer to?
a. Grouping related records together based on a clustering key
b. Random distribution of records in the file
c. Sorting records in ascending order based on a key
d. Encrypting records for security purposes
Answer: a. Grouping related records together based on a clustering key
13. Which file organization method supports direct
access without the need for sequential scanning or an index table?
a. Sequential
b. Heap (Unordered)
c. Hashed
d. Clustering
Answer: c. Hashed
14. What is the primary purpose of a master file
in a database system?
a. To store temporary data
b. To store metadata about the database
c. To store the main data used in the application
d. To store backup copies of the database
Answer: c. To store the main data used in the application
15. Which file organization method is commonly
used in databases where records are fixed in length?
a. Sequential
b. Heap (Unordered)
c. Indexed Sequential
d. Hashed
Answer: a. Sequential
16. What is the disadvantage of the heap (unordered)
file organization?
a. Efficient for range queries
b. Random arrangement of records
c. Requires a complex indexing structure
d. Slow access for individual record retrieval
Answer: d. Slow access for individual record retrieval
17. What is the purpose of a clustering key in the
clustered file organization?
a. To encrypt sensitive data
b. To group related records together
c. To sort records in ascending order
d. To generate unique identifiers
Answer: b. To group related records together
18. Which file organization
method is suitable for applications that require efficient range queries and
data retrieval in a sorted order?
a. Sequential
b. Heap (Unordered)
c. Indexed Sequential
d. Clustering
Answer: c. Indexed Sequential
19. What is a primary
consideration when choosing a hashing function for a hashed file organization?
a. Cost of storage
b. Type of data
c. Collision resolution
d. Speed of retrieval
Answer: c. Collision resolution
20. Which file organization
method is commonly used in databases where records are of variable length?
a. Sequential
b. Heap (Unordered)
c. Indexed Sequential
d. Hashed
Answer: c. Indexed Sequential
21. What is a disadvantage of the indexed sequential file organization
compared to the sequential file organization?
a. Faster access for individual record retrieval
b. More efficient for range queries
c. Requires additional space for the index
d. Suitable for applications with constant data inserts and deletes
Answer: c. Requires additional space for the index
22. Which file organization
method is often used for hash joins in query processing?
a. Sequential
b. Heap (Unordered)
c. Hashed
d. Clustering
Answer: c. Hashed
23. In the context of file
organization, what does "overflow" refer to?
a. A condition where records are stored in a random order
b. The process of rearranging records in ascending order
c. A situation where there is no more space in the file for additional
records
d. The grouping of related records together based on a clustering
key
Answer: c. A situation where there is no more space in the file for
additional records
24. What is the primary advantage
of the clustered file organization over the indexed sequential file
organization?
a. More efficient for range queries
b. Faster access for individual record retrieval
c. Requires less storage space
d. Suitable for applications with constant data inserts and deletes
Answer: b. Faster access for individual record retrieval
25. Which of the following is a
characteristic of a good hashing function in file organization?
a. Produces the same hash value for different keys
b. Causes frequent collisions
c. Distributes keys uniformly across the address space
d. Requires a large index table
Answer: c. Distributes keys uniformly across the address space
26. What is the primary purpose
of the overflow area in a hashed file organization?
a. To store backup copies of records
b. To store records that do not fit in the main file
c. To store temporary data
d. To store metadata about the database
Answer: b. To store records that do not fit in the main file
27. Which file organization
method is commonly used for multimedia databases?
a. Sequential
b. Heap (Unordered)
c. Indexed Sequential
d. Clustering
Answer: a. Sequential
28. What is the role of the
directory in a hierarchical file organization?
a. To store metadata about the database
b. To organize records in a random order
c. To link records in a tree-like structure
d. To group related records together based on a clustering key
Answer: c. To link records in a tree-like structure
29. In which file organization
method are records physically stored in adjacent locations on the storage
medium?
a. Sequential
b. Heap (Unordered)
c. Indexed Sequential
d. Clustering
Answer: a. Sequential
30. What is the primary
purpose of free space management in a file organization?
a. To store temporary data
b. To organize records in a random order
c. To manage available space for new records
d. To store metadata about the database
Answer: c. To manage available space for new records
31. Which file organization
method uses a dynamic structure that can be adjusted as records are added or
removed?
a. Sequential
b. Heap (Unordered)
c. Indexed Sequential
d. Dynamic Clustering
Answer: d. Dynamic Clustering
32. In a direct file
organization, how is the record address determined?
a. Using a clustering key
b. Through a hashing function
c. Sequentially based on record order
d. Using an index table
Answer: b. Through a hashing function
33. What is the primary
disadvantage of a dynamic file organization compared to a fixed file
organization?
a. Improved efficiency for range queries
b. Reduced storage space requirements
c. Increased complexity in addressing and storage management
d. Faster access for individual record retrieval
Answer: c. Increased complexity in addressing and storage management
34. Which of the following is a
common approach for collision resolution in hashing?
a. Linear Probing
b. Heap Sort
c. Depth-First Search
d. Radix Tree
Answer: a. Linear Probing
35. In a multi-level index,
what is the purpose of the upper-level index?
a. To store metadata about the database
b. To provide a fast access path to the lower-level index
c. To organize records in a random order
d. To group related records together based on a clustering key
Answer: b. To provide a fast access path to the lower-level index
36. What is the primary advantage
of a multi-level index over a single-level index?
a. Reduced storage space requirements
b. Improved efficiency for range queries
c. Faster access for individual record retrieval
d. Increased complexity in addressing and storage management
Answer: a. Reduced storage space requirements
37. Which file organization
method is most suitable for applications with frequent data inserts and
deletes?
a. Sequential
b. Heap (Unordered)
c. Indexed Sequential
d. Dynamic Clustering
Answer: d. Dynamic Clustering
38. In a clustered file
organization, what is the role of the clustering key?
a. To store metadata about the database
b. To organize records in a random order
c. To group related records together
d. To provide a fast access path to the records
Answer: c. To group related records together
39. What is the primary purpose
of the merge phase in external sorting?
a. To organize records in ascending order
b. To group related records together based on a clustering key
c. To eliminate duplicate records
d. To combine sorted subfiles into a single sorted file
Answer: d. To combine sorted subfiles into a single sorted file
40. Which file organization
method is commonly used for large-scale distributed databases?
a. Sequential
b. Heap (Unordered)
c. Indexed Sequential
d. Distributed Hashing
Answer: d. Distributed Hashing
41. What is the primary advantage
of the B-tree index structure?
a. Reduced storage space requirements
b. Improved efficiency for range queries
c. Faster access for individual record retrieval
d. Increased complexity in addressing and storage management
Answer: b. Improved efficiency for range queries
42. In the context of a B-tree,
what is a node?
a. A leaf in the tree
b. A non-leaf in the tree
c. An external storage location
d. A data record
Answer: b. A non-leaf in the tree
43. What is the purpose of a
primary index in a file organization?
a. To provide a fast access path to the records
b. To group related records together based on a clustering key
c. To store metadata about the database
d. To organize records in ascending order
Answer: a. To provide a fast access path to the records
44. Which file organization
method is often used for data warehouses and decision support systems?
a. Sequential
b. Heap (Unordered)
c. Indexed Sequential
d. Star Schema
Answer: d. Star Schema
45. What is the primary advantage
of the star schema in data warehousing?
a. Reduced storage space requirements
b. Improved efficiency for range queries
c. Faster access for individual record retrieval
d. Simplified and efficient querying for analytical purposes
Answer: d. Simplified and efficient querying for analytical purposes
46. In a hash index, what is the
role of the hash function?
a. To organize records in a random order
b. To group related records together
c. To provide a fast access path to the records
d. To distribute keys uniformly across the address space
Answer: d. To distribute keys uniformly across the address space
47. Which file organization
method is commonly used for data that is continuously updated and accessed by multiple users simultaneously?
a. Sequential
b. Heap (Unordered)
c. Indexed Sequential
d. Multiversion Concurrency Control
Answer: d. Multiversion Concurrency Control
48. What is the primary purpose
of the transaction log in a database system?
a. To store metadata about the database
b. To organize records in a random order
c. To group related records together based on a clustering key
d. To provide a record of changes made to the database for recovery
purposes
Answer: d. To provide a record of changes made to the database for
recovery purposes
49. In a distributed database,
what is the role of the data dictionary?
a. To provide a fast access path to the records
b. To store metadata about the database
c. To group related records together based on a clustering key
d. To organize records in ascending order
Answer: b. To store metadata about the database
50. What is the primary purpose of data
replication in a distributed database system?
a. To reduce storage space requirements
b. To improve efficiency for range queries
c. To ensure data consistency and availability
d. To increase complexity in addressing and storage management
Answer: c. To ensure data consistency and availability
=====================================================================
0 Comments