Register

Recent questions tagged tbb-dbms-2

526
views
1 answers
0 votes
Random college question paper
Given a relation R(A, B, C, D, E, F, G, H) with keys BD and C and functional dependenciesD→G, E→F and H→C, decompose the R into the highest normal form possible.
User Avatar
585
views
2 answers
0 votes
Test by Bikram | Databases | Test 2 | Question: 30
Consider the following set of relations: EMP (eno, ename , dno) DEPT (dno, dname)Primary key columns are underlined and dno in EMP is a ... :2 returns different number of columns.I, II onlyIII, IV onlyII, III onlyI, IV only
User Avatar
793
views
1 answers
2 votes
Test by Bikram | Databases | Test 2 | Question: 29
Let Depositor and Lender be relational schemas such thatDepositor = {a/c number, cname , balance, branch} & Lender ={loan_number ,cname, amount , branch}. Now ... 3 give same result.Query 1, Query 2 and Query 3 give different results.
User Avatar
314
views
1 answers
1 votes
Test by Bikram | Databases | Test 2 | Question: 28
Given below are some transaction schedules that involve three transactions $T1 \ T2 \ T3$:$\textbf{Schedule 1:}$T2 : Rx , T2 : Ry , T1 : Wx ... above given schedules is conflict serializable?Schedule $1$Schedule $2$Schedule $3$Schedule $4$
User Avatar
521
views
0 answers
3 votes
Test by Bikram | Databases | Test 2 | Question: 27
Consider the relation:Exam(eid, marks)Assume that marks take not null integers only. Also, marks takes distinct values and the number of tuples are odd. ... print?Mean of the marksMedian of the marksMode of the marksAverage of the marks
User Avatar
1.1k
views
3 answers
8 votes
Test by Bikram | Databases | Test 2 | Question: 26
Assume that a data file contains $2000$ records that are ordered by a key attribute $K$ , and a primary index on attribute $K$ is built.The size of key ... accesses required to fetch the record using the index (in average case) is _____.
User Avatar
334
views
1 answers
3 votes
Test by Bikram | Databases | Test 2 | Question: 25
Consider a relational table $T$ with sufficient number of records having attributes $T1, T2, \dots ,Tn$ (where $1 \leq p \leq n)$Two queries $S1$ and $S2$ ... $S2$ but not $S1$.Hashing will outperform ordered indexing on $S1$ but not $S2$.
User Avatar
423
views
1 answers
0 votes
Test by Bikram | Databases | Test 2 | Question: 24
Consider the relation schemas:Rank (name, rank) and student (name, country), where name in student table is a foreign key in table Rank.Which of the following TRC Queries displays ...
User Avatar
584
views
1 answers
7 votes
Test by Bikram | Databases | Test 2 | Question: 23
Consider the table employee' having two columns: 'EmpNo' and 'EmpName'.Run the following transaction on the table:COMMIT; ALTER TABLE employee ADD ... (B) but will throw an error indicating failed transactionEmpNo EmpName PhoneNo
User Avatar
456
views
1 answers
2 votes
Test by Bikram | Databases | Test 2 | Question: 22
Consider the following relation schema:Student (RollNo, Sname, Scity) Packages (Pcode, Pname, Price) Registers (RollNo PCode, Date) What does the ... for at least one package.RollNos of students who registered for all the packages.
User Avatar
351
views
1 answers
2 votes
Test by Bikram | Databases | Test 2 | Question: 21
Consider the following transaction involving two bank accounts $A$ and $B$ ... of the accounts $A$ and $B$ should remain constant is that of:AtomicityConsistencyIsolationDurability
User Avatar
461
views
1 answers
1 votes
Test by Bikram | Databases | Test 2 | Question: 20
Assume that a B-Tree is used as an index for a large database table which has six levels (including the root node). If a new key is inserted into this index, then the maximum number of levels possible in the updated tree is ______.
User Avatar
368
views
1 answers
1 votes
Test by Bikram | Databases | Test 2 | Question: 19
A schedule with two transactions T1 and T2 is as mentioned below: ... is an example of:Cascade-less scheduleRecoverable scheduleBoth Cascade-less and Recoverable scheduleIrrecoverable schedule
User Avatar
518
views
1 answers
2 votes
Test by Bikram | Databases | Test 2 | Question: 18
The above ER diagram depicts a book rental scheme.If this ER diagram is mapped to a relational model, to correctly depict this above scenario, the total number of relations required will be _________.
User Avatar
521
views
2 answers
3 votes
Test by Bikram | Databases | Test 2 | Question: 17
Which of the following is TRUE about the given schedule S? ... but not conflict serializable.It is conflict serializable but not view serializable.It is not serializable.
User Avatar
474
views
2 answers
3 votes
Test by Bikram | Databases | Test 2 | Question: 16
$\sigma_{A=B \text{ and } B=C \text{ and } C=A} \bigg( \Pi_A (R) \times \Pi_B (R) \times \Pi_C (R) \bigg)$The number of rows returned by the above relational algebraic expression is ________.
User Avatar
441
views
1 answers
3 votes
Test by Bikram | Databases | Test 2 | Question: 15
What is the number of rows returned by an SQL query on the below EMP table? ... ;It will throw an error.Three rows are selected.No rows are selected.One row is selected.
User Avatar
440
views
1 answers
0 votes
Test by Bikram | Databases | Test 2 | Question: 14
Consider the schedule $S = \{R1(A),R2(B),W2(A),W1(A)\}$Assume that Transaction T1 has started execution before Transaction T2.Which of the ... and Thomas Write Rule.Not allowed under both Basic Timestamp Protocol and Thomas Write Rule.
User Avatar
504
views
1 answers
1 votes
Test by Bikram | Databases | Test 2 | Question: 13
Consider the following table structures:CREATE TABLE dept(dno number PRIMARY KEY, dname varchar2(30)); CREATE TABLE emp(eno number PRIMARY KEY, ename ... successful.Delete on DEPT is always successful.Update on EMP is always successful.
User Avatar
301
views
1 answers
2 votes
Test by Bikram | Databases | Test 2 | Question: 12
Consider a table $R (A,B,C,D,E)$ where the functional dependencies are:$A \rightarrow B$B \rightarrow C$D \rightarrow E$Table is ... preserving and lossy. Neither dependency preserving nor lossless. Not dependency preserving but lossless.
User Avatar
692
views
1 answers
9 votes
Test by Bikram | Databases | Test 2 | Question: 11
Relation $L( p,q)$ is stored in $100$ blocks, with $50$ records per block (or tuples) of $L$ fitting in one block. Relation $K(m,n)$ is ... Therefore, the total number of blocks required in the result of join operation is: ______ blocks.
User Avatar
1.1k
views
1 answers
2 votes
Test by Bikram | Databases | Test 2 | Question: 10
We are using timestamp-based concurrency control, and there are two transactions T1 and T2 with timestamps 100 and 200, respectively.The following schedule ... Write Rule, but is allowed under Multi-version Timestamp Ordering Protocol.
User Avatar
417
views
1 answers
1 votes
Test by Bikram | Databases | Test 2 | Question: 9
In a B-Tree, the block size is $512$ Bytes, search key is $4$ Bytes, block pointer size is $8$ Bytes and record pointer size is $8$ ... in level $0$ of the above B-tree (where root is at level $0$) is _________.
User Avatar
475
views
1 answers
3 votes
Test by Bikram | Databases | Test 2 | Question: 8
Consider the following schedule: ... transaction problems is present in the given schedule ?Lost updateDirty ReaUnrepeatable readBoth (A) & (B)
User Avatar
406
views
1 answers
3 votes
Test by Bikram | Databases | Test 2 | Question: 7
What is the highest normal form of the relation $R(ABCDEF)$ ... \ \ CD \rightarrow BEF, \ \ AB \rightarrow D \}$?$1NF$2NF$3NF$BCNF$
User Avatar
721
views
1 answers
3 votes
Test by Bikram | Databases | Test 2 | Question: 6
Decompose the following table into BCNF:$R(ABCD)$A \rightarrow C$C \rightarrow A$AB \rightarrow D$The result is:(AC) (ABD)(AC) (CBD)(AB)(BAD)Both (A) & (B)
User Avatar
328
views
1 answers
1 votes
Test by Bikram | Databases | Test 2 | Question: 5
Consider the following set of FDs on a relation $R(ABCDE)$:$F1 = \{ A \rightarrow B, \ AB \rightarrow C, \ D \rightarrow AC, \ D \rightarrow E \}$F2 = \{ A \ ... doesn't cover $F1$.$F1$ is equivalent to $F2$.$F1$ is not equivalent to $F2$.
User Avatar
824
views
2 answers
3 votes
Test by Bikram | Databases | Test 2 | Question: 4
A relation $R(P,Q,R,S)$ has $\{PQ, QR, RS, PS\}$ as candidate keys. The total number of superkeys possible for relation $R$ is ______
User Avatar
729
views
1 answers
0 votes
Test by Bikram | Databases | Test 2 | Question: 3
Consider the following schedule: ... \text{timestamp(T1)}$?$W(B), W(C)$W(A), W(A)$W(A) ,W(B)$W(C), W(A)$
User Avatar
367
views
2 answers
1 votes
Test by Bikram | Databases | Test 2 | Question: 2
The relation R (ABCDE) with FD set $\{AB \rightarrow CDE, \ A \rightarrow C, \ C \rightarrow D\}$ is in which of the following normal forms? 1NF but not in 2NF in both 2NF and 3NF in 3NF but not in BCNF in BCNF
User Avatar
Page: