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
3 answers
4341
Relational Algebra
Please answer the following questions
Please answer the following questions
User Avatar
0 votes
3 answers
4342
The process of assigning similar objects/entities to object/entity type known as
The process of assigning similar objects/entities to object/entity type known as a)Classification b)Instantiation c)Specialization d)Generalization
The process of assigning similar objects/entities to object/entity type known asa)Classification b)Instantiationc)Specializationd)Generalization
User Avatar
0 votes
1 answer
4343
Data model
In a database , the specification of data where individual data item of same type can have different sets of attribute a) True b) false
In a database , the specification of data where individual data item of same type can have different sets of attribute a) True b) false
User Avatar
1 votes
3 answers
4344
b+ tree order
Assume block size 4096 bytes,size of key is 4 bytes,size of pointer is 8 bytes.How many keys are possible per blocks for b+ tree organisation? (a) 155 (b) 154 (c) 341 (d) 340
Assume block size 4096 bytes,size of key is 4 bytes,size of pointer is 8 bytes.How many keys are possible per blocks for b+ tree organisation?(a) 155(b) 154(c) 341(d) 340...
User Avatar
0 votes
1 answer
4349
DBMS general
Decompose a relation into 3NF , BCNF, 2NF , How to get it?
Decompose a relation into 3NF , BCNF, 2NF , How to get it?
User Avatar
1 votes
1 answer
4350
If S is a superkey such that S
If S is a superkey such that S $\cap$ UID is NULL then S $\cup$ UID is also a superkey
If S is a superkey such that S $\cap$ UID is NULL then S $\cup$ UID is also a superkey
User Avatar
11 votes
3 answers
4351
Conflict Equivalent
Consider the following ordering S of transaction T1:R(X),W(Y), T2:R(X),W(Y);T3:R(X),W(Y). how many schedules if any are conflict equivalent to S? 1) 3 2) 5 c) 15 d) 30
Consider the following ordering S of transaction T1:R(X),W(Y), T2:R(X),W(Y);T3:R(X),W(Y). how many schedules if any are conflict equivalent to S?1) 32) 5c) 15d) 30
User Avatar
1 votes
2 answers
4352
Concurrency Problems
T1 T2 R(A) R(A) R(B) R(B) W(A) COMMIT R(A) W(A) COMMIT in the above problem identify the concurrency in the following Schedule involving 2 Transaction T1 AND T2 (r: read and w : write ) a) Dirty Read problem b) Unrepeatable Read problem c) Lost update Problem d) Both a and b
T1T2R(A) R(A) R(B) R(B) W(A) COMMIT R(A) W(A) COMMIT in the above problem identify the concurrency in the following Schedule involving 2 Transaction T1 AND T2 (r: r...
User Avatar
0 votes
2 answers
4353
ACID PROPERTIES
ATOMICITY IS MANAGED BY a) Programmer b) Recovery Management Component c) Concurrency Control Component d) None of it
ATOMICITY IS MANAGED BY a) Programmerb) Recovery Management Component c) Concurrency Control Componentd) None of it
User Avatar
2 votes
1 answer
4355
normalization
Can you explain me this : A table is in second normal form if every attribute is determined by every candidate key , but is not determined by any pure subset of Candidate key ? True or false
Can you explain me this :A table is in second normal form if every attribute is determined by every candidate key , but is not determined by any pure subset of Candidate ...
User Avatar
6 votes
1 answer
4356
normalization
Let R(ABCDE) be a relational schema and F ={AB->CD, ABC->E,C->E} BE A SET OF FUNCTIONAL dependencies. WHAT IS highest normal of R ? 1NF 2NF 3NF BCNF
Let R(ABCDE) be a relational schema and F ={AB->CD, ABC->E,C->E} BE A SET OF FUNCTIONAL dependencies. WHAT IS highest normal of R ?1NF 2NF3NFBCNF
User Avatar
6 votes
4 answers
4357
normalization
Consider the relation R(ABCD) with FD's set F={ AB->CD,C->.A,D->B} which of the following is false ? 1.C->A is a partial Dependency 2.C->A is a transitive Dependency 3.D->B IS A Partial dependency 4. All of these
Consider the relation R(ABCD) with FD's set F={ AB->CD,C->.A,D->B}which of the following is false ?1.C->A is a partial Dependency2.C->A is a transitive Dependency3.D->B I...
User Avatar
3 votes
2 answers
4358
Normalisation
A functional dependency X->y is trivial if y⊆x right ??
A functional dependency X->y is trivial if y⊆x right ??
User Avatar
1 votes
7 answers
4359
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
3 votes
2 answers
4360
Minimum keys in a B-tree of order of 3 which has height = 3?
I think answer is 7 ,if not then pls explain .
I think answer is 7 ,if not then pls explain .
User Avatar
Page: