Recent questions and answers in Databases
Register

Recent questions and answers in Databases

Recent questions and answers in Databases
0 votes
0 answers 45 views
DBMS,serializability
Is it possible to have a conflict serial schedule with Blind write?
stupid_hacker asked in Databases Aug 19, 2021
by stupid_hacker
5 points
45 views
0 votes
0 answers 49 views
self study
if a relation is given and no fds are given then it is in which form?
deep_bansal_04 asked in Databases Aug 8, 2021
by deep_bansal_04
5 points
49 views
0 votes
0 answers 50 views
#Gateapplied
Consider the following schedule S: S: R1(X); R2(Z); R1(Z); R3(X); R3(Y); W1(X); W3(Y); R2(Y); W2(Z); W2(Y); Here Ri(D) denotes that transaction i is reading the data item D while Wi(D) denotes that transaction i is writing ... of the transaction can be added in the end of schedule S in an appropriate order such that S is recoverable. The number of such orders possible are ______
eleven11 asked in Databases Jul 13, 2021
by eleven11
5 points
50 views
0 votes
0 answers 36 views
Please explain the step by step polygraph solution to check for view serializability for this schedule:
CheSin asked in Databases Jul 7, 2021
by CheSin
5 points
36 views
0 votes
0 answers 45 views
from gradeup quiz.
Consider the relation R(ABCDEF) with dependecies F: {A->C, C->D, B->E, E->F} The number of tables present in its 2NF decomposition are _______.
swami_9 asked in Databases Jul 7, 2021
by swami_9
5 points
45 views
0 votes
0 answers 91 views
(Made easy test series) Topic name is total specialization in ER diagram in DBMS
Jaykumar12 asked in Databases Jun 29, 2021
by Jaykumar12
5 points
91 views
0 votes
0 answers 20 views
#self-doubt dbms confused between navathe or korth or raghuramakrishnan
ykrishnay asked in Databases Jun 27, 2021
by ykrishnay
103 points
20 views
0 votes
0 answers 108 views
Made Easy DBMS Practice Set - Normalisation - Question 53
10nikhilsharma01 asked in Databases Jun 14, 2021
by 10nikhilsharma01
9 points
108 views
0 votes
0 answers 81 views
Made Easy DBMS practice set - Normalization - Question 45
10nikhilsharma01 asked in Databases Jun 14, 2021
by 10nikhilsharma01
9 points
81 views
0 votes
0 answers 43 views
my sir give this assignment
Consider the following relations concerning a driving school. The primary key of each relation is in boldface. STUDENT(S_Name,Class_No,Th_Mark,Dr_Mark) S_Name - student name, Th-Mark - Theory mark, Dr_Mark - driving mark STUDENT_DRIVING_TEACHER(S_Name,Dr_T_Name) ... marks than average theory mark of class 8. f)Find the list of teachers who can drive all the vehicles.
nasima0058 asked in Databases May 29, 2021
by nasima0058
5 points
43 views
0 votes
0 answers 33 views
Selfdoubt(Relational Algebra and SQL)
Is the JOIN operations(natural , left , right) in relational algebra and SQL same or is there any difference based on the condition? Please provide reference.
samir757 asked in Databases May 27, 2021
by samir757
29 points
33 views
0 votes
0 answers 44 views
Self-doubt(DBMS)
How to find the number of relations required for a self-referential relationship with all the cardinalities mapped with total and partial participation? Please provide links to the same.
samir757 asked in Databases May 27, 2021
by samir757
29 points
44 views
0 votes
0 answers 59 views
gate 2001 DBMS(normalization)
R(A,B,C,D) is a relation. FD given is:{ AB->C , C->AD } is it in 2NF? is it in 3NF?
rishabh8797 asked in Databases May 2, 2021
by rishabh8797
5 points
59 views
0 votes
0 answers 76 views
Gate pyq cse
Why in this question use B-->A ,A-->C ?
Enolx.21 asked in Databases Apr 23, 2021
by Enolx.21
53 points
76 views
0 votes
0 answers 90 views
Applied Gate CSE DBMS Subject Test
Relation R (A,B,C,D) with FD'S { A->B, B->C, C->D, D->A } then relation R is decomposed into two relations R1 and R2 such that it is satisfying second normal form, third normal form and BCNF and decomposition is lossy. Then how the attributes are distributed in these two decomposed relations R1 and R2? Note: U is the set of all attributes. 1. 2. 3. 4.
samir757 asked in Databases Mar 14, 2021
by samir757
29 points
90 views
0 votes
0 answers 62 views
Applied Course GATE CS - DBMS Practice test 3
Given 3 T1, T2 and T3 transactions which have (2,2), (3,2), (4,2) read and write operations respectively the no of schedules possible using these three transactions are A. 1260 B. 630630 C. 6 D. 63000
samir757 asked in Databases Mar 9, 2021
by samir757
29 points
62 views
0 votes
0 answers 47 views
Gate Applied test series
Love Barot asked in Databases Mar 3, 2021
by Love Barot
7 points
47 views
0 votes
0 answers 30 views
Data base management system
Hello sir/mam, Today I've been told by our sir that we can write into ROM. Is that specified for mobile ROM or Computer ones or none of them please do clarify my doubt!
Sai Manognya asked in Databases Feb 27, 2021
by Sai Manognya
5 points
30 views
0 votes
0 answers 58 views
How to convert this problem statement to ER model
Can Somebody know how to design ER Diagram from this ?
ghostman23111 asked in Databases Feb 21, 2021
by ghostman23111
5 points
58 views
0 votes
0 answers 963 views
GATE CSE 2021 Set 2 | Question: 6 | Video Solution
Arjun asked in Databases Feb 18, 2021
by Arjun
1.4k points
963 views
0 votes
0 answers 565 views
GATE CSE 2021 Set 2 | Question: 31 | Video Solution
Arjun asked in Databases Feb 18, 2021
by Arjun
1.4k points
565 views
0 votes
0 answers 1.0k views
GATE CSE 2021 Set 1 | Question: 13 | Video Solution
Arjun asked in Databases Feb 18, 2021
by Arjun
1.4k points
1.0k views
1 vote
0 answers 1.7k views
GATE CSE 2021 Set 1 | Question: 23 | Video Solution
Arjun asked in Databases Feb 18, 2021
by Arjun
1.4k points
1.7k views
0 votes
0 answers 522 views
GATE CSE 2021 Set 1 | Question: 27 | Video Solution
Arjun asked in Databases Feb 18, 2021
by Arjun
1.4k points
522 views
0 votes
0 answers 488 views
GATE CSE 2021 Set 1 | Question: 32 | Video Solution
Arjun asked in Databases Feb 18, 2021
by Arjun
1.4k points
488 views
0 votes
0 answers 941 views
GATE CSE 2021 Set 1 | Question: 33 | Video Solution
Arjun asked in Databases Feb 18, 2021
by Arjun
1.4k points
941 views
1 vote
0 answers 48 views
Gate 2020 question
Consider a database implemented using B+ tree for file indexing and installed on a disk drive with block size of 4 KB. The size of search key is 12 bytes and the size of tree/disk pointer is 8 bytes. Assume that the database has one million ... each record fits into one disk block. The minimum number of disk accesses required to retrieve any record in the database is ______.
Enolx.21 asked in Databases Feb 13, 2021
by Enolx.21
53 points
48 views
To see more, click for all the questions in this category.
Ask a Question
Quick search syntax
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
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Top Users 2022 Jun 20 - 26
    Weekly Top User (excluding moderators) will get free access to GATE Overflow Test Series for GATE 2021
    Recent questions and answers in Databases
    Developed by Chun