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 answered questions in Databases

2 votes
7 answers
22
Partial dependency
The number of partial dependencies in a relation R{X,Y,V,U,Z} with FD set F={X->YZ, Z->V, V->XY} is ____
The number of partial dependencies in a relation R{X,Y,V,U,Z} with FD set F={X->YZ, Z->V, V->XY} is ____
User Avatar
7 votes
7 answers
23
Number of Different Minimal Cover
Consider the following FD set {A → BC,B → AC, C → AB}. The number of different minimal covers possible for the above FD set __________ .
Consider the following FD set {A → BC,B → AC, C → AB}. The number of different minimal covers possible for the above FD set __________ .
User Avatar
–1 votes
7 answers
24
BCNF
Every BCNF decomposition is A)Dependency preserving B)not a dependency preserving C)Need not be dependency preserving D)None of the above
Every BCNF decomposition is A)Dependency preservingB)not a dependency preservingC)Need not be dependency preservingD)None of the above
User Avatar
1 votes
7 answers
26
PROBLEM ON VIEW SERIALIZABILITY
check whether it is view serializable or not? schedule S:R1(X),W2(X),W1(X)
check whether it is view serializable or not?schedule S:R1(X),W2(X),W1(X)
User Avatar
30 votes
7 answers
34
GATE CSE 2003 | Question: 65
Consider the following $2-3-4$ tree (i.e., B-tree with a minimum degree of two) in which each data item is a letter. The usual alphabetical ordering of letters is used in constructing the tree. What is the result of inserting $G$ in the above tree? None of the above
Consider the following $2-3-4$ tree (i.e., B-tree with a minimum degree of two) in which each data item is a letter. The usual alphabetical ordering of letters is used in...
User Avatar
0 votes
6 answers
36
made easy test series
Consider a relation $R(ABCDEFGH)$. How many superkeys will be there in relation $R$ if the candidate keys for relation are ${A, BC, CDE, EF}$?
Consider a relation $R(ABCDEFGH)$.How many superkeys will be there in relation $R$ if the candidate keys for relation are ${A, BC, CDE, EF}$?
User Avatar
1 votes
6 answers
39
#DBMS ER Model - Minimum Number of tables
What are minimum number of tables required for the following given ER models such that they satisfy 1NF ?
What are minimum number of tables required for the following given ER models such that they satisfy 1NF ?
User Avatar
4 votes
6 answers
40
can cadidate key may be null?
User Avatar
Page: