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

0 votes
0 answers
3093
normal forms
State True/False: "A relation must have a composite key if it is in BCNF but not in 4nf".
State True/False: "A relation must have a composite key if it is in BCNF but not in 4nf".
User Avatar
6 votes
1 answer
3094
order of leaf node in b+ tree??
which formula should we use for calculating LEAF node in B+ tree? I. n*(K+r)+b<=block size where n=no of keys k=key size,r=record pointer,b=block pointer II. (n-1)(K+r)+b<=block size
which formula should we use for calculating LEAF node in B+ tree?I. n*(K+r)+b<=block sizewhere n=no of keysk=key size,r=record pointer,b=block pointerII. (n-1)(K+r)+b<=bl...
User Avatar
0 votes
0 answers
3095
Self Doubt
Are serializable schedule and serial equivalent schedule same ? If so what is the difference ?
Are serializable schedule and serial equivalent schedule same ? If so what is the difference ?
User Avatar
0 votes
0 answers
3098
How to know 1:1 or n:n participation
By looking into er table how do we know it is 1:1 or N:N relation
By looking into er table how do we know it is 1:1 or N:N relation
User Avatar
0 votes
1 answer
3099
Made Easy
Given relation R(A, B, C, D, E) and set of functional dependencies F = {AB → C, AB → D, D → A, BC → D, BC → E} What will be the highest normal form satisfied by R ? a. 1 NF b. 2 NF c. 3 NF d. BCNF
Given relation R(A, B, C, D, E) and set of functional dependencies F = {AB → C, AB → D, D → A, BC → D, BC → E}What w...
User Avatar
3 votes
1 answer
3100
Made Easy
Consider the following relation: R (A1, A,2, ....., An) and Every (n – 2) attributes of R forms Candidate key. Which of the following represents the number of super keys are there in R ? a. nCn–2 * 22 b. nCn–2 + n + 1 c. nCn–2 * [3] d. nCn–2
Consider the following relation: R (A1, A,2, ....., An) and Every (n – 2) attributes of R forms Candidate key. Which of the following represents the number of super key...
User Avatar
0 votes
1 answer
3101
Made Easy Test Series
Assume a B-plus tree as: Size of search key=15B Size of block=512B Size of record pointer=9B Size of block pointer=8B What is the maximum number of nodes that can be accomodated in each leaf and non-leaf node of the tree?
Assume a B-plus tree as:Size of search key=15BSize of block=512BSize of record pointer=9BSize of block pointer=8BWhat is the maximum number of nodes that can be accomodat...
User Avatar
2 votes
1 answer
3102
TestBook Test Series
Let T be a B-tree of order m and height h. if n is the number of key elements in T then the maximum value of n is (m-1)h-1 (m-1)h-1+1 Mh-1 Mh+1+1
Let T be a B-tree of order m and height h. if n is the number of key elements in T then the maximum value of n is(m-1)h-1(m-1)h-1+1Mh-1Mh+1+1
User Avatar
0 votes
1 answer
3104
ace test series
User Avatar
0 votes
0 answers
3105
ACE test series
a table with 3 attributes consist 4 rows (1,2,3) (5,2,3) ,(6,3,3) and ( 9,7,8) which of the following dependency works well BC->A C->B B->A answer given in solution is BC->A..please explain how it is.
a table with 3 attributes consist 4 rows (1,2,3) (5,2,3) ,(6,3,3) and ( 9,7,8) which of the following dependency works wellBC->AC->BB->A answer given in solution is BC->...
User Avatar
0 votes
1 answer
3106
#doubt in ERD to relational DB
E1 and E2 are strong entities with 1:m relationship via R. we take 1 separate table for each strong entity => so 2 tables But if there is 1 : n relationship, then we take 1 side entity into many side => so it should be 1 table, not 2 as 1:n is given please explain which one is correct?
E1 and E2 are strong entities with 1:m relationship via R.we take 1 separate table for each strong entity = so 2 tablesBut if there is 1 : n relationship, then we take 1 ...
User Avatar
1 votes
1 answer
3108
B+ tree dense index
Database table (R) consist 1000 records. The number of minimum B+ tree index blocks required to build dense B+tree index for relation (R) are _________. Assume order of B+ tree root node atleast 1 key atmost 12 key and other nodes of B+ tree order atleast 6 keys and atmost 12 keys.
Database table (R) consist 1000 records. The number of minimum B+ tree index blocks required to build dense B+tree index for relation (R) are _________. Assume order of B...
User Avatar
0 votes
0 answers
3109
MadeEasy Subject Test: Databases - Sql
i think here in Q2 >>> query write in wrong way.........here missing some brackets ??
i think here in Q2 >> query write in wrong way.........here missing some brackets ??
User Avatar
0 votes
1 answer
3110
database
How many rows will be there in the output of the following query?
How many rows will be there in the output of the following query?
User Avatar
Page: