Anna University Previous Years Question Papers
Question Paper Code: 77094
B.E, B.TECH DEGREE EXAMINATION,APRIL/MAY-2015
Third Semester
Computer Science and Engineering
CS6302 Database Management Systems
(Common to information Technology)
(Regulation 2013)
Time- Three hour
Maximum Mark-100
Note:
Old Subject Code in R-2008: CS2255
Semester in R-2008: 04th Semester
Answer all questions
PART A-10X2=20 marks
1. Write the characteristics that distinguish the data base approach with File-base approach.
2. Define: Function dependency.
3. State the need for Query optimization.
4. What is different 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 the four type (star, snowflake, galaxy and fast constellation)of data ware house schemas.
9. Define threats and risks.
10. What is association rule mining?
Part b-5x16-80 marks
11.(a) Draw E-R diagram for the restaurant menu ordering system which will facilitate the food items ordering and services within a restaurant. The entire restaurant scenario is detail as follow. The customer is able to view to food items menu, call the waiter, place order and obtain the final bill through the computer kept in their table. The waiter through their wireless tablet PC are able to initialize a table for customer, control the table function to assist customer, orders, sent order to food preparation staff (chef) and finalize the customer bill. The food preparation staff (chef), with their touch display interfaces to the system,are able to view orders to sent the kitchen by waiter. During preparation they are able to let the waiter know the status of each items are completed. The system should have full accountability and logging facilities and should support supervisors action to account for exceptional circumstances, such as a meal being refunded or walked out on.
(or)
(b) State the need for normalization of a data base and explain the various normal forms (1st,2nd, 3rd BCNF, 4th,5thand domain key)with suitable example.
12.(a) Consider a student registration database comprising of belong given table schema.
Student file
Student number student name student address telephone Number
Course
Course number Description Hours professor Number
Professor File
Professor number Name Office
Registration number
Student Name course Data
Consider a suitable sample of tuples /record for the above mentioned tables and wires DML statement (SQR) to answer for the 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 course is the student registered and what is his/her name?
(v) Who are a professors for the specific studend?
(vi) Who are the student registered in a specific course?
(or)
(b) Discuss about the join order optimization and Heuristic optimization algorithms.
13.(a) Explain the two phase commit and Three phase commit protocols.
(or)
(b) Consider the following schedules. The actions are listed in order they are schedules, and prefixed with the transaction name.
S1: T1:R(X), T2: R(X), T1: W(Y), T2¬:W(Y), T1: R(Y), T2R(Y)
S2: T3:W(X), T1:R(X) , T1W(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?
(ii) Is the schedules conflict- serializable?If so what are all the conflict equivalent serial schedules?
(iii) Is the schedules view-serializable? If so what are all the view equivalent serial schedules?
14.(a) With suitable diagram, discuss about the Raid level (level 0, level 1, level 0+1, level 3, level 4, level 5)
(or)
(b)Explain the Architectural components of a data warehouse and write about data marts.
15.(a) Neatly write the K- means algorithm and show the intermediation result in clustering the below given point into cluster using K-meansalgorithm.
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.
Question Paper Code: 77094
B.E, B.TECH DEGREE EXAMINATION,APRIL/MAY-2015
Third Semester
Computer Science and Engineering
CS6302 Database Management Systems
(Common to information Technology)
(Regulation 2013)
Time- Three hour
Maximum Mark-100
Note:
Old Subject Code in R-2008: CS2255
Semester in R-2008: 04th Semester
Answer all questions
PART A-10X2=20 marks
1. Write the characteristics that distinguish the data base approach with File-base approach.
2. Define: Function dependency.
3. State the need for Query optimization.
4. What is different 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 the four type (star, snowflake, galaxy and fast constellation)of data ware house schemas.
9. Define threats and risks.
10. What is association rule mining?
Part b-5x16-80 marks
11.(a) Draw E-R diagram for the restaurant menu ordering system which will facilitate the food items ordering and services within a restaurant. The entire restaurant scenario is detail as follow. The customer is able to view to food items menu, call the waiter, place order and obtain the final bill through the computer kept in their table. The waiter through their wireless tablet PC are able to initialize a table for customer, control the table function to assist customer, orders, sent order to food preparation staff (chef) and finalize the customer bill. The food preparation staff (chef), with their touch display interfaces to the system,are able to view orders to sent the kitchen by waiter. During preparation they are able to let the waiter know the status of each items are completed. The system should have full accountability and logging facilities and should support supervisors action to account for exceptional circumstances, such as a meal being refunded or walked out on.
(or)
(b) State the need for normalization of a data base and explain the various normal forms (1st,2nd, 3rd BCNF, 4th,5thand domain key)with suitable example.
12.(a) Consider a student registration database comprising of belong given table schema.
Student file
Student number student name student address telephone Number
Course
Course number Description Hours professor Number
Professor File
Professor number Name Office
Registration number
Student Name course Data
Consider a suitable sample of tuples /record for the above mentioned tables and wires DML statement (SQR) to answer for the 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 course is the student registered and what is his/her name?
(v) Who are a professors for the specific studend?
(vi) Who are the student registered in a specific course?
(or)
(b) Discuss about the join order optimization and Heuristic optimization algorithms.
13.(a) Explain the two phase commit and Three phase commit protocols.
(or)
(b) Consider the following schedules. The actions are listed in order they are schedules, and prefixed with the transaction name.
S1: T1:R(X), T2: R(X), T1: W(Y), T2¬:W(Y), T1: R(Y), T2R(Y)
S2: T3:W(X), T1:R(X) , T1W(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?
(ii) Is the schedules conflict- serializable?If so what are all the conflict equivalent serial schedules?
(iii) Is the schedules view-serializable? If so what are all the view equivalent serial schedules?
14.(a) With suitable diagram, discuss about the Raid level (level 0, level 1, level 0+1, level 3, level 4, level 5)
(or)
(b)Explain the Architectural components of a data warehouse and write about data marts.
15.(a) Neatly write the K- means algorithm and show the intermediation result in clustering the below given point into cluster using K-meansalgorithm.
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.
0 comments:
Pen down your valuable important comments below