Recent questions tagged databases / GATE Overflow for GATE CSE

0 votes

1 answer

1

Number of Super Keys
R(A1, A2,A3,A4....AN). How many super keys possible in relation? If (A1 is candidate key, A2 is candidate key, A3 is candidate key)

R(A1, A2,A3,A4....AN). How many super keys possible in relation? If (A1 is candidate key, A2 is candidate key, A3 is candidate key)

ssm

59 views

ssm asked 4 days ago

0 votes

0 answers

2

Relational Database
Give an appropriate tree-structure diagram for the following relational database: Employee (person_name, street, city) Works (person_name, company_name, salary) Company (company_name, city) Manages (person_name, manager_name)

Give an appropriate tree-structure diagram for the following relational database:Employee (person_name, street, city)Works (person_name, company_name, salary)Company (com...

peter09

41 views

peter09 asked Apr 16

0 votes

1 answer

3

Minimal Cover
Consider R(A,B,C,D,E,H) be a relational schema with the following functional dependencies: A->BC, CD->E, E->C, D->AEH, ABH->BD, DH->BC Find minimal cover ?

Consider R(A,B,C,D,E,H) be a relational schema with the following functional dependencies:A->BC, CD->E, E->C, D->AEH, ABH->BD, DH->BCFind minimal cover ?

Yogesh_Jangde

90 views

Yogesh_Jangde asked Apr 13

0 votes

0 answers

4

File organisation and indexing (DBMS)

Suryadip

106 views

Suryadip asked Mar 9

0 votes

0 answers

5

#dbms

Çșȇ ʛấẗẻ

90 views

Çșȇ ʛấẗẻ asked Feb 24

0 votes

0 answers

6

NPTEL DBMS (Introduction to Database systems)course Assignment 10: Topic Database Indexing
Use the following information to answer Questions 7 and 8. A sorted file has the following details: Number of records = 13,10,720; record length = 200 bytes; size of the primary key field = 13 bytes; size of ... of blocks in the first level index file is: a)131072 b)1311 c)1310 d)1286 Accepted Answers: 1286

Use the following information to answer Questions 7 and 8.A sorted file has the following details: Number of records = 13,10,720; record length = 200 bytes;size of the pr...

RishabhSahu325

143 views

RishabhSahu325 asked Feb 22

0 votes

2 answers

7

GATE DS&AI 2024 | Question: 21
Consider the following two tables named Raider and Team in a relational database maintained by a Kabaddi league. The attribute ID in table Team references the primary key of the Raider table, ID. Raider ID Name Raids RaidPoints $1$ Arjun $200$ $250$ $2$ ... Jaipur" AND RaidPoints > 200; The number of rows returned by this query is $\_\_\_\_\_\_\_\_$.

Consider the following two tables named Raider and Team in a relational database maintained by a Kabaddi league. The attribute ID in table Team references the primary key...

Arjun

885 views

Arjun asked Feb 16

0 votes

1 answer

8

GATE DS&AI 2024 | Question: 36
Given the relational schema $R=(U, V, W, X, Y, Z)$ and the set of functional dependencies: \[ \{U \rightarrow V, U \rightarrow W, W X \rightarrow Y, W X \rightarrow Z, V \rightarrow X\} \] Which of the following functional dependencies can be derived from the above set? $V W \rightarrow Y Z$ $W X \rightarrow Y Z$ $V W \rightarrow U$ $V W \rightarrow Y$

