CS6302 DATA BASE MANAGEMENT SYSTEM AU QUESTION PAPER

Embed Size (px)

DESCRIPTION

CS6302 DATA BASE MANAGEMENT SYSTEM AU QUESTION PAPER

Citation preview

  • (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 specjfic student?(vr) Who are the stud,ents registered in a specific course? (16)

    r

    &) Disctrss about the Join order optimization and Heuristic optimization(16)algorithms.IB. (a) Explain the Two-phase Commit and Three-Phase Commit Protocols. (16)

    Or

    G) Consider the following schedules. The actions are listed in the order they, are scheduled, and.prefrxed with the transaction name.

    ' S1 : Tl:R(X), T2:RQC), T1:WC0, T2:W($, Tl:R(Y), T2:R(Y)52: T3:WCK), T1 :R(X), T1 :Wflf, TZ:R(Z),T2:W(Z), T3:R(Z)For each of the sched.ules, answer the following questions :(r) 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? G)(iii) Is the schedule view-serializable? If so, what are all the viewgquivalent serial schedules? Q)

    14. (a) With Suitable diagrams, discuss about the Raid Levels (Level0, Level 1,Level 0+1, Level S, Level 4 and Level S). (16)

    Or

    (b) Explain the Architectural components of a Data Warehouse and writeabout Data marts. (16)

    lb. (a) Neatly write the K-means algorithm and show the intermediate resultsin clustering the below gwen points into Two clusters using K'meansalgorithm.P1 : (0,0), P2 : (1,10), PB : (2,20), P4: (1,15), P5 : (1000, 2000)'P6: (1500, 1500), P7: (1000,1250).

    Or

    (b) Discuss aboui the Aecess control mechanisms and Cryptography methodsto secure the Databases. (16)

    (16)

    77094

    AdminTypewritten Textcseitquestions.blogspot.in