CP7202 - Advanced Databases May/June 2015 Question Paper

CP 7202 Advanced Databases question paper – May/June 2015

CP 7202 Advanced Databases question paper – May/June 2015 / Anna University Previous Year Exam Questions / Anna University Previous Year M.E. M.Tech. Computer Science and Engineering and Information Technology Question Papers

Question Paper Code : 43299 M.E./M.Tech. DEGREE EXAMINATION, MAY/JUNE 2015 Second Semester Computer Science and Engineering CP 7202 — ADVANCED DATABASES (Common to M.E. Computer Science and Engineering (with Specialization in Networks) and M.Tech. Information Technology) (Regulation 2013) Time: Three hours                                                       Maximum: 100 Marks Answer ALL Questions PART A — (10 × 2 = 20 Marks) 1. What are the limitations of client server architecture? 2. Differentiate between Inter-query and Intra-query parallelism. 3. How persistent objects are maintained in object oriented databases? 4. What is object relational database management systems? 5. Write the syntax and semantics of Datalog languages. 6. How to represent time in temporal databases and compare the different time dimensions. 7. Why do we need multimedia databases? List its advantages and disadvantages. 8. State the problems that would occur if transactions are allowed to execute concurrently. 9. What is native XML database? Give example. 10. Mention the components of cloud storage system. PART B — (5 × 16 = 80 Marks) 11. (a) (i) Explain the key properties which are used to measure the parallel database system performance. (8) (ii) Discuss the different architectures for parallel databases. (8) Or (b) (i) Explain the steps involved in processing a query with suitable example. (8) (ii) Compare and contrast the following pairs in distributed database; (4 + 4) (1) Fragmentation and Replication (2) Vertical and Horizontal partitioning. 12. (a) (i) Explain object identity and reference types with example. (8) (ii) How does the concept of a object in the object oriented model differ from the concept of an ER model? (8) Or (b) (i) Discuss the structure and various operation of object oriented database. (8) (ii) Explain the concept of ODMG model win example. (8) 13. (a) Explain how to identify an active and deductive databases with an example. (16) Or (b) Explain spatial data management. Discuss the various indexing techniques of spatial data management. (16) 14. (a) (i) Give a brief note on the design and implementation issues in mobile databases. (8) (ii) Distinguish location dependent and location independent query with an example. (8) Or (b) (i) Consider a data warehouse consists of four dimensions date, spectator, location and game and the two measures count and charge. The charge is the fare where the spectator pays when watching a game on a given date, spectator may be students, adults or seniors. Each category is having its own charge rate. Draw a star schema for the data warehouse and explain how many cuboids are needed to build the data cube? (8) (ii) Describe the task primitives and issues in text mining. (8) 15. (a) (i) Discuss the different approaches for storing XML documents in databases.  (8) (ii) Describe the web based architecture with suitable example. (8) Or (b) (i) Explain the concept of Geographic Information Systems. (8) (ii) Describe the characteristics of cloud computing environment. (8) _____________________________

Go to ME/MTech Anna University Previous Year Questions page

CS 9221 - Database Technology Anna University ME/MTech Question paper
CS 921 - Database Technology Anna University ME/MTech question paper
CP 7202 - Advanced Databases Anna University ME/MTech Question paper

CS6302 Database Management Systems May June 2015 - Question with answers

CS6302 Database Management Systems question paper - May/June 2015 / Anna University Previous Year 2015 Exam Questions / Anna University Previous Year 2015 Computer Science and Information Technology Question Papers / CS6302  / CS 2255 / CS 46 / CS 1254/080250009/10144 CS 406 — Database Management Systems Question with Answers

Question Paper Code : 77094

B.E./B.Tech. DEGREE EXAMINATION, APRIL/MAY 2015.

Third Semester

Computer Science and Engineering

CS 6302 — DATABASE MANAGEMENT SYSTEMS

(Common to Information Technology)

(Regulation 2013)

Time : Three hours                                                             Maximum : 100 marks

Answer ALL questions.

PART A — (10 × 2 = 20 marks)

1. Write the characteristics that distinguish the database approach with the file-based approach.
2. Define: Functional dependency

3. State the need for query optimization.

4. What is the difference between static and dynamic SQL?

5. Write the ACID properties of Transaction.

6. Define: DDL, DML, DCL, and TCL

7. How dynamic hashing differ from static hashing?

8. Write about four types (Star, snowflake, galaxy and fact constellation) of data warehouse schemas.

9. Define threats and risks.

10. What is association rule mining?

PART B — (5 × 16 = 80 marks)

11. (a) Draw an ER diagram for the “Restaurant Menu Ordering System”, which will facilitate the food items ordering and services within a restaurant. The entire restaurant scenario is detailed as follows. The customer is able to view the food items menu, call the waiter, place orders and obtain the final bill through the computer kept in their table. The waiters through their wireless tablet PC are able to initialize a table for customers, control the table functions to assist customers, orders, send orders to food preparation staff (chef) and finalize the customer’s bill. The food preparation staffs (chefs), with their touch-display interfaces to the system, are able to view orders sent to the kitchen by waiters. During preparation, they are able to let the waiter know the status of each item, and can send notifications when items are completed. The system should have full accountability and logging facilities, and should support supervisor actions to account for exceptional circumstances, such as a meal being refunded or walked out on. (16)

Or

(b) State the need for normalization of a database and explain the various normal forms (1st,2nd, 3rd, BCNF, 4^th, 5^th, and domain-key) with suitable examples (16)

