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}}}$$

Highest voted questions in Databases

52 votes
5 answers
62
Consider a database that has the relation schema CR(StudentName, CourseName). An instance of the schema CR is as given below.$$\begin{array}{|c|c|} \hline \textbf{Student...
52 votes
5 answers
63
52 votes
3 answers
65
51 votes
6 answers
68
Which of the following concurrency control protocols ensure both conflict serializability and freedom from deadlock?$2$-phase lockingTime-stamp orderingI onlyII onlyBoth ...
50 votes
6 answers
71
A B-tree of order $4$ is built from scratch by $10$ successive insertions. What is the maximum number of node splitting operations that may take place?$3$$4$$5$$6$
49 votes
4 answers
73
Consider the following relation:$$\overset{\text{Student}}{\begin{array}{|c|c|}\hline\\\underline{\textbf{Roll_No}}& \textbf{Student_Name}\\\hline1& \text{Raj} \\...
49 votes
4 answers
74
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...
48 votes
4 answers
79
Consider the following relations $A, B$ and $C:$ $$\overset{\textbf{A}}{\begin{array}{|c|c|c|}\hline\\\textbf{Id}& \textbf{Name}& \textbf{Age} \\\hline12& \text{A...