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

Recent questions in Databases

1 votes
2 answers
103
UGC NET CSE | June 2023 | Part 2: 44
Which one of the following is $\text{NOT}$ a part of $\text{ACID}$ properties of a database transaction? Atomicity Consistency Isolation Deadlock-freedom
Which one of the following is $\text{NOT}$ a part of $\text{ACID}$ properties of a database transaction?AtomicityConsistencyIsolationDeadlock-freedom
User Avatar
0 votes
0 answers
112
Databases
Show that the two phase locking protocol ensures conflict serializability and that transaction can be serialized according to their lock points.
Show that the two phase locking protocol ensures conflict serializability and that transaction can be serialized according to their lock points.
User Avatar
1 votes
1 answer
113
Ace Test Series | DBMS
In multiple Granularity locking protocol at a particular node transaction T1 is holding SIX LOCK. When transaction T2 is also requesting a lock, at that node which other lock is allowed. I S I X S SIX X
In multiple Granularity locking protocol at a particular node transaction T1 is holding SIX LOCK. When transaction T2 is also requesting a lock, at that node which other ...
User Avatar
0 votes
1 answer
115
Explain the properties of B-Tree Also Construct B+ tree with order P=4 10,5,30,40,20,17,90,45,93,60,20,50,29
please solve in paper formet Explain the properties of B-Tree Also Construct B+ tree with order P=410,5,30,40,20,17,90,45,93,60,20,50,29
User Avatar
0 votes
0 answers
116
Applied root course
User Avatar
1 votes
1 answer
117
Applied root test series
User Avatar
1 votes
1 answer
118
Database: Keys
Consider a relation R(ABCDEFGH). How many superkey will be there in relation Rif candidate key for relation are {A, BC, CDE, EF}?
Consider a relation R(ABCDEFGH). How many superkey will be there in relation Rif candidate key for relation are {A, BC, CDE, EF}?
User Avatar
Page: