File Organization GATE CS PYQ Quiz

Last Updated :
Discuss
Comments

Question 1

A FAT (file allocation table) based file system is being used and the total overhead of each entry in the FAT is 4 bytes in size. Given a 100 x 106 bytes disk on which the file system is stored and data block size is 103 bytes, the maximum size of a file that can be stored on this disk in units of 106 bytes is ____________.

  • 99.55 to 99.65

  • 100.5 to 101.4

  • 97.2 to 98.5

  • 89.1 to 91.2

Question 2

A file is organized so that the ordering of data records is the same as or close to the ordering of data entries in some index. Then that index is called

  • Dense

  • Sparse

  • Clustered

  • Unclustered

Question 3

A data file consisting of 1,50,000 student-records is stored on a hard disk with block size of 4096 bytes. The data file is sorted on the primary key RollNo. The size of a record pointer for this disk is 7 bytes. Each student-record has a candidate key attribute called ANum of size 12 bytes. Suppose an index file with records consisting of two fields, ANum value and the record pointer the corresponding student record, is built and stored on the same disk. Assume that the records of data file and index file are not split across disk blocks. The number of blocks in the index file is ________ .

  • 698

  • 898

  • 899

  • 4096

Question 4

In a file allocation system, which of the following allocation scheme(s) can be used if no external fragmentation is allowed?




I. Contiguous


II. Linked


III. Indexed

  • I and III only

  • II only

  • III only

  • II and III only

Question 5

Consider a database of fixed-length records, stored as an ordered file.  The database has  25,000  records,  with each record being 100  bytes,  of which the primary key occupies  15  bytes.  The data file is block-aligned in that  each  data record is fully contained within a  block.  The database is indexed by a  primary index file,  which is also stored as  a  block-aligned ordered file.  The  figure below  depicts  this  indexing scheme

Tree

Suppose the block size of the file system is 1024 bytes, and a pointer to a block occupies 5 bytes. The system uses binary search on the index file to search for a record with a given key. You may assume that a binary search on an index file of b blocks takes log b block accesses in the worst case.

Given a key, the number of block accesses required to identify the block in the data file that may contain a record with the key, in the worst case, is ____________

  • 1

  • 6

  • 3

  • 4

Question 6

Which of the following file organizations is/are I/O efficient for the scan operation in DBMS?

  • Sorted

  • Heap

  • Unclustered tree index

  • Unclustered hash index

There are 6 questions to complete.

Take a part in the ongoing discussion