Suppose a database schedule S involves transactions T1, ..., Tn. Construct the precedence graph of S with vertices representing the transactions and edges representing the conflicts. If S is serializable, which one of the following orderings of the vertices of the precedence graph is guaranteed to yield a serial schedule? [G16S2Q32]

Explanation

Consider the following database schedule with two transactions, T1 and T2. [G16S2Q61]

Explanation

Consider the following database table named water_schemes : [G16S2Q62]

Explanation

Which of the following is NOT a superkey in a relational schema with attributes V, W, X, Y, Z and primary key V Y? [G16S1Q31]

Explanation

Which one of the following is NOT a part of the ACID properties of database transactions? [G16S1Q32]

Explanation

A database of research articles in a journal uses the following schema. (VOLUME, NUMBER, STARTPAGE, ENDPAGE, TITLE, YEAR, PRICE) The primary key is (VOLUME, NUMBER, STARTPAGE, ENDPAGE) and the following functional dependencies exist in the schema. [G16S1Q33]

Explanation

Consider the following tables T1 and T2. [G17S2Q19]

Explanation

Two transactions T1 and T2 are given as [G17S2Q44]

Explanation

Consider the following database table named top-scorer. [G17S2Q46]

Explanation

Consider following schedules involving two transactions : [J17P3Q7]

Explanation

Which one is correct w.r.t. RDBMS ? [J17P3Q8]

Explanation

Let pk(R) denotes primary key of relation R. A many-to-one relationship that exists between two relations R1 and R2 can be expressed as follows : [J17P3Q9]

Explanation

For a database relation R(A, B, C, D) where the domains of A, B, C and D include only atomic values, only the following functional dependencies and those that can be inferred from them are : [J17P3Q10]

Explanation

Consider the following relation : Works (emp_name, company_name, salary) Here, emp_name is primary key. Consider the following SQL query [J17P3Q11]

Explanation

If following sequence of keys are inserted in a B+ tree with K(=3) pointers : 8, 5, 1, 7, 3, 12, 9, 6 Which of the following shall be correct B+ tree ? [J17P3Q12]

Explanation

The following functional dependencies hold true for the relational schema R{V,W,X,Y,Z}: [G17S1Q16]

Explanation

Consider a database that has the relation schema EMP (EmpId, EmpName, and DeptName). An instance of the schema EMP and a SQL query on it are given below. [G17S1Q23]

Explanation

Consider a database that has the relation schemas EMP(EmpId, EmpName, DeptId), and DEPT(DeptName, DeptId). Note that the DeptId can be permitted to be NULL in the relation EMP. [G17S1Q41]

Explanation

In a database system, unique timestamps are assigned to each transaction using Lamport's logical clock. Let TS(T1) and TS(T2) be the time stamps of transactions T1 and T2 respectively. [G17S1Q42]

Explanation

Consider a database that has the relation schema CR(StudentName, CourseName). An instance of the schema CR is as given below. [G17S1Q46]

Explanation