Recent questions tagged databases - GATE CSE Doubts

0 votes

0 answers

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?

asked May 2 in Databases by rishabh8797 (5 points) | 10 views

0 votes

1 answer

Exam operating system
When switching the CPU between two processes.. which of the following applies A. The PCB is both, saved and reloaded, only for the interrupted process that is existing the CPU B. The PCB is saved for the process that is scheduled for the CPU C. The PCB is reloaded for the process that is scheduled for the CPU D. No PCB is saved or reloaded E. None of the above

asked May 2 in Operating System by Malak (5 points) | 11 views

0 votes

0 answers

Made Easy Book on DBMS, Geeks for Geeks
So recently I have been studying minimization of ER diagrams and have come across a big confusion. So if 2 entities, E1 and E2 are related to each other with one to one cardinality and E1 has Total participation and E2 has Partial participation, ... is 1, but some sources also say that answer should be 2. Also for GATE exam which one should be considered ?

asked Apr 25 in Databases by Palash0007 (5 points) | 14 views

0 votes

0 answers

Gate pyq cse
Why in this question use B-->A ,A-->C ?

asked Apr 23 in Databases by Enolx.21 (49 points) | 18 views

0 votes

0 answers

B+ tree right replication policy
What is right replication policy in database? And how is it different from right biasing?

asked Apr 19 in Databases by dragonball (12 points) | 5 views

0 votes

1 answer

self doubt database management system
is it true that “every strict schedule is cascadeless schedule”?

asked Apr 17 in Databases by adas7099 (9 points) | 27 views

0 votes

0 answers

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.

asked Mar 14 in Databases by samir757 (17 points) | 33 views

0 votes

0 answers

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

asked Mar 9 in Databases by samir757 (17 points) | 12 views

0 votes

0 answers

Past exam paper MSU 2020 Advanced databases
Given the following relations and SQL query: Student (sid, name, age, address, date of birth, level) Book(bid, title, author) Checkout(sid, bid, date_borrowed, date_returned) SELECT S.sid, S.level, C.date_borrowed, C.date_returned FROM Student ... query using a Relation Connection Graph.[5 marks] d) Represent the query above using a query tree. [5 marks]

asked Mar 6 in Databases by Drackelyone (5 points) | 75 views

+1 vote

2 answers

Made easy workbook
Suppose we have two entity sets person, Email and use a relationship Owns. A person own atmost one email account but an email account can be owned by multiple persons. Which of the following is an ER diagram based on above description.

asked Mar 2 in Databases by IrfanRza (9 points) | 35 views

+1 vote

1 answer

Self Doubt regarding ER diagram
What is degree of Self Referential Relationship? Unary or Binary?

asked Feb 24 in Databases by adas7099 (9 points) | 23 views

+3 votes

3 answers

Made easy self dought
Q. R(A,B,C,D,E,F) with {A,BC,CD} candidate keys.How many super keys possible?

asked Feb 23 in Databases by Enolx.21 (49 points) | 58 views

0 votes

0 answers

How to convert this problem statement to ER model
Can Somebody know how to design ER Diagram from this ?

asked Feb 21 in Databases by ghostman23111 (5 points) | 13 views

+1 vote

0 answers

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

asked Feb 13 in Databases by Enolx.21 (49 points) | 22 views

0 votes

0 answers

Made easy test
In this question, it is asked to retrieve the name of each employee who has a dependent with the same first name and is the same sex as employee. How Q1 will give the correct result, coz inside IN() the condition Essn=D,Essn is not there. Can anybody explain.

asked Feb 6 in Databases by Ankita87077 (11 points) | 25 views

0 votes

0 answers

Made easy test series
Consider the following table: A B C a1 b1 c1 a1 b1 c2 a2 b1 c1 a2 b1 c3 Number of non-trivial functional dependencies exists in the above Table ___________.

asked Feb 4 in Databases by vikashrajpoot0100 (5 points) | 24 views

