Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Webpage for Databases:
Recent questions tagged databases
52
votes
3
answers
2881
GATE CSE 2001 | Question: 1.25
Let r and s be two relations over the relation schemes R and S respectively, and let A be an attribute in R. The relational algebra expression $\sigma_{A=a}(r \bowtie s)$ is always equal to $\sigma_{A=a}(r)$ $r$ $\sigma_{A=a}(r) \bowtie s$ None of the above
Kathleen
asked
in
Databases
Sep 14, 2014
by
Kathleen
7.3k
views
gatecse-2001
databases
relational-algebra
54
votes
4
answers
2882
GATE CSE 2001 | Question: 1.24
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? List all vertices adjacent to a given ... self loops List all vertices which belong to cycles of less than three vertices List all vertices reachable from a given vertex
Kathleen
asked
in
Databases
Sep 14, 2014
by
Kathleen
7.8k
views
gatecse-2001
databases
relational-algebra
normal
28
votes
2
answers
2883
GATE2001-1.23, UGCNET-June2012-III: 18
Consider a schema $R(A,B,C,D)$ and functional dependencies $A \rightarrow B$ and $C \rightarrow D$. Then the decomposition of R into $R_1 (A,B)$ and $R_2(C,D)$ is dependency preserving and lossless join lossless join but not dependency preserving dependency preserving but not lossless join not dependency preserving and not lossless join
Kathleen
asked
in
Databases
Sep 14, 2014
by
Kathleen
8.2k
views
gate1998
databases
ugcnetcse-june2012-paper3
database-normalization
6
votes
1
answer
2884
GATE CSE 2000 | Question: 22
Consider a bank database with only one relation transaction (transno, acctno, date, amount) The amount attribute value is positive for deposits and negative for withdrawals. Define an SQL view TP containing the information (acctno,T1.date,T2.amount) for every ... since it was created. To simplify your query, break it up into 2 steps by defining an intermediate view V.
Kathleen
asked
in
Databases
Sep 14, 2014
by
Kathleen
2.5k
views
gatecse-2000
databases
sql
normal
descriptive
12
votes
2
answers
2885
GATE CSE 2000 | Question: 21
(a) Suppose you are given an empty $B^+$ tree where each node (leaf and internal) can store up to $5$ key values. Suppose values $1, 2,\ldots 10$ are inserted, in order, into the tree. Show the tree pictorially after $6$ insertions, and ... what approximately is the average number of keys in each leaf level node. in the normal case, and with the insertion as in (b).
Kathleen
asked
in
Databases
Sep 14, 2014
by
Kathleen
3.9k
views
gatecse-2000
databases
b-tree
normal
descriptive
63
votes
4
answers
2886
GATE CSE 2000 | Question: 2.26
In SQL, relations can contain null values, and comparisons with null values are treated as unknown. Suppose all comparisons with a null value are treated as false. Which of the following pairs is not equivalent? $x = 5 \quad not (not (x = 5))$ $x = 5 \quad x > 4$ and $x < 6,$ where $x$ is an integer $x ≠ 5 \quad not (x = 5)$ none of the above
Kathleen
asked
in
Databases
Sep 14, 2014
by
Kathleen
18.6k
views
gatecse-2000
databases
sql
normal
57
votes
4
answers
2887
GATE CSE 2000 | Question: 2.25
Given relations r(w, x) and s(y, z) the result of select distinct w, x from r, s is guaranteed to be same as r, provided. r has no duplicates and s is non-empty r and s have no duplicates s has no duplicates and r is non-empty r and s have the same number of tuples
Kathleen
asked
in
Databases
Sep 14, 2014
by
Kathleen
16.3k
views
gatecse-2000
databases
sql
30
votes
5
answers
2888
GATE CSE 2000 | Question: 2.24
Given the following relation instance. ... $YZ \rightarrow X$ and $Y \rightarrow Z$ $YZ \rightarrow X$ and $X \rightarrow Z$ $XZ \rightarrow Y$ and $Y \rightarrow X$
Kathleen
asked
in
Databases
Sep 14, 2014
by
Kathleen
14.5k
views
gatecse-2000
databases
database-normalization
easy
43
votes
3
answers
2889
GATE CSE 2000 | Question: 1.23, ISRO2016-57
Given the relations employee (name, salary, dept-no), and department (dept-no, dept-name,address), Which of the following queries cannot be expressed using the basic relational algebra operations ... whose name is the same as their department name The sum of all employees' salaries All employees of a given department
Kathleen
asked
in
Databases
Sep 14, 2014
by
Kathleen
14.8k
views
gatecse-2000
databases
relational-algebra
easy
isro2016
45
votes
4
answers
2890
GATE CSE 2000 | Question: 1.22, UGCNET-June2012-II: 11
B$^{+}$-trees are preferred to binary trees in databases because Disk capacities are greater than memory capacities Disk access is much slower than memory access Disk data transfer rates are much less than memory data transfer rates Disks are more reliable than memory
Kathleen
asked
in
Databases
Sep 14, 2014
by
Kathleen
15.5k
views
gatecse-2000
databases
b-tree
normal
ugcnetcse-june2012-paper2
6
votes
1
answer
2891
GATE CSE 1992 | Question: 13a
How is redundancy reduced in the following models? Hierarchical Network Relational
Kathleen
asked
in
Databases
Sep 13, 2014
by
Kathleen
993
views
gate1992
databases
descriptive
relational-model
22
votes
6
answers
2892
GATE CSE 1991 | Question: 12-a
Suppose a database consist of the following relations: SUPPLIER (SCODE,SNAME,CITY). PART (PCODE,PNAME,PDESC,CITY). PROJECTS (PRCODE,PRNAME,PRCITY). SPPR (SCODE,PCODE,PRCODE,QTY). Write SQL programs corresponding to the following queries: Print PCODE values for ... part to a project in the second city, but do not print the triples in which the two CITY values are same.
Kathleen
asked
in
Databases
Sep 12, 2014
by
Kathleen
3.3k
views
gate1991
databases
sql
normal
descriptive
60
votes
5
answers
2893
GATE CSE 2008 | Question: 69
Consider the following relational schemes for a library database: Book (Title, Author, Catalog_no, Publisher, Year, Price) Collection(Title, Author, Catalog_no) with the following functional dependencies: $\text{Title Author }\rightarrow\text{ Catalog_no}$ ... $\text{2NF}$ and Collection in $\text{3NF}$ Both Book and Collection are in $\text{2NF}$ only
Kathleen
asked
in
Databases
Sep 12, 2014
by
Kathleen
27.8k
views
gatecse-2008
databases
database-normalization
normal
66
votes
4
answers
2894
GATE CSE 2008 | Question: 68
Let R and S be two relations with the following schema $R(\underline{P,Q}, R1, R2, R3)$ $S(\underline{P,Q}, S1, S2)$ where $\left\{P, Q\right\}$ is the key for both schemas. Which of the following queries are equivalent? $\Pi_P \left(R \bowtie S\right)$ ... Only I and II Only I and III Only I, II and III Only I, III and IV
Kathleen
asked
in
Databases
Sep 12, 2014
by
Kathleen
17.9k
views
gatecse-2008
databases
relational-algebra
normal
50
votes
6
answers
2895
GATE CSE 2008 | Question: 41
A B-tree of order $4$ is built from scratch by $10$ successive insertions. What is the maximum number of node splitting operations that may take place? $3$ $4$ $5$ $6$
Kathleen
asked
in
Databases
Sep 12, 2014
by
Kathleen
21.5k
views
gatecse-2008
databases
b-tree
normal
33
votes
4
answers
2896
GATE CSE 2008 | Question: 16, ISRO2016-60
A clustering index is defined on the fields which are of type non-key and ordering non-key and non-ordering key and ordering key and non-ordering
Kathleen
asked
in
Databases
Sep 11, 2014
by
Kathleen
13.9k
views
gatecse-2008
easy
databases
indexing
isro2016
43
votes
5
answers
2897
GATE CSE 2008 | Question: 15
Which of the following tuple relational calculus expression(s) is/are equivalent to $\forall t \in r \left(P\left(t\right)\right)$? $\neg \exists t \in r \left(P\left(t\right)\right)$ $\exists t \notin r \left(P\left(t\right)\right)$ ... $\exists t \notin r \left(\neg P\left(t\right)\right)$ I only II only III only III and IV only
Kathleen
asked
in
Databases
Sep 11, 2014
by
Kathleen
14.0k
views
gatecse-2008
databases
relational-calculus
normal
64
votes
6
answers
2898
GATE CSE 2008 | Question: 82
Consider the following $\text{ER}$ diagram The minimum number of tables needed to represent $M$, $N$, $P$, $R1$, $R2$ is $2$ $3$ $4$ $5$
Kathleen
asked
in
Databases
Sep 11, 2014
by
Kathleen
26.3k
views
gatecse-2008
databases
er-diagram
normal
67
votes
5
answers
2899
GATE CSE 2008 | Question: 70
Consider a file of $16384$ records. Each record is $32\;\text{bytes}$ long and its key field is of size $6\;\text{bytes}$ ... -level blocks in the multi-level index are respectively $8$ and $0$ $128$ and $6$ $256$ and $4$ $512$ and $5$
ABG
asked
in
Databases
Sep 2, 2014
by
ABG
23.6k
views
gatecse-2008
databases
indexing
normal
1
vote
1
answer
2900
Can anyone please help with B+ tree multi level index structure creation?
spandan
asked
in
Databases
Aug 24, 2014
by
spandan
727
views
b-tree
databases
65
votes
6
answers
2901
GATE CSE 2012 | Question: 15
Which of the following statements are TRUE about an SQL query? P : An SQL query can contain a HAVING clause even if it does not have a GROUP BY clause Q : An SQL query can contain a HAVING clause only if it has a GROUP BY clause R : All attributes used ... Not all attributes used in the GROUP BY clause need to appear in the SELECT clause P and R P and S Q and R Q and S
gatecse
asked
in
Databases
Aug 5, 2014
by
gatecse
39.7k
views
gatecse-2012
databases
easy
sql
ambiguous
28
votes
5
answers
2902
GATE CSE 2012 | Question: 14
Given the basic ER and relational models, which of the following is INCORRECT? An attribute of an entity can have more than one value An attribute of an entity can be composite In a row of a relational table, an attribute can have more than one value In a row of a relational table, an attribute can have exactly one value or a NULL value
gatecse
asked
in
Databases
Aug 5, 2014
by
gatecse
16.3k
views
gatecse-2012
databases
normal
er-diagram
45
votes
5
answers
2903
GATE CSE 2012 | Question: 2
Which of the following is TRUE? Every relation in $\text{3NF}$ is also in $\text{BCNF}$ A relation $\text{R}$ is in $\text{3NF}$ if every non-prime attribute of $\text{R}$ is fully functionally dependent on every key of $R$ Every relation in $\text{BCNF}$ is also in $\text{3NF}$ No relation can be in both $\text{BCNF}$ and $\text{3NF}$
gatecse
asked
in
Databases
Aug 5, 2014
by
gatecse
19.6k
views
gatecse-2012
databases
easy
database-normalization
Page:
« prev
1
...
92
93
94
95
96
97
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
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
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent questions tagged databases
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...