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}}}$$

Recent questions in Databases

0 votes

0 answers

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

S2: R1(x);r2(z);r3(x);r1(z);r2(y);r3(y);w1(x);w2(z);w3(y);w2(y)Please help

Cjsmwlq

41 views

Cjsmwlq asked 4 days ago

0 votes

0 answers

B- tree in DBMS

SandeepKumar147

68 views

SandeepKumar147 asked Apr 25

0 votes

0 answers

B tree dbms

SandeepKumar147

28 views

SandeepKumar147 asked Apr 25

0 votes

1 answer

Number of Super Keys
R(A1, A2,A3,A4....AN). How many super keys possible in relation? If (A1 is candidate key, A2 is candidate key, A3 is candidate key)

R(A1, A2,A3,A4....AN). How many super keys possible in relation? If (A1 is candidate key, A2 is candidate key, A3 is candidate key)

ssm

112 views

ssm asked Apr 18

0 votes

0 answers

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)

Give an appropriate tree-structure diagram for the following relational database:Employee (person_name, street, city)Works (person_name, company_name, salary)Company (com...

peter09

81 views

peter09 asked Apr 16

0 votes

0 answers

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 it into 2NF For this question, the answer according to RBR sir was that the ... "BC", therefore we need to split the tables into AC and ABC is what my solution. Kindly correct me if I am wrong

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 it into 2NFFor ...

nareshit

58 views

nareshit asked Apr 15

0 votes

1 answer

Minimal Cover
Consider R(A,B,C,D,E,H) be a relational schema with the following functional dependencies: A->BC, CD->E, E->C, D->AEH, ABH->BD, DH->BC Find minimal cover ?

Consider R(A,B,C,D,E,H) be a relational schema with the following functional dependencies:A->BC, CD->E, E->C, D->AEH, ABH->BD, DH->BCFind minimal cover ?

Yogesh_Jangde

180 views

Yogesh_Jangde asked Apr 13

0 votes

0 answers

If P and Q are predicates and P is the relational algebra expression, then which of the following equivalence are valid ? (1) σP(σQ(e)) = σQ(σP(e)). (2) σP(σQ(e)) = σP ∪ Q(e) (3) σP(σP(e)) = σP V Q (4) All of these

SandeepKumar147

79 views

SandeepKumar147 asked Apr 8

0 votes

1 answer

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

SandeepKumar147

116 views

SandeepKumar147 asked Apr 5

0 votes

0 answers

Can a candidate key for a composite attribute be called a composite key?
Let's take an example of student entity type Name Class Section Address (Line1, Line2, City, State, Country, PinCode) Since composite attribute holds multiple atomic attributes, such that the group is treated as ... (ignoring the semantics) the combinations like {Class, Section} {Class, Address} {Name, Class, Section}

Let's take an example of student entity typeNameClassSectionAddress (Line1, Line2, City, State, Country, PinCode)Since composite attribute holds multiple atomic attribute...

tbhaxor

78 views

tbhaxor asked Apr 4

0 votes

1 answer

S: r3(x) r3(y) w3(x) W2(x) r1(x) w2(y) w3(y) w1(y) How many serial schedules are not view equal to schedule S?

saisri

178 views

saisri asked Mar 24

0 votes

1 answer

Explain why BCNF is said to be improved 3NF.

PRIYANKA pp PIU

126 views

PRIYANKA pp PIU asked Mar 16

0 votes

0 answers

File organisation and indexing (DBMS)

Suryadip

116 views

Suryadip asked Mar 9

0 votes

0 answers

#TOC

Çșȇ ʛấẗẻ

62 views

Çșȇ ʛấẗẻ asked Feb 24

0 votes

0 answers

#dbms

Çșȇ ʛấẗẻ

100 views

Çșȇ ʛấẗẻ asked Feb 24

0 votes

0 answers

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 bytes; size of the primary key field = 13 bytes; size of ... of blocks in the first level index file is: a)131072 b)1311 c)1310 d)1286 Accepted Answers: 1286

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 bytes;size of the pr...

RishabhSahu325

163 views

RishabhSahu325 asked Feb 22

0 votes

2 answers

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 table, ID. Raider ID Name Raids RaidPoints $1$ Arjun $200$ $250$ $2$ ... Jaipur" AND RaidPoints > 200; The number of rows returned by this query is $\_\_\_\_\_\_\_\_$.

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...

Arjun

942 views

Arjun asked Feb 16

0 votes

1 answer

GATE DS&AI 2024 | Question: 36
Given the relational schema $R=(U, V, W, X, Y, Z)$ and the set of functional dependencies: \[ \{U \rightarrow V, U \rightarrow W, W X \rightarrow Y, W X \rightarrow Z, V \rightarrow X\} \] Which of the following functional dependencies can be derived from the above set? $V W \rightarrow Y Z$ $W X \rightarrow Y Z$ $V W \rightarrow U$ $V W \rightarrow Y$

Given the relational schema $R=(U, V, W, X, Y, Z)$ and the set of functional dependencies:\[\{U \rightarrow V, U \rightarrow W, W X \rightarrow Y, W X \...

Arjun

923 views

Arjun asked Feb 16

1 votes

2 answers

GATE CSE 2024 | Set 2 | Question: 9
Once the $\text{DBMS}$ informs the user that a transaction has been successfully completed, its effect should persist even if the system crashes before all its changes are reflected on disk. This property is called durability atomicity consistency isolation

Once the $\text{DBMS}$ informs the user that a transaction has been successfully completed, its effect should persist even if the system crashes before all...

Arjun

2.3k views

Arjun asked Feb 16

1 votes

1 answer

GATE CSE 2024 | Set 2 | Question: 10
In the context of owner and weak entity sets in the $\text{ER}$ (Entity-Relationship) data model, which one of the following statements is TRUE? The weak entity set MUST have total participation in the identifying ... in the identifying relationship Neither weak entity set nor owner entity set MUST have total participation in the identifying relationship

In the context of owner and weak entity sets in the $\text{ER}$ (Entity-Relationship) data model, which one of the following statements is TRUE?The weak entity set MUST h...

Arjun

2.0k views

Arjun asked Feb 16

Page:

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true