Beruflich Dokumente
Kultur Dokumente
COLLEGE
SRM Nagar, Kattankulathur – 603 203
DEPARTMENT OF
COMPUTER SCIENCE ANDENGINEERING
QUESTION BANK
VIII SEMESTER
Regulation – 2013
Prepared by
PART – A
Q.No Question Competence Level
1 List the main characteristics of Big Data. Remember BTL 1
2 Differentiate Big Data and Conventional Data. Understand BTL 2
3 List the various dimensions of growth of Big Data. Remember BTL 1
4 List the advantage of using a Massive Parallel Processing system. Remember BTL 1
Show why Artificial Neural Networks are not commonly used for
5 Apply BTL 3
Data Mining tasks.
6 Examine why do you use inferential statistics in Big data. Remember BTL 1
PART-B
Q.No. Question Competence Level
i. What is Bigdata? Describe the main features of a data analytical Remember BTL 1
1 system? (6)
ii. Describe in detail about the role of statistical models in Big
data. (7)
i. List the main characteristics ofbigdata. (4) Remember BTL 1
2 ii Describe big data architecture with a neat schematic diagram.(9).
3 Formulate the different statistical concepts in inference (13)
Create BTL 6
PART-B
Q.No. Question Competence Level
2 Give a short note on Data Analysis and its Importance. (13) Understand BTL 2
3 i. Assess when do we use multivariate analysis. (5) Evaluate BTL 5
ii. Explain in detail about the various Multivariate
Analysis Techniques with examples. (8)
i. What is the main idea of analyzing time series? (5) Understand BTL 2
4
ii. Distinguish between linear and non-linear dynamics in brief.(8)
i. Analyse and write a short note on BayesianDataAnalysis. (8) Analyze BTL 4
5
ii. Explain Bayesian Inference process in detail. (5)
Point out some of the applications of Data Analysis and its impact on Analyze BTL 4
6
various fields. (13)
i. What are prediction error?. (4) Remember BTL 1
7 ii. State and explain the prediction error in regression and
classification with suitable example. (9)
i. Identify the different mechanisms needed for learning. (6) Apply BTL 3
8 ii. How do use the generalization techniques neededto
Illustrate neural networks? (7)
List the types of evolution strategies in search analysis and Remember BTL 1
9
explain in detail. (13)
i.Distinguish between supervised and unsupervised learning with Analyze BTL 4
10
example (6)
ii.Given the following 3D input data identify the principal
component 1 1 9; 2 4 6; 3 7 4 ; 4 11 4; 5 9 2. (7)
Remember BTL 1
11 List out and explain some of the applications of SVMindetail (13)
Understand BTL 2
i. What is PrincipalComponentAnalysis? (7)
12
ii. Discuss how is it useful in explaining data patterns. (6)
PART – A
Q.No. Question Competence Level
1 Define frequent itemset. Remember BTL 1
Compare and contrast the Multistage and Multi-Hash
2 Understand BTL 2
algorithm
3 List the features of cluster. Remember BTL 1
4 Show what the role of monotonicity is. Apply BTL 3
5 Define singleton. Remember BTL 1
6 Assess how to pick K in a K-Means Algorithm. Evaluate BTL 5
7 What can you say about CLIQUE and PROCLUS? Understand BTL 2
8 Define Hierarchical Clustering. Remember BTL 1
9 Analyse the association rule of frequent items. Analyze BTL 4
10 List the clustering strategies. Remember BTL 1
11 Show how to stop the Merger Process. Apply BTL 3
12 Explain the role of hash tree in association rule discovery. Remember BTL 1
13 What is meant by Merging Buckets in BDMO? Understand BTL 2
14 Formulate the applications of frequent itemset. Create BTL 6
15 Give an outline of strength and weakness of clique. Understand BTL 2
16 Show how to use the main memory for Itemset Counting. Apply BTL 3
Compare and contrast the relationship between centroids and
17 Analyze BTL 4
clustering.
18 Explain the working of Toivonen’s algorithm with example. Analyze BTL 4
19 Can you identify the Pair Counting Bottleneck . Evaluate BTL 5
20 Generalize how to initialize the K-Means algorithm. Create BTL 6
PART-B
Q.No. Question Competence Level
i. Define K-Means algorithm and how will you initialize the Remember BTL 1
1 clusters and pick the value for K? (8)
ii. Examine how the data is processed in BFR Algorithm.(5)
i. Illustrate briefly about Mining frequent Itemsets with its Apply BTL 3
2
applications. (9)
ii. Illustrate how you will find Association Rules with High
confidence. (4)
i. Explain k-means clustering algorithm with an example. (6) Analyze BTL 4
3 ii. List the different hierarchical clustering techniques and explain
any one. (7)
Summarize the hierarchical clustering in Euclidean and non- Understand BTL 2
4
Euclidean Spaces with its efficiency. (13)
Analyse and write a short note on Market-Basket Model with a suitable Analyze BTL 4
5
example. (13)
i. What are the main features of GRGPF Algorithm? (4) Remember BTL 1
6 ii. Examine how to initialize the cluster tree and add points in
GRGPFAlgorithm. (9)
7 Describe about Stream clustering and parallel clustering.(13) Understand BTL 2
A database has five transactions. Let min sup = 60% and min Create BTL 6
conf=80%
TID ITEMS
T100 Milk, Onion, Nuts, Kiwi, Egg, Yoghurt
8 T200 Dhal, Onion, Nuts, Kiwi, Egg, Yoghurt
T300 Milk, Apple, Kiwi, Egg
T400 Milk, Curd, Kiwi, Yoghurt
T500 Curd, Onion, Kiwi, Ice cream,Egg
Find all frequent itemsets using Apriori method. (13)
Discuss the various steps of PROCLUS clustering algorithm and Understand BTL 2
9
itssignificances (13)
Quote short notes on Remember BTL 1
i. Simple Randomized Algorithm. (4)
10
ii. SON Algorithm. (4)
iii. Toivonen’s Algorithm. (5)
IllustratehowwouldyoudescribethevariousstepsofCLIQUE Apply BTL 3
11
clustering algorithm andits significances (13)
i. List the difficulties of handling large datasets.(4) Remember BTL 1
12 ii. What approach can be used to handle large datasets in main
memory? (9)
13 Explain the two-pass A-Priori Algorithm in detail (13). Analyze BTL 4
Suppose that A, B ,C ,D , E and F are all the items. For a particular Evaluate BTL 5
14
support threshold the maximal frequent item sets are {A , B, C } and
{D , E }. What is the negative border? (13)
PART – C
Evaluate the Apriori algorithm for discovering frequent item sets of the Evaluate BTL 5
following table. (15)
Compose a Kohenen self organizing net with two cluster units and five Create BTL 6
input units. The weight vectors for the cluster units are given by
4
W1= [1.0, 0.9, 0.7, 0.5, 0.3 ]
W2= [0.3, 0.5, 0.7, 0.9, 1.0]
Use the square of Euclidean distance to find the winning cluster unit
for the input pattern x= [0.0, 0.5, 1.0, 0.5, 0.0] .Using a learning rate of
0.25, find the new weights for the winning unit[ HINT the winner unit
is the one with smaller index] \ ht
(15)
PART-B
Q.No. Question Competence Level
i. List the features of Hadoop and explain the functionalities Remember BTL 1
of Hadoop cluster? (6)
1
ii. Describe briefly about Hadoop input and output and write a
note on data integrity? (7)
i. Illustrate in detail about Hive data manipulation, queries, Apply BTL 3
2 data definition and datatypes. (7)
ii. Illustrate in brief composing map reduce calculations.(6)
Describe the system architecture and components of Hive and Remember BTL 1
3
Hadoop. (13)
Explain briefly on Analyze BTL 4
4
i. MapR (4) ii.Shrading(5) iii. S3 (4)
Consider a collection of literature survey made by a Create BTL 6
researcher in the form of a text document with respectto cloud
5 and big data analytics. Using Hadoop and MapReduce,
write a program to count the occurrence of pre dominant
keywords. (13)
i. Describe Map Reduce framework in detail. Draw the Remember BTL 1
architectural diagram for physical organization of compute
6
nodes. (7)
ii. Define HDFS. Explain HDFS in detail. (6)
i. Analyse what are the visualization techniques used to Apply BTL 3
7
visualizing data. (7)
ii. Explain any two approaches. (6)
Summarize briefly on Understand BTL 2
8 i. Features of MapR distribution. (8)
ii. Explain the architecture for MapR. (5)
Quote short notes on Remember BTL 1
9
i. NoSQL Databases and its types. (6)
ii. Visualization for BigData. (7)
10 Discuss the various core components of the Hadoop. (13) Understand BTL 2
11 Compare and Contrast the Hadoop and MapR. (13) Analyze BTL 4
i. Explain the purpose of sharding. (7) Analyze BTL 4
12
ii. Explain the process of sharding in MongoDB. (6)
Describe in detail about the issues in the development of Understand BTL 2
13
IDA.(13)
i. Assess the significances of Map Reduce . (4) Evaluate BTL 5
14 ii. Explain about Hadoop distributed file system architecture
withneatdiagram. (9)
PART-C
Recommend a procedure to find the number of occurrence of Evaluate BTL 5
1
a word in adocument . (15)
Analyse the use of Hive. How Does Hive Interact With Analyze BTL 4
2
Hadoop explain in detail? (15)
Develop a visualization technique to represent the following Create BTL 6
data. (15)
i. uni-variate data,
3
ii. 2D data
iii. multi-dimensionaldata
iv. pyramid-typedata.
Formulate how big data analysis helps business people to Create BTL 6
4 increase their revenue. Discuss with any one real time
application. (15)