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                              
  • pinned
  • forced
  • buffer
  • all of the mentioned
Q2 | In case the buffer manager do not write the blocks properly then the buffer manager uses
  • replacement strategy
  • forced strategy
  • crash recovery system
  • both replacement and forced strategy
Q3 | The technique where the blocks which have been used are replaced is called
  • replacement strategy
  • forced strategy
  • crash recovery system
  • most recently used
Q4 |                                        frees the space occupied by a block as soon as the final tuple of that block has been processed.
  • replacement strategy
  • forced strategy
  • toss immediate strategy
  • most recently used
Q5 | Indices whose search key specifies an order different from the sequential order of the file are called                        indices.
  • nonclustered
  • secondary
  • all of the mentioned
  • none of the mentioned
Q6 | An                          consists of a search-key value and pointers to one or more records with that value as their search-key value.
  • index entry
  • index hash
  • index cluster
  • index map
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.
  • dense
  • sparse
  • straight
  • continuous
Q8 | In a                      index, an index entry appears for only some of the search-key values.
  • dense
  • sparse
  • straight
  • continuous
Q9 | A search key containing more than one attribute is referred to as a                    search key.
  • simple
  • composite
  • compound
  • secondary
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 :
  • less than 1
  • less than n
  • less than m
  • less than n/2
Q11 | A technique for direct search is
  • binary search
  • linear search
  • tree search
  • hashing
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.
  • 8, _, _, _, _, _, 10
  • 1, 8, 10, _, _, _, 3
  • 1, _, _, _, _, _,3
  • 1, 10, 8, _, _, _, 3
Q13 | Key value pairs is usually seen in
  • hash tables
  • heaps
  • both hash tables and heaps
  • skip list
Q14 | What is the best definition of a collision in a hash table?
  • two entries are identical except for their keys
  • two entries with different data have the exact same key
  • two entries with different keys have the same exact hash value
  • two entries with the exact same key have different hash values
Q15 | Which of the following scenarios leads to linear running time for a random search hit in a linear-probing hash table?
  • all keys hash to same index
  • all keys hash to different indices
  • all keys hash to an even-numbered index
  • all keys hash to different even-numbered indices
Q16 | Breadth First Search is used in
  • binary trees
  • stacks
  • graphs
  • all of the mentioned
Q17 | A(n)                    can be used to preserve the integrity of a document or a message.
  • message digest
  • message summary
  • encrypted message
  • none of the mentioned
Q18 | The property (or set of properties) that uniquely defines each row in a table is called the:
  • identifier
  • index
  • primary key
  • symmetric key
Q19 | The separation of the data definition from the program is known as:
  • data dictionary
  • data independence
  • data integrity
  • referential integrity
Q20 | The database design that consists of multiple tables that are linked together through matching data stored in each table is called
  • hierarchical database
  • network database
  • object oriented database
  • relational database
Q21 | The association role defines:
  • how tables are related in the database
  • the relationship between the class diagram and the tables in the database
  • the tables that each attribute is contained
  • which attribute is the table’s primary key
Q22 | A                on the attribute A of relation r consists of one bitmap for each value that A can take.
  • bitmap index
  • bitmap
  • index
  • array
Q23 | To identify the deleted records we use the
  • existence bitmap
  • current bitmap
  • final bitmap
  • deleted bitmap
Q24 | In B+ tree the node which points to another node is called
  • leaf node
  • external node
  • final node
  • internal node
Q25 | In the client / server model, the database:
  • is downloaded to the client upon request
  • is shared by both the client and server
  • resides on the client side
  • resides on the server side