The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Recent questions tagged gate2007it
+31
votes
5
answers
1
GATE2007IT85
Consider the $B^{+}$ tree in the adjoining figure, where each node has at most two keys and three links. Now the key $K50$ is deleted from the $B^+$ tree resulting after the two insertions made earlier. Consider the following statements about the $B^+$ tree ... i) and (ii) are true Statements (ii) and (iii) are true Statements (iii) and (i) are true All the statements are false
asked
Oct 31, 2014
in
Databases
by
Ishrat Jahan

5.3k
views
gate2007it
databases
btree
normal
+33
votes
4
answers
2
GATE2007IT84
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$
asked
Oct 31, 2014
in
Databases
by
Ishrat Jahan

5.7k
views
gate2007it
databases
btree
normal
+64
votes
12
answers
3
GATE2007IT83
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$
asked
Oct 31, 2014
in
Operating System
by
Ishrat Jahan

8.3k
views
gate2007it
operatingsystem
diskscheduling
normal
+23
votes
1
answer
4
GATE2007IT82
The head of a hard disk serves requests following the shortest seek time first (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 does not change ... $10, 139, 169, 178, 181, 184, 201, 265$ $10, 138, 170, 178, 181, 185, 200, 265$
asked
Oct 31, 2014
in
Operating System
by
Ishrat Jahan

2k
views
gate2007it
operatingsystem
diskscheduling
normal
+25
votes
5
answers
5
GATE2007IT81
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}$ be the line with the steepest gradient among all $n(n 1)/2$ ... $P_b$ is $\Theta\left(n\right)$ $\Theta\left(n\log n\right)$ $\Theta\left(n\log^2 n\right)$ $\Theta\left(n^2\right)$
asked
Oct 31, 2014
in
Algorithms
by
Ishrat Jahan

2.1k
views
gate2007it
algorithms
timecomplexity
normal
+10
votes
5
answers
6
GATE2007IT80
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 with the ... largest 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
asked
Oct 31, 2014
in
Linear Algebra
by
Ishrat Jahan

1.4k
views
gate2007it
cartesiancoordinates
+19
votes
2
answers
7
GATE2007IT79
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$
asked
Oct 31, 2014
in
Digital Logic
by
Ishrat Jahan

1.7k
views
gate2007it
digitallogic
kmap
normal
+23
votes
2
answers
8
GATE2007IT78
Consider the following expression $a\bar d + \bar a\bar c + b\bar cd$ Which of the following Karnaugh Maps correctly represents the expression?
asked
Oct 31, 2014
in
Digital Logic
by
Ishrat Jahan

1.6k
views
gate2007it
digitallogic
kmap
normal
+4
votes
1
answer
9
GATE2007IT77
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 nonempty open interval $(a, b)$ such that the sequence $x_n$ ... $0.25$ $0.35$ $0.45$ $0.5$ i only i and ii only i, ii and iii only i, ii, iii and iv
asked
Oct 31, 2014
in
Numerical Methods
by
Ishrat Jahan

619
views
gate2007it
numericalmethods
normal
nongate
+18
votes
4
answers
10
GATE2007IT76
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 nonempty, open interval $(a, b)$ such that for all $x_0$ satisfying $a < x_0 < b$, the sequence converges ... sequence converges to the value? $\frac{1+\sqrt{1+8c}}{2c}$ $\frac{1\sqrt{1+8c}}{2c}$ $2$ $\frac{2}{2c1}$
asked
Oct 31, 2014
in
Combinatory
by
Ishrat Jahan

1.7k
views
gate2007it
combinatory
normal
recurrence
0
votes
2
answers
11
GATE2007IT75
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. All other ... utilization of the token ring when tt = 5 ms, tp = 3 ms, N = 15 is: 0.545 0.655 0.9375 0.961
asked
Oct 31, 2014
in
Computer Networks
by
Ishrat Jahan

868
views
gate2007it
computernetworks
tokenring
normal
outofsyllabusnow
0
votes
2
answers
12
GATE2007IT74
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. All other ... maximum utilization of the token ring when tt =3 ms, tp = 5 ms, N = 10 is 0.545 0.6 0.857 0.961
asked
Oct 31, 2014
in
Computer Networks
by
Ishrat Jahan

