DBMS |Gate-2006| Database Management System 1. Consider the following log sequence of two transactions on a bank account, with initial balance 12000, that transfer 2000 to a mortgage payment and then apply a 5% interest. Suppose the database system crashes just before log record 7 is written. When the system is restarted, which one statement …
DBMS |Gate-2006| Previous Year Questions| Set-15 Read More »
DBMS |Gate-2007| Database Management System 1. Consider the following relation schemas : i. b-Schema = (b-name, b-city, assets)ii. a-Schema = (a-num, b-name, bal)iii. d-Schema = (c-name, a-number) Let branch, account and depositor be respectively instances of the above schemas. Assume that account and depositor relations are much bigger than the branch relation. Consider the following …
DBMS |Gate-2007| Previous Year Questions| Set-14 Read More »
DBMS |Gate-2008| Database Management System A clustering index is defined on the fields which are of type : [GATE – 2008] a. non-key and orderingb. non-key and non-orderingc. key and orderingd. key and non-ordering Answer : a) A B-tree of order 4 is built from scratch by 10 successive insertions. What is the maximum number …
DBMS |Gate-2008| Previous Year Questions| Set-13 Read More »
DBMS |Gate-2009| Database Management System The following key values are inserted into a B+ – tree in which order of the internal nodes is 3, and that of the leaf nodes is 2, in the sequence given below. The order of internal nodes is the maximum number of tree pointers in each node, and the …
DBMS |Gate-2009| Previous Year Questions| Set-12 Read More »
DBMS |Gate-2010| Database Management System Consider a B+-tree in which the maximum number of keys in a node is 5. What is the minimum number of keys in any non-root node? [GATE – 2010] a. 1b. 2c. 3d. 4 Answer : b) 2. A relational schema for a train reservation database is given below. Passenger …
DBMS |Gate-2010| Previous Year Questions| Set-11 Read More »
DBMS |Gate-2011| Database Management System 1. Consider a relational table with a single record for each registered student with the following attributes. [GATE – 2011] 1. Registration_Num: Unique registration number of each registered student2. UID: Unique identity number, unique at the national level for each citizen3. BankAccount_Num: Unique account number at the bank. A student …
DBMS |Gate-2011| Previous Year Questions| Set-10 Read More »
DBMS |Gate-2012| Database Management System 1. Which of the following is TRUE? [GATE – 2012] a. Every relation in 3NF is also in BCNFb. A relation R is in 3NF if every non-prime attribute of R is fully functionally dependent on every key of Rc. Every relation in BCNF is also in 3NFd. No relation can …
DBMS |Gate-2013| Database Management System 1. An index is clustered, if : [GATE – 2013] a. it is on a set of fields that form a candidate key.b. it is on a set of fields that include the primary key.c. the data records of the file are organized in the same order as the data …
DBMS |Gate-2014| Database Management System 1. Consider the relation scheme R = (E, F, G, H, I, J, K, L, M, N) and the set of functional dependencies {{E,F} → {G}, {F} → {I,J}, {E,H} → {K,L}, {K} → {M}, {L} → {N}} on R. What is the key for R? [GATE – 2014] a. …
DBMS |Gate-2015| Database Management System 1. SELECT operation in SQL is equivalent to : [GATE – 2015] a. the selection operation in relational algebrab. the selection operation in relational algebra, except that SELECT in SQL retains duplicatesc. the projection operation in relational algebrad. the projection operation in relational algebra, except that SELECT in SQL retains …