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 an upvoted answer in Databases

95
views
0 answers
0 votes
Self Doubt relate to ER diagrams(Databases).
 In (https://gateoverflow.in/219555/number-of-tables) number of tables to be made was 4, merging E1 and E2 in one table, one for R3, and for E3 and ... , I am confused regarding when to merge tables and when to not, someone please help me 
User Avatar
139
views
1 answers
0 votes
can you provide just any free resources for DBMS subject
User Avatar
168
views
0 answers
0 votes
(Transactions and Schedules in Databases)
Q.3(a): You are given the following schedules involving three transactions (T1, T2, T3) performing operations on database items (A, B, C, D): ... lock and unlock instructions to ensure they adhere to the two-phase locking protocol.
User Avatar
145
views
1 answers
0 votes
Indexing
consider a disk with block size 1024 bytes.A block pointer 6 bytes and record pointer 8 bytes.File has 10000 records.Every record is fixed length of 100 bytes ... is not ordered by the field SSN and want to construct secondary index on SSN.
User Avatar
78
views
0 answers
0 votes
Dbms indexing
User Avatar
137
views
1 answers
0 votes
Topic = fd's and normalization.
Q) In R(A,B,C,D)FD's {AB->CD, C->D}Is it in 3NF?Ans) Vaise to shortcut (in x->y fd either x should be super key or y should ... dependent hoti ab pe, par yaha directly bhi dependent hai transitively bhiTo isliye samjh nhi aa rhaPlease help
User Avatar
125
views
0 answers
0 votes
View serializable
S2: R1(x);r2(z);r3(x);r1(z);r2(y);r3(y);w1(x);w2(z);w3(y);w2(y)Please help
User Avatar
150
views
0 answers
0 votes
B- tree in DBMS
User Avatar
90
views
1 answers
0 votes
B tree dbms
User Avatar
146
views
0 answers
1 votes
Relational Database
Give an appropriate tree-structure diagram for the following relational database:Employee (person_name, street, city)Works (person_name, company_name, salary)Company (company_name, city)Manages (person_name, manager_name)
User Avatar
132
views
0 answers
0 votes
RBR Normalisation example problem
In on of the examples shown by RBR sir, under Normalization I think he did this problem incorrectly, Given relation R(ABC) and fd: AB->C and C->A, convert ... the tables into AC and ABC is what my solution. Kindly correct me if I am wrong
User Avatar
171
views
1 answers
0 votes
Relation R(A1, A2, A3 ..... An) n attributes. On this relation m simple candidate key (m ≤ n). How many super keys possible in this relation? A. 2m – 1 B. (2n – 1) ⋅ 2n-m C. 2n – 1 D. (2m – 1) 2n-m
User Avatar
115
views
0 answers
0 votes
Can a candidate key for a composite attribute be called a composite key?
Let's take an example of student entity typeNameClassSectionAddress (Line1, Line2, City, State, Country, PinCode)Since composite attribute holds multiple atomic ... combinations like{Class, Section}{Class, Address}{Name, Class, Section}
User Avatar
270
views
2 answers
0 votes
BCNF
Explain why BCNF is said to be improved 3NF.
User Avatar
155
views
0 answers
0 votes
File organisation and indexing (DBMS)
User Avatar
144
views
0 answers
0 votes
#dbms
User Avatar
223
views
0 answers
0 votes
NPTEL DBMS (Introduction to Database systems)course Assignment 10: Topic Database Indexing
Use the following information to answer Questions 7 and 8.A sorted file has the following details: Number of records = 13,10,720; record length = 200 ... in the first level index file is:a)131072b)1311c)1310d)1286Accepted Answers:1286
User Avatar
1.1k
views
1 answers
0 votes
GATE DS&AI 2024 | Question: 16
Consider a database that includes the following relations:Defender(name, rating, side, goals)Forward(name, rating, assists, goals)Team(name, club, price)Which ONE of the ... $)=\phi$
User Avatar
1.1k
views
2 answers
0 votes
GATE DS&AI 2024 | Question: 21
Consider the following two tables named Raider and Team in a relational database maintained by a Kabaddi league. The attribute ID in table Team references the primary key of the Raider ... rows returned by this query is $\_\_\_\_\_\_\_\_$.
User Avatar
1.0k
views
1 answers
0 votes
GATE DS&AI 2024 | Question: 45
An OTT company is maintaining a large disk-based relational database of different movies with the following schema:\[\begin{array}{l}\text { Movie (ID ... tree on the remaining attributes.Hash index on all the attributes.
User Avatar
2.9k
views
2 answers
4 votes
GATE CSE 2024 | Set 2 | Question: 16
​​​​​Which of the following file organizations is/are $\text{I/O}$ efficient for the scan operation in $\text{DBMS}$?SortedHeapUnclustered tree indexUnclustered hash index
User Avatar
405
views
0 answers
4 votes
GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 40
Consider the following schema (primary keys are underlined):Which of the following queries returns the department numbers of those departments for which there are no courses being offered?
User Avatar
259
views
0 answers
0 votes
Memory Based GATE DA 2024 | Question: 17
Consider the following SQL query:\[\begin{aligned}&\text{SELECT * FROM Raider, Team} \\&\text{WHERE Raider.id = Team.id} \\&\text{AND City = ' ... rows returned by the SQL query, given the conditions specified for the City and Raid points.
User Avatar
202
views
0 answers
0 votes
Memory Based GATE DA 2024 | Question: 47
You are given three tables: `team`, `table1`, and `table2`. To find the names of all players in the team who are either present in `table1` or `table2`, consider the ... \text{{table2}}) \,/\, \Pi_{\text{{PlayerName}}}(\text{{team}})\)
User Avatar
187
views
0 answers
0 votes
Memory Based GATE DA 2024 | Question: 58
DBMS question: One SQL query is given. Based on the query which data structure can be used involving hashing, B+ tree, etc?
User Avatar
345
views
2 answers
1 votes
Consider a schema R(A, B, C, D, E, F) and functional dependencies A → B, C → D, and E → F. The number of superkeys of this schema is ____
User Avatar
817
views
0 answers
3 votes
GO Classes Test Series 2024 | Mock GATE | Test 12 | Question: 24
Assume that a data file has an index consisting of $\text{N}$ items, where $\text{N}$ is large. If a binary search of the index is used to find an item, then, of the ... $\text{N} \log _2 \text{N}$
User Avatar
To see more, click for the full list of questions or popular tags.