FirstRanker Logo

FirstRanker.com - FirstRanker's Choice is a hub of Question Papers & Study Materials for B-Tech, B.E, M-Tech, MCA, M.Sc, MBBS, BDS, MBA, B.Sc, Degree, B.Sc Nursing, B-Pharmacy, D-Pharmacy, MD, Medical, Dental, Engineering students. All services of FirstRanker.com are FREE

📱

Get the MBBS Question Bank Android App

Access previous years' papers, solved question papers, notes, and more on the go!

Install From Play Store

Download AKTU B-Tech 6th Sem 2017-2018 NCS 066 Datawarehousing And Data Mining Question Paper

Download AKTU (Dr. A.P.J. Abdul Kalam Technical University (AKTU), formerly Uttar Pradesh Technical University (UPTU) B-Tech 6th Semester (Sixth Semester) 2017-2018 NCS 066 Datawarehousing And Data Mining Question Paper

This post was last modified on 29 January 2020

AKTU B-Tech Last 10 Years 2010-2020 Previous Question Papers || Dr. A.P.J. Abdul Kalam Technical University


Printed Pages: 02

Paper ID: 110626

Sub Code: NCS 066

--- Content provided by⁠ FirstRanker.com ---

Roll No.

B.Tech (SEM VI) THEORY EXAMINATION 2017-18

DATAWAREHOUSING AND DATA MINING

Time: 3 Hours

Total Marks: 100

--- Content provided by FirstRanker.com ---

Note: 1. Attempt all Sections. If require any missing data; then choose suitably.

SECTION A

  1. Attempt all questions in brief. 2 x 10 = 20
    1. Draw the diagram for key steps of data mining.
    2. Define the term Support and Confidence.
    3. What are attribute selection measures? What is the drawback of information gain?
    4. --- Content provided by​ FirstRanker.com ---

    5. Differentiate between classification and clustering
    6. Write the statement for Apriori Algorithm.
    7. What are the drawbacks of k-mean algorithm?
    8. What is Chi Square test?
    9. Compare Roll up, Drill down operation.
    10. --- Content provided by‌ FirstRanker.com ---

    11. What are Hierarchical methods for clustering?
    12. Name main features of Genetic Algorithm.

SECTION B

  1. Attempt any three of the following: 10 x 3 = 30
    1. Explain the data mining / knowledge extraction process in detail?
    2. Differentiate between OLAP and OLTP.
    3. --- Content provided by‍ FirstRanker.com ---

    4. Find frequent patterns and the association rules by using Apriori Algorithm for the following transactional database:

      TID Items
      T100 M, O, N, K, E, Y
      T200 O, O, N, K, E, Y
      T300 M, A, K, E
      T400 M, U, C, K, Y
      T500 C, O, O, K, I, E
      bought

      Let Minimum support = 60% and Minimum Confidence = 80%
    5. --- Content provided by​ FirstRanker.com ---

    6. What are different database schemas. Show with an example?
    7. How data back-up and data recovery is managed in data warehouse?

SECTION C

  1. Attempt any one part of the following: 10 x 1 = 10
    1. Draw the 3-tier data warehouse architecture. Explain ETL process.
    2. Elaborate the different strategies for data cleaning.
    3. --- Content provided by⁠ FirstRanker.com ---

  2. Attempt any one part of the following: 10 x 1 = 10
    1. What are different clustering methods? Explain STING in detail.
    2. What are the applications of data warehousing? Explain web mining and spatial mining.
  3. Attempt any one part of the following: 10 x 1 = 10
    1. Define data warehouse. What strategies should be taken care of while designing a warehouse?

      --- Content provided by FirstRanker.com ---

      FirstRanker.com
    2. Write short notes on the following:
      1. Concept Hierarchy
      2. ROLAP vs MOLAP
      3. Gain Ratio
      4. Classification Vs Clustering
      5. --- Content provided by‌ FirstRanker.com ---

      FirstRanker.com
  4. Attempt any one part of the following: 10 x 1 = 10
    1. Compute the decision rules by deriving a decision tree classifier and information gain as selection measure for the given database in table.

      Table 6

      --- Content provided by‌ FirstRanker.com ---


      Age Income Student Credit rating Class: buys computer
      youth high No Fair No
      youth high No Excellent No
      middle high No Fair Yes
      aged senior No Fair Yes
      senior low Yes Fair Yes
      senior low Yes Excellent No
      middle low Yes Excellent Yes
      aged youth No Fair No
      youth low Yes Fair Yes
      senior medium Yes Fair Yes
      youth medium Yes Excellent Yes
      middle medium No Excellent Yes
      aged high Yes Fair Yes
      aged medium No Excellent No


      Given: Gain (age) = 0.246, Gain (student) = 0.151 and Gain (Credit Rating) = 0.048
    2. What is Laplacian Correction in Bayesian Classifier? Compute the class of the following tuple by using Bayesian classification for given database in table 6.

      --- Content provided by‍ FirstRanker.com ---

      X = (Age = senior, Credit rating = fair, Income = medium, student = no)
  5. Attempt any one part of the following: 10 x 1 = 10
    1. Write the k-mean algorithm. Suppose that the data mining task is to cluster points (with (x,y) representing location ) into three clusters, where the points are:

      A1 (2, 10), A2 (2, 5) A3 (8, 4)

      --- Content provided by‍ FirstRanker.com ---

      B1 (5, 8), B2 (7, 5) B3 (6, 4)
      C1 (1, 2), C2 (4, 9)

      The distance function is Euclidean distance. Suppose initially we assign A1, B1, and C1 as the center of each cluster, respectively. Use the k-means algorithm to show only The three cluster centers after the first round of execution.
    2. What is Hierarchical method for clustering? Explain BIRCH method.
    3. --- Content provided by‌ FirstRanker.com ---

FirstRanker.com

This download link is referred from the post: AKTU B-Tech Last 10 Years 2010-2020 Previous Question Papers || Dr. A.P.J. Abdul Kalam Technical University

--- Content provided by‌ FirstRanker.com ---