Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged gateit-2007
0
votes
1
answer
1
Lock Compatibility in GATE IT 2007 | Question: 66
With reference to the GATE IT 2007 | Question : 66 In the following article from GeeksForGeeks : Lock Compatibility Diagram It can be clearly seen that if a transaction Ti owns a Shared lock on A, then a transaction Tj cannot take an Exclusive lock on ... (A) call in T2 will wait for T1, and T1 will wait for Lock_X(B) from T2, so hence a deadlock ?
With reference to the GATE IT 2007 | Question : 66In the following article from GeeksForGeeks : Lock Compatibility DiagramIt can be clearly seen that if a transaction Ti ...
ParthPratim
292
views
ParthPratim
asked
Jan 6, 2023
Databases
databases
gateit-2007
+
–
47
votes
5
answers
2
GATE IT 2007 | Question: 85
Consider the $B^{+}$ tree in the adjoining figure, where each node has at most two keys and three links. Keys $K15$ and then $K25$ are inserted into this tree in that order. Now the key $K50$ is deleted from the $B^+$ tree resulting after the two ... (i) and (ii) are true Statements (ii) and (iii) are true Statements (iii) and (i) are true All the statements are false
Consider the $B^{+}$ tree in the adjoining figure, where each node has at most two keys and three links.Keys $K15$ and then $K25$ are inserted into this tree in that orde...
Ishrat Jahan
17.6k
views
Ishrat Jahan
asked
Oct 30, 2014
Databases
gateit-2007
databases
b-tree
normal
+
–
46
votes
5
answers
3
GATE IT 2007 | Question: 84
Consider the $B^+$ tree in the adjoining figure, where each node has at most two keys and three links. Keys $K15$ and then $K25$ are inserted into this tree in that order. Exactly how many of the following nodes (disregarding the links) will be present in the tree after the two insertions? $1$ $2$ $3$ $4$
Consider the $B^+$ tree in the adjoining figure, where each node has at most two keys and three links.Keys $K15$ and then $K25$ are inserted into this tree in that order....
Ishrat Jahan
16.0k
views
Ishrat Jahan
asked
Oct 30, 2014
Databases
gateit-2007
databases
b-tree
normal
+
–
94
votes
16
answers
4
GATE IT 2007 | Question: 83
The head of a hard disk serves requests following the shortest seek time first (SSTF) policy. What is the maximum cardinality of the request set, so that the head changes its direction after servicing every request if the total number of tracks are $2048$ and the head can start from any track? $9$ $10$ $11$ $12$
The head of a hard disk serves requests following the shortest seek time first (SSTF) policy. What is the maximum cardinality of the request set, so that the head changes...
Ishrat Jahan
22.8k
views
Ishrat Jahan
asked
Oct 30, 2014
Operating System
gateit-2007
operating-system
disk-scheduling
normal
+
–
31
votes
1
answer
5
GATE IT 2007 | Question: 82
The head of a hard disk serves requests following the shortest seek time first $\textsf{(SSTF)}$ policy. The head is initially positioned at track number $180$. Which of the request sets will cause the head to change its direction after servicing every request assuming that the head ... $10, 139, 169, 178, 181, 184, 201, 265$ $10, 138, 170, 178, 181, 185, 200, 265$
The head of a hard disk serves requests following the shortest seek time first $\textsf{(SSTF)}$ policy. The head is initially positioned at track number $180$.Which of t...
Ishrat Jahan
5.9k
views
Ishrat Jahan
asked
Oct 30, 2014
Operating System
gateit-2007
operating-system
disk-scheduling
normal
+
–
43
votes
6
answers
6
GATE IT 2007 | Question: 81
Let $P_1, P_2,\dots , P_n $be $n$ points in the $xy$-plane such that no three of them are collinear. For every pair of points $P_i$ and $P_j$, let $L_{ij}$ be the line passing through them. Let $L_{ab}$ ... $\Theta\left(n\right)$ $\Theta\left(n\log n\right)$ $\Theta\left(n\log^2 n\right)$ $\Theta\left(n^2\right)$
Let $P_1, P_2,\dots , P_n $be $n$ points in the $xy$-plane such that no three of them are collinear. For every pair of points $P_i$ and $P_j$, let $L_{ij}$ be the line pa...
Ishrat Jahan
6.2k
views
Ishrat Jahan
asked
Oct 30, 2014
Algorithms
gateit-2007
algorithms
time-complexity
normal
+
–
25
votes
8
answers
7
GATE IT 2007 | Question: 80
Let $P_{1},P_{2},\ldots,P_{n}$ be $n$ points in the $xy-$plane such that no three of them are collinear. For every pair of points $P_{i}$ and $P_{j}$, let $L_{ij}$ be the line passing through them. Let $L_{ab}$ be the line ... or the smallest $y$-coordinate among all the points The difference between $x$-coordinates $P_{a}$ and $P_{b}$ is minimum None of the above
Let $P_{1},P_{2},\ldots,P_{n}$ be $n$ points in the $xy-$plane such that no three of them are collinear. For every pair of points $P_{i}$ and $P_{j}$, let $L_{ij}$ be the...
Ishrat Jahan
5.1k
views
Ishrat Jahan
asked
Oct 30, 2014
Linear Algebra
gateit-2007
cartesian-coordinates
+
–
32
votes
3
answers
8
GATE IT 2007 | Question: 79
Consider the following expression $a\bar d + \bar a \bar c + b\bar cd$ Which of the following expressions does not correspond to the Karnaugh Map obtained for the given expression? $\bar c \bar d+ a\bar d + ab\bar c + \bar a \bar cd$ ... $\bar b\bar c \bar d + ac\bar d + \bar a \bar c + ab\bar c$
Consider the following expression$a\bar d + \bar a \bar c + b\bar cd$Which of the following expressions does not correspond to the Karnaugh Map obtained for the given exp...
Ishrat Jahan
5.6k
views
Ishrat Jahan
asked
Oct 30, 2014
Digital Logic
gateit-2007
digital-logic
k-map
normal
+
–
30
votes
3
answers
9
GATE IT 2007 | Question: 78
Consider the following expression $a\bar d + \bar a\bar c + b\bar cd$ Which of the following Karnaugh Maps correctly represents the expression?
Consider the following expression$a\bar d + \bar a\bar c + b\bar cd$Which of the following Karnaugh Maps correctly represents the expression?
Ishrat Jahan
4.7k
views
Ishrat Jahan
asked
Oct 30, 2014
Digital Logic
gateit-2007
digital-logic
k-map
normal
+
–
4
votes
1
answer
10
GATE IT 2007 | Question: 77
Consider the sequence $\left \langle x_n \right \rangle,\; n \geq 0$ defined by the recurrence relation $x_{n + 1} = c \cdot (x_n)^2 - 2$, where $c > 0$. For which of the following values of $c$, does there exist a non-empty open interval $(a, b)$ such that the ... $0.25$ $0.35$ $0.45$ $0.5$ i only i and ii only i, ii and iii only i, ii, iii and iv
Consider the sequence $\left \langle x_n \right \rangle,\; n \geq 0$ defined by the recurrence relation $x_{n + 1} = c \cdot (x_n)^2 - 2$, where $c 0$.For which of the f...
Ishrat Jahan
1.5k
views
Ishrat Jahan
asked
Oct 30, 2014
Numerical Methods
gateit-2007
numerical-methods
normal
non-gate
+
–
23
votes
4
answers
11
GATE IT 2007 | Question: 76
Consider the sequence $\langle x_n \rangle , \: n \geq 0$ defined by the recurrence relation $x_{n+1} = c . x^2_n -2$, where $c > 0$. Suppose there exists a non-empty, open interval $(a, b)$ such that for all $x_0$ satisfying $a < x_0 < b$, the ... sequence converges to the value? $\frac{1+\sqrt{1+8c}}{2c}$ $\frac{1-\sqrt{1+8c}}{2c}$ $2$ $\frac{2}{2c-1}$
Consider the sequence $\langle x_n \rangle , \: n \geq 0$ defined by the recurrence relation $x_{n+1} = c . x^2_n -2$, where $c 0$.Suppose there exists a non-empty, open...
Ishrat Jahan
5.4k
views
Ishrat Jahan
asked
Oct 30, 2014
Combinatory
gateit-2007
combinatory
normal
recurrence-relation
+
–
0
votes
2
answers
12
GATE IT 2007 | Question: 75
Consider a token ring topology with N stations (numbered 1 to N) running token ring protocol where the stations are equally spaced. When a station gets the token it is allowed to send one frame of fixed size. Ring latency is tp, while the transmission time of a frame is tt. ... utilization of the token ring when tt = 5 ms, tp = 3 ms, N = 15 is: 0.545 0.655 0.9375 0.961
Consider a token ring topology with N stations (numbered 1 to N) running token ring protocol where the stations are equally spaced. When a station gets the token it is al...
Ishrat Jahan
2.1k
views
Ishrat Jahan
asked
Oct 30, 2014
Computer Networks
gateit-2007
computer-networks
token-ring
normal
out-of-syllabus-now
+
–
3
votes
2
answers
13
GATE IT 2007 | Question: 74
Consider a token ring topology with N stations (numbered 1 to N) running token ring protocol where the stations are equally spaced. When a station gets the token it is allowed to send one frame of fixed size. Ring latency is tp, while the transmission time of a frame is tt. ... utilization of the token ring when tt =3 ms, tp = 5 ms, N = 10 is 0.545 0.6 0.857 0.961
Consider a token ring topology with N stations (numbered 1 to N) running token ring protocol where the stations are equally spaced. When a station gets the token it is al...
Ishrat Jahan
3.6k
views
Ishrat Jahan
asked
Oct 30, 2014
Computer Networks
gateit-2007
computer-networks
token-ring
normal
out-of-syllabus-now
+
–
44
votes
8
answers
14
GATE IT 2007 | Question: 73
Consider the regular expression $R = (a + b)^* \ (aa + bb) \ (a + b)^*$ Which one of the regular expressions given below defines the same language as defined by the regular expression $R$ ? $(a(ba)^* + b(ab)^*)(a + b)^+$ $(a(ba)^* + b(ab)^*)^*(a + b)^*$ $(a(ba)^* (a + bb) + b(ab)^*(b + aa))(a + b)^*$ $(a(ba)^* (a + bb) + b(ab)^*(b + aa))(a + b)^+$
Consider the regular expression $R = (a + b)^* \ (aa + bb) \ (a + b)^*$Which one of the regular expressions given below defines the same language as defined by the regula...
Ishrat Jahan
13.9k
views
Ishrat Jahan
asked
Oct 30, 2014
Theory of Computation
gateit-2007
theory-of-computation
regular-expression
normal
+
–
42
votes
7
answers
15
GATE IT 2007 | Question: 72
Consider the regular expression $R = (a + b)^* (aa + bb) (a + b)^*$ Which deterministic finite automaton accepts the language represented by the regular expression $R$?
Consider the regular expression $R = (a + b)^* (aa + bb) (a + b)^*$Which deterministic finite automaton accepts the language represented by the regular expression $R$?
Ishrat Jahan
7.8k
views
Ishrat Jahan
asked
Oct 30, 2014
Theory of Computation
gateit-2007
theory-of-computation
finite-automata
normal
+
–
47
votes
4
answers
16
GATE IT 2007 | Question: 71
Consider the regular expression $R = (a + b)^* (aa + bb) (a + b)^*$ Which of the following non-deterministic finite automata recognizes the language defined by the regular expression $R$? Edges labeled $\lambda $ denote transitions on the empty string.
Consider the regular expression $R = (a + b)^* (aa + bb) (a + b)^*$Which of the following non-deterministic finite automata recognizes the language defined by the regular...
Ishrat Jahan
8.2k
views
Ishrat Jahan
asked
Oct 30, 2014
Theory of Computation
gateit-2007
theory-of-computation
finite-automata
normal
+
–
28
votes
3
answers
17
GATE IT 2007 | Question: 70
You are given the following four bytes : $\begin{array}{| c | c | c | c |} \hline 10100011 & 00110111 & 11101001 & 10101011 \\\hline \end{array}$ Which of the following are substrings of the base $64$ encoding of the above four bytes? $\text{zdp}$ $\text{fpq}$ $\text{qwA}$ $\text{oze}$
You are given the following four bytes : $$\begin{array}{| c | c | c | c |} \hline 10100011 & 00110111 & 11101001 & 10101011 \\\hline \end{array}$$ Which of the fol...
Ishrat Jahan
12.0k
views
Ishrat Jahan
asked
Oct 30, 2014
Computer Networks
gateit-2007
computer-networks
network-security
normal
out-of-gate-syllabus
+
–
31
votes
4
answers
18
GATE IT 2007 | Question: 69
Consider the following clauses: Not inherently suitable for client authentication. Not a state sensitive protocol. Must be operated with more than one server. Suitable for structured message organization. May need two ports on the serve side for proper operation. The option that has the ... -i; SMTP-ii; DNS-iii; IMAP-iv; HTTP-v SMTP-i; HTTP-ii; IMAP-iii; DNS-iv; FTP-v
Consider the following clauses:Not inherently suitable for client authentication.Not a state sensitive protocol.Must be operated with more than one server.Suitable for st...
Ishrat Jahan
6.4k
views
Ishrat Jahan
asked
Oct 30, 2014
Computer Networks
gateit-2007
computer-networks
network-protocols
normal
+
–
60
votes
4
answers
19
GATE IT 2007 | Question: 68
Consider the following relation schemas : b-Schema = (b-name, b-city, assets) a-Schema = (a-num, b-name, bal) d-Schema = (c-name, a-number) Let branch, account and depositor be respectively instances of the above schemas. Assume that account and ... depositor) Пc-name (σb-city = "Agra" branch ⋈ (σb-city = "Agra" ⋀ bal < 0 account ⋈ depositor))
Consider the following relation schemas :b-Schema = (b-name, b-city, assets)a-Schema = (a-num, b-name, bal)d-Schema = (c-name, a-number)Let branch, account and depositor ...
Ishrat Jahan
12.8k
views
Ishrat Jahan
asked
Oct 30, 2014
Databases
gateit-2007
databases
joins
relational-algebra
normal
+
–
47
votes
3
answers
20
GATE IT 2007 | Question: 67
Consider the following implications relating to functional and multivalued dependencies given below, which may or may not be correct. if $A \rightarrow \rightarrow B$ and $A \rightarrow \rightarrow C$ then $A \rightarrow BC$ if $A \rightarrow B$ ... then $A \rightarrow \rightarrow C$ Exactly how many of the above implications are valid? $0$ $1$ $2$ $3$
Consider the following implications relating to functional and multivalued dependencies given below, which may or may not be correct.if $A \rightarrow \rightarrow B$ and ...
Ishrat Jahan
12.8k
views
Ishrat Jahan
asked
Oct 30, 2014
Databases
gateit-2007
databases
database-normalization
multivalued-dependency-4nf
normal
+
–
53
votes
5
answers
21
GATE IT 2007 | Question: 66
Consider the following two transactions$: T1$ and $T2.$ ...
Consider the following two transactions$: T1$ and $T2.$$\begin{array}{clcl} T1: & \text{read (A);} & T2: & \text{read (B);} \\ & \text{read (B);} & & \text{read (A);} \\ ...
Ishrat Jahan
17.7k
views
Ishrat Jahan
asked
Oct 30, 2014
Databases
gateit-2007
databases
transaction-and-concurrency
normal
+
–
43
votes
5
answers
22
GATE IT 2007 | Question: 65
Consider a selection of the form $\sigma_{A\leq 100} (r)$, where $r$ is a relation with $1000$ tuples. Assume that the attribute values for $A$ among the tuples are uniformly distributed in the interval $[0, 500].$ Which one of the following options is the best estimate of the number of tuples returned by the given selection query ? $50$ $100$ $150$ $200$
Consider a selection of the form $\sigma_{A\leq 100} (r)$, where $r$ is a relation with $1000$ tuples. Assume that the attribute values for $A$ among the tuples are unifo...
Ishrat Jahan
12.5k
views
Ishrat Jahan
asked
Oct 30, 2014
Databases
gateit-2007
databases
relational-calculus
probability
normal
+
–
46
votes
6
answers
23
GATE IT 2007 | Question: 64
A broadcast channel has $10$ nodes and total capacity of $10$ Mbps. It uses polling for medium access. Once a node finishes transmission, there is a polling delay of $80$ μs to poll the next node. Whenever a node is polled, it is allowed to transmit a maximum of $1000$ bytes. The maximum throughput of the broadcast channel is: $1$ Mbps $100/11$ Mbps $10$ Mbps $100$ Mbps
A broadcast channel has $10$ nodes and total capacity of $10$ Mbps. It uses polling for medium access. Once a node finishes transmission, there is a polling delay of $80$...
Ishrat Jahan
10.6k
views
Ishrat Jahan
asked
Oct 30, 2014
Computer Networks
gateit-2007
computer-networks
communication
normal
+
–
62
votes
8
answers
24
GATE IT 2007 | Question: 63
A group of $15$ routers is interconnected in a centralized complete binary tree with a router at each tree node. Router $i$ communicates with router $j$ by sending a message to the root of the tree. The root then sends the message back down to router $j$ ... mean number of hops per message, assuming all possible router pairs are equally likely is $3$ $4.26$ $4.53$ $5.26$
A group of $15$ routers is interconnected in a centralized complete binary tree with a router at each tree node. Router $i$ communicates with router $j$ by sending a mess...
Ishrat Jahan
18.7k
views
Ishrat Jahan
asked
Oct 30, 2014
Computer Networks
gateit-2007
computer-networks
routing
binary-tree
normal
+
–
55
votes
3
answers
25
GATE IT 2007 | Question: 62
Let us consider a statistical time division multiplexing of packets. The number of sources is $10$. In a time unit, a source transmits a packet of $1000$ bits. The number of sources sending data for the first $20$ ... unit. Then the average number of backlogged of packets per time unit during the given period is $5$ $4.45$ $3.45$ $0$
Let us consider a statistical time division multiplexing of packets. The number of sources is $10$. In a time unit, a source transmits a packet of $1000$ bits. The number...
Ishrat Jahan
12.8k
views
Ishrat Jahan
asked
Oct 30, 2014
Computer Networks
gateit-2007
computer-networks
communication
normal
+
–
38
votes
6
answers
26
GATE IT 2007 | Question: 61
In the waveform (a) given below, a bit stream is encoded by Manchester encoding scheme. The same bit stream is encoded in a different coding scheme in wave form (b). The bit stream and the ... Manchester respectively $0111101000$ and Differential Manchester respectively $1000010111$ and Integral Manchester respectively $0111101000$ and Integral Manchester respectively
In the waveform (a) given below, a bit stream is encoded by Manchester encoding scheme. The same bit stream is encoded in a different coding scheme in wave form (b). The ...
Ishrat Jahan
17.8k
views
Ishrat Jahan
asked
Oct 30, 2014
Computer Networks
gateit-2007
computer-networks
communication
manchester-encoding
normal
out-of-gate-syllabus
+
–
40
votes
4
answers
27
GATE IT 2007 | Question: 60
For the network given in the figure below, the routing tables of the four nodes $A$, $E$, $D$ and $G$ are shown. Suppose that $F$ has estimated its delay to its neighbors, $A$, $E$, $D$ and $G$ as $8$, $10$, $12$ and $6$ msecs respectively and updates its ...
For the network given in the figure below, the routing tables of the four nodes $A$, $E$, $D$ and $G$ are shown. Suppose that $F$ has estimated its delay to its neighbors...
Ishrat Jahan
9.2k
views
Ishrat Jahan
asked
Oct 30, 2014
Computer Networks
gateit-2007
computer-networks
distance-vector-routing
normal
+
–
1
votes
1
answer
28
GATE IT 2007 | Question: 59
The contents of the text file t1 txt containing four lines are as follows : a1 b1 a2 b2 a3 b2 a4 b1 The contents of the text file t2 txt containing five lines are as follows : a1 c1 a2 c2 a3 c3 a4 c3 a5 c4 Consider the following Bourne ... that the given strings may be substrings of a printed line.) "b1 c1" "b2 c3" "b1 c2" "b1 c3"
The contents of the text file t1 txt containing four lines are as follows :a1 b1a2 b2a3 b2a4 b1The contents of the text file t2 txt containing...
Ishrat Jahan
1.5k
views
Ishrat Jahan
asked
Oct 30, 2014
Operating System
gateit-2007
out-of-syllabus-now
shell-script
normal
+
–
72
votes
4
answers
29
GATE IT 2007 | Question: 58
A demand paging system takes $100$ time units to service a page fault and $300$ time units to replace a dirty page. Memory access time is $1$ time unit. The probability of a page fault is $p$ ... that the average access time is $3$ time units. Then the value of $p$ is $0.194$ $0.233$ $0.514$ $0.981$
A demand paging system takes $100$ time units to service a page fault and $300$ time units to replace a dirty page. Memory access time is $1$ time unit. The probability o...
Ishrat Jahan
22.5k
views
Ishrat Jahan
asked
Oct 30, 2014
Operating System
gateit-2007
operating-system
page-replacement
probability
normal
+
–
43
votes
3
answers
30
GATE IT 2007 | Question: 57
In a multi-user operating system on an average, $20$ requests are made to use a particular resource per hour. The arrival of requests follows a Poisson distribution. The probability that either one, three or five requests are made in $45$ ... $6.9 \times 10^3 \times e^{-20}$ $1.02 \times 10^3 \times e^{-20}$
In a multi-user operating system on an average, $20$ requests are made to use a particular resource per hour. The arrival of requests follows a Poisson distribution. The ...
Ishrat Jahan
9.4k
views
Ishrat Jahan
asked
Oct 30, 2014
Probability
gateit-2007
probability
poisson-distribution
normal
+
–
Page:
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register