Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Webpage for Databases:
Recent questions tagged databases
3
votes
1
answer
1711
nptel
Choose the correct option about the following schedule. S:R2(A);W3(A);(commitT3);W1(A);(commitT1);W2(B);R2(C);(commitT2);R4(A);R4(B);(commitT4) 1. S is both recoverable and conflict serializable 2. S is neither recoverable nor conflict serializable 3. S is recoverable but not conflict serializable 4. S is not recoverable but conflict serializable
Choose the correct option about the following schedule.S:R2(A);W3(A);(commitT3);W1(A);(commitT1);W2(B);R2(C);(commitT2);R4(A);R4(B);(commitT4) 1. S is both recoverable a...
gulsanchouhan
678
views
gulsanchouhan
asked
Sep 28, 2017
Databases
databases
nptel-quiz
+
–
1
votes
0
answers
1712
NPTEL
Which of the following can be described as a programming model used to develop applications processing massive amounts of data in a distributed and/or parallel manner? 1. Map Reduce 2 .OLAP 3. Mahout 4. Cloud Computing
Which of the following can be described as a programming model used to develop applications processing massive amounts of data in a distributed and/or parallel manner?1. ...
gulsanchouhan
351
views
gulsanchouhan
asked
Sep 28, 2017
Databases
databases
nptel-quiz
+
–
1
votes
0
answers
1713
nptel
Consider the following database Col 1 Col 2 Col 3 1 2 3 4 5 6 7 8 9 If Col1 and Col2 form a column family and Col3 is another column family, how is the data stored? A. 1 2 3 4 5 6 7 8 9 B. 1 4 7 2 5 8 3 6 9 C. 1 2 4 5 7 8 3 6 9 D. 1 4 7 3 6 9 2 5 8
Consider the following databaseCol 1Col 2Col 3123456789If Col1 and Col2 form a column family and Col3 is another column family, how is the data stored?A. 1 2 3 4 5 6 7 8 ...
gulsanchouhan
397
views
gulsanchouhan
asked
Sep 28, 2017
Databases
databases
nptel-quiz
+
–
1
votes
0
answers
1714
NPTEL
Suppose a deadlock occurs in the schedule S given below. S: l1(A),l3(D),l1(B),u1(A),l2(C),l2(B),l1(D),l2(B),l3(C),l4(A),l4(C),l5(A) A transaction that causes the least number of cascading rollbacks is decided to be chosen as victim, then which of the following transaction cannot be chosen as a victim? 1. T3 2. T2 3. T1 4. Cannot be decided
Suppose a deadlock occurs in the schedule S given below. S: l1(A),l3(D),l1(B),u1(A),l2(C),l2(B),l1(D),l2(B),l3(C),l4(A),l4(C),l5(A) A transaction that causes the least n...
gulsanchouhan
239
views
gulsanchouhan
asked
Sep 28, 2017
Databases
databases
nptel-quiz
+
–
1
votes
0
answers
1715
nptel
Consider the following schedule $S$. S: l1(A),l3(D),l1(B),u1(A),l2(C),l2(B),l1(D),l2(B),l3(C),l4(A),l4(C),l5(A); Which of the following is a valid set of transactions that are potential victims? 1. {T1,T2,T3,T5} 2. {T1,T2} 3. {T1,T2,T3,T4} 4. {T1,T2,T3}
Consider the following schedule $S$. S: l1(A),l3(D),l1(B),u1(A),l2(C),l2(B),l1(D),l2(B),l3(C),l4(A),l4(C),l5(A); Which of the following is a valid set of transactions tha...
gulsanchouhan
427
views
gulsanchouhan
asked
Sep 28, 2017
Databases
databases
nptel-quiz
+
–
1
votes
0
answers
1716
NPTEL
Consider the following schedule. All the locks are exclusive, and between the lock l and unlock u operations, the corresponding data item is first read and then written. S: l1(A),l3(D),l1(B),u1(A),l2(C),l2(B),l1(D),l2(B),l3(C),l4(A),l4(C),l5(A) The schedule will result in a deadlock. 1. True 2. False
Consider the following schedule. All the locks are exclusive, and between thelock l and unlock u operations, the corresponding data item is first read and then written. S...
gulsanchouhan
312
views
gulsanchouhan
asked
Sep 28, 2017
Databases
databases
nptel-quiz
+
–
4
votes
2
answers
1717
UGC NET CSE | December 2008 | Part 2 | Question: 32
Suppose R is a relation schema and F is a set of functional dependencies on R. Further, suppose R1 and R2 form a decomposition of R. Then the decomposition is a lossless join decomposition of R provided that: R1∩R2→R1 is in F+ ... in F+ both R1∩R2→R1 and R1∩R2→R2 functional dependencies are in F+ at least one from R1∩R2→R1 and R1∩R2→R2 is in F+
Suppose R is a relation schema and F is a set of functional dependencies on R. Further, suppose R1 and R2 form a decomposition of R. Then the decomposition is a lossless ...
rishu_darkshadow
1.8k
views
rishu_darkshadow
asked
Sep 26, 2017
Databases
ugcnetcse-dec2008-paper2
databases
database-normalization
+
–
1
votes
2
answers
1718
UGC NET CSE | December 2008 | Part 2 | Question: 31
Aggregation is : an abstraction through which relationships are treated as lower level entities an abstraction through which relationships are treated as higher level entities an abstraction through which relationships are not treated at all as entities none of the above
Aggregation is :an abstraction through which relationships are treated as lower level entitiesan abstraction through which relationships are treated as higher level entit...
rishu_darkshadow
2.5k
views
rishu_darkshadow
asked
Sep 26, 2017
Databases
ugcnetcse-dec2008-paper2
databases
aggregation
+
–
2
votes
4
answers
1719
UGC NET CSE | December 2008 | Part 2 | Question: 30
An entity has: (i) a set of properties (ii) a set of properties and values for all the properties (iii) a set of properties and the values for some set of properties may non-uniquely identify an entity (iv) a set of properties and ... properties may uniquely identify an entity Which of the above are valid? (i) only (ii) only (iii) only (iv) only
An entity has:(i) a set of properties(ii) a set of properties and values for all the properties(iii) a set of properties and the values for some set of properties may non...
rishu_darkshadow
2.8k
views
rishu_darkshadow
asked
Sep 26, 2017
Databases
ugcnetcse-dec2008-paper2
databases
er-diagram
+
–
3
votes
1
answer
1720
aggregation:minimum number of tables
set2018
291
views
set2018
asked
Sep 26, 2017
Databases
databases
+
–
0
votes
0
answers
1721
Weak entity set
If the identifying relationship set has a descriptive attribute, then the movement of an attribute will be on weak entity side? pls explain with proper reference
If the identifying relationship set has a descriptive attribute, then the movement of an attribute will be on weak entity side?pls explain with proper reference
set2018
307
views
set2018
asked
Sep 25, 2017
Databases
databases
self-doubt
+
–
1
votes
1
answer
1722
serial schedules
If total n! serial schedules are possible , will all of them give the same result?
If total n! serial schedules are possible , will all of them give the same result?
Parshu gate
352
views
Parshu gate
asked
Sep 21, 2017
Databases
databases
serializability
+
–
0
votes
2
answers
1723
DBMS-Decomposition
Which of the following statement is true while decomposition ? 3NF guaranteed dependency preserving 3NF guaranteed lossless property Both of the above None of the above
Which of the following statement is true while decomposition ? 3NF guaranteed dependency preserving3NF guaranteed lossless propertyBoth of the aboveNone of the above
rishu_darkshadow
604
views
rishu_darkshadow
asked
Sep 21, 2017
Databases
decomposition
databases
+
–
1
votes
1
answer
1724
Minimum tables required
1.Minimum number of tables required which satisfies 1NF ? 2.Minimum number of tables required which satisfies 3NF ?
1.Minimum number of tables required which satisfies 1NF ?2.Minimum number of tables required which satisfies 3NF ?
Xylene
850
views
Xylene
asked
Sep 20, 2017
Databases
databases
er-diagram
+
–
1
votes
0
answers
1725
Minimum number of index blocks
DB file consists of 1250 records. Block can hold either 3 records or (10 keys, 11 pointers). How many minimum index blocks are required for sparse B+ tree index? I think the answer should be (417/10) + (42/11) +(4/11) = 42 + 4 + 1 = 47 (Assuming order of leaf and internal nodes are same as they are not given separately). Am I correct?
DB file consists of 1250 records. Block can hold either 3 records or (10 keys, 11 pointers). How many minimum index blocks are required for sparse B+ tree index?I think t...
Xylene
1.3k
views
Xylene
asked
Sep 20, 2017
Databases
databases
indexing
+
–
3
votes
0
answers
1726
Concurrent transactions
Number of concurrent transactions that can be formed with 3 transactions having 3,2 and 1 operations respectively. Here should the answer be 60 or 54 ? Should we include serial transactions also in the answer or should we subtract it?
Number of concurrent transactions that can be formed with 3 transactions having 3,2 and 1 operations respectively.Here should the answer be 60 or 54 ? Should we include s...
Xylene
548
views
Xylene
asked
Sep 20, 2017
Databases
databases
+
–
1
votes
1
answer
1727
Number of relations in ER diagram
Minimum number of relations or tables required ?
Minimum number of relations or tables required ?
Xylene
1.5k
views
Xylene
asked
Sep 19, 2017
Databases
databases
er-diagram
+
–
4
votes
4
answers
1728
Random Doubt, Candidate Key, DBMS
If A Relation R(A,B,C,D) and CK given is (AB,C) and FD is given as A->C Then the relation is in which highest normal form?
If A Relation R(A,B,C,D) and CK given is (AB,C)and FD is given as A->C Then the relation is in which highest normal form?
Anirudh Pandey
1.5k
views
Anirudh Pandey
asked
Sep 19, 2017
Databases
candidate-key
databases
database-normalization
+
–
0
votes
2
answers
1729
SQL query
Answer given on virtual gate is a1,a3,a2 I'm getting a1,a3,a2,a1 as duplicate values are allowed in SQL. What is my mistake here ?
Answer given on virtual gate is a1,a3,a2I'm getting a1,a3,a2,a1 as duplicate values are allowed in SQL. What is my mistake here ?
just_bhavana
818
views
just_bhavana
asked
Sep 18, 2017
Databases
sql
databases
+
–
2
votes
2
answers
1730
CANDIDATE KEY
Parshu gate
1.2k
views
Parshu gate
asked
Sep 17, 2017
Databases
databases
candidate-key
candidate
database-normalization
+
–
0
votes
1
answer
1731
B+ Tree: Insert operation
answer on virtual gate ia given 2, while my answer is 1.
answer on virtual gate ia given 2, while my answer is 1.
Manu Thakur
340
views
Manu Thakur
asked
Sep 17, 2017
Databases
databases
bplustrees
+
–
3
votes
1
answer
1732
ER Diagram: Minimum number of tables needed
this question is from virtual gate test series. what is the minimum number of RDBMS tables needed for the following er diagram:
this question is from virtual gate test series. what is the minimum number of RDBMS tables needed for the following er diagram:
Manu Thakur
2.0k
views
Manu Thakur
asked
Sep 17, 2017
Databases
databases
er-to-relational
er-diagram
+
–
1
votes
1
answer
1733
UGC NET CSE | December 2009 | Part 2 | Question: 47
Analysis of large database to retrieve information is called (A) OLTP (B) OLAP (C) OLDP (D) OLPP
Analysis of large database to retrieve information is called(A) OLTP(B) OLAP(C) OLDP(D) OLPP
rishu_darkshadow
2.2k
views
rishu_darkshadow
asked
Sep 17, 2017
Databases
ugcnetcse-dec2009-paper2
databases
data-mining
+
–
1
votes
0
answers
1734
UGC NET CSE | December 2009 | Part 2 | Question: 45
The name of the transaction file shall be provided by the operator and the file that contains the edited transactions ready for execution shall be called (A) Batch. Exe (B) Trans. Exe (C) Opt. Exe (D) Edit.Exe
The name of the transaction file shall be provided by the operator and the file that contains the edited transactions ready for execution shall be called(A) Batch. Exe(B)...
rishu_darkshadow
1.1k
views
rishu_darkshadow
asked
Sep 17, 2017
Others
ugcnetcse-dec2009-paper2
databases
acid-properties
+
–
3
votes
2
answers
1735
UGC NET CSE | December 2009 | Part 2 | Question: 19
A function that has no partial functional dependencies is in __________ form. (A) 3 NF (B) 2 NF (C) 4 NF (D) BCNF
A function that has no partial functional dependencies is in __________ form.(A) 3 NF(B) 2 NF(C) 4 NF(D) BCNF
rishu_darkshadow
6.7k
views
rishu_darkshadow
asked
Sep 17, 2017
Databases
ugcnetcse-dec2009-paper2
databases
database-normalization
+
–
1
votes
1
answer
1736
UGC NET CSE | December 2009 | Part 2 | Question: 18
Match the following : ... $\text{4-a, 3-b, 2-c, 1-d}$ $\text{3-a, 4-b, 1-c, 2-d}$
Match the following :$\begin{array}{clcl} \text{(1)} & \text{Determinants} & \text{(a)}\ & \text{No attribute can be added} \\ \text{(2)} & \text{Candidate key} & \t...
rishu_darkshadow
988
views
rishu_darkshadow
asked
Sep 17, 2017
Databases
ugcnetcse-dec2009-paper2
databases
database-normalization
match-the-following
+
–
5
votes
4
answers
1737
UGC NET CSE | December 2009 | Part 2 | Question: 17
Specialization is __________ process. (A) top-down (B) bottom up (C) both (A) and (B) (D) none of these
Specialization is __________ process.(A) top-down(B) bottom up(C) both (A) and (B)(D) none of these
rishu_darkshadow
6.6k
views
rishu_darkshadow
asked
Sep 17, 2017
Databases
ugcnetcse-dec2009-paper2
databases
er-diagram
+
–
2
votes
4
answers
1738
UGC NET CSE | December 2009 | Part 2 | Question: 16
The E-R model is expressed in term of I. Entities II. The relationship among entities. III. The attributes of the entities. IV. Functional relationship. (A) I, II (B) I, II, IV (C) II, II, IV (D) I, II, III
The E-R model is expressed in term ofI. EntitiesII. The relationship among entities.III. The attributes of the entities.IV. Functional relationship.(A) I, II(B) I, II, IV...
rishu_darkshadow
4.9k
views
rishu_darkshadow
asked
Sep 17, 2017
Databases
ugcnetcse-dec2009-paper2
databases
er-diagram
+
–
0
votes
1
answer
1739
maximum size of join
set2018
509
views
set2018
asked
Sep 16, 2017
Databases
databases
+
–
0
votes
1
answer
1740
Sparse and Dense index doubt
Block size 1000 B Search key 12 B Pointer size 8B What is max records of DB 1) For Dense index B+ tree of 2 level 2) For Sparse index B+ tree of 2 level How ans will differ , Plz show
Block size 1000 BSearch key 12 BPointer size 8BWhat is max records of DB1) For Dense index B+ tree of 2 level2) For Sparse index B+ tree of 2 levelHow ans will differ , P...
srestha
631
views
srestha
asked
Sep 16, 2017
Databases
databases
indexing
+
–
Page:
« prev
1
...
53
54
55
56
57
58
59
60
61
62
63
...
98
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register