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

Recent questions in Databases

1 votes
1 answer
3661
Ace Page# 12, Q# 25
What are essential properties of Functional dependencies (FD)? There is a one to one Relationship between attributes in FDs FDs must be defined on schema FDs must be non trivial All of the above
What are essential properties of Functional dependencies (FD)?There is a one to one Relationship between attributes in FDsFDs must be defined on schemaFDs must be non tri...
User Avatar
2 votes
2 answers
3663
SQL1
Consider the following R A 1 2 3 4 B NULL 1 2 2 select * from R as R1 where not exists (select * from R where B = R1.A) The number of tuple returned by SQL query is ____________
Consider the following RA1234BNULL122select * from R as R1 where not exists (select * from R where B = R1.A)The number of tuple returned by SQL query is ____________
User Avatar
1 votes
1 answer
3664
SQL
Q1: (Select eno from emp where deptno=10) union(Select eno from emp where deptno=20) Q2:(Select eno from emp where deptno=10 or deptno=20) Which one is true? 1)Q1⊆Q2 2)Q2⊆Q1 3)Q1=Q2 4)data inefficient
Q1: (Select eno from emp where deptno=10) union(Select eno from emp where deptno=20)Q2:(Select eno from emp where deptno=10 or deptno=20)Which one is true?1)Q1⊆Q22)Q2�...
User Avatar
4 votes
1 answer
3665
Indexing
If one block access time is 30ms,then what is the access time for 100 blocks index if we use binary search?
If one block access time is 30ms,then what is the access time for 100 blocks index if we use binary search?
User Avatar
1 votes
1 answer
3666
UGC NET CSE | December 2015 | Part 2 | Question: 14
Match the following database terms to their functions $:$ ... $\text{(a)-(iv), (b)-(iii), (c)-(ii), (d)-(i)}$
Match the following database terms to their functions $:$$\begin{array} {clcl} & \textbf{List – I} && \textbf{List – II} \\ \text{(a)} & \text{Normalization} & \te...
User Avatar
2 votes
2 answers
3667
madeeasy
A B C 3 5 NULL 6 NULL 10 NULL 10 5 12 NULL NULL SELECT * FROM R WHERE (A>=5) AND (B>C OR C>=5); NO OF TUPLES RESULTED BY QUERY?
A B C3 5 NULL6 NULL 10NULL 10 512 NULL NULLSELECT * FROM R WHERE (A>=5) AND (B>C OR C>=5);NO OF TUPLES RESULTED BY QUERY?
User Avatar
2 votes
2 answers
3672
UGC NET CSE | Junet 2015 | Part 2 | Question: 20
For a weak entity set to be meaningful, it must be associated with another entity set in combination with some of their attribute values, is called as: Neighbour Set Strong Entity Set Owner Entity Set Weak Set
For a weak entity set to be meaningful, it must be associated with another entity set in combination with some of their attribute values, is called as:Neighbour SetStrong...
User Avatar
1 votes
1 answer
3674
UGC NET CSE | Junet 2015 | Part 2 | Question: 18
Drop Table cannot be used to drop a Table referenced by _______ constraint Primary key Sub key Super key Foreign key a a, b and c d a and d
Drop Table cannot be used to drop a Table referenced by _______ constraintPrimary keySub keySuper keyForeign keyaa, b and cda and d
User Avatar
4 votes
2 answers
3676
madeeasy
how many foreign keys required for the following relation R (ABCDEF) with FD ( AB ⇒C,BC ⇒A , AC ⇒B ,D ⇒E) into BCNF and lossless join, dependency preserving decomposition?
how many foreign keys required for the following relation R (ABCDEF) with FD ( AB ⇒C,BC ⇒A , AC ⇒B ,D ⇒E) into BCNF and lossless join, dependency pres...
User Avatar
1 votes
3 answers
3677
made easy
how many minimum relations required to decompose the following relation R (ABCD) with fd ( A⇒B , C⇒D) with lossless join and dependency preserving BCNF decomposition?
how many minimum relations required to decompose the following relation R (ABCD) with fd ( A⇒B , C⇒D) with lossless join and dependency preserving BCNF decompos...
User Avatar
3 votes
2 answers
3678
Made easy
Consider the following relation R (A B C D E) WITH FD F= (A ⇒BC, CD ⇒E, B⇒D, E ⇒A ). How many minimum relations required to decompose into BCNF with Dependency preserving and Lossless join decomposition?
Consider the following relation R (A B C D E) WITH FD F= (A ⇒BC, CD ⇒E, B⇒D, E ⇒A ).How many minimum relations required to decompose into BCNF with De...
User Avatar
3 votes
1 answer
3679
UGC NET CSE | December 2013 | Part 3 | Question: 60
Match the following $:$ ... $\text{a-i, b-iii, c-iv, d-ii}$ $\text{a-ii, b-iv, c-i, d-iii}$
Match the following $:$$\begin{array} {clcl} & \textbf{List – I} && \textbf{List – II} \\ \text{a.} & \text{Secondary Index} & \text{i.} & \text{Functional Depende...
User Avatar
3 votes
1 answer
3680
UGC NET CSE | December 2013 | Part 3 | Question: 59
Armstrong $(1974)$ ... $\text{a-ii, b-i, c-iii, d-iv}$ $\text{a-iv, b-iii, c-i, d-ii}$
Armstrong $(1974)$ proposed systematic approach to derive functional dependencies. Match the following w.r.t functional dependencies:$\begin{array}{} & \textbf{List-I} ...
User Avatar
Page: