Professional Documents
Culture Documents
DWDM MCQ Questions
DWDM MCQ Questions
Q1. Which of the following methods do we use to find the best fit line for data in Linear Regression?
Ans=(a)
Q2.______ refers loosely to the process of semi-automatically analyzing large databases to find useful
patterns.
Ans= (a)
S1: Data scrubbing is a process to upgrade the quality of data, before it is moved into data warehouse.
S2: Data scrubbing is a process of rejecting data from data warehouse to create indexes.
(a)S1 true, S2 false (b)S1 false, S2 true (c) both S1 and S2 false (d)both S1 and S2 true
Ans= (a)
Q4. The most common source of change data in refreshing a data warehouse is:
(a) Queryable change data
(b) Cooperative change data
(c) Logged change data
(d) Snapshot change data
Ans: (d)
Q6. Data warehouse contains ……………. data that is never found in the operational environment.
A) normalized
B) informational
C) summary
D) denormalized
Ans= (c)
And= (d)
Q10. …………………….. supports basic OLAP operations, including slice and dice, drill-down, roll-
up and pivoting.
A) Information processing
B) Analytical processing
C) Data mining
D) Transaction processing
Ans= (b)
Q11. The data from the operational environment enter …………………… of data warehouse.
A) Current detail data
B) Older detail data
C) Lightly Summarized data
D) Highly summarized data
Ans= (a)
(a) OLTP (b) OLAP (c) Data system (d) Market system
Ans= (b)
Q14. A data cube C, has n dimensions and each dimensions has exactly p distinct values in the base
cuboid. Assume that there are no concept hierarchies associated with the dimensions. What is the
maximum number of cells possible in the data cube, C ?
Ans= (d)
Q15. Which of the following features usually applies to data in a data warehouse?
(a) Data are often deleted
(b) Most applications consist of transactions
(c) Data are rarely deleted
(d) Relatively few records are processed by applications
Ans: (c)
Q17. Which technique finds the frequent itemsets in just two database scans?
(a) Partitioning
(b) Sampling
(c) Hashing
(d) Dynamic itemset counting
Ans: (a)
Q20. The..............step eliminates the extensions of (k-1)-itemsets which are not found to be frequent
from being considered for counting support
Ans= (d)
Ans= (a)
(a)only measures (b)only dimensions (c)keys and measures (d)only surrogate keys
Ans= (b)
Q23. In a rule based classifier, if there is a rule for each combination of attribute values, what do you
call that rule set R
Ans= (a)
Q24. If two variables V1 and V2, are used for clustering. Which of the following are true for K means
clustering with k =3?
(a) 1 only (b) 2 only (c) 1 and 2 (d) None of the above
Ans=(a)
Q25. Repository of information gathered from multiple sources , storing under unified scheme at a
single site is known as
Ans= (c)
Q26. Which of the following clustering algorithms suffers from the problem of convergence at local
optima?
(a) 1 &3 (b) 2 & 3 (c) 1,2 & 4 (d) all of above
Ans=(d)
Q27. Feature scaling is an important step before applying K-Mean algorithm. What is reason behind
this?
(a) In distance calculation it will give the same weights for all features
(b) You always get the same clusters. If you use or don’t use feature scaling
(c) In Manhattan distance it is an important step but in Euclidian it is not
(d) None of these
Ans=(a)
Ans=(a)
Q29.Which of the following evaluation metrics can be used to evaluate a model while modeling a
continuous output variable?
A) AUC-ROC
B) Accuracy
C) Logloss
D) Mean-Squared-Error
Ans=(d)
Q30. When you find noise in data which of the following option would you consider in k-NN?
Ans=(a)