menu
search
Log In
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

Subjects

Questions without answers in Databases

Network Sites

 GO Mechanical
 GO Electrical
 GO Electronics
 GO Civil
 CSE Doubts

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.

$$\small{\overset{{\large{\textbf{Mark Distribution in Previous GATE}}}}{\begin{array}{|c|c|c|c|c|c|c|c|}\hline
\textbf{Year}&\textbf{2019}&\textbf{2018}&\textbf{2017-1}&\textbf{2017-2}&\textbf{2016-1}&\textbf{2016-2}&\textbf{Minimum}&\textbf{Average}&\textbf{Maximum}
\\\hline\textbf{1 Mark Count}&2&2&2&2&3&2&2&2.2&3
\\\hline\textbf{2 Marks Count}&3&2&3&3&1&2&1&2.3&3
\\\hline\textbf{Total Marks}&8&6&8&8&5&6&\bf{6}&\bf{6.8}&\bf{8}\\\hline
\end{array}}}$$

Questions without answers in Databases

0 votes
0 answers
1
UGCNET-Dec2006-II: 18
Which statement is false regarding data independence ? Hierarchical data model suffers from data independence Network model suffers from data independence Relational model suffers only from logical data independence Relational model suffers only from physical data independence
Which statement is false regarding data independence ? Hierarchical data model suffers from data independence Network model suffers from data independence Relational model suffers only from logical data independence Relational model suffers only from physical data independence
asked Mar 27, 2020 in Databases jothee 73 views
1 vote
0 answers
2
KPGCET-CSE-2019-3
The process of normalization is used to Enhance the number of relations Determine the relationship between different relations Minimize the redundancies & eliminate anomalies Ease the computational work.
The process of normalization is used to Enhance the number of relations Determine the relationship between different relations Minimize the redundancies & eliminate anomalies Ease the computational work.
asked Aug 4, 2019 in Databases gatecse 63 views
0 votes
0 answers
3
KPGCET-CSE-2019-5
The difference between the structured query language and the programming relationship language is that Structured query language does not contain answer to how ? about computation Programming language does not contain the answer to how?about computation Only structured query language uses strict semiotics Only programming language uses strict semiotics.
The difference between the structured query language and the programming relationship language is that Structured query language does not contain answer to how ? about computation Programming language does not contain the answer to how?about computation Only structured query language uses strict semiotics Only programming language uses strict semiotics.
asked Aug 4, 2019 in Databases gatecse 43 views
0 votes
0 answers
4
KPGCET-CSE-2019-6
One of the differences between Object-Oriented Paradigm (OOP) and Database Management System (DBMS) is that In DBMS, null values &redundancies are completely eliminated In OOP, null values & redundancies are completely eliminated In OOP, only null values are minimized In DBMS, only null values are eliminated.
One of the differences between Object-Oriented Paradigm (OOP) and Database Management System (DBMS) is that In DBMS, null values &redundancies are completely eliminated In OOP, null values & redundancies are completely eliminated In OOP, only null values are minimized In DBMS, only null values are eliminated.
asked Aug 4, 2019 in Databases gatecse 48 views
0 votes
0 answers
5
KPGCET-CSE-2019-8
Couple of the good database design principles suggest that preservation and minimization of functional dependencies. These issues can be resolved by Eliminating transitive functional dependencies Eliminating all interrelationship between all attributes Minimizing candidate keys None of these
Couple of the good database design principles suggest that preservation and minimization of functional dependencies. These issues can be resolved by Eliminating transitive functional dependencies Eliminating all interrelationship between all attributes Minimizing candidate keys None of these
asked Aug 4, 2019 in Databases gatecse 62 views
0 votes
0 answers
6
KPGCET-CSE-2019-9
The normalization is a way to implement Good software engineering principles Good database design principles Structured Query Language Database Schema
The normalization is a way to implement Good software engineering principles Good database design principles Structured Query Language Database Schema
asked Aug 4, 2019 in Databases gatecse 38 views
0 votes
0 answers
7
KPGCET-CSE-2019-38
In DBMS, the only association would satiate the complete interrelationships set of business processes and in object oriented paradigm, the inter relationships are enhanced by additional aggregation & super-sub class hierarchy. This addition ... following from the object-oriented paradigm null values only redundancies only both null values & redundancies inconsistencies
In DBMS, the only association would satiate the complete interrelationships set of business processes and in object oriented paradigm, the inter relationships are enhanced by additional aggregation & super-sub class hierarchy. This addition is due to the elimination of the following from the object-oriented paradigm null values only redundancies only both null values & redundancies inconsistencies
asked Aug 4, 2019 in Databases gatecse 18 views
0 votes
0 answers
8
KPGCET-CSE-2019-39
Relational Algebra is integral part of DBMS because it contains operators analogous to query language queries. contains relational operators analogous to query language queries. is used as intermediate language in translating programming language ... query language queries is used as intermediate language in translating query language queries into programming language programs.
Relational Algebra is integral part of DBMS because it contains operators analogous to query language queries. contains relational operators analogous to query language queries. is used as intermediate language in translating programming language programs into query language queries is used as intermediate language in translating query language queries into programming language programs.
asked Aug 4, 2019 in Databases gatecse 33 views
0 votes
0 answers
9
KPGCET-CSE-2019-41
The ‘divide’ operator in the relational algebra is categorized as A mathematical operator A relational operator A mathematical cum relational operator Neither relational nor mathematical operator
The ‘divide’ operator in the relational algebra is categorized as A mathematical operator A relational operator A mathematical cum relational operator Neither relational nor mathematical operator
asked Aug 4, 2019 in Databases gatecse 16 views
0 votes
0 answers
10
KPGCET-CSE-2019-43
The distinction between B tree and B+ tree is that В tree contains data at all memory locations whereas B+ tree contains data at leaf level nodes B+ tree contains data at all levels and B tree contains data only at the leaf nodes. Both contain data at all levels Both contains data only at leaf nodes.
The distinction between B tree and B+ tree is that В tree contains data at all memory locations whereas B+ tree contains data at leaf level nodes B+ tree contains data at all levels and B tree contains data only at the leaf nodes. Both contain data at all levels Both contains data only at leaf nodes.
asked Aug 4, 2019 in Databases gatecse 36 views
0 votes
0 answers
11
KPGCET-CSE-2019-45
In the transaction management of schedule, the Conflict serializability implies View serializability View serializability implies Conflict serializability Conflict serializability does not implies View serializability None of these
In the transaction management of schedule, the Conflict serializability implies View serializability View serializability implies Conflict serializability Conflict serializability does not implies View serializability None of these
asked Aug 4, 2019 in Databases gatecse 23 views
0 votes
0 answers
12
Virtual Gate Test Series: Databases - Schedules
A' is set of all possible schedules 'C' is set of all possible schedules that are guaranteed to produce a correct final result 'S' is the set of all serializable schedules 'P' is the set of all schedules possible under 2-phase locking protocol Which is FALSE? $P\subseteq C$ $S\subset P$ $S\subseteq P$ $P\subset C$
A' is set of all possible schedules 'C' is set of all possible schedules that are guaranteed to produce a correct final result 'S' is the set of all serializable schedules 'P' is the set of all schedules possible under 2-phase locking protocol Which is FALSE? $P\subseteq C$ $S\subset P$ $S\subseteq P$ $P\subset C$
asked May 28, 2019 in Databases aditi19 347 views
0 votes
0 answers
13
#DBMS_ER Model
A university database contains information about professors (identified by SSN) and courses (identified by courseid). Professors teach courses; each of the following situations concerns the Teaches relationship set. For below situation, draw the ER diagram: ... in a team can teach the course. Model this situation introducing additional entity sets and relationship sets if necessary.
A university database contains information about professors (identified by SSN) and courses (identified by courseid). Professors teach courses; each of the following situations concerns the Teaches relationship set. For below situation, draw the ER diagram: Suppose ... in a team can teach the course. Model this situation introducing additional entity sets and relationship sets if necessary.
asked May 24, 2019 in Databases Sumiran Agrawal 314 views
1 vote
0 answers
14
Made Easy Test Series:Databases-Tables
Number of tables required in above ER diagram will be _____________ Is $R_{1}$ create separate table or not?? and $R_{2}$ look like if we remove loop from it?? Answer given for table $E_{1}R_{1}$ Key will be $AC$ , with ... Entities. So, it will add one extra table. I already read https://gateoverflow.in/229580/madeeasy-test-series-number-of-tables-required
Number of tables required in above ER diagram will be _____________ Is $R_{1}$ create separate table or not?? and $R_{2}$ look like if we remove loop from it?? Answer given for table $E_{1}R_{1}$ Key will be $AC$ , with $C$ foreign key. And for ... $2$ Entities. So, it will add one extra table. I already read https://gateoverflow.in/229580/madeeasy-test-series-number-of-tables-required
asked May 22, 2019 in Databases srestha 267 views
1 vote
0 answers
15
IIIT-H INTERVIEW
Why does OS and DBMS have their own synchronisation mechanisms, when OS can alone do it and it sits at the bottom of DB?
Why does OS and DBMS have their own synchronisation mechanisms, when OS can alone do it and it sits at the bottom of DB?
asked May 18, 2019 in Databases shraddha priya 462 views
0 votes
0 answers
16
Molina Exercise-6.3.1 Question no-f Page no-280 SQL
Product(maker, model, type) PC(model, speed, ram, hd, price) Laptop(model, speed, ram, hd, screen, price) Printer(model, color, type, price) Find the maker(s) of the PC(s) with the fastest processor among all those PC 's that have the ... p where p.speed IN( select max(p1.speed) from PC p1 where p1.ram IN( select MIN(p2.ram) from PC p2)))
Product(maker, model, type) PC(model, speed, ram, hd, price) Laptop(model, speed, ram, hd, screen, price) Printer(model, color, type, price) Find the maker(s) of the PC(s) with the fastest processor among all those PC 's that have the smallest amount of RAM pls check if my SQL ... p.model from PC p where p.speed IN( select max(p1.speed) from PC p1 where p1.ram IN( select MIN(p2.ram) from PC p2)))
asked May 8, 2019 in Databases aditi19 269 views
0 votes
0 answers
17
Natural Join Self Doubt
how to write the query for natural join on three relations in SQL using the NATURAL JOIN clause?
how to write the query for natural join on three relations in SQL using the NATURAL JOIN clause?
asked May 8, 2019 in Databases aditi19 178 views
1 vote
0 answers
18
Made Easy Databases
Consider the following schedules with data item x The number of serial schedules which are view equal to schedules but not conflict equal is ___________.
Consider the following schedules with data item x The number of serial schedules which are view equal to schedules but not conflict equal is ___________.
asked May 5, 2019 in Databases Hirak 277 views
0 votes
0 answers
19
Self Doubt on SQL AND operator
Here why does the 5th query select * from employees natural join works_on where PID = 'X' AND PID='Y'; is not working The queries are The output are
Here why does the 5th query select * from employees natural join works_on where PID = 'X' AND PID='Y'; is not working The queries are The output are
asked Apr 30, 2019 in Databases kd..... 246 views
0 votes
0 answers
20
ISI DBMS
Consider the relations r1(A, B, C), r2(C, D, E) and r3(E, F). Assume that the set of all attributes constitutes the primary keys of these relations, rather than the individual ones. Let V (C, r1) be 500, V (C, r2) be 1000, V (E, r2) be ... r2 has 1500 tuples, and r3 has 750 tuples, then give the ordering of the natural join r1 ▷◁ r2 ▷◁ r3 for its efficient computation. Justify your answer
Consider the relations r1(A, B, C), r2(C, D, E) and r3(E, F). Assume that the set of all attributes constitutes the primary keys of these relations, rather than the individual ones. Let V (C, r1) be 500, V (C, r2) be 1000, V (E, r2) be 50, ... , r2 has 1500 tuples, and r3 has 750 tuples, then give the ordering of the natural join r1 ▷◁ r2 ▷◁ r3 for its efficient computation. Justify your answer
asked Apr 18, 2019 in Databases Priyanka17 121 views
0 votes
0 answers
21
#DBMS#Transaction
asked Apr 17, 2019 in Databases Golam Murtuza 93 views
0 votes
0 answers
22
Doubt on a gate question
https://gateoverflow.in/968/gate2003-85 How in the above question the functional dependency (date of birth -> age) is a partial functional dependency. (As told in the selected answer for this question) Because according to navathe the definition of partial functional dependency ... X and the dependency still holds; that is, for some A belongs to X (X - {A}) -> Y.
https://gateoverflow.in/968/gate2003-85 How in the above question the functional dependency (date of birth -> age) is a partial functional dependency. (As told in the selected answer for this question) Because according to navathe the definition of partial functional dependency is A functional ... removed from X and the dependency still holds; that is, for some A belongs to X (X - {A}) -> Y.
asked Apr 13, 2019 in Databases Kushagra Chatterjee 96 views
0 votes
0 answers
23
#SELF DOUBT(WEAK ENTITY IN DBMS)
Can a weak entity depend on more than one strong entity?If yes then how does that exaclty work?
Can a weak entity depend on more than one strong entity?If yes then how does that exaclty work?
asked Apr 8, 2019 in Databases codingo1234 69 views
0 votes
0 answers
24
ISI2017-PCB-CS-3-b
Consider the following relations: $\text{STD_CHOICES } (\underline{\text{Student_ID}}, \underline{\text{Course_ID}}, \text{Semester})$ and $\text{COURSE_ASSIGN} (\underline{\text{Teacher_ID}}, \underline{\text{Course_ID}}, \underline{\text{Semester}})$. The ... the ID for all the students who have not been taught by the same teacher in more than one course across all semesters.
Consider the following relations: $\text{STD_CHOICES } (\underline{\text{Student_ID}}, \underline{\text{Course_ID}}, \text{Semester})$ and $\text{COURSE_ASSIGN} (\underline{\text{Teacher_ID}}, \underline{\text{Course_ID}}, \underline{\text{Semester}})$. The former ... output the ID for all the students who have not been taught by the same teacher in more than one course across all semesters.
asked Apr 8, 2019 in Databases akash.dinkar12 232 views
0 votes
0 answers
25
self doubt
In this Question , it is said that S is serializable .. so if S is conflict serializable then the precedence graph will be acyclic and we can use Topological sort to get a serial schedule, but what if the graph is not conflict serializable and is view serializable, ... use topological sort to get a serial schedule .. then how come the answer is (A). Topological sort .. Please Help!!
In this Question , it is said that S is serializable .. so if S is conflict serializable then the precedence graph will be acyclic and we can use Topological sort to get a serial schedule, but what if the graph is not conflict serializable and is view serializable, then ... cannot use topological sort to get a serial schedule .. then how come the answer is (A). Topological sort .. Please Help!!
asked Apr 5, 2019 in Databases _Bash_ 64 views
0 votes
0 answers
26
#self doubt
my doubt is- when question is said find minimum no.of table to given E-R diagram,and additional condition table are satisfying 1NF/2NF/3NF. how we conclude table is 1NF/2NF/3NF.
my doubt is- when question is said find minimum no.of table to given E-R diagram,and additional condition table are satisfying 1NF/2NF/3NF. how we conclude table is 1NF/2NF/3NF.
asked Apr 5, 2019 in Databases sandeep singh gaur 80 views
0 votes
0 answers
27
self doubt
What is the correct answer of this Question and what are the Minimized tables ???
What is the correct answer of this Question and what are the Minimized tables ???
asked Apr 4, 2019 in Databases _Bash_ 127 views
0 votes
0 answers
28
DBMS Korth Edition 4 Exercise 16 Question 31 (Page No. 636)
Give example schedules to show that if any of lookup, insert or delete do not lock the next key value, the phantom phenomenon could go undetected.
Give example schedules to show that if any of lookup, insert or delete do not lock the next key value, the phantom phenomenon could go undetected.
asked Apr 3, 2019 in Databases akash.dinkar12 148 views
0 votes
0 answers
29
DBMS Korth Edition 4 Exercise 16 Question 29 (Page No. 635)
Explain the reason for the use of degree-two consistency. What disadvantages dos this approach have ?
Explain the reason for the use of degree-two consistency. What disadvantages dos this approach have ?
asked Apr 3, 2019 in Databases akash.dinkar12 57 views
To see more, click for the full list of questions or popular tags.
Dark theme
Muffin by Hélio Chun
Thanks to Q2A
...