1.4k
views
gate2007it
computernetworks
tokenring
normal
outofsyllabusnow
+23
votes
7
answers
13
GATE2007IT73
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)^+$
asked
Oct 31, 2014
in
Theory of Computation
by
Ishrat Jahan

4.1k
views
gate2007it
theoryofcomputation
regularexpressions
normal
+31
votes
7
answers
14
GATE2007IT72
Consider the regular expression $R = (a + b)^* (aa + bb) (a + b)^*$ Which deterministic finite automaton accepts the language represented by the regular expression $R$?
asked
Oct 31, 2014
in
Theory of Computation
by
Ishrat Jahan

2.5k
views
gate2007it
theoryofcomputation
finiteautomata
normal
+33
votes
3
answers
15
GATE2007IT71
Consider the regular expression $R = (a + b)^* (aa + bb) (a + b)^*$ Which of the following nondeterministic finite automata recognizes the language defined by the regular expression $R$? Edges labeled $\lambda $ denote transitions on the empty string.
asked
Oct 31, 2014
in
Theory of Computation
by
Ishrat Jahan

3.1k
views
gate2007it
theoryofcomputation
finiteautomata
normal
+22
votes
3
answers
16
GATE2007IT70
You are given the following four bytes : 10100011 00110111 11101001 10101011 Which of the following are substrings of the base $64$ encoding of the above four bytes? $\text{zdp}$ $\text{fpq}$ $\text{qwA}$ $\text{oze}$
asked
Oct 30, 2014
in
Computer Networks
by
Ishrat Jahan

6.5k
views
gate2007it
computernetworks
networksecurity
normal
+20
votes
2
answers
17
GATE2007IT69
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 maximum ... POP3i; SMTPii; DNSiii; IMAPiv; HTTPv SMTPi; HTTPii; IMAPiii; DNSiv; FTPv
asked
Oct 30, 2014
in
Computer Networks
by
Ishrat Jahan

2.3k
views
gate2007it
computernetworks
networkprotocols
normal
+44
votes
6
answers
18
GATE2007IT68
Consider the following relation schemas : bSchema = (bname, bcity, assets) aSchema = (anum, bname, bal) dSchema = (cname, anumber) Let branch, account and depositor be respectively instances of the above schemas. Assume that account and depositor ... ⋈ depositor) Пcname (σbcity = "Agra" branch ⋈ (σbcity = "Agra" ⋀ bal < 0 account ⋈ depositor))
asked
Oct 30, 2014
in
Databases
by
Ishrat Jahan

4.3k
views
gate2007it
databases
joins
relationalalgebra
normal
+31
votes
3
answers
19
GATE2007IT67
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 \rightarrow BC$ if $A \rightarrow B$ ... $A \rightarrow \rightarrow C$ Exactly how many of the above implications are valid? $0$ $1$ $2$ $3$
asked
Oct 30, 2014
in
Databases
by
Ishrat Jahan

4.4k
views
gate2007it
databases
databasenormalization
multivalueddependency4nf
normal
+37
votes
4
answers
20
GATE2007IT66
Consider the following two transactions : T1 and T2. T1 : read (A); T2 : read (B); read (B); read (A); if A = 0 then B ← B + 1; if B ≠ 0 then A ← A  1; write (B); write (A); Which of the following schemes, using shared and exclusive locks, satisfy the requirements for ... ← B + 1; then A ← A  1; write (B); write (A); unlock (A); unlock (A); unlock (B); unlock (B); commit; commit;
asked
Oct 30, 2014
in
Databases
by
Ishrat Jahan

5.1k
views
gate2007it
databases
transactions
normal
+29
votes
3
answers
21
GATE2007IT65
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$
asked
Oct 30, 2014
in
Databases
by
Ishrat Jahan

4k
views
gate2007it
databases
relationalcalculus
probability
normal
+31
votes
3
answers
22
GATE2007IT64
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
asked
Oct 30, 2014
in
Computer Networks
by
Ishrat Jahan

