Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions and answers in Databases
0
votes
1
answer
1
Explain why BCNF is said to be improved 3NF.
prasantkr.singh
answered
in
Databases
1 day
ago
by
prasantkr.singh
27
views
0
votes
0
answers
2
File organisation and indexing (DBMS)
Suryadip
asked
in
Databases
Mar 10
by
Suryadip
46
views
databases
indexing
file-system
2
votes
2
answers
3
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
sanjeet24
answered
in
Databases
Mar 6
by
sanjeet24
2.1k
views
gatecse2024-set2
databases
multiple-selects
0
votes
0
answers
4
#TOC
Çșȇ ʛấẗẻ
asked
in
Databases
Feb 24
by
Çșȇ ʛấẗẻ
42
views
theory-of-computation
finite-automata
regular-expression
regular-language
0
votes
0
answers
5
#dbms
Çșȇ ʛấẗẻ
asked
in
Databases
Feb 24
by
Çșȇ ʛấẗẻ
58
views
databases
database-normalization
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
RishabhSahu325
asked
in
Databases
Feb 23
by
RishabhSahu325
86
views
databases
0
votes
3
answers
7
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$
GauravRajpurohit
answered
in
Databases
Feb 18
by
GauravRajpurohit
1.9k
views
gatecse2024-set1
multiple-selects
databases
0
votes
2
answers
8
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. \begin{tabular}{|l|l|l|l|} \hline \multicolumn{4 ... WHERE Raider.ID=Team.ID AND City="Jaipur" AND RaidPoints > 200; The number of rows returned by this query is
Hira Thakur
answered
in
Databases
Feb 17
by
Hira Thakur
761
views
gate-ds-ai-2024
numerical-answers
databases
sql
0
votes
1
answer
9
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 ... derived from the above set? $V W \rightarrow Y Z$ $W X \rightarrow Y Z$ $V W \rightarrow U$ $V W \rightarrow Y$
Hira Thakur
answered
in
Databases
Feb 17
by
Hira Thakur
742
views
gate-ds-ai-2024
databases
database-normalization
multiple-selects
2
votes
3
answers
10
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
KASHIF_RAHMAN
answered
in
Databases
Feb 17
by
KASHIF_RAHMAN
2.0k
views
gatecse2024-set1
databases
1
vote
2
answers
11
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)}$
KASHIF_RAHMAN
answered
in
Databases
Feb 17
by
KASHIF_RAHMAN
1.8k
views
gatecse2024-set1
databases
er-diagram
3
votes
2
answers
12
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
iarpitmishra
answered
in
Databases
Feb 17
by
iarpitmishra
3.2k
views
gatecse2024-set1
multiple-selects
databases
1
vote
1
answer
13
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}$
Hira Thakur
answered
in
Databases
Feb 17
by
Hira Thakur
2.1k
views
gatecse2024-set1
databases
conflict-serializable
multiple-selects
2
votes
1
answer
14
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$
Deepak Poonia
answered
in
Databases
Feb 17
by
Deepak Poonia
1.8k
views
gatecse2024-set2
databases
1
vote
1
answer
15
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}$
supreetshukla
answered
in
Databases
Feb 17
by
supreetshukla
1.7k
views
gatecse2024-set2
databases
two-phase-locking-protocol
multiple-selects
1
vote
1
answer
16
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 __________.
supreetshukla
answered
in
Databases
Feb 17
by
supreetshukla
1.5k
views
gatecse2024-set2
numerical-answers
databases
1
vote
2
answers
17
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
Deepak Poonia
answered
in
Databases
Feb 17
by
Deepak Poonia
1.9k
views
gatecse2024-set2
databases
transaction-and-concurrency
1
vote
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 ___________.
Hira Thakur
answered
in
Databases
Feb 17
by
Hira Thakur
1.6k
views
gatecse2024-set1
numerical-answers
databases
1
vote
1
answer
19
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
supreetshukla
answered
in
Databases
Feb 17
by
supreetshukla
1.6k
views
gatecse2024-set2
databases
6
votes
3
answers
20
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)
Praveenjha802
answered
in
Databases
Feb 7
by
Praveenjha802
590
views
goclasses2024-mockgate-14
numerical-answers
databases
b-tree
1-mark
0
votes
1
answer
21
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$
Lakshmi Narayana404
answered
in
Databases
Feb 6
by
Lakshmi Narayana404
157
views
gate2024-da-memory-based
goclasses
databases
database-normalization
functional-dependency
4
votes
1
answer
22
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
GO Classes
answered
in
Databases
Feb 5
by
GO Classes
314
views
goclasses2024-mockgate-14
databases
relational-algebra
1-mark
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?
GO Classes
asked
in
Databases
Feb 5
by
GO Classes
264
views
goclasses2024-mockgate-14
databases
sql
2-marks
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 transactions. $L M$ ... ), or already dead('-'). Select all that are correct. At t3: a At t6: b At t7: a At t8: -
GO Classes
answered
in
Databases
Feb 5
by
GO Classes
603
views
goclasses2024-mockgate-14
databases
transaction-and-concurrency
two-phase-locking-protocol
multiple-selects
2-marks
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
GO Classes
answered
in
Databases
Feb 5
by
GO Classes
267
views
goclasses2024-mockgate-14
databases
database-normalization
functional-dependency
multiple-selects
2-marks
0
votes
0
answers
26
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;} \end{aligned} \] Determine the number of rows returned by the SQL query, given the conditions specified for the City and Raid points.
GO Classes
asked
in
Databases
Feb 5
by
GO Classes
138
views
gate2024-da-memory-based
goclasses
databases
sql
numerical-answers
0
votes
0
answers
27
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}})\)
GO Classes
asked
in
Databases
Feb 5
by
GO Classes
96
views
gate2024-da-memory-based
goclasses
databases
relational-algebra
0
votes
0
answers
28
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?
GO Classes
asked
in
Databases
Feb 5
by
GO Classes
104
views
gate2024-da-memory-based
goclasses
databases
sql
b-tree
1
vote
2
answers
29
Consider a schema R(A, B, C, D, E, F) and functional dependencies A → B, C → D, and E → F. The number of superkeys of this schema is ____
amityadav
answered
in
Databases
Feb 3
by
amityadav
175
views
5
votes
5
answers
30
ISRO2020-51
The SQL query SELECT columns FROM TableA RIGHT OUTER JOIN TableB ON A.columnName = B.columnName WHERE A.columnName IS NULL returns the following: All rows in Table $\text{B}$, which meets equality condition above and, none from Table $\text{A}$ which meets the ... in Table $\text{B}$, which meets the equality condition All rows in Table $\text{A}$, which meets the equality condition
satyaAchar
answered
in
Databases
Feb 1
by
satyaAchar
3.5k
views
isro-2020
databases
sql
normal
3
votes
2
answers
31
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 65
Let $r(X, Y)$ and $s(Y)$ be two relations. What is returned by the following relational algebra query? Values of $r.X$ which are related to every value of $s.Y$. Values of $r.Y$ which are related to every value of $s.Y$. ... which are not related to some value of $s.Y$. Values of $r.X$ which are not related to any value of $s.Y$.
Aaveg537
answered
in
Databases
Jan 29
by
Aaveg537
418
views
goclasses2024-mockgate-13
goclasses
databases
relational-algebra
2-marks
3
votes
1
answer
32
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 31
Let $\text{R}_1, \text{R}_2, \ldots,\text{ }R_n$ be a decomposition of schema $\text{U}$. Let $u(\text{U})$ be a relation, and let $r_i=\Pi_{\text{R}_i}(u)$ ... $u=r_1 \bowtie r_2 \bowtie r_3 \bowtie r_4 \bowtie . . r_n$ None of the above
Deepak Poonia
answered
in
Databases
Jan 29
by
Deepak Poonia
346
views
goclasses2024-mockgate-13
goclasses
databases
relational-algebra
1-mark
0
votes
1
answer
33
please explain this sql question and how do we get the answer?
GauravRajpurohit
answered
in
Databases
Jan 28
by
GauravRajpurohit
127
views
databases
sql
3
votes
1
answer
34
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 32
The order of a leaf node in a $\text{B tree}$ is the maximum number of (value, data record pointer) pairs it can hold. Given that the block size is $1 \mathrm{~K}$ bytes, data record pointer is $7$ bytes long, the value field is $9$ bytes long and a block pointer is $6$ bytes long, what is the order of the leaf node?
GO Classes
answered
in
Databases
Jan 28
by
GO Classes
397
views
goclasses2024-mockgate-13
goclasses
numerical-answers
databases
b-tree
1-mark
3
votes
1
answer
35
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 33
Consider the following two schedules consisting to two transaction $\mathrm{T}_1$ and $\mathrm{T}_2$ : Which of the following is/are true about these schedules? Both $\mathrm{S}_1$ and $\mathrm{S}_2$ are ... and also conflict serializable. $\mathrm{S}_1$ and $\mathrm{S}_2$ are neither conflict equivalent nor conflict serializable.
GO Classes
answered
in
Databases
Jan 28
by
GO Classes
221
views
goclasses2024-mockgate-13
goclasses
databases
transaction-and-concurrency
conflict-serializable
1-mark
5
votes
1
answer
36
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 64
Consider the following schema: The primary key fields are underlined, and the domain of each field is listed after the field name. Assume there are no NULL values in any column of any relation and every relation has at least one tuple. ... who have a rating of $10 $ OR have reserved boat $104.$ All sids of sailor table Empty set.
GO Classes
answered
in
Databases
Jan 28
by
GO Classes
438
views
goclasses2024-mockgate-13
goclasses
databases
sql
2-marks
Help get things started by
asking a question
.
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
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
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(24)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(682)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
243k
comments
79.6k
users
Recent questions and answers in Databases
Recent Blog Comments
Hlo I'm Rupesh I got AIR 3485 in gate CS and AIR...
@Ajay Sasank here is the direct link...
Thank you for the post didi My GATE 2023 & 2024...
I Hope it helps 😊
Today's best post I seen thank you for motivation