Test my Merit My Results Create Exam

Higher Study | DBMS | File Organization and Indexing

Which of the following statements is false?
Suppose you have a Linux file system where the block size is 2K bytes, a disk address is 32 bits, and an i-node contains the disk addresses of the first 12 direct blocks of file, a single indirect block, and a double indirect block. Approximately, what is the largest file that can be represented by an i-node?  
Consider a table that describes the customers: Customers(custid, name, gender, rating) The rating value is an integer in the range 1 to 5 and only two values (male and female) are recorded for gender. Consider the query “how many male customers have a rating of 5”? The best indexing mechanism appropriate for the query is
Which of the following objects are data-independent and can provide security so as to restrict data access? A. Sequence B. Views C. Indexes
In which of the following hash functions, do consecutive keys map to consecutive hash values?
Which of the following function sets the position to a desired point in the file?
Which one of the following statements is NOT correct about the B+ tree data structure used for creating an index of a relational database table?
The order of a leaf node in a B+ tree is the maximum number of (value, data record pointer) pairs it can hold. Given that the block size is 1K bytes, data record pointer is 7 bytes long, the value field is 9 bytes long and a block pointer is 6 bytes long, what is the order of the leaf node?
Ads