0 votes

0 answers

self doubt Databases : What do partial dependencies really mean ?

asked Feb 2 in Databases by ashutoshbsathe (5 points) | 16 views

0 votes

0 answers

Self Doubt , Databases
Is Read – Write conflict possible in a strict recoverable schedule? As strict 2PL guarantees strict recoverable. Is Read-Write conflict possible in a strict recoverable schedule ?

asked Jan 24 in Databases by anurags228 (23 points) | 10 views

0 votes

0 answers

#made-easy #databases
1) 2) 3) 4) ANS GIVEN IS 1 WHY 3 NOT POSSIBLE?

asked Jan 23 in Databases by 404 found (37 points) | 20 views

0 votes

0 answers

Cascade Rollback and Not recoverable at the same time

asked Jan 18 in Databases by reboot (5 points) | 10 views

+1 vote

0 answers

DATABASE GFG QUESTION
Consider the following relations A, B, C. How many tuples does the result of the following relational algebra expression contain? Assume that the schema of A U B is the same as that of A. Table A Id Name Age ---------------- 12 Arun 60 15 Shreya 24 99 Rohit 11 ... Rohit 11 Table C Id Phone Area ----------------- 10 2200 02 99 2100 01 How many tuples will be returned by ?

asked Jan 17 in Databases by donniedarko (39 points) | 28 views

0 votes

0 answers

ACE Chapter 3 Normalization
Consider a relation R(ABCDE) with the following functional dependencies sets. Which of the following below alternative can be decomposed into BCNF without violating dependency preserving? { ABC → DE, DE→ C} { AB→ C , ABD → E , E->D } {ABC->DE , D→ B , E→ C } {ABC → DE , D → EA , A → D}

asked Jan 17 in Databases by Surya_Dev Chaturvedi (5 points) | 26 views

0 votes

0 answers

GATE 2001 DBMS
Suppose the adjacency relation of vertices in a graph is represented in a table Adj(X,Y). Which of the following queries cannot be expressed by a relational algebra expression of constant length? A List of all vertices adjacent to a given vertex B ... of less than three vertices D List all vertices reachable from a given vertex *Please elaborate all the solutions of this question.

asked Jan 15 in Databases by donniedarko (39 points) | 19 views

0 votes

0 answers

Made Easy Test Series, DBMS, Normalization
Can anyone please explain how B) and D) are true? 2NF requires us to have no partial dependency on key for some non-key attributes. 3NF requires us to have no transitive dependency OR X->Y non trivial dependencies where either X is SK or Y are all prime attributes. Can anyone please explain how this leads to options B and D being true? Thanks.

asked Jan 15 in Databases by sankalpmittal (41 points) | 11 views

0 votes

1 answer

Made Easy Test Series, DBMS, Functional Dependencies

asked Jan 15 in Databases by sankalpmittal (41 points) | 41 views

0 votes

0 answers

Elmsari Fundamentals , Normalisation
Consider the universal relation A = {P,Q,R,S,T,U,V,W,X,Y,Z} and the set of functional dependencies FD's = { PQ -> R, R -> ST, Q -> U, U -> VW, S-> XY }. What is the key for A. Decompose A into 2NF and 3 NF relations

asked Jan 11 in Databases by Lucifer2440 (5 points) | 12 views

0 votes

1 answer

FULL OUTER JOIN
Can anyone please explain how minimum number of tuples in case of Full Outer Join is max(m,n) using a proper example?

asked Jan 8 in Databases by anshumansinha18 (5 points) | 14 views

0 votes

0 answers

The database system then writes out enough information to disk

asked Jan 7 in Databases by Tara22 (13 points) | 15 views

0 votes

0 answers

Gate applied course
If an E-R model says E having at least one multi-valued attribute is converted into relational model say R then what will be the number of simple candidate key possible in R if E has only single attribute as candidate key? A) 0 B) exactly 1 c) more than 1 d) can’t say

