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|c|c|c|c|c|c|}\hline \textbf{Year}& \textbf{2026 - 1}& \textbf{2026 - 2}& \textbf{2025 - 1}& \textbf{2025 - 2}& \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}&2&2&1&1&4&4&1&3&2&1&1&2.1&4\\\hline \textbf{2 Marks Count}&2&2&3&4&2&2&2&2&3&3&2&2.5&4\\\hline \textbf{Total Marks}&6&6&8&9&8&8&5&7&8&7&\bf{5}&\bf{7.2}&\bf{9}\\\hline \end{array}}}$$

0 0 votes
1 1 answer
565
565 views
0 0 votes
1 1 answer
1.9k
1.9k views
Considering the following schema, create the appropriate tables and insert at least 5 records:AUTHOR(author-id,name, city,country)PUBLISHER (publisher-id, name,city, coun...
0 0 votes
1 1 answer
481
481 views
Sailor (Sid––––,Sname,Age)Reserves (Sid,Bid–––––––––,date)Boat (Bid––––,Bname,color)i) Select B.bid, count (*) From boat B, Reserves RWhere R.bid = B.bid and B.color = 'R...
0 0 votes
1 1 answer
1.1k
1.1k views
Construct the B+ tree for the following set of key values : {2,3,5,7,11,17,19,23,29,31}. Assume that tree is initially empty and values are added in ascending order. Cons...
0 0 votes
0 0 answers
407
407 views
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 1000 records and...
0 0 votes
0 0 answers
496
496 views
Show that the two phase locking protocol ensures conflict serializability and that transaction can be serialized according to their lock points.
1 1 vote
1 1 answer
699
699 views
In multiple Granularity locking protocol at a particular node transaction T1 is holding SIX LOCK. When transaction T2 is also requesting a lock, at that node which other ...
0 0 votes
1 1 answer
670
670 views
A schedule S is having 3 transactions and each transaction is having two different data items and a blind 'Write A’ statement is in all the three transactions.With the ab...
0 0 votes
1 1 answer
1.8k
1.8k views
please solve in paper formet Explain the properties of B-Tree Also Construct B+ tree with order P=410,5,30,40,20,17,90,45,93,60,20,50,29
0 0 votes
1 1 answer
500
500 views
1 1 vote
1 answers 1 answer
559
559 views
1 1 vote
1 1 answer
1.7k
1.7k views
Consider a relation R(ABCDEFGH). How many superkey will be there in relation Rif candidate key for relation are {A, BC, CDE, EF}?
2 2 votes
1 1 answer
5.9k
5.9k views
0 0 votes
1 1 answer
393
393 views
3 3 votes
2 2 answers
381
381 views
Which of the following statements concerning database normalization is/are TRUE? (Mark all the appropriate choices)A sufficient condition for a relation to be in $1NF$ bu...
0 0 votes
2 2 answers
626
626 views
Construct an E-R model for the below assumption and find out the degree of the relationship :-A technician uses exactly one notebook for each project.Each notebook belong...
0 0 votes
1 1 answer
903
903 views
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 ...
1 1 vote
3 3 answers
2.6k
2.6k views
An ER diagram is having two strong entities E1 and E2. The relationship between the entities ‘R’ is having partial participation from E1 side and total participation from...
0 0 votes
1 1 answer
541
541 views
Which of the following are truea. A relational table can have atmost one foreign keyb. The main purpose of foreign key is to optimize the queries by query optimizer.
4 4 votes
2 2 answers
1.3k
1.3k views
The order of a leaf node in a $\text{B tree}$ is the maximum number of (value, data record pointer) pairs it can hold. Given that the block size is $1 \mathrm{~K}$ bytes,...