Data Mining and Data Warehouse MCQs with answers Page - 16

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. Any subset of a frequent set is a frequent set. This is ___________.

  • (A) upward closure property.
  • (B) downward closure property.
  • (C) maximal frequent set.
  • (D) border set.

A

Admin • 828.03K Points
Coach

Q. Any superset of an infrequent set is an infrequent set. This is _______.

  • (A) maximal frequent set.
  • (B) border set.
  • (C) upward closure property.
  • (D) downward closure property.

A

Admin • 828.03K Points
Coach

Q. If an itemset is not a frequent set and no superset of this is a frequent set, then it is _______.

  • (A) maximal frequent set
  • (B) border set.
  • (C) upward closure property.
  • (D) downward closure property.

A

Admin • 828.03K Points
Coach

Q. A priori algorithm is otherwise called as __________.

  • (A) width-wise algorithm.
  • (B) level-wise algorithm.
  • (C) pincer-search algorithm.
  • (D) fp growth algorithm.

A

Admin • 828.03K Points
Coach

Q. The A Priori algorithm is a ___________.

  • (A) top-down search.
  • (B) breadth first search.
  • (C) depth first search.
  • (D) bottom-up search.

A

Admin • 828.03K Points
Coach

Q. The first phase of A Priori algorithm is _______.

  • (A) candidate generation.
  • (B) itemset generation.
  • (C) pruning.
  • (D) partitioning.

A

Admin • 828.03K Points
Coach

Q. The second phaase of A Priori algorithm is ____________.

  • (A) candidate generation.
  • (B) itemset generation.
  • (C) pruning.
  • (D) partitioning.

A

Admin • 828.03K Points
Coach

Q. The _______ step eliminates the extensions of (k-1)-itemsets which are not found to be frequent, from being considered for counting support.

  • (A) candidate generation.
  • (B) pruning.
  • (C) partitioning.
  • (D) itemset eliminations.

A

Admin • 828.03K Points
Coach

Q. The a priori frequent itemset discovery algorithm moves _______ in the lattice.

  • (A) upward.
  • (B) downward.
  • (C) breadthwise.
  • (D) both upward and downward.

A

Admin • 828.03K Points
Coach

Q. After the pruning of a priori algorithm, _______ will remain.

  • (A) only candidate set.
  • (B) no candidate set.
  • (C) only border set.
  • (D) no border set.

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.