asked Jan 6 in Databases by Gopichandankem (5 points) | 29 views

0 votes

0 answers

why we cannot undo a committed transaction
We have the log file that has all information to undo this committed transaction, so why it says we cannot? once a transaction has committed we cannot undo its effect by aborting it.

asked Jan 6 in Databases by Tara22 (13 points) | 21 views

+1 vote

1 answer

NPTEL Assignment Question
S1 : r1(x),r2(x),w2(x),r3(x),w1(x), w2(y),r3(y),w3(x) S2 : r2(x),r1(x),w1(x),w2(x),w2(y),r3(x),w3(x),r3(y) The answer Says Both of them are view equivalent. My Doubt is that there Initial Read Don't ... first and In S2 T2 is reding it first. Same doubt as in this question https://csedoubts.gateoverflow.in/6351/nptel-view-serialisability but it is unclear even in this.

asked Jan 4 in Databases by Sahil91 (683 points) | 37 views

0 votes

1 answer

Applied test Series DBMS
Consider the following relation R with attributes as A, B, C, D, and E with functional dependencies (FDs) as marked below: For example, the arrow coming from attribute B is towards the attribute C, therefore, the FD will be B -> C. Which of the ... -prime attributes. Therefore, the relation R is neither in 2NF nor in 3NF. Hence, the correct options are (iii), and (iv).

asked Jan 4 in Databases by Nitinkumar.097 (13 points) | 42 views

0 votes

1 answer

THE GATE ACADEMY ts
Does B+ tree support random access?

asked Jan 3 in Databases by Abhineet Singh (23 points) | 37 views

0 votes

0 answers

Self doubt - 2 Phase Locking
Does 2 Phase Locking Protocol ensures a Schedule as recoverable?

asked Dec 30, 2020 in Databases by mani312 (5 points) | 12 views

0 votes

1 answer

Made Easy Test series Database Q1
Assume S is a schedule that has both read and write operations with different transactions and different data variables. Also assume all the operations are atomic in nature. Which of the following are true? S with no dirty read then S is ... . S with no dirty read then S is conflict serializable schedule S with no dirty read then S is strict serializable.

asked Dec 29, 2020 in Databases by Shivateja MST (45 points) | 43 views

0 votes

0 answers

restore/recover
What's the difference between recover' and restore'? can we use recover' instead of restore' here? If the transaction does not complete its execution, the database system restores the old values from the log to make it appear as though the ... specifically, it is handled by a component of the database called the recovery system, which we describe in detail in Chapter 19.

asked Dec 28, 2020 in Databases by Tara22 (13 points) | 22 views

0 votes

0 answers

GATE 2017 SET 1 Question 42
What is “Timestamp wrap around” in Timestamp Ordering Concurrency Control?

asked Dec 28, 2020 in Databases by Praddyumn (5 points) | 15 views

0 votes

0 answers

consistence constraints
The text below is from Silberschatz book. Can you please explain how consistence constraints can be verified by integrity constraints? Ensuring consistency for an individual transaction is the responsibility of the application programmer who codes the transaction. This task may be facilitated by automatic testing of integrity constraints, as we discussed in Section 4.4.

asked Dec 26, 2020 in Databases by Tara22 (13 points) | 8 views

0 votes

0 answers

with embedded database accesses in JDBC or ODBC
Is with embedded database accesses in JDBC or ODBC' for the underlined part only or for strikethrough part too? A transaction is a unit of program execution that accesses and possibly updates various data items. ... consists of all operations executed between the begin transaction and end transaction. Introduction to Database Systems, Silberschatz

asked Dec 25, 2020 in Databases by Tara22 (13 points) | 10 views

0 votes

1 answer

Made Easy Test Series | Maximum Number of CKs possible simultaneously.

asked Dec 25, 2020 in Databases by Animesh Sinha (25 points) | 155 views

Page:

1
2
3
4
...
14
next »

9,270 questions

3,204 answers

14,751 comments

96,304 users