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

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. A index is the one which satisfies all the columns requested in the query without performing further lookup into the clustered index.

  • (A) clustered
  • (B) non clustered
  • (C) covering
  • (D) b-tree

A

Admin • 833.24K Points
Coach

Q. Which of the following is an attribute that can uniquely identify a row in a table?

  • (A) secondary key
  • (B) candidate key
  • (C) foreign key
  • (D) alternate key

A

Admin • 833.24K Points
Coach

Q. The relationship between DEPARTMENT and EMPLOYEE is a

  • (A) one-to-one relationship
  • (B) one-to-many relationship
  • (C) many-to-many relationship
  • (D) many-to-one relationship

A

Admin • 833.24K Points
Coach

Q. In query processing, the is the lowest-level operator to access data.

  • (A) index search
  • (B) linear search
  • (C) file scan
  • (D) access paths

A

Admin • 833.24K Points
Coach

Q. In a the system scans each file block and tests all records to see whether they satisfy the selection condition.

  • (A) index search
  • (B) linear search
  • (C) file scan
  • (D) access paths

A

Admin • 833.24K Points
Coach

Q. Which algorithm uses equality comparison on a key attribute with a primary index to retrieve a single record that satisfies the corresponding equality condition.

  • (A) a2
  • (B) a4
  • (C) a5
  • (D) a6

A

Admin • 833.24K Points
Coach

Q. The strategy can retrieve a single record if the equality condition is on a key; multiple records may be retrieved if the indexing field is not a key is

  • (A) a2
  • (B) a4
  • (C) a5
  • (D) a6

A

Admin • 833.24K Points
Coach

Q. The algorithm that uses a secondary ordered index to guide retrieval for comparison conditions involving <,≤,≥, or > is

  • (A) a2
  • (B) a4
  • (C) a5
  • (D) a6

A

Admin • 833.24K Points
Coach

Q. The algorithm scans each index for pointers to tuples that satisfy an individual condition.

  • (A) a2
  • (B) a4
  • (C) a9
  • (D) a6

A

Admin • 833.24K Points
Coach

Q. If access paths are available on all the conditions of a disjunctive selection, each index is scanned for pointers to tuples that satisfy the individual condition. This is satisfied by

  • (A) a10
  • (B) a7
  • (C) a9
  • (D) a6

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