Community Sites
Create your own community website and start earning today !
It's Free !
 
Communities Members BookmarksPolls Fresher Jobs Funny Pictures MCA Projects New Member FAQ  



My Profile
Active Members
TodayLast 7 Days more...



Awards & Gifts
Online Exams

Fresher Jobs


Our fresher job section is exclusively for fresh graduates! Find jobs for freshers in major Indian cities including Bangalore, Chennai, Hyderabad, Pune or Kochi

Resources


Find educational articles, blogs, discussion threads and other resources.

Colleges


Find details about any college in India or search for courses.

website counter



Download Model question papers & previous years question papers

Posted By: acme       Member Level: Silver       Posted Date: 19 Apr 2008

2007 Jawaharlal Nehru Technological University B.E Computer Science IV-I, DATA MINING AND DATA WAREHOUSING,regular,2007 Question paper



Course: B.E Computer Science   University: Jawaharlal Nehru Technological University




Set No. 1
IV B.Tech I Semester Regular Examinations, November 2007
DATA MINING AND DATA WAREHOUSING
( Common to Computer Science & Engineering and Information
Technology)
Time: 3 hours Max Marks: 80 Answer any FIVE Questions
All Questions carry equal marks

? ? ? ? ?
1. (a) Discuss Data Warehouse schema's. Draw the sketch of a retail sales analysis
star schema.
(b) What is Fact Data? Discuss the characteristics of fact versus reference data.[8+8]
2. (a) Discuss role of event manager.
(b) Discuss role of database manager.
(c) Discuss data warehousing process managers. [4+6+6]
3. Describe the role and importance of hardware architecture of a data warehouse.
Explain with the help of an example situation. [16]
4. Describe the hardware choices that are available to implement backup strategy with
their merits and demerits. [16]
5. Explain planning requirement for Database and non-database sizing. [16]
6. (a) Explain about the Three basic levels of Testing. [8]
(b) Explain about the GUILLOTINE CUT phenomenon. What is the advantage
of this method comparing with other. [4+4]
7. (a) What is concept hierarchy? How is it related to web mining? [3+5]
(b) Discuss the principles underlying text clustering. [8]
8. (a) Discuss the essential features of the GSP algorithm. [8]
(b) What is the event-prediction problem? Propose one algorithm to solve this
problem. [3+5]

? ? ? ? ?

Set No. 2


1. (a) What is Query Management process? Explain briefly.
(b) Explain how to directing queries?
(c) Briefly discuss maximizing system resources.
(d) Describe about query capture. [4+4+4+4]
2. (a) Explain Designing dimension tables.
(b) Explain Designing Star flake Scheme. [8+8]
3. (a) Describe the issues involved in the selection of hardware architecture for data ware system.
(b) Discuss the issues involved in the client-side of a data warehouse system. [8+8]
4. (a) Write the basic terminology and involved in backup strategies.
(b) Describe the effect on database design while implementing backup strategy.[8+8]
5. Describe Daily processing with reference to load estimation. [16]
6. (a) Explain the information - theoretic approach to measure the goodness of a split. [8]
(b) Explain about the GUILLOTINE CUT phenomenon. What is the advantage of this method comparing with other. [4+4]
7. (a) What are the different types of web mining? How is web usage mining different
from web structure mining and web content mining? [4+4]
(b) What is Page Rank? How is it computed? [3+5]
8. (a) Write in detail about the SPADE algorithm.
(b) Write in detail about the GSP algorithm.
(c) Write about the common feature of SPADE & GSP algorithm. [5+5+6]

? ? ? ? ?

Set No. 3

1. Give an introduction of Delivery process in Data Warehouse. [16]
2. Explain the following options with reference to Fact table Design:
(a) Minimizing column size.
(b) using intelligent and non intelligent keys.
(c) Identifying significant historical period. [16]
3. Write short notes on the following:
(a) Rule based optimizer
(b) Data shipping
(c) Shared disk systems
(d) Distributed lock manager. [4+4+4+4]
4. (a) Describe the role of security restrictions once the data warehouse has gone live
(b) What are the audit requirements to impose security restrictions at the beginning of data Warehouse. [8+8]
5. How do you make load estimation for a data warehouse? [16]
6. (a) Describe the class histogram, count matrix and AVC sets. Are they similar in
some respect? [6+2]
(b) Compare ID3 and C4.5 DECISION TREE construction algorithms. [8]
7. (a) Explain about the Scatter/Gather interface. In what way it is useful in text
clustering.
(b) Discuss about [8+8]
i. Transverse & Intrinsic Links,
ii. Reference Nods & Index nodes.
8. (a) Discuss the essential features of the GSP algorithm. [8]
(b) What is the event-prediction problem? Propose one algorithm to solve this
problem. [3+5]

? ? ? ? ?

Set No. 4

1. (a) Explain meta data and Data Marting concepts briefly with reference to data warehousing.
(b) Draw the three tire decision support information diagram depicting the summary and detailed information.[8+8]
2. (a) When is a summary table too big to be useful ?
(b) Relate and discuss the various degrees of aggregation within summary tables.[8+8]
3. (a) Describe the server management features of a data warehouse system.
(b) “Management tools are required to manage a large, dynamic and complex
system such as data warehouse system“ offer your explanation with justification.[8+8]
4. Describe the role and distinct features of user access to impose security restrictions
on data warehouse. [16]
5. (a) Discuss with a neat sketch data flow through data warehouse with reference to
tuning the data load.
(b) What are fixed queries? [12+4]
6. What is a DECISION TREE? With an example, Explain about the CART, ID3
algorithms. Give comparison between CART & ID3 algorithm. [3+9+4]
7. (a) What is text clustering? Discuss the principles underlying text clustering.[2+6]
(b) What are the different types of web mining? How is web usage mining different
from web structure mining and web content mining? [3+5]
8. (a) How do you handle spatial and non-spatial data, while carrying out any mining task?
(b) Propose different neighborhood relationships that can be used for density-
based clustering of spatial data. [8+8]

? ? ? ? ?





Return to question paper search

Next Question Paper: 'C' Programming And Data Structure (Practical) Set 4

Previous Question Paper: MATHEMATICAL MODELLING AND SIMULATION

Related Question Papers:


  • II Year II Sem - MEFA (R05-Set 2-Aug /Sep'2007-Sup)


  • SWITCHING THEORY & LOGIC DESIGN setno2


  • MANAGERIAL ECONOMICS AND FINANCIAL ANALYSIS II B.Tech II Semester Regular Examinations 2007, set 2


  • II B.Tech Supplimentary Examinations, Aug/Sep 2008,PRINCIPLES OF COMMUNICATIONS


  • DIGITAL LOGIC DESIGN


  • Categories


    Submit Previous Years University Question Papers and make money from adsense revenue sharing program

    Are you preparing for a university examination? Download model question papers and practise before you write the exam.

    Watch TV Channels



    Contact Us    Privacy Policy    Terms Of Use   

    SpiderWorks Technologies Pvt Ltd. 2006 - 2007 All Rights Reserved.