(Pages : 3)

R 2667
Reg. No. :
Name:

Fourth Semester B.C.A. Dearee Exanmination, July 2023

Career Related First Degree Programme under CBCSS
Group2(b) - Computer Applications
Core Course
CP 1444:DATAMINING AND WAREHOUSING
(2021 Admission)
Time:3 Hours
Max. Marks :80
SECTION A

Answer all questions. Each question carries 1 mark.

1. What is called data?

2. KDD stands for

3. What database models can OLAP adopt?

4. Define frequent patterns.
5. Association rule mining can be viewed as and
6. What is the use of partitioning?
7. What are the approaches of free pruning?
8. Define neural network.

P.T.0.
 analysis?
of partitioning in cluster
9. What is the use
outlier?
10. What arethe types of
(10 x 1=
SECTION B

Carries 2 marks.
Answer any eight questions. Each
11. Define Data warehouse.

12. What is Fact Constellation?

13. What is the use of data extraction?

14. What is the use of Apriorialgorithm?

15. What are closed item sets?

16. Define association rule.

17. What is called classification?

18. What is
Perception-based classification?
19. How to calculate error rate?

20. Define Cluster.

21. What are the

22. What is the use
disadvantages of K-means algorithm?
of
parametric method?
 SECTION -C

(Short Essay]
4 marks.
10 MAnswer any six questions. Each question catrries

23. Write shop notes on machine learning.

24. Differentiate OLTP and OLAP.

25. What are the major issues in data mining?

26. Explain Market Basket Analysis.
Frequent Item sets.
27. Discuss on FPGrowth Approach for Mining
28. Explain the general approach of Classification.
29. Write short notes on lazy learners.
30. Discuss about K-means Centroid-Based Technique.

31. What are the requirements for cluster analysis?

(6x 4= 24 Marks)
SECTION D

[Long Essay]
Answer any two questions. Each question carries 15 marks.
32. Explain OLAP Multi-Dimensional Models.

33. Explain Apriori algorithm for discovering frequent item sets by Confined
Candidate Generation.

34. Explain rule based classification with example.

35. Explain outlier and its detection methods in detail.

(2 x 15 = 30 Marks)

3
R-2667
 G 1657
(Pages: 3)
Reg. No. :
Name
Examination, April2019
Sixth Semester B.ScJB.C.A. DegreeUnder CBCSSApplications
Career Related FDP
Science/Computer
Group 2(B): Computer
1661.3/Core Course CP 1643
Elective Course CS WAREHOUSING
DATAMINING AND DATA
(2014 Admission Onwards)
Max Marks: 80
Time: 3 Hours

SECTION-A
(VeryShort Answer Type)
questions): (10x1=10iarks)
(One word to maximumof one sentence, answer all
1. Define adistance measure in clustering.

2 What is text mining ?

3. Define atabase system.

4. Define acluster.

5. What do you mean by data inntegration ?

6. Define an attribute.

7. Define data reduction.

8. Deline a data cube.

9. Define a classifier.
10. Define outliers.
 G-1657

SFCTION - B
(Short Answer)
(NOT toEXCeed one paragraph, answerany eight quesions. Each queslion
two marks) carres
(8x2=16 Marks)
11 Deine an Online
Transacion Process1ng Syslerm
12. Which are the steps involved in
dala mining ?
13. Explain the
concept of data cleaning.
14. Which are the lwo steps
involved in classification ?
15. DiscUss about mela dala.
16. Explain the use of star schema.
17.
Explain the features of a data
warehouse.
18 What do you mean by
decision tree induction?
8. Wnatdo youmean by density based
clustering ?
20. Discuss about "Lazy LeanerS"
21. Define support in association rule mining.
22. Explain
different data representation lechniques
SECTION -C
(Short Essay)
(Not to exceed 120words, answer any six
four marks). questions. Each question carnes
(6x4=24 Ma
23. Write short notes on
frequent pattern mining.
24. Explain in detail the steps involved in data
pre-processing.
25. Explain the Concept of a data cubes.
 G- 11

26 Explain the use of web mining

2? What do you mean by Boolean Association ?

28 DisCUSs about OLAP.

29. What do you mean by a data mart ?

30. Explain Bayesian class1fication

31. Explain k-nearest neighbor nethod
SECTION- D
(Long Essay)
(2x15=30 M
question carrnes 15 marks).
(Answer any two questions. Each
about decision trees and rule generation usingdecision trees.
32. Discuss
detail.
33. Explain aboui Apriori algorithm in
of data mining.
34. Explain in detailabout scope and applications
in detail.
35. Explain any two clustering algorithms
610 30
Max.
Weight: (Weight
4) P.T.O.
questions. thesereduction. these
between
these
thesealgebraic these
more
of of of
2014
CBCSS TECHNIQUES of
of
None None or None none existsNone
all one dimension
an
April Answer relationships
data.
in by by d) d) d)
relationships
under d) d)
computed cube these
Examination,
each. alternatives. Descriptive Checking
c) by Statistic
of Bivariate
ProgrammeMINING Holisticdata cube None
down
c)
questions be the
data data-driven. linear
Course
Core SECTIONA can
:3)(Pages (2b)
Group givenpatterns
or c) it c) b) d) a c)
Degree AND on that Correlation
four if Distributive
arguments.
Degree Preventive aggregation
Reducing assumes
regression
the
MINING of one.from for. is
bunches model data.
B.C.A. identifies operation
used up
b)
of
First answer
weightage b) of b)
set b) means mining output
b)
DATA
is
function
Semester four model Non-parametric
c)
Related some for and
correct data
: of a a)Expanding stands Parametric
a)
1643 consists for a) aggregate
Predictive Algebraic
a) is
the data
carries function
with
most stands dimension. acroSS
a) Linear
a)
Career
Sixth MOLAP input
CP Time:3
Hours Slicing
4),
bunch
Section
the KDT Drill
5)II. the
An
Choose 2)
A
No.
Reg. Each 1) 3) 6) 7) B)
Name
: This
I.
610 -2

