Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
dj_1
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by dj_1
3
answers
1
GATE CSE 1993 | Question: 14
An $\text{ISAM}$ (indexed sequential) file consists of records of size $64$ bytes each, including key field of size $14$ bytes. An address of a disk block takes $2$ bytes. If the disk block size is $512$ bytes and there are $16K$ records, compute the size of the data and index areas in terms of number blocks. How many levels of $\text{tree}$ do you have for the index?
An $\text{ISAM}$ (indexed sequential) file consists of records of size $64$ bytes each, including key field of size $14$ bytes. An address of a disk block takes $2$ bytes...
6.7k
views
answer edited
Feb 16, 2018
Databases
gate1993
databases
indexing
normal
descriptive
+
–
3
answers
2
GATE CSE 2013 | Question: 54
Relation $R$ has eight attributes $\text{ABCDEFGH}$. Fields of $R$ contain only atomic values. $F$= $\text{{CH→G, A→BC, B→CFH, E→A, F→EG}}$ is a set of functional dependencies $(FDs)$ so that $F^+$ is exactly the set of $FDs$ that hold for $R$. How many candidate keys does the relation $R$ have? $3$ $4$ $5$ $6$
Relation $R$ has eight attributes $\text{ABCDEFGH}$. Fields of $R$ contain only atomic values. $F$=$\text{{CH→G, A→BC, B→CFH, E→A, F→EG}}$ is a set of functiona...
14.2k
views
edited
Feb 16, 2018
Databases
gatecse-2013
databases
database-normalization
normal
+
–
7
answers
3
GATE CSE 2002 | Question: 1.19
Relation $R$ with an associated set of functional dependencies, $F$, is decomposed into $\text{BCNF}$. The redundancy (arising out of functional dependencies) in the resulting set of relations is Zero More than zero but less than that of an equivalent $3NF$ decomposition Proportional to the size of F+ Indeterminate
Relation $R$ with an associated set of functional dependencies, $F$, is decomposed into $\text{BCNF}$. The redundancy (arising out of functional dependencies) in the resu...
20.0k
views
edited
Feb 16, 2018
Databases
gatecse-2002
databases
database-normalization
normal
+
–
2
answers
4
GATE CSE 2008 | Question: 83
Consider the following $\text{ER}$ diagram The minimum number of tables needed to represent $M$, $N$, $P$, $R1$, $R2$ is Which of the following is a correct attribute set for one of the tables for the minimum number of tables needed to represent $M$, $N$, $P$, $R1$, $R2$? ${M1, M2, M3, P1}$ ${M1, P1, N1, N2}$ ${M1, P1, N1}$ ${M1, P1}$
Consider the following $\text{ER}$ diagramThe minimum number of tables needed to represent $M$, $N$, $P$, $R1$, $R2$ is Which of the following is a correct attribute set ...
10.6k
views
answer edited
Feb 16, 2018
Databases
gatecse-2008
databases
er-diagram
normal
+
–
6
answers
5
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$
Consider the following $\text{ER}$ diagramThe minimum number of tables needed to represent $M$, $N$, $P$, $R1$, $R2$ is$2$$3$$4$$5$
26.2k
views
answer edited
Feb 9, 2018
Databases
gatecse-2008
databases
er-diagram
normal
+
–
8
answers
6
GATE CSE 2015 Set 1 | Question: 41
Consider an Entity-Relationship $(\text{ER})$ model in which entity sets $E_{1}$ and $E_{2}$ are connected by an $m:n$ relationship $R_{12}$. $E_{1}$ and $E_{3}$ are connected by a $1 : n$ ($1$ ... from the above $\text{ER}$ model, then the minimum number of relations that would be generated if all relation are in $\text{3NF}$ is________________.
Consider an Entity-Relationship $(\text{ER})$ model in which entity sets $E_{1}$ and $E_{2}$ are connected by an $m:n$ relationship $R_{12}$. $E_{1}$ and $E_{3}$ are conn...
18.6k
views
answer edited
Feb 9, 2018
Databases
gatecse-2015-set1
databases
er-diagram
normal
numerical-answers
+
–
4
answers
7
GATE CSE 2005 | Question: 75
Let $E_1$ and $E_2$ be two entities in an $E/R$ diagram with simple-valued attributes. $R_1$ and $R_2$ are two relationships between $E_1$ and $E_2$, where $R_1$ is one-to-many and $R_2$ is many-to-many. $R_1$ and $R_2$ do not have ... of their own. What is the minimum number of tables required to represent this situation in the relational model? $2$ $3$ $4$ $5$
Let $E_1$ and $E_2$ be two entities in an $E/R$ diagram with simple-valued attributes. $R_1$ and $R_2$ are two relationships between $E_1$ and $E_2$, where $R_1$ is one-t...
18.2k
views
edited
Feb 9, 2018
Databases
gatecse-2005
databases
er-diagram
normal
+
–
11
answers
8
GATE CSE 1999 | Question: 2.7, UGCNET-June2014-III: 25
Consider the schema $R=(S,T, U, V)$ and the dependencies $S \rightarrow T, T \rightarrow U, U \rightarrow V$ and $V \rightarrow S$. Let $R = (R1\text{ and } R2)$ be a decomposition such that $R1 \cap R2 \neq \phi$. The decomposition ... but not $\textsf{3NF}$ in $\textsf{3NF}$ but not in $\textsf{2NF}$ in both $\textsf{2NF}$ and $\textsf{3NF}$
Consider the schema $R=(S,T, U, V)$ and the dependencies $S \rightarrow T, T \rightarrow U, U \rightarrow V$ and $V \rightarrow S$. Let $R = (R1\text{ and } R2)$ be a dec...
27.0k
views
answer edited
Feb 9, 2018
Databases
gate1999
databases
database-normalization
normal
ugcnetjune2014iii
+
–
8
answers
9
GATE CSE 1998 | Question: 1.34
Which normal form is considered adequate for normal relational database design? $2NF$ $5NF$ $4NF$ $3NF$
Which normal form is considered adequate for normal relational database design?$2NF$$5NF$$4NF$$3NF$
10.2k
views
answer edited
Feb 9, 2018
Databases
gate1998
databases
database-normalization
easy
+
–
5
answers
10
GATE CSE 2002 | Question: 2.24
Relation $R$ is decomposed using a set of functional dependencies, $F$, and relation $S$ is decomposed using another set of functional dependencies, $G$. One decomposition is definitely $\text{BCNF}$, the other is definitely $3NF$, but it is ... the closures of $F$ and $G$ are available). Dependency-preservation Lossless-join $\text{BCNF}$ definition $3NF$ definition
Relation $R$ is decomposed using a set of functional dependencies, $F$, and relation $S$ is decomposed using another set of functional dependencies, $G$. One decompositio...
10.5k
views
edited
Feb 9, 2018
Databases
gatecse-2002
databases
database-normalization
easy
+
–
6
answers
11
GATE CSE 2005 | Question: 29, UGCNET-June2015-III: 9
Which one of the following statements about normal forms is $\text{FALSE}?$ $\text{BCNF}$ is stricter than $\text{3NF}$ Lossless, dependency-preserving decomposition into $\text{3NF}$ is always possible Lossless, dependency-preserving decomposition into $\text{BCNF}$ is always possible Any relation with two attributes is in $\text{BCNF}$
Which one of the following statements about normal forms is $\text{FALSE}?$$\text{BCNF}$ is stricter than $\text{3NF}$Lossless, dependency-preserving decomposition into $...
16.7k
views
answer edited
Feb 9, 2018
Databases
gatecse-2005
databases
database-normalization
easy
ugcnetcse-june2015-paper3
+
–
6
answers
12
GATE IT 2004 | Question: 75
A relation $\text{Empdtl}$ ... and $\textsf{1NF}$ $\textsf{BCNF}$ and hence also in $\textsf{3NF}$, $\textsf{2NF}$ and $\textsf{1NF}$
A relation $\text{Empdtl}$ is defined with attributes empcode (unique), name, street, city, state and pincode. For any pincode, there is only one city and state. Also, fo...
17.5k
views
answer edited
Feb 9, 2018
Databases
gateit-2004
databases
database-normalization
normal
+
–
8
answers
13
GATE IT 2005 | Question: 23, ISRO2017-67
A B-Tree used as an index for a large database table has four levels including the root node. If a new key is inserted in this index, then the maximum number of nodes that could be newly created in the process are $5$ $4$ $3$ $2$
A B-Tree used as an index for a large database table has four levels including the root node. If a new key is inserted in this index, then the maximum number of nodes tha...
18.5k
views
edited
Jan 31, 2018
Databases
gateit-2005
databases
b-tree
normal
isro2017
+
–
8
answers
14
GATE CSE 2010 | Question: 18
Consider a $B^+$-tree in which the maximum number of keys in a node is $5$. What is the minimum number of keys in any non-root node? $1$ $2$ $3$ $4$
Consider a $B^+$-tree in which the maximum number of keys in a node is $5$. What is the minimum number of keys in any non-root node?$1$$2$$3$$4$
32.7k
views
answer edited
Jan 31, 2018
Databases
gatecse-2010
databases
b-tree
easy
+
–
12
answers
15
GATE CSE 2009 | Question: 44
The following key values are inserted into a $B+$ - tree in which order of the internal nodes is $3$, and that of the leaf nodes is $2$, in the sequence given below. The order of internal nodes is the maximum number of tree pointers in each node, and the ... $1$ The maximum number of times leaf nodes would get split up as a result of these insertions is $2$ $3$ $4$ $5$
The following key values are inserted into a $B+$ - tree in which order of the internal nodes is $3$, and that of the leaf nodes is $2$, in the sequence given below. The ...
36.8k
views
edited
Jan 31, 2018
Databases
gatecse-2009
databases
b-tree
normal
+
–
6
answers
16
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$
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$
21.5k
views
edited
Jan 31, 2018
Databases
gatecse-2008
databases
b-tree
normal
+
–
2
answers
17
GATE CSE 2004 | Question: 52
The order of an internal node in a $B+$ tree index is the maximum number of children it can have. Suppose that a child pointer takes $6$ bytes, the search field value takes $14$ bytes, and the block size is $512$ bytes. What is the order of the internal node? $24$ $25$ $26$ $27$
The order of an internal node in a $B+$ tree index is the maximum number of children it can have. Suppose that a child pointer takes $6$ bytes, the search field value tak...
11.3k
views
answer edited
Jan 31, 2018
Databases
gatecse-2004
databases
b-tree
normal
+
–
3
answers
18
GATE IT 2006 | Question: 61
In a database file structure, the search key field is $9$ $bytes$ long, the block size is $512$ $bytes$, a record pointer is $7$ $bytes$ and a block pointer is $6$ $bytes$. The largest possible order of a non-leaf node in a$ B+$ tree implementing this file structure is $23$ $24$ $34$ $44$
In a database file structure, the search key field is $9$ $bytes$ long, the block size is $512$ $bytes$, a record pointer is $7$ $bytes$ and a block pointer is $6$ $bytes...
6.8k
views
edited
Jan 31, 2018
Databases
gateit-2006
databases
b-tree
normal
+
–
2
answers
19
GATE IT 2004 | Question: 79
Consider a table $T$ in a relational database with a key field $K$. A $B$-tree of order $p$ is used as an access structure on $K$, where $p$ denotes the maximum number of tree pointers in a B-tree index node. Assume that $K$ is $10$ $bytes$ long; disk block ... In order for each $B$-tree node to fit in a single disk block, the maximum value of $p$ is $20$ $22$ $23$ $32$
Consider a table $T$ in a relational database with a key field $K$. A $B$-tree of order $p$ is used as an access structure on $K$, where $p$ denotes the maximum number of...
7.6k
views
edited
Jan 31, 2018
Databases
gateit-2004
databases
b-tree
normal
+
–
6
answers
20
GATE CSE 2002 | Question: 2.23, UGCNET-June2012-II: 26
A $B^+$ - tree index is to be built on the Name attribute of the relation STUDENT. Assume that all the student names are of length $8$ bytes, disk blocks are of size $512$ bytes, and index pointers are of size $4$ bytes. Given the scenario, what ... of the degree (i.e. number of pointers per node) of the $B^+$ - tree? $16$ $42$ $43$ $44$
A $B^+$ - tree index is to be built on the Name attribute of the relation STUDENT. Assume that all the student names are of length $8$ bytes, disk blocks are of size $512...
14.0k
views
edited
Jan 31, 2018
Databases
gatecse-2002
databases
b-tree
normal
ugcnetcse-june2012-paper2
+
–
9
answers
21
GATE IT 2006 | Question: 69
A program on machine $X$ attempts to open a $UDP$ connection to port $5376$ on a machine $Y$, and a $TCP$ connection to port $8632$ on machine $Z$. However, there are no applications listening at the corresponding ports on $Y$ and $Z$. An $ICMP$ Port Unreachable error will be generated by $Y$ but not $Z$ $Z$ but not $Y$ Neither $Y$ nor $Z$ Both $Y$ and $Z$
A program on machine $X$ attempts to open a $UDP$ connection to port $5376$ on a machine $Y$, and a $TCP$ connection to port $8632$ on machine $Z$. However, there are no ...
13.9k
views
edited
Jan 31, 2018
Computer Networks
gateit-2006
computer-networks
tcp
udp
normal
+
–
4
answers
22
GATE IT 2007 | Question: 14
Consider a $TCP$ connection in a state where there are no outstanding $ACK$s. The sender sends two segments back to back. The sequence numbers of the first and second segments are $230$ and $290$ respectively. The first segment was lost, but the second segment was received correctly ... $Y$ (in that order) are $60$ and $290$ $230$ and $291$ $60$ and $231$ $60$ and $230$
Consider a $TCP$ connection in a state where there are no outstanding $ACK$s. The sender sends two segments back to back. The sequence numbers of the first and second seg...
10.4k
views
edited
Jan 30, 2018
Computer Networks
gateit-2007
computer-networks
tcp
normal
+
–
7
answers
23
GATE CSE 2009 | Question: 47
While opening a $TCP$ connection, the initial sequence number is to be derived using a time-of-day (ToD) clock that keeps running even when the host is down. The low order $32$ bits of the counter of the ToD clock is to be used for the initial sequence numbers ... sequence numbers used for packets of a connection can increase? $0.015$/s $0.064$/s $0.135$/s $0.327$/s
While opening a $TCP$ connection, the initial sequence number is to be derived using a time-of-day (ToD) clock that keeps running even when the host is down. The low orde...
25.2k
views
edited
Jan 30, 2018
Computer Networks
gatecse-2009
computer-networks
tcp
difficult
ambiguous
+
–
4
answers
24
GATE CSE 2010 | Question: 47
Suppose computers $A$ and $B$ have $IP$ addresses $10.105.1.113$ and $10.105.1.91$ respectively and they both use same netmask $N$. Which of the values of $N$ given below should not be used if $A$ and $B$ should belong to the same network? $255.255.255.0$ $255.255.255.128$ $255.255.255.192$ $255.255.255.224$
Suppose computers $A$ and $B$ have $IP$ addresses $10.105.1.113$ and $10.105.1.91$ respectively and they both use same netmask $N$. Which of the values of $N$ given below...
15.0k
views
edited
Jan 30, 2018
Computer Networks
gatecse-2010
computer-networks
subnetting
easy
+
–
3
answers
25
GATE IT 2008 | Question: 85
Host $X$ has $IP$ address $192.168.1.97$ and is connected through two routers $R1$ and $R2$ to another host $Y$ with $IP$ address $192.168.1.80$. Router $R1$ has $IP$ addresses $192.168.1.135$ and $192.168.1.110$. $R2$ has $IP$ ... . Which $IP$ address should $X$ configure its gateway as? $192.168.1.67$ $192.168.1.110$ $192.168.1.135$ $192.168.1.155$
Host $X$ has $IP$ address $192.168.1.97$ and is connected through two routers $R1$ and $R2$ to another host $Y$ with $IP$ address $192.168.1.80$. Router $R1$ has $IP$ a...
19.6k
views
edited
Jan 30, 2018
Computer Networks
gateit-2008
computer-networks
subnetting
normal
+
–
2
answers
26
GATE CSE 2008 | Question: 57
If a class $B$ network on the Internet has a subnet mask of $255.255.248.0$, what is the maximum number of hosts per subnet? $1022$ $1023$ $2046$ $2047$
If a class $B$ network on the Internet has a subnet mask of $255.255.248.0$, what is the maximum number of hosts per subnet?$1022$$1023$$2046$$2047$
13.7k
views
edited
Jan 30, 2018
Computer Networks
gatecse-2008
computer-networks
subnetting
easy
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register