Computer Science - Computer Fundamentals - Discussion
Discussion Forum : Computer Fundamentals - Section 15 (Q.No. 18)
18.
Which of the following file organizations is most efficient for a file with a high degree of file activity?
Discussion:
2 comments Page 1 of 1.
Jeftha Dkhar Dann said:
2 months ago
The correct answer is: VSAM.
Explanation:
VSAM (Virtual Storage Access Method) → Designed by IBM for high-performance file access, especially for files with frequent updates, insertions, and deletions.
Sequential files → Efficient for reading all records in order, not for high activity.
ISAM (Indexed Sequential Access Method) → Better than sequential, but less flexible than VSAM for high activity.
B-Tree index → Used for indexing, but VSAM is a full file organisation method optimised for high activity.
So, for files with high activity, VSAM is the most efficient.
Explanation:
VSAM (Virtual Storage Access Method) → Designed by IBM for high-performance file access, especially for files with frequent updates, insertions, and deletions.
Sequential files → Efficient for reading all records in order, not for high activity.
ISAM (Indexed Sequential Access Method) → Better than sequential, but less flexible than VSAM for high activity.
B-Tree index → Used for indexing, but VSAM is a full file organisation method optimised for high activity.
So, for files with high activity, VSAM is the most efficient.
Shewangizaw Bogale said:
9 years ago
ISAM (Indexed Sequential Access Method) is a file management system developed at IBM that allows records to be accessed either sequentially (in the order they were entered) or randomly (with an index), so as per the definition, for a file with a high degree of file activity ISAM is more efficient than Sequential Access Method. B/c ISAM contains both Access methods.
Post your comments here:
Quick links
Quantitative Aptitude
Verbal (English)
Reasoning
Programming
Interview
Placement Papers