Data Mining And Warehouse Set 7

Computer Science Engineering (CSE),

Common Topics in Competitive and Entrance exams

Practice Mode Previous Next
On This Page

This set of Data Mining and Data Warehouse Multiple Choice Questions & Answers (MCQs) focuses on Data Mining And Warehouse Set 7

Q1 | If a set is a frequent set and no superset of this set is a frequent set, then it is called ________.
  • maximal frequent set.
  • border set.
  • lattice.
  • infrequent sets.
Answer: maximal frequent set.
Q2 | Any subset of a frequent set is a frequent set. This is ___________.
  • upward closure property.
  • downward closure property.
  • maximal frequent set.
  • border set.
Answer: downward closure property.
Q3 | Any superset of an infrequent set is an infrequent set. This is _______.
  • maximal frequent set.
  • border set.
  • upward closure property.
  • downward closure property.
Answer: upward closure property.
Q4 | If an itemset is not a frequent set and no superset of this is a frequent set, then it is _______.
  • maximal frequent set
  • border set.
  • upward closure property.
  • downward closure property.
Answer: border set.
Q5 | A priori algorithm is otherwise called as __________.
  • width-wise algorithm.
  • level-wise algorithm.
  • pincer-search algorithm.
  • fp growth algorithm.
Answer: level-wise algorithm.
Q6 | The A Priori algorithm is a ___________.
  • top-down search.
  • breadth first search.
  • depth first search.
  • bottom-up search.
Answer: bottom-up search.
Q7 | The first phase of A Priori algorithm is _______.
  • candidate generation.
  • itemset generation.
  • pruning.
  • partitioning.
Answer: candidate generation.
Q8 | The second phaase of A Priori algorithm is ____________.
  • candidate generation.
  • itemset generation.
  • pruning.
  • partitioning.
Answer: pruning.
Q9 | The _______ step eliminates the extensions of (k-1)-itemsets which are not found to be frequent, frombeing considered for counting support.
  • candidate generation.
  • pruning.
  • partitioning.
  • itemset eliminations.
Answer: pruning.
Q10 | The a priori frequent itemset discovery algorithm moves _______ in the lattice.
  • upward.
  • downward.
  • breadthwise.
  • both upward and downward.
Answer: upward.
Q11 | After the pruning of a priori algorithm, _______ will remain.
  • only candidate set.
  • no candidate set.
  • only border set.
  • no border set.
Answer: no candidate set.
Q12 | The number of iterations in a priori ___________.
  • increases with the size of the maximum frequent set.
  • decreases with increase in size of the maximum frequent set.
  • increases with the size of the data.
  • decreases with the increase in size of the data.
Answer: increases with the size of the maximum frequent set.
Q13 | MFCS is the acronym of _____.
  • maximum frequency control set.
  • minimal frequency control set.
  • maximal frequent candidate set.
  • minimal frequent candidate set.
Answer: maximal frequent candidate set.
Q14 | Dynamuc Itemset Counting Algorithm was proposed by ____.
  • bin et al.
  • argawal et at.
  • toda et al.
  • simon et at.
Answer: bin et al.
Q15 | Itemsets in the ______ category of structures have a counter and the stop number with them.
  • dashed.
  • circle.
  • box.
  • solid.
Answer: dashed.
Q16 | The itemsets in the _______category structures are not subjected to any counting.
  • dashes.
  • box.
  • solid.
  • circle.
Answer: solid.
Q17 | Certain itemsets in the dashed circle whose support count reach support value during an iterationmove into the ______.
  • dashed box.
  • solid circle.
  • solid box.
  • none of the above.
Answer: dashed box.
Q18 | Certain itemsets enter afresh into the system and get into the _______, which are essentially thesupersets of the itemsets that move from the dashed circle to the dashed box.
  • dashed box.
  • solid circle.
  • solid box.
  • dashed circle.
Answer: dashed circle.
Q19 | The itemsets that have completed on full pass move from dashed circle to ________.
  • dashed box.
  • solid circle.
  • solid box.
  • none of the above.
Answer: solid circle.
Q20 | The FP-growth algorithm has ________ phases.
  • one.
  • two.
  • three.
  • four.
Answer: two.
Q21 | A frequent pattern tree is a tree structure consisting of ________.
  • an item-prefix-tree.
  • a frequent-item-header table.
  • a frequent-item-node.
  • both a & b.
Answer: both a & b.
Q22 | The non-root node of item-prefix-tree consists of ________ fields.
  • two.
  • three.
  • four.
  • five.
Answer: three.
Q23 | The frequent-item-header-table consists of __________ fields.
  • only one.
  • two.
  • three.
  • four.
Answer: two.
Q24 | The paths from root node to the nodes labelled 'a' are called __________.
  • transformed prefix path.
  • suffix subpath.
  • transformed suffix path.
  • prefix subpath.
Answer: prefix subpath.
Q25 | The transformed prefix paths of a node 'a' form a truncated database of pattern which co-occur with ais called _______.
  • suffix path.
  • fp-tree.
  • conditional pattern base.
  • prefix path.
Answer: conditional pattern base.
Previous Next