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
2311
Normalization
ABC is key of R(ABCDE). Is A -- DBC is Partial dependncy .
ABC is key of R(ABCDE). Is A DBC is Partial dependncy .
User Avatar
2 votes
2 answers
2312
entity relationship
User Avatar
1 votes
1 answer
2313
MUX 4X1
The product of Maxterms expression for the the output f of the the MUX is (A+B+C)(A+B’+C’)(A’+B’+C)(A’+B+C’) (A+B+C’)(A+B’+C)(A’+B+C)(A’+B’+C’)
The product of Maxterms expression for the the output f of the the MUX is (A+B+C)(A+B’+C’)(A’+B’+C)(A’+B+C’) (A+B+C’)(A+B’+C)(A’+B+C)(A’+B’+C’)
User Avatar
0 votes
0 answers
2314
SQL check operator
Create table Student(Rno numeric, Name varchar(20),Marks numeric, Course varchar(30)); In order to ensure that the value of Marks should not exceed 100, which of the following should be used?( Marks: -0.33 ) Alter(Marks>=100) Alter(Marks<100) Check (Marks>=100) Check(Marks<100)
Create table Student(Rno numeric, Name varchar(20),Marks numeric, Course varchar(30));In order to ensure that the value of Marks should not exceed 100, which of the follo...
User Avatar
4 votes
3 answers
2315
made easy test series
i think in this ques BD->E also voilates 3NF plz correct me if i am wrong
i think in this ques BD->E also voilates 3NF plz correct me if i am wrong
User Avatar
1 votes
2 answers
2319
Normalization
True or false , 1)minimal canonical cover may not be unique. 2) canonical cover may not be unique
True or false , 1)minimal canonical cover may not be unique.2) canonical cover may not be unique
User Avatar
3 votes
2 answers
2320
b+tree
User Avatar
1 votes
0 answers
2321
relational algebra
User Avatar
4 votes
2 answers
2322
B+ tree
pls explain
pls explain
User Avatar
2 votes
2 answers
2323
ER model
User Avatar
3 votes
2 answers
2324
Gate 2008 (Extension: convert into 3NF)
Let R (A, B, C, D, E, P, G) be a relational schema in which the following functional depen­dencies are known to hold: AB → CD, DE → P, C → E, P → C and B → G. Convert the above schema in 3NF
Let R (A, B, C, D, E, P, G) be a relational schema in which the following functional depen­dencies are known to hold: AB → CD, DE → P, C → E, P → C and B → G.C...
User Avatar
1 votes
1 answer
2325
Test Series
a) I, III b) I, IV c) II, III d) II, IV
a) I, IIIb) I, IVc) II, IIId) II, IV
User Avatar
2 votes
1 answer
2326
Relational Algebra
User Avatar
1 votes
2 answers
2327
virtual gate
Relation R(ABCDEF) with the following set of functional dependencies {AB→CDEF, C→A, D→B, E→F, B→E}. The decomposed relationslations of R into 3NF are __________________________.
Relation R(ABCDEF) with the following set of functional dependencies {AB→CDEF, C→A, D→B, E→F, B→E}.The decomposed relationslations of R into 3NF are ___________...
User Avatar
4 votes
4 answers
2329
Normal forms conceptual
Consider a relation R(ABCD) is decomposed into R1(AC), R2(BD) based on some set of functional dependencies then R1 and R2 definitely be in _______________ Normal Form.
Consider a relation R(ABCD) is decomposed into R1(AC), R2(BD) based on some set of functional dependencies then R1 and R2 definitely be in _______________ Normal Form.
User Avatar
Page: