Top 350+ Solved Data Mining and Data Warehouse MCQ Questions Answer
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.
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.
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.
Q. A priori algorithm is otherwise called as __________.
a. width-wise algorithm.
b. level-wise algorithm.
c. pincer-search algorithm.
d. fp growth algorithm.
Q. The A Priori algorithm is a ___________.
a. top-down search.
b. breadth first search.
c. depth first search.
d. bottom-up search.
Q. The first phase of A Priori algorithm is _______.
a. candidate generation.
b. itemset generation.
c. pruning.
d. partitioning.
Q. The second phaase of A Priori algorithm is ____________.
a. candidate generation.
b. itemset generation.
c. pruning.
d. partitioning.
Q. The _______ step eliminates the extensions of (k-1)-itemsets which are not found to be frequent, frombeing considered for counting support.
a. candidate generation.
b. pruning.
c. partitioning.
d. itemset eliminations.
Q. The a priori frequent itemset discovery algorithm moves _______ in the lattice.
a. upward.
b. downward.
c. breadthwise.
d. both upward and downwar
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.
Q. The number of iterations in a priori ___________.
a. increases with the size of the maximum frequent set.
b. decreases with increase in size of the maximum frequent set.
c. increases with the size of the data.
d. decreases with the increase in size of the data.
Q. MFCS is the acronym of _____.
a. maximum frequency control set.
b. minimal frequency control set.
c. maximal frequent candidate set.
d. minimal frequent candidate set.
Q. Dynamuc Itemset Counting Algorithm was proposed by ____.
a. bin et al.
b. argawal et at.
c. toda et al.
d. simon et at.
Q. Itemsets in the ______ category of structures have a counter and the stop number with them.
a. dashed.
b. circle.
c. box.
d. soli
Q. The itemsets in the _______category structures are not subjected to any counting.
a. dashes.
b. box.
c. solid.
d. circle.