Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 33 views

    126VW122019

    Uploaded by

    Abhishek yadav
    This document is a question paper for an exam on data warehousing and data mining. It contains two parts: Part A has 10 short answer questions worth a total of 25 marks. Questions cover topics like data cubes, normalization, association rules, decision trees, and clustering. Part B has 5 units each with two questions worth 10 marks each, for a total of 50 marks. Questions can be chosen from topics like data warehouse architecture, OLAP operations, data mining tasks, frequent patterns, classification algorithms, and clustering algorithms.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    126VW122019

    Uploaded by

    Abhishek yadav
    33 views2 pages
    This document is a question paper for an exam on data warehousing and data mining. It contains two parts: Part A has 10 short answer questions worth a total of 25 marks. Questions cover topics like data cubes, normalization, association rules, decision trees, and clustering. Part B has 5 units each with two questions worth 10 marks each, for a total of 50 marks. Questions can be chosen from topics like data warehouse architecture, OLAP operations, data mining tasks, frequent patterns, classification algorithms, and clustering algorithms.

    Original Description:

    Rrrr

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document is a question paper for an exam on data warehousing and data mining. It contains two parts: Part A has 10 short answer questions worth a total of 25 marks. Questions cover topics like data cubes, normalization, association rules, decision trees, and clustering. Part B has 5 units each with two questions worth 10 marks each, for a total of 50 marks. Questions can be chosen from topics like data warehouse architecture, OLAP operations, data mining tasks, frequent patterns, classification algorithms, and clustering algorithms.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    33 views2 pages

    126VW122019

    Uploaded by

    Abhishek yadav
    This document is a question paper for an exam on data warehousing and data mining. It contains two parts: Part A has 10 short answer questions worth a total of 25 marks. Questions cover topics like data cubes, normalization, association rules, decision trees, and clustering. Part B has 5 units each with two questions worth 10 marks each, for a total of 50 marks. Questions can be chosen from topics like data warehouse architecture, OLAP operations, data mining tasks, frequent patterns, classification algorithms, and clustering algorithms.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 2

    Code No: 126VW

    R15
    JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
    B. Tech III Year II Semester Examinations, December - 2019
    DATA WAREHOUSING AND DATA MINING
    (Information Technology)
    Time: 3 hours Max. Marks: 75

    Note: This question paper contains two parts A and B.


    Part A is compulsory which carries 25 marks. Answer all questions in Part A. Part B
    consists of 5 Units. Answer any one full question from each unit. Each question carries
    10 marks and may have a, b, c as sub questions.

    PART - A
    (25 Marks)

    1.a) Define Data Cube. Give an example. [2]


    b) What are semi-addictive measures? [3]
    c) What is Data Binaryzation? [2]
    d) Describe Data Normalization methods in brief. [3]
    e) Define the measure confidence in association rule mining. [2]
    f) Differentiate frequent subsequence and frequent substructure. [3]
    g) What is Decision tree? Give an example. [2]
    h) How to evaluate classifier? [3]
    i) Define Clustering of Data. [2]
    j) List out all partitioning methods for clustering data. [3]

    PART - B
    (50 Marks)

    2.a) Describe 3-tier Architecture of Data Warehouse with a neat sketch.


    b) Design Fact constellation table with suitable example. [6+4]
    OR
    3.a) Describe various OLAP operations performed on Multidimensional Data Model.
    b) Differentiate ROLAP, MOLAP and HOLAP server functionalities. [6+4]

    4.a) Explain about various Data Mining Tasks with appropriate examples.
    b) Discuss about any two measures of similarity. [6+4]
    OR
    5.a) “Data preprocessing is necessary before data mining process”. Justify your answer.
    b) Enumerate feature subset selection methods. [6+4]

    6.a) Illustrate FP-growth algorithm with a suitable example.


    b) Discuss about maximal frequent Item set. [7+3]
    OR
    7.a) Categorize various kinds of Association Rules with examples.
    b) How to represent Frequent Itemset in compact format? [6+4]

    www.manaresults.co.in
    8.a) Discuss about attribute selection measure „Information Gain‟.
    b) How will you solve a classification problem using Bayesian Belief Networks? [4+6]
    OR
    9.a) Write about Lazy Learners for classification.
    b) Describe kNN Algorithm for data classification with appropriate example. [4+6]

    10.a) Discuss about key issues in Hierarchical clustering.


    b) Demonstrate DIANA clustering algorithm with example. [5+5]
    OR
    11.a) What are the advantages of PAM Method?
    b) How to cluster the data sets using k-mediod clustering algorithm? [4+6]

    ---ooOoo---

    www.manaresults.co.in

    You might also like