Data Mining and Data Warehouse MCQs with answers Page - 15

Here, you will find a collection of MCQ questions on Data Mining and Data Warehouse. 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 • 828.03K Points
Coach

Q. The proportion of transaction supporting X in T is called _________.

  • (A) confidence.
  • (B) support.
  • (C) support count.
  • (D) all of the above.

A

Admin • 828.03K Points
Coach

Q. The absolute number of transactions supporting X in T is called ___________.

  • (A) confidence.
  • (B) support.
  • (C) support count.
  • (D) none of the above.

A

Admin • 828.03K Points
Coach

Q. The value that says that transactions in D that support X also support Y is called ______________.

  • (A) confidence.
  • (B) support.
  • (C) support count.
  • (D) none of the above.

A

Admin • 828.03K Points
Coach

Q. If T consist of 500000 transactions, 20000 transaction contain bread, 30000 transaction contain jam, 10000 transaction contain both bread and jam. Then the support of bread and jam is _______.

  • (A) 2%
  • (B) 20%
  • (C) 3%
  • (D) 30%

A

Admin • 828.03K Points
Coach

Q. 7 If T consist of 500000 transactions, 20000 transaction contain bread, 30000 transaction contain jam, 10000 transaction contain both bread and jam. Then the confidence of buying bread with jam is _______.

  • (A) 33.33%
  • (B) 66.66%
  • (C) 45%
  • (D) 50%

A

Admin • 828.03K Points
Coach

Q. The left hand side of an association rule is called __________.

  • (A) consequent.
  • (B) onset.
  • (C) antecedent.
  • (D) precedent.

A

Admin • 828.03K Points
Coach

Q. The right hand side of an association rule is called _____.

  • (A) consequent.
  • (B) onset.
  • (C) antecedent.
  • (D) precedent.

A

Admin • 828.03K Points
Coach

Q. Which of the following is not a desirable feature of any efficient algorithm?

  • (A) to reduce number of input operations.
  • (B) to reduce number of output operations.
  • (C) to be efficient in computing.
  • (D) to have maximal code length.

A

Admin • 828.03K Points
Coach

Q. All set of items whose support is greater than the user-specified minimum support are called as _____________.

  • (A) border set.
  • (B) frequent set.
  • (C) maximal frequent set.
  • (D) lattice.

A

Admin • 828.03K Points
Coach

Q. If a set is a frequent set and no superset of this set is a frequent set, then it is called ________.

  • (A) maximal frequent set.
  • (B) border set.
  • (C) lattice.
  • (D) infrequent sets.

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.