3.7k
views
gate2007it
computernetworks
communication
normal
+41
votes
8
answers
23
GATE2007IT63
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$. The mean number of hops per message, assuming all possible router pairs are equally likely is $3$ $4.26$ $4.53$ $5.26$
asked
Oct 30, 2014
in
Computer Networks
by
Ishrat Jahan

5.9k
views
gate2007it
computernetworks
routing
binarytree
normal
+37
votes
2
answers
24
GATE2007IT62
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$ ... per time unit. Then the average number of backlogged of packets per time unit during the given period is $5$ $4.45$ $3.45$ $0$
asked
Oct 30, 2014
in
Computer Networks
by
Ishrat Jahan

4.8k
views
gate2007it
computernetworks
communication
normal
+28
votes
4
answers
25
GATE2007IT61
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 coding scheme ... Manchester respectively $0111101000$ and Differential Manchester respectively $1000010111$ and Integral Manchester respectively $0111101000$ and Integral Manchester respectively
asked
Oct 30, 2014
in
Computer Networks
by
Ishrat Jahan

6k
views
gate2007it
computernetworks
communication
manchesterencoding
normal
+26
votes
5
answers
26
GATE2007IT60
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 routing ...
asked
Oct 30, 2014
in
Computer Networks
by
Ishrat Jahan

3.2k
views
gate2007it
computernetworks
distancevectorrouting
normal
0
votes
1
answer
27
GATE2007IT59
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 shell ... Note that the given strings may be substrings of a printed line.) "b1 c1" "b2 c3" "b1 c2" "b1 c3"
asked
Oct 30, 2014
in
Operating System
by
Ishrat Jahan

433
views
gate2007it
outofsyllabusnow
shellscript
normal
+50
votes
5
answers
28
GATE2007IT58
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$. In case of a page fault, the probability of page being dirty is also $p$. It is observed that the average access time is $3$ time units. Then the value of $p$ is $0.194$ $0.233$ $0.514$ $0.981$
asked
Oct 30, 2014
in
Operating System
by
Ishrat Jahan

8.2k
views
gate2007it
operatingsystem
pagereplacement
probability
normal
+23
votes
1
answer
29
GATE2007IT57
In a multiuser 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$ minutes is given by : $6.9 \times 10^6 \times e^{20}$ ... $6.9 \times 10^3 \times e^{20}$ $1.02 \times 10^3 \times e^{20}$
asked
Oct 30, 2014
in
Probability
by
Ishrat Jahan

3.4k
views
gate2007it
probability
poissondistribution
normal
+26
votes
3
answers
30
GATE2007IT56
Synchronization in the classical readers and writers problem can be achieved through use of semaphores. In the following incomplete code for readerswriters problem, two binary semaphores mutex and wrt are used to obtain synchronization wait (wrt) writing is performed signal (wrt) wait ... (mutex), wait (mutex), signal (wrt) signal (mutex), wait (mutex), signal (mutex), wait (mutex)
asked
Oct 30, 2014
in
Operating System
by
Ishrat Jahan

3.1k
views
gate2007it
operatingsystem
processsynchronization
normal
Page:
1
2
3
next »
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
IISc CDS Interview Experience, 2020
IITD MS CSE (Systems) Experience
IIT Bombay M.Tech. (RA)  Interview Experience
Interview Experience for MS(R)IIT Delhi (School of Information Technology)
PGEE 2020 (CSE) Experience
Subjects
All categories
General Aptitude
(2k)
Engineering Mathematics
(8.3k)
Digital Logic
(2.9k)
Programming and DS
(5k)
Algorithms
(4.4k)
Theory of Computation
(6.2k)
Compiler Design
(2.2k)
Operating System
(4.6k)
Databases
(4.2k)
CO and Architecture
(3.4k)
Computer Networks
(4.2k)
Non GATE
(1.2k)
Others
(1.5k)
Admissions
(595)
Exam Queries
(562)
Tier 1 Placement Questions
(23)
Job Queries
(71)
Projects
(19)
Unknown Category
(1k)
Recent questions tagged gate2007it
Recent Blog Comments
Q1. I don't know any trick or method, I usually...
Yeah, Now it's on.
Can you check now?
Even I filled NIELIT form which had similar...
Today's test will be late  either midnight or...
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
52,375
questions
60,580
answers
201,986
comments
95,396
users