Database Management System Set 21

Computer Science Engineering (CSE),

Bachelor of Science in Computer Science FY (BSc CS),

Bachelor of Science in Computer Science SY (BSc CS),

Bachelor of Science in Information Technology SY (BSc IT),

Bachelor of Computer Applications (BCA),

Bachelor of Business Administration in Computer Applications (BBA [CA]),

Bachelor of Science in Information Technology (BSc IT),

Bachelor of Science in Computer Science (BSc CS),

Master of Business Administration (MBA)

Learning Mode Previous Next
On This Page

This set of DataBase Management System (DBMS) Multiple Choice Questions & Answers (MCQs) focuses on Database Management System Set 21

Q1 | A block that is not allowed to be written back to disk is said to be                              
Q2 | In case the buffer manager do not write the blocks properly then the buffer manager uses
Q3 | The technique where the blocks which have been used are replaced is called
Q4 |                                        frees the space occupied by a block as soon as the final tuple of that block has been processed.
Q5 | Indices whose search key specifies an order different from the sequential order of the file are called                        indices.
Q6 | An                          consists of a search-key value and pointers to one or more records with that value as their search-key value.
Q7 | In a                clustering index, the index record contains the search-key value and a pointer to the first data record with that search-key value and the rest of the records will be in the sequential pointers.
Q8 | In a                      index, an index entry appears for only some of the search-key values.
Q9 | A search key containing more than one attribute is referred to as a                    search key.
Q10 | If h is any hashing function and is used to hash n keys in to a table of size m, where n<=m, the expected number of collisions involving a particular key x is :
Q11 | A technique for direct search is
Q12 | Consider a hash table of size seven, with starting index zero, and a hash function (3x + 4)mod7. Assuming the hash table is initially empty, which of the following is the contents of the table when the sequence 1, 3, 8, 10 is inserted into the table using closed hashing? Note that ‘_’ denotes an empty location in the table.
Q13 | Key value pairs is usually seen in
Q14 | What is the best definition of a collision in a hash table?
Q15 | Which of the following scenarios leads to linear running time for a random search hit in a linear-probing hash table?
Q16 | Breadth First Search is used in
Q17 | A(n)                    can be used to preserve the integrity of a document or a message.
Q18 | The property (or set of properties) that uniquely defines each row in a table is called the:
Q19 | The separation of the data definition from the program is known as:
Q20 | The database design that consists of multiple tables that are linked together through matching data stored in each table is called
Q21 | The association role defines:
Q22 | A                on the attribute A of relation r consists of one bitmap for each value that A can take.
Q23 | To identify the deleted records we use the
Q24 | In B+ tree the node which points to another node is called
Q25 | In the client / server model, the database:
Previous Next