Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged gateit-2007
60
votes
6
answers
61
GATE IT 2007 | Question: 26
Consider $n$ jobs $J_1, J_2 \dots J_n$ such that job $J_i$ has execution time $t_i$ and a non-negative integer weight $w_i$ ... the jobs? Non-decreasing order of $t_i$ Non-increasing order of $w_i$ Non-increasing order of $w_it_i$ Non-increasing order of $w_i/t_i$
Consider $n$ jobs $J_1, J_2 \dots J_n$ such that job $J_i$ has execution time $t_i$ and a non-negative integer weight $w_i$. The weighted mean completion time of the jobs...
Ishrat Jahan
14.4k
views
Ishrat Jahan
asked
Oct 29, 2014
Operating System
gateit-2007
operating-system
process-scheduling
normal
+
–
73
votes
6
answers
62
GATE IT 2007 | Question: 25
What is the largest integer $m$ such that every simple connected graph with $n$ vertices and $n$ edges contains at least $m$ different spanning trees ? $1$ $2$ $3$ $n$
What is the largest integer $m$ such that every simple connected graph with $n$ vertices and $n$ edges contains at least $m$ different spanning trees ?$1$$2$$3$$n$
Ishrat Jahan
21.3k
views
Ishrat Jahan
asked
Oct 29, 2014
Graph Theory
gateit-2007
graph-theory
graph-connectivity
normal
+
–
52
votes
11
answers
63
GATE IT 2007 | Question: 24
A depth-first search is performed on a directed acyclic graph. Let $d[u]$ denote the time at which vertex $u$ is visited for the first time and $f[u]$ the time at which the DFS call to the vertex $u$ terminates. Which of the following statements is always TRUE for all edges $(u, v)$ in the graph ? $d[u] < d[v]$ $d[u] < f[v]$ $f[u] < f[v]$ $f[u] > f[v]$
A depth-first search is performed on a directed acyclic graph. Let $d[u]$ denote the time at which vertex $u$ is visited for the first time and $f[u]$ the time at which t...
Ishrat Jahan
13.5k
views
Ishrat Jahan
asked
Oct 29, 2014
Algorithms
gateit-2007
algorithms
graph-algorithm
normal
graph-search
depth-first-search
+
–
32
votes
7
answers
64
GATE IT 2007 | Question: 23
A partial order $P$ is defined on the set of natural numbers as follows. Here $\frac{x}{y}$ denotes integer division. $(0, 0) \in P.$ $(a, b) \in P$ if and only if $(a \% 10) \leq (b \% 10$) and $(\frac{a}{10},\frac{b}{10})\in P.$ ... $P$? (i) and (iii) (ii) and (iv) (i) and (iv) (iii) and (iv)
A partial order $P$ is defined on the set of natural numbers as follows. Here $\frac{x}{y}$ denotes integer division.$(0, 0) \in P.$$(a, b) \in P$ if and only if $(a \% 1...
Ishrat Jahan
11.2k
views
Ishrat Jahan
asked
Oct 29, 2014
Set Theory & Algebra
gateit-2007
set-theory&algebra
partial-order
normal
+
–
0
votes
1
answer
65
GATE IT 2007 | Question: 22
The trapezoidal method is used to evaluate the numerical value of $\int_{0}^{1}e^x dx$. Consider the following values for the step size h. 10-2 10-3 10-4 10-5 For which of these values of the step size h, is the computed value guaranteed to be correct ... that there are no round-off errors in the computation. iv only iii and iv only ii, iii and iv only i, ii, iii and iv
The trapezoidal method is used to evaluate the numerical value of $\int_{0}^{1}e^x dx$. Consider the following values for the step size h.10-210-310-410-5For which of th...
Ishrat Jahan
1.5k
views
Ishrat Jahan
asked
Oct 29, 2014
Numerical Methods
gateit-2007
numerical-methods
trapezoidal-rule
normal
out-of-syllabus-now
+
–
42
votes
5
answers
66
GATE IT 2007 | Question: 21
Which one of these first-order logic formulae is valid? $\forall x\left(P\left(x\right) \implies Q\left(x\right)\right) \implies \left(∀xP\left(x\right)\implies \forall xQ\left(x\right)\right)$ ... $\forall x \exists y P\left(x, y\right)\implies \exists y \forall x P\left(x, y\right)$
Which one of these first-order logic formulae is valid?$\forall x\left(P\left(x\right) \implies Q\left(x\right)\right) \implies \left(∀xP\left(x\right)\implies \forall ...
Ishrat Jahan
10.3k
views
Ishrat Jahan
asked
Oct 29, 2014
Mathematical Logic
gateit-2007
mathematical-logic
normal
first-order-logic
+
–
1
votes
1
answer
67
GATE IT 2007 | Question: 20
Consider the XML document fragment given below: <Book> <Title>GATE 2K7 Example<Title> <Content> One of many lines </Content> <TOC> One of many content entries </TOC> </Book> Consider the XPath ... The Title and Content elements The Content and TOC elements The Title and TOC elements The Title, Content and TOC elements
Consider the XML document fragment given below:<Book <Title>GATE 2K7 Example<Title <Content One of many lines </Content <TOC One of many content entries </TOC </Book>Cons...
Ishrat Jahan
1.1k
views
Ishrat Jahan
asked
Oct 29, 2014
Web Technologies
gateit-2007
xml
out-of-syllabus-now
+
–
0
votes
0
answers
68
GATE IT 2007 | Question: 19
Given below are some HTML lines. <img src = "pict.jpg" width = "256" height = "256" border = "0" usemap = "#map" /> <map name = "map" > <area shape = "poly" coords = ... to the web server will result in a GET request. Exactly how many of the statements given above are correct? 0 1 2 3
Given below are some HTML lines.<img src = "pict.jpg" width = "256" height = "256" border = "0" usemap = "#map" / <map name = "map" <area shape = "poly" coords = "50, 50...
Ishrat Jahan
1.4k
views
Ishrat Jahan
asked
Oct 29, 2014
Web Technologies
gateit-2007
web-technologies
html
normal
+
–
36
votes
3
answers
69
GATE IT 2007 | Question: 18
A firewall is to be configured to allow hosts in a private network to freely open TCP connections and send packets on open connections. However, it will only allow external hosts to send packets on existing open TCP connections or connections ... be that of A combinational circuit A finite automaton A pushdown automaton with one stack A pushdown automaton with two stacks
A firewall is to be configured to allow hosts in a private network to freely open TCP connections and send packets on open connections. However, it will only allow extern...
Ishrat Jahan
6.3k
views
Ishrat Jahan
asked
Oct 29, 2014
Computer Networks
gateit-2007
computer-networks
theory-of-computation
normal
network-security
out-of-gate-syllabus
+
–
50
votes
3
answers
70
GATE IT 2007 | Question: 17
Exponentiation is a heavily used operation in public key cryptography. Which of the following options is the tightest upper bound on the number of multiplications required to compute $b^n \bmod{m}, 0 \leq b, n \leq m$ ? $O(\log n)$ $O(\sqrt n)$ $O\Biggl (\frac{n}{\log n} \Biggr )$ $O(n)$
Exponentiation is a heavily used operation in public key cryptography. Which of the following options is the tightest upper bound on the number of multiplications require...
Ishrat Jahan
8.7k
views
Ishrat Jahan
asked
Oct 29, 2014
Algorithms
gateit-2007
algorithms
time-complexity
normal
+
–
22
votes
3
answers
71
GATE IT 2007 | Question: 16
The minimum positive integer $p$ such that $3^{p} \pmod {17} = 1$ is $5$ $8$ $12$ $16$
The minimum positive integer $p$ such that $3^{p} \pmod {17} = 1$ is$5$$8$$12$$16$
Ishrat Jahan
7.3k
views
Ishrat Jahan
asked
Oct 29, 2014
Set Theory & Algebra
gateit-2007
set-theory&algebra
normal
number-theory
+
–
22
votes
3
answers
72
GATE IT 2007 | Question: 15
Consider the following two statements: A hash function (these are often used for computing digital signatures) is an injective function. A. encryption technique such as DES performs a permutation on the elements of its input alphabet. Which one of the following options ... (i) is true and the other is false Statement (ii) is true and the other is false Both are true
Consider the following two statements:A hash function (these are often used for computing digital signatures) is an injective function.A. encryption technique such as DES...
Ishrat Jahan
7.9k
views
Ishrat Jahan
asked
Oct 29, 2014
Computer Networks
gateit-2007
computer-networks
network-security
normal
out-of-gate-syllabus
+
–
42
votes
4
answers
73
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...
Ishrat Jahan
10.4k
views
Ishrat Jahan
asked
Oct 29, 2014
Computer Networks
gateit-2007
computer-networks
tcp
normal
+
–
33
votes
5
answers
74
GATE IT 2007 | Question: 13
Consider the following statements about the timeout value used in TCP. The timeout value is set to the RTT (Round Trip Time) measured during TCP connection establishment for the entire duration of the connection. Appropriate RTT estimation algorithm is used to set the timeout value of a TCP ... $(ii)$ are false, but $(iii)$ is true $(i), (ii)$ and $(iii)$ are false
Consider the following statements about the timeout value used in TCP.The timeout value is set to the RTT (Round Trip Time) measured during TCP connection establishment f...
Ishrat Jahan
11.3k
views
Ishrat Jahan
asked
Oct 29, 2014
Computer Networks
gateit-2007
computer-networks
tcp
normal
+
–
44
votes
4
answers
75
GATE IT 2007 | Question: 12
The address sequence generated by tracing a particular program executing in a pure demand paging system with $100$ bytes per page is $\text{0100, 0200, 0430, 0499, 0510, 0530, 0560, 0120, 0220, 0240, 0260, 0320, 0410.}$ Suppose that the memory can store only one page and ... to $\text{x + 99}$ are loaded on to the memory. How many page faults will occur? $0$ $4$ $7$ $8$
The address sequence generated by tracing a particular program executing in a pure demand paging system with $100$ bytes per page is$\text{0100, 0200, 0430, 0499, 0510, 0...
Ishrat Jahan
14.9k
views
Ishrat Jahan
asked
Oct 29, 2014
Operating System
gateit-2007
operating-system
virtual-memory
page-replacement
normal
+
–
54
votes
7
answers
76
GATE IT 2007 | Question: 11
Let a memory have four free blocks of sizes $4k$, $8k$, $20k$, $2k$ ... $J7$ will be completed will be $16$ $19$ $20$ $37$
Let a memory have four free blocks of sizes $4k$, $8k$, $20k$, $2k$. These blocks are allocated following the best-fit strategy. The allocation requests are stored in a q...
Ishrat Jahan
19.0k
views
Ishrat Jahan
asked
Oct 29, 2014
Operating System
gateit-2007
operating-system
memory-management
normal
+
–
32
votes
3
answers
77
GATE IT 2007 | Question: 10
Processes $P1$ and $P2$ use critical_flag in the following routine to achieve mutual exclusion. Assume that critical_flag is initialized to FALSE in the main program. get_exclusive_access ( ) { if (critical _flag == FALSE) { critical_flag = TRUE ; critical_region () ; critical_flag = ... Both (i) and (ii) are false (i) is true (ii) is false Both (i) and (ii) are true
Processes $P1$ and $P2$ use critical_flag in the following routine to achieve mutual exclusion. Assume that critical_flag is initialized to FALSE in the main program.get_...
Ishrat Jahan
11.1k
views
Ishrat Jahan
asked
Oct 29, 2014
Operating System
gateit-2007
operating-system
process-synchronization
normal
+
–
33
votes
3
answers
78
GATE IT 2007 | Question: 9
Consider an ambiguous grammar $G$ and its disambiguated version $D.$ Let the language recognized by the two grammars be denoted by $L(G)$ and $L(D)$ respectively. Which one of the following is true? $L (D) ⊂ L (G)$ $L (D) ⊃ L (G)$ $L (D) = L (G)$ $L (D)$ is empty
Consider an ambiguous grammar $G$ and its disambiguated version $D.$ Let the language recognized by the two grammars be denoted by $L(G)$ and $L(D)$ respectively. Which o...
Ishrat Jahan
6.6k
views
Ishrat Jahan
asked
Oct 29, 2014
Compiler Design
gateit-2007
compiler-design
grammar
normal
+
–
27
votes
2
answers
79
GATE IT 2007 | Question: 8
The following circuit implements a two-input AND gate using two $2-1$ multiplexers. What are the values of $X_1, X_2, X_3$? $X_1 = b, X_2 = 0, X_3 = a$ $X_1 = b, X_2 = 1, X_3 = b$ $X_1 = a, X_2 = b, X_3 = 1$ $X_1 = a, X_2 = 0, X_3 = b$
The following circuit implements a two-input AND gate using two $2-1$ multiplexers.What are the values of $X_1, X_2, X_3$?$X_1 = b, X_2 = 0, X_3 = a$$X_1 = b, X_2 = 1, X_...
Ishrat Jahan
7.4k
views
Ishrat Jahan
asked
Oct 29, 2014
Digital Logic
gateit-2007
digital-logic
normal
multiplexer
+
–
47
votes
5
answers
80
GATE IT 2007 | Question: 7
Which of the following input sequences for a cross-coupled $R-S$ flip-flop realized with two $NAND$ gates may lead to an oscillation? $11, 00$ $01, 10$ $10, 01$ $00, 11$
Which of the following input sequences for a cross-coupled $R-S$ flip-flop realized with two $NAND$ gates may lead to an oscillation?$11, 00$$01, 10$$10, 01$$00, 11$
Ishrat Jahan
22.2k
views
Ishrat Jahan
asked
Oct 29, 2014
Digital Logic
gateit-2007
digital-logic
normal
flip-flop
+
–
41
votes
6
answers
81
GATE IT 2007 | Question: 6, ISRO2011-25
A processor takes $12$ cycles to complete an instruction I. The corresponding pipelined processor uses $6$ stages with the execution times of $3, 2, 5, 4, 6$ and $2$ cycles respectively. What is the asymptotic speedup assuming that a very large number of instructions are to be executed? $1.83$ $2$ $3$ $6$
A processor takes $12$ cycles to complete an instruction I. The corresponding pipelined processor uses $6$ stages with the execution times of $3, 2, 5, 4, 6$ and $2$ cycl...
Ishrat Jahan
13.2k
views
Ishrat Jahan
asked
Oct 29, 2014
CO and Architecture
gateit-2007
co-and-architecture
pipelining
normal
isro2011
+
–
5
votes
2
answers
82
GATE IT 2007 | Question: 5
Which of the following systems is a most likely candidate example of a pipe and filter architecture ? Expert system DB repository Aircraft flight controller Signal processing
Which of the following systems is a most likely candidate example of a pipe and filter architecture ?Expert systemDB repositoryAircraft flight controllerSignal processing...
Ishrat Jahan
2.0k
views
Ishrat Jahan
asked
Oct 29, 2014
IS&Software Engineering
gateit-2007
is&software-engineering
normal
+
–
5
votes
2
answers
83
GATE IT 2007 | Question: 4, ISRO2016-66
In the Spiral model of software development, the primary determinant in selecting activities in each iteration is Iteration size Cost Adopted process such as Rational Unified Process or Extreme Programming Risk
In the Spiral model of software development, the primary determinant in selecting activities in each iteration isIteration sizeCostAdopted process such as Rational Unifie...
Ishrat Jahan
6.2k
views
Ishrat Jahan
asked
Oct 29, 2014
IS&Software Engineering
gateit-2007
is&software-engineering
spiral-model
normal
isro2016
+
–
34
votes
4
answers
84
GATE IT 2007 | Question: 3, UGCNET-June2012-III: 34
Consider a weighted, undirected graph with positive edge weights and let $uv$ be an edge in the graph. It is known that the shortest path from the source vertex $s$ to $u$ has weight 53 and the shortest path from $s$ to $v$ has weight 65. Which one of the ... $(u,v) \leq 12$ Weight $(u,v) = 12$ Weight $(u,v) \geq 12$ Weight $(u,v) > 12$
Consider a weighted, undirected graph with positive edge weights and let $uv$ be an edge in the graph. It is known that the shortest path from the source vertex $s$ to $u...
Ishrat Jahan
11.3k
views
Ishrat Jahan
asked
Oct 29, 2014
Algorithms
gateit-2007
algorithms
graph-algorithms
normal
ugcnetcse-june2012-paper3
+
–
61
votes
8
answers
85
GATE IT 2007 | Question: 2
Let $A$ be the matrix $\begin{bmatrix}3 &1 \\ 1&2\end{bmatrix}$. What is the maximum value of $x^TAx$ where the maximum is taken over all $x$ that are the unit eigenvectors of $A?$ $5$ $\frac{(5 + √5)}{2}$ $3$ $\frac{(5 - √5)}{2}$
Let $A$ be the matrix $\begin{bmatrix}3 &1 \\ 1&2\end{bmatrix}$. What is the maximum value of $x^TAx$ where the maximum is taken over all $x$ that are the unit eigenvect...
Ishrat Jahan
16.0k
views
Ishrat Jahan
asked
Oct 29, 2014
Linear Algebra
gateit-2007
linear-algebra
eigen-value
normal
+
–
20
votes
4
answers
86
GATE IT 2007 | Question: 1
Suppose there are two coins. The first coin gives heads with probability $\dfrac{5}{8}$ when tossed, while the second coin gives heads with probability $\dfrac{1}{4}.$ One of the two coins is picked up at random with equal probability and tossed. What is the probability of ... $\left(\dfrac{1}{2}\right)$ $\left(\dfrac{7}{16}\right)$ $\left(\dfrac{5}{32}\right)$
Suppose there are two coins. The first coin gives heads with probability $\dfrac{5}{8}$ when tossed, while the second coin gives heads with probability $\dfrac{1}{4}.$ On...
Ishrat Jahan
4.3k
views
Ishrat Jahan
asked
Oct 29, 2014
Probability
gateit-2007
probability
normal
binomial-distribution
+
–
Page:
« prev
1
2
3
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register