Exam Details
Subject | data mining and techniques | |
Paper | ||
Exam / Course | m.sc. information technology | |
Department | ||
Organization | acharya nagarjuna university-distance education | |
Position | ||
Exam Date | May, 2018 | |
City, State | new delhi, new delhi |
Question Paper
Total No. of Questions 18] [Total No. of Pages 02
M.Sc. DEGREE EXAMINATION, MAY 2018
Second Year
INFORMATION TECHNOLOGY
Data Mining and Techniques
Time 3 Hours Maximum Marks 70
SECTION A × 15 45)
Answer any THREE questions
Q1) Discuss in detail about various data mining tasks.
Q2) Explain about the CART Algorithm for Building Tree Classifiers.
Q3) Write about different parameter optimization methods.
Q4) Discuss about partition based clustering algorithms.
Q5) Explain about data warehousing and online analytical processing (OLAP)
SECTION B × 4 20)
Answer any five questions
Q6) Write about various distance measures for data analysis.
Q7) Briefly explain about principle component analysis.
Q8) How to select variables for high dimensional data.
Q9) Briefly explain about patterns for strings.
Q10) Write the features of EM algorithm.
Q11) Describe joint distributions for categorical data.
Q12) Explain feature selection for classification in High Dimensions.
Q13) Write about multidimensional indexing.
SECTION C × 1
Answer all questions
Q14) Define sampling.
Q15) What is data visualization?
Q16) Give any two data distance measures.
Q17) Define regression.
Q18) Define association rule mining.
M.Sc. DEGREE EXAMINATION, MAY 2018
Second Year
INFORMATION TECHNOLOGY
Data Mining and Techniques
Time 3 Hours Maximum Marks 70
SECTION A × 15 45)
Answer any THREE questions
Q1) Discuss in detail about various data mining tasks.
Q2) Explain about the CART Algorithm for Building Tree Classifiers.
Q3) Write about different parameter optimization methods.
Q4) Discuss about partition based clustering algorithms.
Q5) Explain about data warehousing and online analytical processing (OLAP)
SECTION B × 4 20)
Answer any five questions
Q6) Write about various distance measures for data analysis.
Q7) Briefly explain about principle component analysis.
Q8) How to select variables for high dimensional data.
Q9) Briefly explain about patterns for strings.
Q10) Write the features of EM algorithm.
Q11) Describe joint distributions for categorical data.
Q12) Explain feature selection for classification in High Dimensions.
Q13) Write about multidimensional indexing.
SECTION C × 1
Answer all questions
Q14) Define sampling.
Q15) What is data visualization?
Q16) Give any two data distance measures.
Q17) Define regression.
Q18) Define association rule mining.
Subjects
- artificial intelligence
- basics of information technology
- computer networks
- computer organisation
- cryptography & network security
- data mining and techniques
- data structures with c
- database management systems
- operating systems
- programming with c++
- software engineering
- tcp / ip