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

45 votes
6 answers
43
GATE CSE 2014 Set 2 | Question: 30
Consider a join (relation algebra) between relations $r(R)$ and $s(S)$ using the nested loop method. There are $3$ ... $s(S)$ is more than $0.5$. join selection factor between $r(R)$ and $s(S)$ is less than $0.5$.
Consider a join (relation algebra) between relations $r(R)$ and $s(S)$ using the nested loop method. There are $3$ buffers each of size equal to disk block size, out of w...
User Avatar
39 votes
3 answers
48
GATE CSE 2005 | Question: 76
The following table has two attributes $A$ and $C$ where $A$ is the primary key and $C$ is the foreign key referencing $A$ ... $(7, 2)$ $(5, 2), (7, 2)$ and $(9, 5)$ $(3, 4), (4, 3)$ and $(6, 4)$
The following table has two attributes $A$ and $C$ where $A$ is the primary key and $C$ is the foreign key referencing $A$ with on-delete cascade.$$\begin{array}{|c|c|} \...
User Avatar
2 votes
3 answers
49
UGC NET CSE | June 2014 | Part 2 | Question: 49
Let $R =\{A, B, C, D, E, F\}$ be a relation schema with the following dependencies $C \rightarrow F$, $E \rightarrow A$, $EC \rightarrow D$, $A \rightarrow B$. Which of the following is a key for $R$ ? CD EC AE AC
Let $R =\{A, B, C, D, E, F\}$ be a relation schema with the following dependencies $C \rightarrow F$, $E \rightarrow A$, $EC \rightarrow D$, $A \rightarrow B$. Which of t...
User Avatar
39 votes
2 answers
50
GATE CSE 1999 | Question: 2.25
Which of the following is/are correct? An SQL query automatically eliminates duplicates An SQL query will not work if there are no indexes on the relations SQL permits attribute names to be repeated in the same relation None of the above
Which of the following is/are correct?An SQL query automatically eliminates duplicatesAn SQL query will not work if there are no indexes on the relationsSQL permits attri...
User Avatar
6 votes
4 answers
52
3NF is inadequate in situations where the relation:
3NF is inadequate in situations where the relation: A. has multiple candidates key B. has candidate key that are composite C. has overlapped candidate keys D. all the above
3NF is inadequate in situations where the relation:A. has multiple candidates keyB. has candidate key that are compositeC. has overlapped candidate keysD. all the above
User Avatar
1 votes
2 answers
58
3NF
Consider a relation R with five attributes ABCDE. You are given the following dependencies: A → B, BC → E, and ED → A. 1. List all keys for R. 2. Is R in 3NF? 3. Is R in BCNF?
Consider a relation R with five attributes ABCDE. You are given the following dependencies: A → B, BC → E, and ED → A.1. List all keys for R.2. Is R in 3NF?3. Is R ...
User Avatar
34 votes
5 answers
60
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: