Databases | SQL | Oracle | MS Access Answers

Check whether the given schedules are conflict serializable or not

 S1 : R2(B)W2(A)R1(A)R3(A)W1(B)W2(B)W3(B)

S2:R3(Y)W3(Z)R1(X)W1(X)W3(Y)W3(Z)R2(Z)R1(Y)W1(Y)R2(Y)W2(Y)

Check whether Schedule is serial, serializable, Conflict serializable

S:R2(Z),R2(Y),W2(Y),R3(Y),R3(Z),R1(X),W1(X),W3(Y)W3(Z)R2(X)R1(Y)W1(Y)

Write an SQL query to fetch “FIRST_NAME” from the table in upper case.            

SQL query to fetch “JOINING_DATE” whose department is Admin and salary is more than 70000.                                           

Given a relation R( P, Q, R, S, T, U, V, W, X, Y) and Functional Dependency set FD = { PQ → R, PS → VW, QS → TU, P → X, W → Y }, determine whether the given R is in 2NF?Describe anomalies of database.(10marks)

) Check the given schedule for conflict serializability:

	S1: R1(X) R1(Y) R2(X) R2(Y) W2(Y) W1(X)

Consider a schedule with 3 transactions with 2, 3, and 4 operations respectively. Calculate the possible

number of

c) Serial schedules

d) Non serial schedules

Consider the following schedule of transactions

R1(A) W1(A) R2(A) W2(B) W1(B) Commit1 Commit2

Which of the following properties are true for the above schedule and justify the reason for your answer

with explanation?

a) Conflict Serializable

b) View Serializable

c) Recoverable

Consider the following relation with set of functional dependencies

R(ABCDEF)

AB->CD, CD->EF, BC->DEF, D->B, CE->F

a) Identify the candidate keys in the above relation (with proper steps followed).

b) Identify which normal form this relation is in and reason for the answer.

Create the given database with the condition that EMP_ID and FIRST_NAME will be the primary key of table and all unique values in LAST_NAME