Scribd
Upload
33 views2 pages

Datamining

This document contains the questions for an end semester examination in Data Mining. It includes 7 questions assessing various data mining concepts and algorithms. Question 1 asks about the Apriori algorithm, k-means clustering, OLAP cubes, and how OLTP differs from OLAP. Question 2 covers logistic regression and linear support vector machines. Question 3 addresses data warehousing and the data mining process. Question 4 is about the page rank algorithm. Question 5 examines principle component analysis. Question 6 tests understanding of entropy, information gain, Gini index, and the ID3 decision tree algorithm. Question 7 asks to draw decision trees for boolean functions.

Uploaded by

SharmaDeep
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
33 views2 pages

Datamining

This document contains the questions for an end semester examination in Data Mining. It includes 7 questions assessing various data mining concepts and algorithms. Question 1 asks about the Apriori algorithm, k-means clustering, OLAP cubes, and how OLTP differs from OLAP. Question 2 covers logistic regression and linear support vector machines. Question 3 addresses data warehousing and the data mining process. Question 4 is about the page rank algorithm. Question 5 examines principle component analysis. Question 6 tests understanding of entropy, information gain, Gini index, and the ID3 decision tree algorithm. Question 7 asks to draw decision trees for boolean functions.

Uploaded by

SharmaDeep
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

POKHARA UNIVERSITY

END SEMESTER EXAMINATION


Subject: Data Mining FM: 100
Course Type: Elective PM: 40
BE Computer Engineering
Year/Semester: IV/II
Time: 3 hrs

Attempt all Questions.

1(a) Explain Apriori Algorithm and k-means algorithm. [7]


(b) What do you mean by OLAP Cube? How OLTP is different from OLAP? Explain with
appropriate examples. [3+3+2]

2(a). Use appropriate example to explain Logistic Regression. [7]


(b). Find the linear SVM plane for the following datasets: [8]

POSITIVE CLASS DATASETS: {(3,2), (3,-2), (6,2),(6,-2)}

NEGATIVE CLASS DATASETS: {(2,0),(0,2),(0,-2),(-2,0)}

3(a). What is Datawarehousing?Explain the process of Data Mining. [3+5]


(b). How Data mining is applied in the modern world for decision making in Business, Science
and Entertainment sectors? Explain with appropriate examples. [4+3]

4(a). Describe page rank algorithm.[7]


(b). Find the page rank for 5 different pages A,B,C,D and E, given the link between each page in
the following graph: [8]

5(a). Why do we need Principle Component Analysis?[7]


(b). Find PC1 and PC2 for the following dataset: [8]

X1 3 5 7 8 10

X2 3 3 4 5 7
6(a). Find Entropy, Information Gain and Gini Index for a1, a2, a3 from the given datasets:
[8]

Instance 1 2 3 4 5 6 7 8 9
a1 Blue Green Red Blue Blue Red Blue Red Red
a2 Blue Blue Blue Red Red Green Green Blue Red
a3 Blue Blue Blue Red Red Red Red Red Red
Target 1 2 2 2 2 1 1 1 1
class

6(b). Using the above datasets, explain ID3 Algorithm and generate a decision tree. [7]

7. Draw decision trees for any two of the following boolean functions: [5+5]

a. A’BC + AB’C + ABC’


b.A’B’ + A’ + B’
c. (X+Y)(X’+Y’)

You might also like