Databases

GATE CS 2015 Set 3 — Question 54

Multiple choice 2 marks GATE CS — Computer Science & IT 2015

Consider a simple checkpointing protocol and the following set of operations in the log:(start, T4); (write, T4, y, 2, 3); (start, T1); (commit, T4); (write, T1, z, 5,…

GATE CS 2019 — Question 35

Multiple choice 1 mark GATE CS — Computer Science & IT 2019

Consider the following two statements about database transaction schedules:I. Strict two-phase locking protocol generates conflict serializable schedules that are also recoverable.II. Timestamp-ordering concurrency control protocol with Thomas' Write…

GATE CS 2020 — Question 47

Numerical answer 2 marks GATE CS — Computer Science & IT 2020

Consider a database implemented using a B+ tree for file indexing and installed on a disk drive with block size of 4 KB. The size of the search…

GATE CS 2015 Set 2 — Question 34

Numerical answer 1 mark GATE CS — Computer Science & IT 2015

Consider a B+ tree in which the search key is 12 bytes long, block size is 1024 bytes, record pointer is 10 bytes long and the block pointer…

GATE CS 2017 Set 1 — Question 43

Multiple choice 2 marks GATE CS — Computer Science & IT 2017

The following functional dependencies hold true for the relational schema \(R\{V, W, X, Y, Z\}\):V -> W VW -> X Y -> VX Y -> ZWhich of the…

GATE CS 2020 — Question 14

Multiple choice 1 mark GATE CS — Computer Science & IT 2020

Consider a relational table \(R\) that is in 3NF, but not in BCNF. Which one of the following statements is TRUE?

GATE CS 2014 Set 2 — Question 30

Multiple choice 2 marks GATE CS — Computer Science & IT 2014

Consider the following relational schema:employee(empId, empName, empDept) customer(custId, custName, salesRepId, rating)salesRepId is a foreign key referring to empId of the employee relation. Assume that each employee makes a…

GATE CS 2005 — Question 21

Multiple choice 1 mark GATE CS — Computer Science & IT 2005

Which one of the following statements about normal forms is FALSE?

GATE CS 2015 Set 2 — Question 42

Multiple choice 2 marks GATE CS — Computer Science & IT 2015

Consider two relations \(R_1(A, B)\) with the tuples \((1, 5), (3, 7)\) and \(R_2(A, C) = (1, 7), (4, 9)\). Assume that \(R(A, B, C)\) is the full natural outer join of \(R_1\) and \(R_2\). Consider the following tuples of…

GATE CS 2012 — Question 43

Multiple choice 2 marks GATE CS — Computer Science & IT 2012

Suppose \(R_1(A, B)\) and \(R_2(C, D)\) are two relation schemas. Let \(r_1\) and \(r_2\) be the corresponding relation instances. \(B\) is a foreign key that refers to \(C\) in \(R_2\).…