Exam Details
Subject | data structures | |
Paper | ||
Exam / Course | b.e.(computer science and engineering) | |
Department | ||
Organization | SETHU INSTITUTE OF TECHNOLOGY | |
Position | ||
Exam Date | May, 2017 | |
City, State | tamil nadu, pulloor |
Question Paper
Reg. No.
B.E. B.Tech. DEGREE EXAMINATION, MAY 2017
Elective
Computer Science and Engineering
01UCS917 MASSIVE DATASET ANALYTICS
(Regulation 2013)
Duration: Three hours Maximum: 100 Marks
Answer ALL Questions
PART A (10 x 2 20 Marks)
1. List the characteristics of big data and challenges in handling big data.
2. Write any two possible web data from which effective analysis can be carried out.
3. Highlight the uses of regression modeling.
4. Define principal component analysis.
5. Give any two examples for stream data.
6. State how to count the distinct elements in a stream.
7. List the different hierarchical clustering techniques.
8. Define K-Means clustering algorithm.
9. State the significances of Map Reduce.
10. List the components of Hadoop framework.
PART B x 16 80 Marks)
11. Discuss the evolution of big data analytics.
Explain in detail about the major resampling techniques.
Or
Question Paper Code: 31289
2
31289
Highlight the features of modern data analytics tools.
Compare analysis and reporting.
12. What is a Bayesian network? With an example, explain how this network can be used for analyzing data.
Describe the steps involved in support vector based inference methodology.
Or
Explain the architecture of multi layer feed forward neural network.
Explain in detail about extracting fuzzy models from data.
13. Explain the architecture for processing streaming data.
Discuss the concept of decaying window in detail.
Or
Explain how to count ones in a window using DGIM algorithm.
Describe about any one Real Time Analytics Platform (RTAP) application.
14. Explain Apriori algorithm and with an example show how association rules are generated from frequent item sets.
Or
Discuss the various steps of PROCLUS clustering algorithm and also give its significances.
Describe about Stream clustering and Parallel clustering.
15. Describe Map Reduce framework in detail with neat diagram.
Highlight the features of NoSQL.
Or
Discuss about Hadoop Distributed File System architecture with a neat diagram.
Write short notes on Visualization for Big Data.
B.E. B.Tech. DEGREE EXAMINATION, MAY 2017
Elective
Computer Science and Engineering
01UCS917 MASSIVE DATASET ANALYTICS
(Regulation 2013)
Duration: Three hours Maximum: 100 Marks
Answer ALL Questions
PART A (10 x 2 20 Marks)
1. List the characteristics of big data and challenges in handling big data.
2. Write any two possible web data from which effective analysis can be carried out.
3. Highlight the uses of regression modeling.
4. Define principal component analysis.
5. Give any two examples for stream data.
6. State how to count the distinct elements in a stream.
7. List the different hierarchical clustering techniques.
8. Define K-Means clustering algorithm.
9. State the significances of Map Reduce.
10. List the components of Hadoop framework.
PART B x 16 80 Marks)
11. Discuss the evolution of big data analytics.
Explain in detail about the major resampling techniques.
Or
Question Paper Code: 31289
2
31289
Highlight the features of modern data analytics tools.
Compare analysis and reporting.
12. What is a Bayesian network? With an example, explain how this network can be used for analyzing data.
Describe the steps involved in support vector based inference methodology.
Or
Explain the architecture of multi layer feed forward neural network.
Explain in detail about extracting fuzzy models from data.
13. Explain the architecture for processing streaming data.
Discuss the concept of decaying window in detail.
Or
Explain how to count ones in a window using DGIM algorithm.
Describe about any one Real Time Analytics Platform (RTAP) application.
14. Explain Apriori algorithm and with an example show how association rules are generated from frequent item sets.
Or
Discuss the various steps of PROCLUS clustering algorithm and also give its significances.
Describe about Stream clustering and Parallel clustering.
15. Describe Map Reduce framework in detail with neat diagram.
Highlight the features of NoSQL.
Or
Discuss about Hadoop Distributed File System architecture with a neat diagram.
Write short notes on Visualization for Big Data.
Subjects
- applied statistics and queuing networks
- artificial intelligence
- building enterprise applications
- c# and .net framework
- cloud computing
- computer communication and networks
- computer networks
- computer organization and architecture
- data structures
- data warehousing and data mining
- database management systems
- database system concepts
- design and analysis of algorithms
- discrete mathematics
- distributed systems
- environmental science and engineering
- fundamentals of information security
- fundamentals of mobile computing
- human computer interaction
- information storage management
- interactive computer graphics
- internet of things
- java programming
- microprocessors and microcontrollers
- multimedia
- object oriented analysis and design
- object oriented programming
- object oriented programming with c++
- operating systems
- principles of compiler design
- probability statistics and queuing systems
- project management and finance
- python programming
- qualitative and quantitative aptitude
- reasoning and quantitative aptitude
- software engineering
- software testing
- theory of computation
- transforms and partial differential equations
- value education and human rights
- web programming