II. 9) DT stands for

which iterim
10) The of an itm is the percentage of transactions in
0Ccurs.

a) confidence b) support c) percentage d) none of these

11) Afrequent set is a set if it is a frequent set and nosuperset of this

is a frequent set.

12) A
priori algorithm operates in bottom-up, search method.
a) Depth-First b) Linear c) Breadth First d) None of these
IV.13) In a decision tree, attributes whose domain is not numerical are called
attributes.
a) Non numerical b) Numerical c) Categorical d) None of these
14) Entropy provides an information theoretic approach to measure the
of a split.
15) Classification and Regression Tree is commonly notated as
16) data mining is the branch of data mining that deals
location data. with the
a) Web b) Text c) Spatial d) None of these
(Weight 4x1=4)
SECTION-B
Short answer type. Answer any 8
questions. (Weight 8)
17) What is Meta Data ?
18) What are the scope of data
mining?
19) Define Drilling.
20) Define-Associative Rule.
21) Write any two
applications of data mining in Health Care.
22) What are the important
methods for data preparations ?
23) What is data reduction ?
 -3 610
24) Define Data Cleaning.
25) What is SplittingAttribute of a Decision Tree ?
26) What is CART?
27) Define Text Mining.
28) Define Web Content Mining.
(Weight 8x1=8)
SECTION-C
Short essay type. Answer any 5 questions.
(Weight 10)
29) Compare and Contrast KDD and Data Mining.
30) What is multi dimensional data model ?
31) What is clustering ?
32) Write a note onneeds of data mining.
33) What is prediction ?
34) Write a note on decision tree learning.
35) What are the main phases of construction of decision tree ?
36) What are the techniques used for visual data mining ?
(Weight 5x2=10)
SECTION-D
Long essay type. Answer any 2 questions.
(Weight 8)
37) Compare and Contrast Data Ware House and Data
Mining.
38) Data Mining using Decision tree -Explain.
39) Explain Web mining in detail.
(Weight 2x4=8)
 (Pages : 3) 610
Reg. No.:

Name :

Sixth Semester B.C.A. Degree Examination, April 2014

