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

Questions without answers in Databases

238
views
0 answers
0 votes
https://www.javatpoint.com/dbms-reduction-of-er-diagram-into-table
How can I represent the ER model in tabular form? , in java point, the tabular form doesn't seem to be correct.Ref. https://www.javatpoint.com/dbms-reduction-of-er-diagram-into-table
User Avatar
246
views
0 answers
0 votes
Hamburg University Exercise 4.1 Sizes of Relations
Given two relations R1 and R2 where R1 contains N1 tuples and R2 contains N2 tuples, give the minimum and maximum possible sizes (in tuples) for the relation produced by each of the following ... )| ≤ N1(10): 0 ≤ |σA>B(R1) ∪ σA<B(R1)| ≤ N1
User Avatar
282
views
0 answers
0 votes
Ace Academy Bits and Bytes
Assertion(a) : A relation R(ABC) is having 3 rows andresults in 3 rows.Reason(r) : Natural Join join two tables based on all common columns with equality conditions.A . both 'a' ... 'a' and 'r' are false. D. 'a' is true but 'r' is false .
User Avatar
444
views
0 answers
0 votes
ER Diagram
Can someone please provide me with the correct explanation for this question
User Avatar
395
views
0 answers
0 votes
Database.
T1: R1(A), W1(A), R1 (B). W1(B); T2: R2(A), W2(A), R2(B). W₂(B) S1: R2(A), W2(A), R1 (A), W1(A), R1 (B), W1(B), R2(B) ... serializable schedules.S1 R1(x) R3(y) W1(x) W2(y) R3(x) W2(x)Find out whether S₁ is conflict serializable schedules.
User Avatar
564
views
0 answers
0 votes
Finding minimum number of tables needed to represent ER diagram
Find minimum number of tables needed to represent following ER diagram?This question would have been relatively simple as we would implicitly convert the ERD to 3NF (asked ... in 1NF or 2NF?. What would our approach will be in that case?
User Avatar
264
views
0 answers
0 votes
https://testbook.com/TS-nic-scientist-b/tests/640217b028c19ad10b7fed68?attemptNo=1#/lt-solutions
In a databse system, let TS(T1) and TS(T2) be the timestamps of transactions T1 and T2 respectively. W-t(X) denotes the largest timestamp of any transaction that executed ... W-t(X) then T₁ is rolled backAll of the above.PS: Ans given as B
User Avatar
244
views
0 answers
0 votes
#cpcb
Two relations A and B are stored as clustered sequential files on disk. Each block on disk can hold 100 records of either A or B. The relation A contains ... nested loop join operation on these two tables is at least (in integer) _________.
User Avatar
234
views
0 answers
0 votes
Databases
Show that the two phase locking protocol ensures conflict serializability and that transaction can be serialized according to their lock points.
User Avatar
192
views
0 answers
0 votes
Applied root course
User Avatar
460
views
0 answers
0 votes
Database ER model
Consider the following relation (capitalized letters are attributes and lower letters are values).X:From the given FDs find the dependencies that seems to apply on X and ... possible key (Candidate key) for X.A→C,D→E,C→A,E→BE→A,C→B,B→D,B→A
User Avatar
330
views
0 answers
0 votes
Ace workbook dbms
User Avatar
578
views
0 answers
0 votes
TestBook TestSeries question to find max child possible in B+ Tree
In a B+ Tree index having order 6, which is the maximum number of child pointers it can have. Keys are numbered from 1 to 83. What can be the maximum number of nodes which can be used to store all the keys?A. 17B. 19C. 59D. 57
User Avatar
257
views
0 answers
0 votes
Databases
Please explain option c.
User Avatar
317
views
0 answers
1 votes
SQL | Not Exist
User Avatar
290
views
0 answers
0 votes
SQL
consider following relation How many number of records resulted by following SQL query?Select $T_{1}.A$From RWhere Exists (Select Count (*) From S Where R .C<S.F and S. E > 10 ); A 3B 2C 1D 0
User Avatar
451
views
0 answers
0 votes
Entity-relationship and Relational Model:el:Convert the following entity-relationship diagram into tables of relational model
Entity-relationship and Relational Model:el:Convert the following entity-relationship diagram into tables of relational model
User Avatar
679
views
0 answers
0 votes
Unacademy AIMT -1
the answer is 28
User Avatar
481
views
0 answers
1 votes
DRDO CSE 2022 Paper 2 | Question: 15 (a)
Answer the following.__________ is the operation that reverses the normalization to denormalization form.
User Avatar
280
views
0 answers
1 votes
DRDO CSE 2022 Paper 2 | Question: 15 (c)
Answer the following.Which of the following are not keys in the database?Compliment *AgreementConstructSupplement
User Avatar
383
views
0 answers
2 votes
Since it is already in 3NF, why decompose further?
Since the schema is already in 3NF we can keep the relations to 1, cant we? If you think the answer is different please explain how
User Avatar
464
views
0 answers
1 votes
self doubt
Any attribute(s) determining a prime attribute, automatically becomes a prime(s) attributeTrue or false
User Avatar
352
views
0 answers
0 votes
Databases
How to identify many to many relationship.Can R2 be one to one.
User Avatar
233
views
0 answers
0 votes
selfdoubt
can a relationship have a degree of one if both the entities are same and participating in one form?ex: employee helps employee
User Avatar
3.1k
views
0 answers
6 votes
5. Consider a multi-dimensional array A [90][30]40] with base address start at 1000, calculate the address of A[10][20][3] in row major order and column major order. Assume the first element is stored at A [2][2][2] and each element take 2 byte.
Consider a multi-dimensional array A [90][30]40] with base address start at 1000, calculate the address of A[10][20][3] in row major order and column major order. ... first element is stored at A [2][2][2] and each element take 2 byte.
User Avatar
621
views
0 answers
0 votes
DBMS -- Book Confusion
which is best book for DBMS korth or navathe ?since i know that both book is great but i wanted to follow 1 particular book that is easy to understand and simple language for all topics.please suggest .
User Avatar
245
views
0 answers
0 votes
Serializability
What is Proof/Explanation for complexity to test if a schedule is conflict serializable is O(n^2) whereas for view serializable is O(2^n)-Exponential ?
User Avatar
144
views
0 answers
0 votes
Fanout ratio in indexing
What is fanout ratio
User Avatar
To see more, click for the full list of questions or popular tags.