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{2022} & \textbf{2021-1}&\textbf{2021-2}&\textbf{2020}&\textbf{2019}&\textbf{2018}&\textbf{2017-1}&\textbf{2017-2}&\textbf{2016-1}&\textbf{2016-2}&\textbf{Minimum}&\textbf{Average}&\textbf{Maximum}
\\\hline\textbf{1 Mark Count} & 3 &2&1&2&2&2&2&2&3&2&1&2.1&3
\\\hline\textbf{2 Marks Count} & 2&3&3&3&3&2&3&3&1&2&1&2.5&3
\\\hline\textbf{Total Marks} & 7 &8&7&8&8&6&8&8&5&6&\bf{6}&\bf{7.1}&\bf{8}\\\hline
\end{array}}}$$

Filter

Most viewed questions in Databases

57 votes
4 answers
86
GATE CSE 2000 | Question: 2.25
Given relations r(w, x) and s(y, z) the result of select distinct w, x from r, s is guaranteed to be same as r, provided. r has no duplicates and s is non-empty r and s have no duplicates s has no duplicates and r is non-empty r and s have the same number of tuples
Given relations r(w, x) and s(y, z) the result ofselect distinct w, x from r, s is guaranteed to be same as r, provided.r has no duplicates and s is non-emptyr and s have...
User Avatar
49 votes
4 answers
88
GATE CSE 2015 Set 1 | Question: 24
A file is organized so that the ordering of the data records is the same as or close to the ordering of data entries in some index. Then that index is called Dense Sparse Clustered Unclustered
A file is organized so that the ordering of the data records is the same as or close to the ordering of data entries in some index. Then that index is calledDenseSparseCl...
User Avatar
44 votes
3 answers
90
GATE CSE 2017 Set 2 | Question: 46
Consider the following database table named $\text{top_scorer}$ ... tc.goals FROM top_scorer AS tc WHERE tc.country='Germany') The number of tuples returned by the above SQL query is ______
Consider the following database table named $\text{top_scorer}$.$$\overset{\text{top_scorer}}{\begin{array}{|c|c|c|}\hline\\\textbf{player}& \textbf{country}& \textbf...
User Avatar
9 votes
4 answers
92
To calculate how many no of super keys?
a relation R(A,B,C,D,E,F,G,H) and set of functional dependencies are {CH->G,A->BC,B->CFH,E->A,F->EG } then how many possible super keys are present ?
a relation R(A,B,C,D,E,F,G,H)and set of functional dependencies are {CH->G,A->BC,B->CFH,E->A,F->EG }then how many possible super keys are present ?
User Avatar
2 votes
2 answers
95
UGC NET CSE | Junet 2015 | Part 2 | Question: 20
For a weak entity set to be meaningful, it must be associated with another entity set in combination with some of their attribute values, is called as: Neighbour Set Strong Entity Set Owner Entity Set Weak Set
For a weak entity set to be meaningful, it must be associated with another entity set in combination with some of their attribute values, is called as:Neighbour SetStrong...
User Avatar
Page: