Q#1: File organization in DBMS refers to:
(A) The way data is stored in a file on disk
(B) How tables are normalized
(C) How indexes are created
(D) How queries are written
Answer: (A) The way data is stored in a file on disk
Q#2: Which of the following is a type of file organization?
(A) Sequential
(B) Heap (unordered)
(C) Indexed
(D) All of the above
Answer: (D) All of the above
Q#3: Sequential file organization stores records:
(A) In a sorted order based on key
(B) Randomly
(C) Only by primary key
(D) Only by foreign key
Answer: (A) In a sorted order based on key
Q#4: Heap (unordered) file organization stores records:
(A) In no particular order
(B) Sorted by key
(C) Only by index
(D) Only by primary key
Answer: (A) In no particular order
Q#5: Indexed file organization stores:
(A) An index to allow fast access
(B) Only sequential data
(C) Only heap data
(D) Only temporary data
Answer: (A) An index to allow fast access
Q#6: Direct (hash) file organization accesses records:
(A) Using a hash function on key
(B) Sequentially
(C) Using B-Tree
(D) Using composite key
Answer: (A) Using a hash function on key
Q#7: In sequential file organization, search for a record is:
(A) Slow for large files
(B) Very fast for large files
(C) Random
(D) Impossible
Answer: (A) Slow for large files
Q#8: Heap file is suitable for:
(A) Frequent insertions
(B) Frequent sequential searches
(C) Sorted data only
(D) Only backups
Answer: (A) Frequent insertions
Q#9: Indexed file organization improves:
(A) Search performance
(B) Insertion speed always
(C) Data encryption
(D) Storage efficiency only
Answer: (A) Search performance
Q#10: Clustered file organization stores:
(A) Related records physically close
(B) Random records
(C) Only index entries
(D) Only keys
Answer: (A) Related records physically close
Q#11: Primary key indexing stores:
(A) Index on primary key
(B) Index on any column
(C) Only sequential data
(D) Only heap data
Answer: (A) Index on primary key
Q#12: Secondary key indexing stores:
(A) Index on non-primary key column
(B) Only primary key
(C) Only sequential data
(D) Only heap data
Answer: (A) Index on non-primary key column
Q#13: Multilevel index is used to:
(A) Reduce index search time for large files
(B) Encrypt data
(C) Normalize table
(D) Backup files
Answer: (A) Reduce index search time for large files
Q#14: Hash file organization is efficient for:
(A) Equality searches
(B) Range searches
(C) Sorting
(D) Aggregation
Answer: (A) Equality searches
Q#15: Sequential file is inefficient for:
(A) Frequent insertions and deletions
(B) Read-only operations
(C) Sorted queries
(D) Reports
Answer: (A) Frequent insertions and deletions
Q#16: Overflow area in hashing is used to:
(A) Store records that hash to an already filled location
(B) Store primary keys only
(C) Store sequential data
(D) Store index entries only
Answer: (A) Store records that hash to an already filled location
Q#17: Dense index contains:
(A) Index entry for every record
(B) Index entry for some records only
(C) Only primary key
(D) Only heap data
Answer: (A) Index entry for every record
Q#18: Sparse index contains:
(A) Index entry for some records only
(B) Index entry for every record
(C) Only primary key
(D) Only hash values
Answer: (A) Index entry for some records only
Q#19: Indexed sequential access method (ISAM) combines:
(A) Sequential and index access
(B) Only heap access
(C) Only sequential access
(D) Only hash access
Answer: (A) Sequential and index access
Q#20: Direct access file is also called:
(A) Random access file
(B) Sequential file
(C) Indexed file
(D) Overflow file
Answer: (A) Random access file
Q#21: File organization affects:
(A) Query performance
(B) Insertion/deletion speed
(C) Storage utilization
(D) All of the above
Answer: (D) All of the above
Q#22: Heap files are also called:
(A) Unordered files
(B) Sequential files
(C) Indexed files
(D) Clustered files
Answer: (A) Unordered files
Q#23: Sequential files are best for:
(A) Range queries
(B) Single record search
(C) Frequent insertion
(D) Only small files
Answer: (A) Range queries
Q#24: Hashing provides:
(A) Constant time access on average
(B) Sequential access
(C) Range queries
(D) Indexed scanning
Answer: (A) Constant time access on average
Q#25: Clustering factor in file organization indicates:
(A) How well related records are stored together
(B) How random records are
(C) How fast hashing works
(D) Index depth
Answer: (A) How well related records are stored together
Q#26: Overflow chaining in hash files helps to:
(A) Handle collisions
(B) Sort data
(C) Normalize table
(D) Encrypt database
Answer: (A) Handle collisions
Q#27: Multilevel indexing reduces:
(A) Number of disk accesses
(B) Storage only
(C) Redundancy
(D) Encryption overhead
Answer: (A) Number of disk accesses
Q#28: ISAM separates:
(A) Index and data area
(B) Only primary keys
(C) Only hash buckets
(D) Only leaf nodes
Answer: (A) Index and data area
Q#29: File organization choice depends on:
(A) Type of queries and frequency of insertions/deletions
(B) Database size only
(C) Normalization only
(D) Encryption only
Answer: (A) Type of queries and frequency of insertions/deletions
Q#30: Main goal of file organization is:
(A) Efficient storage and retrieval of data
(B) Encrypt data
(C) Normalize tables
(D) Backup database only
Answer: (A) Efficient storage and retrieval of data