Given the relational schema $R=(U, V, W, X, Y, Z)$ and the set of functional dependencies:\[\{U \rightarrow V, U \rightarrow W, W X \rightarrow Y, W X \...

Arjun

879 views

Arjun asked Feb 16

1 votes

2 answers

9

GATE CSE 2024 | Set 2 | Question: 9
Once the $\text{DBMS}$ informs the user that a transaction has been successfully completed, its effect should persist even if the system crashes before all its changes are reflected on disk. This property is called durability atomicity consistency isolation

Once the $\text{DBMS}$ informs the user that a transaction has been successfully completed, its effect should persist even if the system crashes before all...

Arjun

2.2k views

Arjun asked Feb 16

1 votes

1 answer

10

GATE CSE 2024 | Set 2 | Question: 10
In the context of owner and weak entity sets in the $\text{ER}$ (Entity-Relationship) data model, which one of the following statements is TRUE? The weak entity set MUST have total participation in the identifying ... in the identifying relationship Neither weak entity set nor owner entity set MUST have total participation in the identifying relationship

In the context of owner and weak entity sets in the $\text{ER}$ (Entity-Relationship) data model, which one of the following statements is TRUE?The weak entity set MUST h...

Arjun

1.9k views

Arjun asked Feb 16

3 votes

2 answers

11

GATE CSE 2024 | Set 2 | Question: 16
Which of the following file organizations is/are $\text{I/O}$ efficient for the scan operation in $\text{DBMS}$? Sorted Heap Unclustered tree index Unclustered hash index

Which of the following file organizations is/are $\text{I/O}$ efficient for the scan operation in $\text{DBMS}$?SortedHeapUnclustered tree indexUnclustered...

Arjun

2.4k views

Arjun asked Feb 16

1 votes

1 answer

12

GATE CSE 2024 | Set 2 | Question: 17
Which of the following statements about the Two Phase Locking ($2 \mathrm{PL}$) protocol is/are TRUE? $2 \mathrm{PL}$ permits only serializable schedules With $2 \mathrm{PL}$, a transaction always locks the data item being read or ... , no more locks on any data item can be obtained inside that transaction A deadlock is possible with $2 \mathrm{PL}$

Which of the following statements about the Two Phase Locking ($2 \mathrm{PL}$) protocol is/are TRUE?$2 \mathrm{PL}$ permits only serializable schedulesWith $...

Arjun

2.0k views

Arjun asked Feb 16

2 votes

1 answer

13

GATE CSE 2024 | Set 2 | Question: 35
The relation schema, Person (pid, city), describes the city of residence for every person uniquely identified by pid. The following relational algebra operators are available: selection, projection, cross product, and rename. To find the list of cities ... above operators, the minimum number of cross product operations that must be used is $1$ $2$ $3$ $4$

The relation schema, Person (pid, city), describes the city of residence for every person uniquely identified by pid. The following relational algebra oper...

Arjun

2.2k views

Arjun asked Feb 16

1 votes

1 answer

14

GATE CSE 2024 | Set 2 | Question: 46
A functional dependency $F: X \rightarrow Y$ is termed as a useful functional dependency if and only if it satisfies all the following three conditions: $\text{X}$ is not the empty set. $\text{Y}$ is not the empty set. Intersection ... set. For a relation $\text{R}$ with $4$ attributes, the total number of possible useful functional dependencies is __________.

A functional dependency $F: X \rightarrow Y$ is termed as a useful functional dependency if and only if it satisfies all the following three conditions:$\text{X}$ is not ...

Arjun

1.8k views

Arjun asked Feb 16

1 votes

2 answers

15

GATE CSE 2024 | Set 1 | Question: 10
Let $\mathrm{S}$ be the specification: "Instructors teach courses. Students register for courses. Courses are allocated classrooms. Instructors guide students." Which one of the following $\mathrm{ER}$ diagrams CORRECTLY represents $\mathrm{S}$? $\text{(i)}$ $\text{(ii)}$ $\text{(iii)}$ $\text{(iv)}$

Let $\mathrm{S}$ be the specification: "Instructors teach courses. Students register for courses. Courses are allocated classrooms. Instructors guide students." Which one...

Arjun

2.1k views

Arjun asked Feb 16

2 votes

3 answers

16

GATE CSE 2024 | Set 1 | Question: 11
In a $\mathrm{B}+$ tree, the requirement of at least half-full $(50 \%)$ node occupancy is relaxed for which one of the following cases? Only the root node All leaf nodes All internal nodes Only the leftmost leaf node

In a $\mathrm{B}+$ tree, the requirement of at least half-full $(50 \%)$ node occupancy is relaxed for which one of the following cases?Only the root nodeAll leaf nodesAl...

Arjun

2.3k views

Arjun asked Feb 16

3 votes

2 answers

17

GATE CSE 2024 | Set 1 | Question: 12
Which of the following statements about a relation $\mathbf{R}$ in first normal form $\text{(1NF)}$ is/are TRUE? $\mathbf{R}$ can have a multi-attribute key $\mathbf{R}$ cannot have a foreign key $\mathbf{R}$ cannot have a composite attribute $\mathbf{R}$ cannot have more than one candidate key

Which of the following statements about a relation $\mathbf{R}$ in first normal form $\text{(1NF)}$ is/are TRUE?$\mathbf{R}$ can have a multi-attribute key$\mathbf{R}$ ca...

Arjun

3.6k views

Arjun asked Feb 16

1 votes

1 answer

18

GATE CSE 2024 | Set 1 | Question: 25
Consider the following two relations, $R(A, B)$ and $S(A, C)$: $R$ $A$ $B$ $10$ $20$ $20$ $30$ $30$ $40$ $30$ $50$ $50$ $95$ $S$ $A$ $C$ $10$ $90$ $30$ $45$ $40$ $80$ The total number of tuples obtained by evaluating the following expression $\sigma_{B<C}\left(R \bowtie_{R . A=S . A} S\right)$ is ___________.

Consider the following two relations, $R(A, B)$ and $S(A, C)$:$R$$A$$B$$10$$20$$20$$30$$30$$40$$30$$50$$50$$95$$S$$A$$C$$10$$90$$30$$45$$40$$80$The total number of tuples...

Arjun

1.8k views

Arjun asked Feb 16

1 votes

3 answers

19

GATE CSE 2024 | Set 1 | Question: 34
The symbol $\rightarrow$ indicates functional dependency in the context of a relational database. Which of the following options is/are TRUE? $(X, Y) \rightarrow(Z, W)$ implies $X \rightarrow(Z, W)$ $(X, Y) \rightarrow(Z, W)$ ... $(X, W) \rightarrow Z$ $(X \rightarrow Y$ and $Y \rightarrow Z)$ implies $X \rightarrow Z$

The symbol $\rightarrow$ indicates functional dependency in the context of a relational database. Which of the following options is/are TRUE?$(X, Y) \rightarrow(Z, W)$...

Arjun

2.2k views

Arjun asked Feb 16

1 votes

1 answer

20

GATE CSE 2024 | Set 1 | Question: 36
Consider the following read-write schedule $\text{S}$ over three transactions $T_{1}, T_{2}$, and $T_{3}$ ... to $\text{S}$? $T_{1} T_{2} T_{3}$ $T_{1} T_{3} T_{2}$ $T_{3} T_{2} T_{1}$ $T_{3} T_{1} T_{2}$

Consider the following read-write schedule $\text{S}$ over three transactions $T_{1}, T_{2}$, and $T_{3}$, where the subscripts in the schedule indicate trans...

Arjun

2.3k views

Arjun asked Feb 16

4 votes

1 answer

21

GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 13
Division operator in relational algebra is appropriate to handle which of the following query types? employees work on at most one of the critical projects employees work on any one of the critical projects employees work on at least one of the critical projects employees work on all the critical projects

Division operator in relational algebra is appropriate to handle which of the following query types?employees work on at most one of the critical projectsemployees work o...

GO Classes

385 views

GO Classes asked Feb 5

6 votes

3 answers

22

GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 14
A B-Tree of order $m$ is an $m$-way search tree. What is the minimum number of keys that can be stored on the leaf level of a B-Tree of order 20 with 3 levels? (Note: the root of a tree counts as its first level)

A B-Tree of order $m$ is an $m$-way search tree. What is the minimum number of keys that can be stored on the leaf level of a B-Tree of order 20 with 3 levels? (Note: th...

GO Classes

679 views

GO Classes asked Feb 5

4 votes

0 answers

23

GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 40
Consider the following schema (primary keys are underlined): Which of the following queries returns the department numbers of those departments for which there are no courses being offered?

Consider the following schema (primary keys are underlined):Which of the following queries returns the department numbers of those departments for which there are no cour...

GO Classes

324 views

GO Classes asked Feb 5

9 votes

1 answer

24

GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 41
Consider the following lock requests in the Table below. And note that: $\mathrm{S}(\cdot)$ and $\mathrm{X}(\cdot)$ stand for 'shared lock' and 'exclusive lock', respectively. $T_1, T_2, T_3, T_4$, and $T_5$ represent five ... dead('-'). Select all that are correct. At t3: a At t6: b At t7: a At t8: -

Consider the following lock requests in the Table below. And note that:$\mathrm{S}(\cdot)$ and $\mathrm{X}(\cdot)$ stand for 'shared lock' and 'exclusive lock', respectiv...

GO Classes

737 views

GO Classes asked Feb 5

6 votes

1 answer

25

GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 50
Consider the following database relation: $\mathrm{R}=(\mathrm{SFLNGCRW} \mathrm{H})=(\mathrm{S}$ : SID, F: First Name, L: Last Name, N: Number of Units, G: GPA, C: Course (of teaching), R ... only one applied? SID determines Rating Rating determines Wage Rating determines Course Rating and First Name determine Wage and Hours of Work

Consider the following database relation: $\mathrm{R}=(\mathrm{SFLNGCRW} \mathrm{H})=(\mathrm{S}$ : SID, F: First Name, L: Last Name, N: Number of Units, G: GPA, C: Cours...

GO Classes

360 views

GO Classes asked Feb 5

0 votes

1 answer

26

Memory Based GATE DA 2024 | Question: 16
Consider a relation R: \[ \begin{aligned} & R(U, V, W, X, Y, Z) \\ & F=\left\{ \begin{array}{l} U \rightarrow V \\ U \rightarrow W \\ WX \rightarrow Y \\ WX \rightarrow Z \\ V \rightarrow X \end ... be deduced. Which of the following options is correct? $VW \rightarrow U$ $VW \rightarrow Y$ $VW \rightarrow YZ$ $WX \rightarrow YZ$

Consider a relation R:\[\begin{aligned}& R(U, V, W, X, Y, Z) \\& F=\left\{\begin{array}{l} U \rightarrow V \\ U \rightarrow W \\ WX \rightarrow Y \\�...

GO Classes

221 views

GO Classes asked Feb 4

0 votes

0 answers

27

Memory Based GATE DA 2024 | Question: 17
Consider the following SQL query: \[ \begin{aligned} &\text{SELECT * FROM Raider, Team} \\ &\text{WHERE Raider.id = Team.id} \\ &\text{AND City = 'Jaipur'} \\ &\text{AND Raid_points \textgreater 200; ... {aligned} \] Determine the number of rows returned by the SQL query, given the conditions specified for the City and Raid points.

Consider the following SQL query:\[\begin{aligned}&\text{SELECT * FROM Raider, Team} \\&\text{WHERE Raider.id = Team.id} \\&\text{AND City = 'Jaipur'} \\&\text{AND Raid_p...

GO Classes

175 views

GO Classes asked Feb 4

0 votes

0 answers

28

Memory Based GATE DA 2024 | Question: 47
You are given three tables: `team`, `table1`, and `table2`. To find the names of all players in the team who are either present in `table1` or `table2`, consider the following relational algebra queries: $\Pi_{\text{{PlayerName}}}(\text{{team}}) \,/\, \ ... text{{Name}}}(\text{{table1}} \cap \text{{table2}}) \,/\, \Pi_{\text{{PlayerName}}}(\text{{team}})$

You are given three tables: team , table1 , and table2 . To find the names of all players in the team who are either present in table1 or table2 , consider the foll...

GO Classes

130 views

GO Classes asked Feb 4

0 votes

0 answers

29

Memory Based GATE DA 2024 | Question: 58
DBMS question: One SQL query is given. Based on the query which data structure can be used involving hashing, B+ tree, etc?

DBMS question: One SQL query is given. Based on the query which data structure can be used involving hashing, B+ tree, etc?

GO Classes

135 views

GO Classes asked Feb 4

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true