Register

Web Page

ER‐model. Relational model:Relational algebra, Tuple calculus, SQL. Integrity constraints, Normal forms. File organization, Indexing (e.g., B and B+ trees). Transactions and concurrency control.

$$\scriptsize{\overset{{\large{\textbf{Mark Distribution in Previous GATE}}}}{\begin{array}{|c|c|c|c|c|c|c|c|}\hline
\textbf{Year}& \textbf{2024-1}& \textbf{2024-2} &\textbf{2023} &\textbf{2022} & \textbf{2021-1}&\textbf{2021-2}&\textbf{Minimum}&\textbf{Average}&\textbf{Maximum}
\\\hline\textbf{1 Mark Count} &4&4&1& 3 &2&1&1&2.5&4
\\\hline\textbf{2 Marks Count} &2&2&2& 2&3&3&2&2.33&3
\\\hline\textbf{Total Marks} & 8&8&5& 7 &8&7&\bf{5}&\bf{7.16}&\bf{8}\\\hline
\end{array}}}$$

Filter

Most answered questions in Databases

6 votes
5 answers
101
ISRO2009-70
A locked database file can be Accessed by only one user Modified by users with the correct password Used to hide sensitive information Updated by more than one user
A locked database file can beAccessed by only one userModified by users with the correct passwordUsed to hide sensitive informationUpdated by more than one user
User Avatar
8 votes
5 answers
102
ISRO-2013-61, ISRO2008-35
Embedded pointer provides A secondary access path A physical record key An inverted index A primary key
Embedded pointer providesA secondary access pathA physical record keyAn inverted indexA primary key
User Avatar
7 votes
5 answers
106
Number of conflict serializable schedules
Number of conflict serializable schedules in T1 : R(A) W(A) R(B) W(B) T2: R(A) W(A) R(B) W(B)
Number of conflict serializable schedules inT1 : R(A) W(A) R(B) W(B)T2: R(A) W(A) R(B) W(B)
User Avatar
4 votes
5 answers
107
If the order of a B-Tree is 20 , then the number of levels needed to store 15 , 998 keys are?
If the order of a B-Tree is $20$, then the number of levels needed to store $15,998$ keys are ______.
User Avatar
0 votes
5 answers
111
ER DIAGRAM
User Avatar
28 votes
5 answers
114
GATE IT 2005 | Question: 22
A table has fields $F_1, F_2, F_3, F_4, F_5$ with the following functional dependencies $F_1 \to F_3, F_2\to F_4, (F_1 . F_2) \to F_5$ In terms of Normalization, this table is in $1\;\text{NF}$ $2\;\text{NF}$ $3\;\text{NF}$ None of these
A table has fields $F_1, F_2, F_3, F_4, F_5$ with the following functional dependencies $F_1 \to F_3, F_2\to F_4, (F_1 . F_2) \to F_5$In terms of Normalization, this ...
User Avatar
43 votes
5 answers
115
GATE IT 2004 | Question: 76
A table T1 in a relational database has the following rows and columns: ... set marks = marks + 5 Select avg(marks) from T1 What is the output of the select statement? $18.75$ $20$ $25$ $\text{Null}$
A table T1 in a relational database has the following rows and columns: $$\begin{array}{|c|c|c|} \hline \text {Roll no. } & \text {Marks} \\\hline 1& 10 \\\hline 2 & 20 ...
User Avatar
34 votes
5 answers
118
GATE IT 2004 | Question: 21
Which level of locking provides the highest degree of concurrency in a relational database ? Page Table Row Page, table and row level locking allow the same degree of concurrency
Which level of locking provides the highest degree of concurrency in a relational database ?PageTableRowPage, table and row level locking allow the same degree of concurr...
User Avatar
Page: