Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Webpage for Databases:
Recent questions tagged databases
33
votes
4
answers
2161
GATE CSE 1989 | Question: 12a
The below figure shows a $B^+$ tree where only key values are indicated in the records. Each block can hold upto three records. A record with a key value $34$ is inserted into the $B^+$ tree. Obtain the modified $B^+$ tree after insertion.
The below figure shows a $B^+$ tree where only key values are indicated in the records. Each block can hold upto three records. A record with a key value $34$ is inserted...
makhdoom ghaya
8.4k
views
makhdoom ghaya
asked
Dec 9, 2016
Databases
descriptive
gate1989
databases
b-tree
+
–
2
votes
1
answer
2162
Lossy join decomposition
Rakesh K
1.3k
views
Rakesh K
asked
Dec 9, 2016
Databases
databases
database-normalization
decomposition
+
–
0
votes
2
answers
2163
Transactions
Neal Caffery
448
views
Neal Caffery
asked
Dec 8, 2016
Databases
transaction-and-concurrency
databases
+
–
0
votes
1
answer
2164
Let a, b and c be the number of entities in entity sets A, B, and C, respectively
Let a, b and c be the number of entities in entity sets A, B, and C, respectively. Let t be the maximum number of triples in the relationship set for R. Which of the following is a possible combination of values for a, b ... c=4, t=20 a =100, b=10, c=20, t=100 --could'nt understand the question.what are triples??
Let a, b and c be the number of entities in entity sets A, B, and C, respectively. Let t be the maximum number of triples in the relationship set for R. Which of the foll...
Akriti sood
2.5k
views
Akriti sood
asked
Dec 6, 2016
Databases
databases
+
–
0
votes
1
answer
2165
find the number of tuples
Given enroll table as follows: What is the number of tuples in the output of the following query? Select Stud.Id FROM ENROLL WHERE grade = A' UNION ALL Select Stud.Id FROM ENROLL WHERE grade = B'; in this table ,select operation will select distinct student id values or it ... wherever grade = A or B?? i.e first select operation on A will select (1,2,3) or (1,2,1,3) ??
Given enroll table as follows:What is the number of tuples in the output of the following query?Select Stud.Id FROM ENROLL WHERE grade = ‘A’UNION ALLSelect Stud.Id FR...
Akriti sood
1.5k
views
Akriti sood
asked
Dec 6, 2016
Databases
databases
relational-algebra
+
–
3
votes
4
answers
2166
Gateforum DBMS assesment test(Relational Algebra)(see the image below)
smartmeet
889
views
smartmeet
asked
Dec 6, 2016
Databases
gateforum-test-series
databases
relational-algebra
+
–
0
votes
1
answer
2167
MadeEasy Test Series: Databases - Relational Algebra
#plz check 3rd statement:
#plz check 3rd statement:
Hradesh patel
653
views
Hradesh patel
asked
Dec 6, 2016
Databases
made-easy-test-series
databases
relational-algebra
+
–
1
votes
1
answer
2168
MadeEasy Test Series: Databases - Database Normalization
#plz check i am right??
#plz check i am right??
Hradesh patel
491
views
Hradesh patel
asked
Dec 6, 2016
Databases
made-easy-test-series
databases
database-normalization
+
–
0
votes
1
answer
2169
MadeEasy Test Series: Databases - Transactions
#plz check i am right ??
#plz check i am right ??
Hradesh patel
486
views
Hradesh patel
asked
Dec 6, 2016
Databases
made-easy-test-series
databases
transaction-and-concurrency
+
–
3
votes
3
answers
2170
B-Tree: Counting number of keys.
Let T be a B-tree of order m and height h. if n is the number of key elements in T then the maximum value of n is ? I'm getting $m^{h+1}-1$, Am I correct?
Let T be a B-tree of order m and height h. if n is the number of key elements in T then the maximum value of n is ? I'm getting $m^{h+1}-1$, Am I correct?
Aghori
8.4k
views
Aghori
asked
Dec 4, 2016
Databases
b-tree
databases
+
–
10
votes
1
answer
2171
GateForum DBMS Assessment test(see the image below)
The $\text{ER}$ diagram shown below depicts a relation between an $\text{EMPLOYEE}$ and its Dependent. When the above $\text{ER}$ diagram mapped to a relational model, then number of attributes of employee entity and dependent entity which remain non- ... Dependent: $1$ Employee: $2\: \&$ Dependent: $1$ Employee: $2\: \&$ Dependent: $2$
The $\text{ER}$ diagram shown below depicts a relation between an $\text{EMPLOYEE}$ and its Dependent.When the above $\text{ER}$ diagram mapped to a relational model, the...
smartmeet
1.2k
views
smartmeet
asked
Dec 3, 2016
Databases
databases
gateforum-test-series
er-diagram
relations
+
–
0
votes
1
answer
2172
Database
Given R (ABCDE) A-->BC,CD->E B->D E->A CONVERT GIVEN INTO 1NF 2NF 3NF AND THEN BCNF PLEASE VERIFY :)
Given R (ABCDE)A >BC,CD->E B->D E->ACONVERT GIVEN INTO 1NF 2NF 3NF AND THEN BCNF PLEASE VERIFY :)
Dexter
301
views
Dexter
asked
Dec 2, 2016
Databases
databases
+
–
0
votes
1
answer
2173
Database
Given R (ABCDE) FDS ARE A-->BC,C-->DE, D-->E R1(ABCD) R2(DE) FIND WHETHER ITS DECOMPOSITION IS VALID OR NOT and Fd preserving too
Given R (ABCDE)FDS ARE A >BC,C >DE, D >ER1(ABCD) R2(DE)FIND WHETHER ITS DECOMPOSITION IS VALID OR NOT and Fd preserving too
Dexter
276
views
Dexter
asked
Dec 2, 2016
Databases
databases
+
–
1
votes
0
answers
2174
Given the following relational schemas
Given the following relational schemas Student (studId, name, age, sex, deptNo, advisor) Department (deptId, DName, hod, phoneNo) Which of the following will be the TRC query to obtain the department names that do not have any girl students? {d.Dname | department(d) ∧ ~ ... (d) ∧ ~ ((∃(s)) student(s) ∧ s.sex = F' ∧ s.deptNo = d.deptId)} None of these
Given the following relational schemasStudent (studId, name, age, sex, deptNo, advisor)Department (deptId, DName, hod, phoneNo)Which of the following will be the TRC quer...
Akriti sood
1.9k
views
Akriti sood
asked
Dec 2, 2016
Databases
databases
relational-algebra
relational-calculus
+
–
0
votes
2
answers
2175
Ace Test Series: Databases - Er Diagram
chaser
1.1k
views
chaser
asked
Dec 2, 2016
Databases
ace-test-series
databases
er-diagram
+
–
1
votes
2
answers
2176
Ace Test Series: Databases - B Tree
chaser
761
views
chaser
asked
Dec 2, 2016
Databases
ace-test-series
databases
indexing
b-tree
+
–
0
votes
2
answers
2177
Find serilaiability of given schedule
i) Is this schedule conflict serializable? ii)is this scheule view serializable? ii) Is this schedule serializable??
i) Is this schedule conflict serializable?ii)is this scheule view serializable?ii) Is this schedule serializable??
sh!va
510
views
sh!va
asked
Dec 1, 2016
Databases
databases
+
–
0
votes
1
answer
2178
Find the serializability of given schedule
i) Is this schedule conflict serializable? ii)is this scheule view serializable? ii) Is this schedule serializable?? HOW TO SOLVE THIS PROBLEM?
i) Is this schedule conflict serializable?ii)is this scheule view serializable?ii) Is this schedule serializable??HOW TO SOLVE THIS PROBLEM?
sh!va
1.3k
views
sh!va
asked
Dec 1, 2016
Databases
databases
+
–
11
votes
1
answer
2179
GATE CSE 1989 | Question: 4-xiv
For secondary key processing which of the following file organizations is preferred? Give a one line justification: Indexed sequential file organization. Two-way linked list. Inverted file organization. Sequential file organization.
For secondary key processing which of the following file organizations is preferred? Give a one line justification:Indexed sequential file organization.Two-way linked lis...
makhdoom ghaya
7.3k
views
makhdoom ghaya
asked
Nov 30, 2016
Databases
gate1989
normal
databases
indexing
descriptive
+
–
5
votes
2
answers
2180
Virtual Gate Test Series: Databases - Recover Schedule
Assume there are n transactions$:T_{1},T_{2},.,T_{n}.$ Every transaction writes value of $X$ that is read by its successive transaction like $T_{1}$ writes value of $X$ that is read by $T_{2}, T_{2}$ writes a value of ... $X$ that is read by Tn. Now,if $T_{1}$ fails,then total how many transaction rollbacks are required to recover the schedule?
Assume there are n transactions$:T_{1},T_{2},.,T_{n}.$ Every transaction writes value of $X$ that is read by its successive transaction like $T_{1}$ writes value of $X$ t...
smartmeet
1.0k
views
smartmeet
asked
Nov 30, 2016
Databases
databases
transaction-and-concurrency
virtual-gate-test-series
+
–
12
votes
1
answer
2181
B-tree/B+tree
1)Consider a B+ Tree of order 4 and height 3, then find a)The maximum number of records stored are ........... b)The maximum number of keys ........... c)The minimum number of records stored are ............ d)The minimum ... maximum number of keys ? 3) Find the following with order 3 and height 3 in B-tree Minimum and maximum number of keys ? Please provide detailed explanation
1)Consider a B+ Tree of order 4 and height 3, then finda)The maximum number of records stored are ...........b)The maximum number of keys ...........c)The minimum number...
Prabhanjan_1
9.5k
views
Prabhanjan_1
asked
Nov 30, 2016
Databases
databases
indexing
+
–
0
votes
0
answers
2182
SQL HAVING Clause
Can Anyone Explain how Query 28 works with example.
Can Anyone Explain how Query 28 works with example.
Beyonder
733
views
Beyonder
asked
Nov 30, 2016
Databases
databases
sql
gatebook-dbms
+
–
0
votes
0
answers
2183
ALL operator Doubt
Can some one explain me the working of ALL opertor in the below query Tables are : COUNTRY (CODE, NAME) and MEMBER (ORGANIZATION, COUNTRY_code). primary keys are in blod letters and foreign key is in italics. SELECT COUNTRY.name FROM COUNTRY JOIN ... of countries which are members of one or more organisations. 4. List the names of countries which are members of all organisations.
Can some one explain me the working of ALL opertor in the below queryTables are : COUNTRY (CODE, NAME) and MEMBER (ORGANIZATION, COUNTRY_code). primary keys are in blod l...
cse7
213
views
cse7
asked
Nov 29, 2016
Databases
databases
+
–
4
votes
3
answers
2184
tuple relational calculus
Given the following relational schemas Student (studId, name, age, sex, deptNo, advisor) Department (deptId, DName, hod, phoneNo) Which of the following will be the TRC query to obtain the department names that do not have any girl students? 1. {d.Dname | department(d) ∧ ~ ((∃(s)) ... 3. {d.Dname | department(d) ∧ ~ ((∃(s)) student(s) ∧ s.sex = F' ∧ s.deptNo = d.deptId)}
Given the following relational schemasStudent (studId, name, age, sex, deptNo, advisor)Department (deptId, DName, hod, phoneNo)Which of the following will be the TRC quer...
vaishali jhalani
2.7k
views
vaishali jhalani
asked
Nov 29, 2016
Databases
databases
relational-calculus
+
–
0
votes
0
answers
2185
Weak entity
Which of the following statement(s) is/are true? I.Every existence dependency results in a weak entity. II.Role names are technically not necessary in relationships types when all the participating entity types are distinct. III.The relationship between owner entity and the weak entity is one to many.
Which of the following statement(s) is/are true?I.Every existence dependency results in a weak entity.II.Role names are technically not necessary in relationships types w...
vaishali jhalani
1.0k
views
vaishali jhalani
asked
Nov 29, 2016
Databases
databases
+
–
1
votes
2
answers
2186
ER to Table Conversion
Any Good Resource to study this topic ? Or Could anyone explain this topic to me ?
Any Good Resource to study this topic ? Or Could anyone explain this topic to me ?
PEKKA
1.5k
views
PEKKA
asked
Nov 29, 2016
Databases
er-diagram
rdbms
databases
+
–
0
votes
0
answers
2187
doubt
can derived attribute be derived from more than one entitiy or from different entity????
can derived attribute be derived from more than one entitiy or from different entity????
shefaligups11 Gups
306
views
shefaligups11 Gups
asked
Nov 27, 2016
Databases
databases
er-diagram
+
–
30
votes
2
answers
2188
GATE CSE 2008 | Question: 83
Consider the following $\text{ER}$ diagram The minimum number of tables needed to represent $M$, $N$, $P$, $R1$, $R2$ is Which of the following is a correct attribute set for one of the tables for the minimum number of tables needed to represent $M$, $N$, $P$, $R1$, $R2$? ${M1, M2, M3, P1}$ ${M1, P1, N1, N2}$ ${M1, P1, N1}$ ${M1, P1}$
Consider the following $\text{ER}$ diagramThe minimum number of tables needed to represent $M$, $N$, $P$, $R1$, $R2$ is Which of the following is a correct attribute set ...
Arjun
10.9k
views
Arjun
asked
Nov 27, 2016
Databases
gatecse-2008
databases
er-diagram
normal
+
–
26
votes
4
answers
2189
GATE CSE 1990 | Question: 10b
One giga bytes of data are to be organized as an indexed-sequential file with a uniform blocking factor $8.$ Assuming a block size of $1$ Kilo bytes and a block refrencing pointer size of $32$ bits, find out the number of levels of indexing ... size of the master index. The referencing capability (fanout ratio) per block of index storage may be considered to be $32$.
One giga bytes of data are to be organized as an indexed-sequential file with a uniform blocking factor $8.$ Assuming a block size of $1$ Kilo bytes and a block refrencin...
makhdoom ghaya
6.5k
views
makhdoom ghaya
asked
Nov 24, 2016
Databases
gate1990
databases
indexing
descriptive
+
–
23
votes
1
answer
2190
GATE CSE 1990 | Question: 10-a
Consider the following relational database: employees (eno, ename, address, basic-salary) projects (pno, pname, nos-of-staffs-allotted) working (pno, eno, pjob) The queries regarding data in the above database are formulated below in SQL. ... FROM projects)) SELECT pname FROM projects WHERE pno IN (SELECT pno FROM projects MINUS SELECT DISTINCT pno FROM working);
Consider the following relational database:employees (eno, ename, address, basic-salary)projects (pno, pname, nos-of-staffs-allotted)working (pno, eno, pjob)The queries r...
makhdoom ghaya
2.9k
views
makhdoom ghaya
asked
Nov 24, 2016
Databases
gate1990
descriptive
databases
sql
+
–
Page:
« prev
1
...
68
69
70
71
72
73
74
75
76
77
78
...
97
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register