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{2024-1}& \textbf{2024-2} &\textbf{2023} &\textbf{2022} & \textbf{2021-1}&\textbf{2021-2}&\textbf{Minimum}&\textbf{Average}&\textbf{Maximum}
\\\hline\textbf{1 Mark Count} &4&4&1& 3 &2&1&1&2.5&4
\\\hline\textbf{2 Marks Count} &2&2&2& 2&3&3&2&2.33&3
\\\hline\textbf{Total Marks} & 8&8&5& 7 &8&7&\bf{5}&\bf{7.16}&\bf{8}\\\hline
\end{array}}}$$

Filter

Most answered questions in Databases

#61
17.4k
views
6 answers
56 votes
GATE CSE 2002 | Question: 2.25
From the following instance of a relation schema $R(A,B,C)$, we can conclude that:$$\begin{array}{|l|l|}\hline \textbf{A} & \textbf{B} & \textbf{C} \\\hline \text{1} & \...
User Avatar
#62
14.6k
views
6 answers
42 votes
GATE CSE 2002 | Question: 2.23, UGCNET-June2012-II: 26
A $B^+$ - tree index is to be built on the Name attribute of the relation STUDENT. Assume that all the student names are of length $8$ bytes, disk blocks are of size $512...
User Avatar
#63
9.0k
views
6 answers
46 votes
GATE CSE 2001 | Question: 2.24
Which of the following relational calculus expression is not safe?$\left\{t \mid \exists u \in R_1\left(t[A] = u[A]\right) \land \neg \exists s \in R_2 \left(t[A] = s[A]\...
User Avatar
#64
53.2k
views
6 answers
129 votes
GATE CSE 2001 | Question: 2.23
$R(A,B,C,D)$ is a relation. Which of the following does not have a lossless join, dependency preserving $BCNF$ decomposition?$A \rightarrow B, B \rightarrow CD$$A \righta...
User Avatar
#65
3.5k
views
6 answers
22 votes
GATE CSE 1991 | Question: 12-a
Suppose a database consist of the following relations:SUPPLIER (SCODE,SNAME,CITY). PART (PCODE,PNAME,PDESC,CITY). PROJECTS (PRCODE,PRNAME,PRCITY). SPPR (SCODE,PCODE,PRCOD...
User Avatar
#66
22.4k
views
6 answers
50 votes
GATE CSE 2008 | Question: 41
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$
User Avatar
#67
27.7k
views
6 answers
64 votes
GATE CSE 2008 | Question: 82
Consider the following $\text{ER}$ diagramThe minimum number of tables needed to represent $M$, $N$, $P$, $R1$, $R2$ is$2$$3$$4$$5$
User Avatar
#68
40.7k
views
6 answers
65 votes
GATE CSE 2012 | Question: 15
Which of the following statements are TRUE about an SQL query?P : An SQL query can contain a HAVING clause even if it does not have a GROUP BY clauseQ : An SQL query can ...
User Avatar
#69
9.2k
views
5 answers
13 votes
GATE CSE 2023 | Question: 6
Which one of the options given below refers to the degree (or arity) of a relation in relational database systems?Number of attributes of its relation schema.Number of tu...
User Avatar
#70
13.3k
views
5 answers
25 votes
GATE CSE 2022 | Question: 46
Consider the relational database with the following four schemas and their respective instances.Student(sNo, sName, dNo) Dept(dNo, dName)Course(cNo, cName, dNo) Register(...
User Avatar
#71
3.7k
views
5 answers
5 votes
GATE CSE 1994 | Question: 14b
For a $B^+$ - tree of order $d$ with $n$ leaf nodes, the number of nodes accessed during a search is $O(\_)$.
User Avatar
#72
14.0k
views
5 answers
27 votes
GATE CSE 2021 Set 1 | Question: 33
Consider the relation $R(P,Q,S,T,X,Y,Z,W)$ with the following functional dependencies.$$PQ\rightarrow X;\quad P\rightarrow YX;\quad Q\rightarrow Y; \quad Y\rightarrow ZW$...
User Avatar
#73
1.7k
views
5 answers
2 votes
NIELIT 2016 MAR Scientist C - Section C: 5
A primary key, if combined with a foreign key createsparent child relationship between the tables that connect themmany-to-many relationship between the tables that conne...
User Avatar
#74
3.6k
views
5 answers
4 votes
NIELIT 2017 DEC Scientist B - Section B: 1
Which one of the following statements are not correct?$S1$: $3$NF decomposition is always lossless join and dependency preserving.$S2$: $3$NF decomposition is always loss...
User Avatar
#75
3.5k
views
5 answers
6 votes
UGC NET CSE | January 2017 | Part 2 | Question: 18
Let $M$ and $N$ be two entities in an $E-R$ diagram with simple single value attributes. $R_{1}$ and $R_{2}$ are two relationship between $M$ and $N$, where as $R_{1}$, i...
User Avatar
#76
1.5k
views
5 answers
0 votes
UGC NET CSE | January 2017 | Part 2 | Question: 47
__________ refers loosely to the process of semi-automatically analyzing large databases to find useful patterns.DataminingData warehousingDBMSData mirroring
User Avatar
#77
12.1k
views
5 answers
20 votes
GATE CSE 2020 | Question: 37
Consider a schedule of transactions $T_1$ and $T_2$:$\begin{array}{|c|c|c|c|c|c|c|c|c|c|c|} \hline T_1 & RA & & & RC & & WD & & WB & \text{Commit} & \\ \hline T_2 & & R...
User Avatar
#78
3.7k
views
5 answers
5 votes
ISRO2020-51
The SQL querySELECT columns FROM TableA RIGHT OUTER JOIN TableB ON A.columnName = B.columnName WHERE A.columnName IS NULLreturns the following:All rows in Table $\text{B}...
User Avatar
#79
3.9k
views
5 answers
4 votes
UGC NET CSE | June 2019 | Part 2 | Question: 31
Which of the following has same expressive power with regard to relational query language?Rational algebra and domain relational calculusRelational algebra and tuples rel...
User Avatar
#80
3.3k
views
5 answers
5 votes
UGC NET CSE | June 2019 | Part 2 | Question: 34
In relational databases, if relation R is in BCNF, then which of the following is true about relation R?R is in 4NFR is not in 1NFR is in 2NF and not in 3NFR is in 2NF an...
User Avatar
Page: