Scribd Logo
Upload

Welcome to Scribd!

  • 23 views

    Ut 3 Ac

    Uploaded by

    shenbagaraman cse
    This document appears to be an exam for a course on analytic computing. It contains two parts: Part A consists of 9 short answer questions worth 2 marks each about topics like data mining techniques for social media, differences between OLTP and OLAP, and MapReduce algorithms. Part B contains 2 longer answer questions worth 16 marks each - one asks how social network visualizations can be classified based on visualization tasks, and the other asks about hierarchical visualization techniques and core components of Hadoop. The exam is out of a total of 50 marks.

    Copyright:

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

    Ut 3 Ac

    Uploaded by

    shenbagaraman cse
    23 views1 page
    This document appears to be an exam for a course on analytic computing. It contains two parts: Part A consists of 9 short answer questions worth 2 marks each about topics like data mining techniques for social media, differences between OLTP and OLAP, and MapReduce algorithms. Part B contains 2 longer answer questions worth 16 marks each - one asks how social network visualizations can be classified based on visualization tasks, and the other asks about hierarchical visualization techniques and core components of Hadoop. The exam is out of a total of 50 marks.

    Original Title

    UT 3 AC

    Copyright

    © © All Rights Reserved

    Available Formats

    DOC, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document appears to be an exam for a course on analytic computing. It contains two parts: Part A consists of 9 short answer questions worth 2 marks each about topics like data mining techniques for social media, differences between OLTP and OLAP, and MapReduce algorithms. Part B contains 2 longer answer questions worth 16 marks each - one asks how social network visualizations can be classified based on visualization tasks, and the other asks about hierarchical visualization techniques and core components of Hadoop. The exam is out of a total of 50 marks.

    Copyright:

    © All Rights Reserved
    Download as DOC, PDF, TXT or read online from Scribd
    Download as doc, pdf, or txt
    23 views1 page

    Ut 3 Ac

    Uploaded by

    shenbagaraman cse
    This document appears to be an exam for a course on analytic computing. It contains two parts: Part A consists of 9 short answer questions worth 2 marks each about topics like data mining techniques for social media, differences between OLTP and OLAP, and MapReduce algorithms. Part B contains 2 longer answer questions worth 16 marks each - one asks how social network visualizations can be classified based on visualization tasks, and the other asks about hierarchical visualization techniques and core components of Hadoop. The exam is out of a total of 50 marks.

    Copyright:

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

    National Engineering College, K.R Nagar, Kovilpatti-628 503 National Engineering College, K.

    R Nagar, Kovilpatti-628 503


    (An Autonomous Institution, Affiliated to Anna University Chennai) (An Autonomous Institution, Affiliated to Anna University Chennai)
    B.E CSE - INTERNAL ASSESSMENT TEST – III B.E CSE - INTERNAL ASSESSMENT TEST – III
    Semester-VII Course: 15CS34E - Analytic Computing  Semester-VII Course: 15CS34E - Analytic Computing 
    Time: 1.30 Hours      Date: 03.10.2018 Max: 50 marks Time: 1.30 Hours      Date: 03.10.2018 Max: 50 marks
    Part-A 9*2=18 Part-A 9*2=18
    1. Mention the two primary kinds of data which are often analyzed in the 1. Mention the two primary kinds of data which are often analyzed in the
    context of social networks. CO 4 (R) context of social networks. CO 4 (R)
    2. Name the data mining techniques which are used for the social media. 2. Name the data mining techniques which are used for the social media.
    CO 4 (U) CO 4 (U)
    3. List out the differences between OLTP and OLAP. CO 4 (U) 3. List out the differences between OLTP and OLAP. CO 4 (U)
    4. What is meant by ontology engineering? CO 4 (R) 4. What is meant by ontology engineering? CO 4 (R)
    5. What is the motivation for the data mining in the social media? CO 4 (U) 5. What is the motivation for the data mining in the social media? CO 4 (U)
    6. Define the term shrading. CO 5 (R) 6. Define the term shrading. CO 5 (R)
    7. Why the matrix multiplication is being performed in the map reduce 7. Why the matrix multiplication is being performed in the map reduce
    algorithms? (U) CO 5. algorithms? (U) CO 5.
    8. How the mapreduce algorithms are different from the general parallel 8. How the mapreduce algorithms are different from the general parallel
    computations?(R) CO 5. computations?(R) CO 5.
    9. It is necessary to restart the entire job only if the node at the master executes 9. It is necessary to restart the entire job only if the node at the master executes
    fails-Justify.C0 5 (Ana) fails-Justify.C0 5 (Ana)
    Part-B 2*16=32 Part-B 2*16=32
    10. How will you classify the visualization of social networks in different 10. How will you classify the visualization of social networks in different
    groups depending on the focus of the predominant visual task? Explain in groups depending on the focus of the predominant visual task? Explain in
    detail. C0 4 (R). (16) detail. C0 4 (R). (16)
    11. a) Explain how the Hierarchical visualization techniques which are used to 11. a) Explain how the Hierarchical visualization techniques which are used to
    partition all dimensions into subsets..(10) CO 5 (U) partition all dimensions into subsets..(10) CO 5 (U)
    b) Explain the various core components of the Hadoop. (6) CO 5 (R) b) Explain the various core components of the Hadoop. (6) CO 5 (R)

    You might also like