Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged tbb-dbms-1
1
votes
1
answer
1
Test by Bikram | Databases | Test 1 | Question: 30
Consider the join of relation R with a relation S. If R has $m$ tuples and S has $n$ tuples, then the maximum and minimum sizes of the join, respectively, are __________. $m+n$ and $0$ $m+n$ and $|m-n|$ $mn$ and $0$ $mn$ and $m+n$
Consider the join of relation R with a relation S. If R has $m$ tuples and S has $n$ tuples, then the maximum and minimum sizes of the join, respectively, are __________....
Bikram
319
views
Bikram
asked
Nov 26, 2016
Databases
tbb-dbms-1
+
–
0
votes
1
answer
2
Test by Bikram | Databases | Test 1 | Question: 29
A functional dependency of the form x → y is trivial if y ⊆ x y ⊂ x x ⊆ y x ⊂ y
A functional dependency of the form x → y is trivial ify ⊆ xy ⊂ xx ⊆ yx ⊂ y
Bikram
230
views
Bikram
asked
Nov 26, 2016
Databases
tbb-dbms-1
+
–
0
votes
1
answer
3
Test by Bikram | Databases | Test 1 | Question: 28
What does the following Tuple Relational Calculus query produce? The expression σθ1 (E1 ⋈θ2 E2) is the same as: E1 ⋈θ1^ θ2 E2 (σθ1 E1) ∧ (σθ2 E2 ) E1 ⋈ θ1∨ θ2 E2 None of the above
What does the following Tuple Relational Calculus query produce?The expression σθ1 (E1 ⋈θ2 E2) is the same as: E1 ⋈θ1^ θ2 E2 (σθ1 E1) ∧ (σθ2 E2 ) E1 ⋈ θ...
Bikram
299
views
Bikram
asked
Nov 26, 2016
Databases
tbb-dbms-1
+
–
0
votes
1
answer
4
Test by Bikram | Databases | Test 1 | Question: 27
What does the following relational algebra expression represent ? Consider the relations given below with keys in Bold : Branch (branch no, street, city) Staff (staff No, name, salary, branch No, position, DOB) propertyForRent ( ... Π staffNo (propertyForRent) Π staffNo (Staff) - Π staffNo (propertyForRent) Π staffNo (Staff) * ΠstaffNo(rent)
What does the following relational algebra expression represent ?Consider the relations given below with keys in Bold :Branch (branch no, street, city)Staff (staff No, n...
Bikram
297
views
Bikram
asked
Nov 26, 2016
Databases
tbb-dbms-1
+
–
1
votes
1
answer
5
Test by Bikram | Databases | Test 1 | Question: 26
Consider the following relations Employee (E#, Ename, salary, Bdate, D#) Department (D#, Dname, mgremp#, Location) Dependent (E#, DependentName) Which among these tuple calculus queries represent the following condition: List the names of mangers who have at least one dependent ... t (t ∈ DEPENDENT ∧ u ∈ DEPARTMENT ∧ t[E#] = u[D#] ∧ m[E#] = u[D#])}
Consider the following relationsEmployee (E#, Ename, salary, Bdate, D#)Department (D#, Dname, mgremp#, Location)Dependent (E#, DependentName)Which among these tuple calcu...
Bikram
297
views
Bikram
asked
Nov 26, 2016
Databases
tbb-dbms-1
+
–
1
votes
1
answer
6
Test by Bikram | Databases | Test 1 | Question: 25
Checkpoints are a part of Recovery measures Security measures Concurrency measures Authorization measures
Checkpoints are a part ofRecovery measuresSecurity measuresConcurrency measuresAuthorization measures
Bikram
311
views
Bikram
asked
Nov 26, 2016
Databases
tbb-dbms-1
+
–
0
votes
1
answer
7
Test by Bikram | Databases | Test 1 | Question: 24
Let the search key field of a B+ tree is 4 Bytes , the disk block size is 199 Bytes , and the index pointer is 3 Bytes, then the order of B+ tree is _______
Let the search key field of a B+ tree is 4 Bytes , the disk block size is 199 Bytes , and the index pointer is 3 Bytes, then the order of B+ tree is _______
Bikram
385
views
Bikram
asked
Nov 26, 2016
Databases
tbb-dbms-1
numerical-answers
+
–
1
votes
2
answers
8
Test by Bikram | Databases | Test 1 | Question: 23
Given R(A,B,C,D,E) with the set of FDs, F{AB→CD, ABC → E, C → A} the normal form of R is 2NF BCNF 4NF 3NF
Given R(A,B,C,D,E) with the set of FDs,F{AB→CD, ABC → E, C → A}the normal form of R is2NFBCNF4NF3NF
Bikram
503
views
Bikram
asked
Nov 26, 2016
Databases
tbb-dbms-1
+
–
3
votes
2
answers
9
Test by Bikram | Databases | Test 1 | Question: 22
Consider the following set of relations: EMP(eno, ename, dno) DEPT(dno,dname) Primary key columns are in bold and dno in EMP is a foreign key referring primary key of DEPT table. Now consider the following queries: QUERY : 1 SELECT * FROM emp e ... Query:1 and Query:2 returns different no of columns. I, II only I, IV only II, III only III, IV only
Consider the following set of relations: EMP(eno, ename, dno)DEPT(dno,dname)Primary key columns are in bold and dno in EMP is a foreign key referring primary key of DEP...
Bikram
678
views
Bikram
asked
Nov 26, 2016
Databases
tbb-dbms-1
natural-join
+
–
0
votes
1
answer
10
Test by Bikram | Databases | Test 1 | Question: 21
A transaction is in __________ state after the final statement has been executed. partially committed active committed aborted
A transaction is in __________ state after the final statement has been executed.partially committedactivecommittedaborted
Bikram
340
views
Bikram
asked
Nov 26, 2016
Databases
tbb-dbms-1
+
–
0
votes
1
answer
11
Test by Bikram | Databases | Test 1 | Question: 20
What is the Minimum space utilization for a $B+$ Tree index node: $80 \%$ $60 \%$ $50 \%$ $75 \%$
What is the Minimum space utilization for a $B+$ Tree index node:$80 \%$$60 \%$$50 \%$$75 \%$
Bikram
338
views
Bikram
asked
Nov 26, 2016
Databases
tbb-dbms-1
+
–
0
votes
1
answer
12
Test by Bikram | Databases | Test 1 | Question: 19
Which is the best file organization when data is frequently added or deleted from a file? Sequential Direct Index sequential None of the above
Which is the best file organization when data is frequently added or deleted from a file?SequentialDirectIndex sequentialNone of the above
Bikram
403
views
Bikram
asked
Nov 26, 2016
Databases
tbb-dbms-1
+
–
2
votes
1
answer
13
Test by Bikram | Databases | Test 1 | Question: 18
$R (A,B,C,D)$ is a relation. Which of the following does not have a lossless join dependency preserving BCNF decomposition $A \rightarrow B, \ B \rightarrow CD$ $A \rightarrow B, \ B \rightarrow C, \ C \rightarrow D$ $AB \rightarrow C,\ C \rightarrow AD$ $A \rightarrow BCD$
$R (A,B,C,D)$ is a relation. Which of the following does not have a lossless join dependency preserving BCNF decomposition$A \rightarrow B, \ B \rightarrow CD$$A \rightar...
Bikram
427
views
Bikram
asked
Nov 26, 2016
Databases
tbb-dbms-1
+
–
3
votes
2
answers
14
Test by Bikram | Databases | Test 1 | Question: 17
This is an Instance of Sailors Relation ... S2.rating ) SELECT S.sname FROM Sailors S WHERE S.rating >ALL ( SELECT S2.rating FROM Sailors S2 WHERE S2.age < 21 )
This is an Instance of Sailors Relation$$\overset{\text{Sailors Table}} { \begin{array}{|l|l|} \hline \text{S_ID} & \text{S_Name} & \text{Rating} & \text{Age} \\ \hline 1...
Bikram
888
views
Bikram
asked
Nov 26, 2016
Databases
tbb-dbms-1
+
–
1
votes
1
answer
15
Test by Bikram | Databases | Test 1 | Question: 16
The FD $A \rightarrow B, \ \ DB \rightarrow C$ implies $DA \rightarrow C$ $A \rightarrow C$ $B \rightarrow A$ $DB \rightarrow A$
The FD $A \rightarrow B, \ \ DB \rightarrow C$ implies$DA \rightarrow C$$A \rightarrow C$$B \rightarrow A$$DB \rightarrow A$
Bikram
199
views
Bikram
asked
Nov 26, 2016
Databases
tbb-dbms-1
+
–
1
votes
1
answer
16
Test by Bikram | Databases | Test 1 | Question: 15
Let $R = (A,B,C)$, and let $r1$ and $r2$ both be relations on schema $R$. Select a SQL expression among these options that is equivalent to the following query. $ \Pi AB(r1) \bowtie \Pi BC(r2)$ select r1.A, r2.B, r2.C from r1, r2 where r1.B = r2 ... r1 where (A, B, C) not in (select ∗ from r2) select r1.A , r2.B , r1.C from r1, r2 where r1.B = r2.B
Let $R = (A,B,C)$, and let $r1$ and $r2$ both be relations on schema $R$. Select a SQL expression among these options that is equivalent to the following query. $ \Pi AB(...
Bikram
381
views
Bikram
asked
Nov 26, 2016
Databases
tbb-dbms-1
+
–
1
votes
2
answers
17
Test by Bikram | Databases | Test 1 | Question: 14
Let there is a Table named Stud_records with $3000$ records of fixed length, each record size is $50$ Bytes and records are stored in a block of size $512$ Bytes, If secondary index is built on the key field of size $10$ Bytes and a block pointer of size $5$ Bytes , then the number of first level index blocks are ______
Let there is a Table named Stud_records with $3000$ records of fixed length, each record size is $50$ Bytes and records are stored in a block of size $512$ Bytes, If sec...
Bikram
867
views
Bikram
asked
Nov 26, 2016
Databases
tbb-dbms-1
numerical-answers
+
–
2
votes
3
answers
18
Test by Bikram | Databases | Test 1 | Question: 13
A student can register for at most $p$ courses and each course can have at most $v$ students. Each student is enrolled to at least one course and each course has at least one student. This schema is normalized into three tables: $\textbf{Student, Registers, Courses}$ The ... not be correct? $Y \geq 1$ $Y \leq p ^* X$ $X \geq v ^* Y$ $X > 0$
A student can register for at most $p$ courses and each course can have at most $v$ students. Each student is enrolled to at least one course and each course has at least...
Bikram
589
views
Bikram
asked
Nov 26, 2016
Databases
tbb-dbms-1
+
–
0
votes
1
answer
19
Test by Bikram | Databases | Test 1 | Question: 12
Which one is NOT True among these statements: In B+-tree, data pointers are stored only at the leaf nodes of the tree Any B-tree is a search tree may not be always balanced In a B-tree, every value of the search field appears ... the tree The leaf nodes of the B+-tree are linked together to provide ordered access on the search field to the records
Which one is NOT True among these statements:In B+-tree, data pointers are stored only at the leaf nodes of the treeAny B-tree is a search tree may not be always balanced...
Bikram
241
views
Bikram
asked
Nov 26, 2016
Databases
tbb-dbms-1
+
–
1
votes
1
answer
20
Test by Bikram | Databases | Test 1 | Question: 11
Consider the following database schedule with $3$ transactions, $T1$ ,$T2$ and $T3$. Where $r$ ... following statements about the above schedule is TRUE? the schedule is serializable the schedule is not serializable schedule will not execute this schedule have deadlock
Consider the following database schedule with $3$ transactions, $T1$ ,$T2$ and $T3$. Where $r$ stands for READ, w for WRITE.$S : r2 (A); r1 (B); w2 (A); r2 (B); r3 (A); w...
Bikram
408
views
Bikram
asked
Nov 26, 2016
Databases
tbb-dbms-1
+
–
0
votes
1
answer
21
Test by Bikram | Databases | Test 1 | Question: 10
Consider the relation $R(A, B, C, D, E)$ with the set of function dependencies: $F = \{ AB \rightarrow C, \ \ D \rightarrow E, \ \ A \rightarrow D \}$ The candidate Key is _____ BC AB BAC AD
Consider the relation $R(A, B, C, D, E)$ with the set of function dependencies: $F = \{ AB \rightarrow C, \ \ D \rightarrow E, \ \ A \rightarrow D \}$ The candidate K...
Bikram
336
views
Bikram
asked
Nov 26, 2016
Databases
tbb-dbms-1
+
–
0
votes
1
answer
22
Test by Bikram | Databases | Test 1 | Question: 9
Consider the following database with primary keys in Bold Project(P_No, P_Name, P_Incharge) Employee(E_No, E_Name) Assigned_To(P_No, E_No) Which sentence represent the following relational algebra? Employee $\bowtie$ (Assigned_To) $\div$ ( ... the employees working on at least one projects. List details of the employees working on all the projects.
Consider the following database with primary keys in BoldProject(P_No, P_Name, P_Incharge) Employee(E_No, E_Name) Assigned_To(P_No, E_No)Which sentence represent the f...
Bikram
421
views
Bikram
asked
Nov 26, 2016
Databases
tbb-dbms-1
+
–
1
votes
1
answer
23
Test by Bikram | Databases | Test 1 | Question: 8
The rule that a value of a foreign key must appear as a value of some specific table is called a Referential constraint Index Integrity constraint Functional dependency
The rule that a value of a foreign key must appear as a value of some specific table is called aReferential constraintIndexIntegrity constraintFunctional dependency
Bikram
258
views
Bikram
asked
Nov 26, 2016
Databases
tbb-dbms-1
+
–
1
votes
2
answers
24
Test by Bikram | Databases | Test 1 | Question: 7
Consider the following schedule for transactions T1, T2 , these transactions have two phase locking: T1: lock- S(A) Read (A) Lock -X (B) Read (B) B = A +B Write (B) Unlock (A) Unlock(B) T2 lock-X(A) Lock- S(B) write (A ... about T1 and T2? T1 and T2 are deadlock free T1 and T2 results in a deadlock T1 and T2 are serial schedule none of the above
Consider the following schedule for transactions T1, T2 , these transactions have two phase locking:T1:lock- S(A)Read (A)Lock –X (B)Read (B)B = A +BWrite (B)Unlock (A) ...
Bikram
881
views
Bikram
asked
Nov 26, 2016
Databases
tbb-dbms-1
+
–
0
votes
1
answer
25
Test by Bikram | Databases | Test 1 | Question: 6
In SQL the statement → Select * from R ,S is equivalent to: select * from R natural join S select * from R inner join S select * from R cross join S select * from R union join S
In SQL the statement→ Select * from R ,S is equivalent to:select * from R natural join Sselect * from R inner join Sselect * from R cross join Sselect * from R union j...
Bikram
458
views
Bikram
asked
Nov 26, 2016
Databases
tbb-dbms-1
+
–
0
votes
2
answers
26
Test by Bikram | Databases | Test 1 | Question: 5
Two transactions of $T1$ and $T2$ are given as follows: $T1: \text{R1(A) W1(A) R1(B) W1(B)}$ $T2 : \text{ R2(B) W2(B) R2(C) W2(C)}$ Total number of Conflict Serializable schedules formed by $T1$ and $T2$ are $2$ $70$ $54$ $12$
Two transactions of $T1$ and $T2$ are given as follows:$T1: \text{R1(A) W1(A) R1(B) W1(B)}$$T2 : \text{ R2(B) W2(B) R2(C) W2(C)}$Total number of Conflict Serializable...
Bikram
592
views
Bikram
asked
Nov 26, 2016
Databases
tbb-dbms-1
+
–
0
votes
1
answer
27
Test by Bikram | Databases | Test 1 | Question: 4
Each dealer owns one or more cars and each car is owned by at-most one dealer. If Dealer table has $20$ tuples and Cars table has $60$ tuples then owns table can have maximum _____ number of tuples
Each dealer owns one or more cars and each car is owned by at-most one dealer. If Dealer table has $20$ tuples and Cars table has $60$ tuples then owns table can have max...
Bikram
679
views
Bikram
asked
Nov 26, 2016
Databases
tbb-dbms-1
numerical-answers
+
–
0
votes
2
answers
28
Test by Bikram | Databases | Test 1 | Question: 3
Suppose that the transaction T1 and T2 access the same database items. ... these two transactions? Dirty Read will occur Lost update will occur Both T1 and T2 are serial schedule This is an example of uncommitted data problem
Suppose that the transaction T1 and T2 access the same database items.$$\begin{array}{|l|l|} \hline T1 & T2 \\ \hline \text{read(X)} & {} \\ X=X-N & {} \\ \hline {} & \te...
Bikram
485
views
Bikram
asked
Nov 26, 2016
Databases
tbb-dbms-1
+
–
1
votes
2
answers
29
Test by Bikram | Databases | Test 1 | Question: 2
Under what condition does the selection operation distribute over theta join operation? Let $R$ and $S$ ... i, iii i, ii, iii, iv ii, iii i, ii
Under what condition does the selection operation distribute over theta join operation?Let $R$ and $S$ are two relations then which one of the following statements about ...
Bikram
687
views
Bikram
asked
Nov 26, 2016
Databases
tbb-dbms-1
relational-algebra
+
–
3
votes
1
answer
30
Test by Bikram | Databases | Test 1 | Question: 1
What is the minimum number of tables required to represent this E-R diagram in the relational model? Considering that for both R1 and R2 cardinality is $1:1$ $2$ $3$ $4$ $5$
What is the minimum number of tables required to represent this E-R diagram in the relational model? Considering that for both R1 and R2 cardinality is $1:1$$2$$3$$4$$5$...
Bikram
1.1k
views
Bikram
asked
Nov 26, 2016
Databases
tbb-dbms-1
+
–
To see more, click for the
full list of questions
or
popular tags
.
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register