Career Related First Degree Programme under CBCSS
Group (2b)
Core Course
CP 1643: DATA MINING AND MINING TECHNIQUES
Time:3 Hours Max. Weight: 30
SECTION-A
This Section consists of four bunches of four questions each. Answer all
Each bunch carriesa weightage of one. questions.
Choose the most correct answer from the given alternatives.
(Weight 4)
I. 1) KDT stands for
2) A model identifies patterns or relationships in data.
a) Predictive b) Preventive c) Descriptive d) None of these
3) An aggregate function is if it can be computed by an algebraic
function with some set of arguments.
a) Algebraic b) Distritbutive c) Holistic d) None of these
4), Slicing is the operation used for the data cube by one or more
dimension.
a) Expanding b) Reducing c) Checking d) None of these
II. 5) Drill means aggregation on data cube by dimension reduction.
a) acroSS b) up c) down d) none of these
6) MOLAP stands for
7) data mining model is data-driven.
a) Parametric b) Statistic
c) Non-parametric d) None of these
8) regression assumes that a linear relationships exists between
the input data and output data.
a) Linear b) Correlation c) Bivariate d) None of these
P.T.0.
610 -2.

|I. 9) DT stands for

10) The of an itèm is the percentage of transactions in which iterm
0Ccurs.
a) confidence b) support c) percentage d) none of these
11) Afrequent set is a set if it is a frequent set and no Superset of this
is a frequent set.
12) Apriori algorithm operates in
a) Depth-First bottom-up,. search method.
b) Linear c) Breadth First d) None of these
IV.13) In a decision tree, attributes whose
domain is not numerical are called
attributes.
a) Non numerical b)
Numerical c) Categorical d) None of these
14) Entropy provides an information
of a split.
theoretic approach to measure the
15) Classification and
Regression Tree is Commonly notated as.
16) data mining is the branch of data
location data. mining that deals with the
a) Web b) Text c) Spatial d) None of these
(Weight 4xl=4)
SECTION-B
Short answer type. Answer any 8
questions. (Weight 8)
17) What is Meta Data ?
18) What are the scope of data
mining?
19) Define Drilling.
20) Define-Associative Rule.
21) Write any two
applications of data mining in Health Care.
22) What are the important
methods for data preparations ?
23) What is data reduction ?
 3 610

24) Define Data Cleaning.

25) What is Splitting Attribute of a Decision Tree ?
26) What is CART ?

27) Define Text Mining.

28) Define Web Content Mining. (Weight 8x1=8)
SECTION-C
Short essay type. Answer any 5 questions. (Weight 10)
29) Compare and Contrast KDD and Data Mining.
30) What is muiti dimensional data model ?
31) What is clustering?
32) Write a note on needs of data mining.
33) What is prediction ?
34) Write a note on decision tree learing.
35) What are the main phases of construction of decision tree?
36) What are the techniques used for visual data mining ?
(Weight 5x2=10)
SECTION-D
Long essay type. Answer any 2 questions.
(Weight 8)
37) Compare and Contrast Data Ware House and Data Mining.
38) Data Mining using Decision tree - Explain.
39) Explain Web mining in detail.
(Weight 2x4-8)
 (Pages :2) 318
Reg. No. :
Name

Slxth Semester B.C.A. Degree Examination, March 2012

(2007 Scheme)
DATA MINING AND MAPPING TECHNIQUES

Time:3 Hours Max. Marks : 75

SECTION-A

Answer any 10 questions. Each carries 3 marks.

1. What are the operations supported bya typical OLAP system to reduce the size
of a database ?

2. What is a data warehouse ?

3. What is a transaction ? How it differ from a query ?

4. Name the categories of OLAP tools.

5. What isa frequent pattern in a data set?

6. What are closed patterns in a data set ?
7. What are the strength of decision tree method ?
8. Compare classification and clustering.
9. What are the characteristics of genetic algorithms ?

10. Give a list ofcommercial or non commercial data mining tools.

11. What is link analysis in Web mining?
12. Explain how web mining can be helpful to personalised web experience.
P.T.O.
318

SECTION-B

Answer any 5 questions. Each carries 6 marks.

13. Discuss the typical OLAP operations with an example.
14. What is a data cube ? Explain computations supported on a data cube with
examples.
15. ls it possible to mine frequent itemsets without candidate generation ?
Justify your answer. (N

16. Explain apriori algorithm.

17. Explain any clustering method in detail.
18. What is a multimedia database ? Explain the methods to mine a multimedia
databasse.
19. Outline google's Page Rank algorithm.
20. Discuss new trends in datamining.

SECTION-C

Answer any one questions. t carries 15 marks.

21. Outline decision tree classification task with the help of an example dataset.
Bringout the importance of tree splittingand measures of node imputity.
22. What is market basket analysis ? Outline the method using an example dataset.