Database Management System (DBMS) MCQs with answers Page - 74

Here, you will find a collection of MCQ questions on Database Management System (DBMS). Go through these questions to enhance your preparation for upcoming examinations and interviews.

To check the correct answer, simply click the View Answer button provided for each question.

Have your own questions to contribute? Click the button below to share your MCQs with others!

+ Add Question

A

Admin • 833.24K Points
Coach

Q. 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 :

  • (A) less than 1
  • (B) less than n
  • (C) less than m
  • (D) less than n/2

A

Admin • 833.24K Points
Coach

Q. 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.

  • (A) 8, _, _, _, _, _, 10
  • (B) 1, 8, 10, _, _, _, 3
  • (C) 1, _, _, _, _, _,3
  • (D) 1, 10, 8, _, _, _, 3

A

Admin • 833.24K Points
Coach

Q. Key value pairs is usually seen in

  • (A) hash tables
  • (B) heaps
  • (C) both hash tables and heaps
  • (D) skip list

A

Admin • 833.24K Points
Coach

Q. What is the best definition of a collision in a hash table?

  • (A) two entries are identical except for their keys
  • (B) two entries with different data have the exact same key
  • (C) two entries with different keys have the same exact hash value
  • (D) two entries with the exact same key have different hash values

A

Admin • 833.24K Points
Coach

Q. Which of the following scenarios leads to linear running time for a random search hit in a linear-probing hash table?

  • (A) all keys hash to same index
  • (B) all keys hash to different indices
  • (C) all keys hash to an even-numbered index
  • (D) all keys hash to different even-numbered indices

A

Admin • 833.24K Points
Coach

Q. Breadth First Search is used in

  • (A) binary trees
  • (B) stacks
  • (C) graphs
  • (D) all of the mentioned

A

Admin • 833.24K Points
Coach

Q. A(n) can be used to preserve the integrity of a document or a message.

  • (A) message digest
  • (B) message summary
  • (C) encrypted message
  • (D) none of the mentioned

A

Admin • 833.24K Points
Coach

Q. In E-R diagram generalization is represented by

  • (A) ellipse
  • (B) dashed ellipse
  • (C) rectangle
  • (D) triangle

A

Admin • 833.24K Points
Coach

Q. What is a relationship called when it is maintained between two entities?

  • (A) unary
  • (B) binary
  • (C) ternary
  • (D) quaternary

A

Admin • 833.24K Points
Coach

Q. Which of the following is a low level operator?

  • (A) insert
  • (B) update
  • (C) delete
  • (D) directory

Add MCQ in this Category

If you want to share an MCQ question in this category, it's a great idea! It will be helpful for many other students using this website.

Share Your MCQ

Browse Categories

Click on category to learn MCQs of that category.