DBMS-Physical Data Organization Questions and Answers
DBMS Physical Data Organization questions with answers are vital for computer science students and aspirants preparing for placement exams by TCS, Infosys, Wipro, and government technical tests. This topic explains how databases store, retrieve, and manage data efficiently using file structures, indexing, and hashing techniques. By practicing these database MCQs, candidates can enhance their understanding of data access mechanisms, record organization, and storage optimization. Each question is designed to test conceptual clarity and practical application, making this an ideal resource for programming and DBMS interview preparation.
DBMS-Physical Data Organization
Showing 10 of
72 questions
41. In a block-level stripping, splitting of blocks is done across multiple disks and it treats the array of disks as a single large disk.
- TRUE
- FALSE
42. B+-tree index is a balanced tree in which the internal nodes direct the search operation and the leaf nodes contain the data entries.
- TRUE
- FALSE
43. If data are stored sequentially on a magnteic tape, they are ideal for:
- on-line applications
- batch processing applications
- spreadsheet applications
- decision-making applications.
44. Compared to the main memory, secondary memory is:
- costly
- volatile
- faster
- none of these
45. Secondary storage devices are used for:
- backup of data
- permanent data storage
46. Which of the following is direct access processing method?
- relative addressing
- indexing
- hashing
- all of these
47. Compared to the main memory, secondary memory is:
- costly
- volatile
- faster
- none of these
48. A file contains the following that is needed for information processing:
- Knowledge
- Instructions
- data
- none of these
49. Which of the following is a valid file type?
- master file
- report file
- transaction file
- none of these
50. Which of the following stores data that is permanent in nature?
- transaction file
- master file
- report file
- none of these