12. (a) Consider a student registration database comprising of the below given table schema. (16)

Student_File(student_number, student_name, address, telephone)

Course_File(course_number, description, hours, professor_number)

Professor_File(Professor_number, name, office)

Registration_File(student_number, course_number, date)

Consider a suitable sample of tuples/records for the above mentioned tables and write DML statements (SQL) to answer for each queries listed below.

(i) Which courses does a specific professor teach?

(ii) What courses are taught by two specific professors?

(iii) Who teaches a specific course and where is his/her office?

(iv) For a specific student number, in which courses is the student registered and what is his/her name?

(v) Who are the professors for a specific student?

(vi) Who are the students registered in a specific course?

Or

(b) Discuss about the join order optimization and heuristic optimization algorithms. (16)

13. (a) Explain the Two-phase and Three-phase commit protocols. (16)

Or

(b) Consider the following schedules. The actions are listed in the order they are scheduled, and prefixed with the transaction name.

S1: T1:R(X), T2:R(X), T1:W(Y), T2:W(Y), T1:R(Y), T2:R(Y)

S2: T3:W(X), T1:R(X), T1:W(Y), T2:R(Z), T2:W(Z), T3:R(Z)

For each of the schedules, answer the following questions;

(i) What is the precedence graph for the schedule? (2)

(ii) Is the schedule conflict-serializable? If so, what are all the conflict equivalent serial schedules? (7)

(iii) Is the schedule view-serializable? If so, what are all the view equivalent serial schedules? (7)

14. (a) With suitable diagrams, discuss about the RAID levels (level 0, level 1, level 0+1, level 3, level 4 and level 5). (16)

Or

(b) Explain the architectural components of a data warehouse and write about data marts. (16)

15. (a) Neatly write the K-means algorithm and show the intermediate results in clustering the below given points into two clusters using K-means algorithm. (16)

P1: (0,0), P2: (1,10), P3: (2,20), P4: (1,15), P5: (1000,2000), P6: (1500,1500), P7: (1000,1250).

Or

(b) Discuss about the access control mechanisms and Cryptography methods to secure the databases. (16)

***********

 

Database Management Systems (DBMS) Question - Pune University May 2013

Database Management Systems (DBMS) Question - Pune University May 2013 / Pune University BE (CSE) and BTech (IT) DBMS Question - May 2013

UNIVERSITY OF PUNE

[4363] – 251

T.E. (Computer & IT Semester – I) Examination, 2013

DATABASE MANAGEMENT SYSTEMS

 (2008 Pattern)

Time: 3 Hours                                           Max. Marks: 100

Instructions : 1) Answers to the two Sections should be written in separate books.

2) Black figures to the right indicate full marks.

3) Assume suitable data, if necessary.

4) Solve Section I: Q 1 or Q 2, Q 3 or Q 4, Q 5 or Q 6.

5) Solve Section II: Q 7 or Q 8, Q 9 or Q 10, Q 11 or Q 12.

SECTION – I

Q1) A) How following problems are handled with DBMS. [6]

i. Data Isolation

ii. Data Redundancy and Inconsistency

iii. Data Integrity

B) Explain with examples how ER diagrams are converted into tables. [6]

C) Explain the need of the following. [6]

i. View       ii) Foreign Key.

OR

Q2) A) Explain various database languages. [8]

B) Explain various data models used in DBMS. [10]

Q3) A) Given relation schema: R(A,B,C), S(D,E,F). Let the relation r® and s(S) be given. Convert the following SQL statements in relational algebra form.               [8]

1. select * from r where B = 17;

2. select A, F from r,s where r.C = s.D;

3. update r set B = B*15 where A = ‘aaa’;

4. select * from s where E<20;

B) Explain various operations in relational algebra. [8]

OR

Q4) A) What is Cursor? Explain various types of Cursor. [8]

B) Explain stored procedures and triggers. [8]

Q5) A) Explain why 4NF is more desirable than BCNF. Rewrite the definition of 4NF and BCNF using the notions of domain constraints and general constraints. [8]

B) Specify Armstrong’s axioms. Use Armstrong’s axioms to prove the soundness of pseudo transitivity rule. [8]

OR

Q6) A) Let R=(A,B,C,D,E) and let M be the following set of multi-valued dependencies. [8]

A →→ BC, B →→ CD, E →→ AD.

List the non-trivial dependencies in M+.

B) Describe the concept of Transitive dependency and explain how this concept is used to define 3NF. [8]

SECTION - II

Q7) A) What is ordered indices? Explain the types of ordered indices with suitable example. [9]

B) Explain detail use of B Tree as an indexing technique. Compare B tree and B+ tree. [9]

OR

Q8) A) Explain following: [9]

i. Dense index    ii. Sparse index          iii. Clustered index

B) Give the transformation rules for releational expressions. [9]

Q9) A) Explain the concept of ‘Transaction’. Describe ACID properties for transaction. [8]

B) Show the two phase locking protocol ensures conflict serializability. [8]

OR

Q10) A) Explain timestamp based protocol. [8]

B) State and explain Thomas Write rule. [8]

Q11) A) How does the concept of an object in the object oriented model differ from the concept of an entity in the ER model. [8]

B) Explain the need of backup and replication. [8]

OR

Q12) A) What is fragment of a relation? What are main types of fragments? [8]

B) Write short note on:

i. Data warehouse manager

ii. Pointers swizzling techniques.

————————