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

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions.
Recent questions tagged gate20153
+3
votes
4
answers
1
GATE20153_55
Consider the following software items: Program$X$, Control Flow Diagram of Program$Y$ and Control Flow Diagram of Program$Z$ as shown below The values of McCabe's Cyclomatic complexity of program$X$, program$Y$, and program$Z$ respectively are 4, 4, 7 3, 4, 7 4, 4, 8 4, 3, 8
asked
Feb 16, 2015
in
IS&Software Engineering
by
jothee
Veteran
(
112k
points)

1.2k
views
gate20153
is&softwareengineering
cyclomaticcomplexity
normal
nongate
+20
votes
3
answers
2
GATE20153_54
Consider the following C program #include<stdio.h> int f1(void); int f2(void); int f3(void); int x=10; int main() { int x=1; x += f1() + f2 () + f3() + f2(); printf("%d", x); return 0; } int f1() { int x = 25; x++; return x;} int f2() { static int x = 50; x++; return x;} int f3() { x *= 10; return x;} The output of the program is ______.
asked
Feb 16, 2015
in
Programming
by
jothee
Veteran
(
112k
points)

2.3k
views
gate20153
programming
programminginc
normal
numericalanswers
+16
votes
3
answers
3
GATE20153_53
Language $L_1$ is polynomial time reducible to language $L_2$. Language $L_3$ is polynomial time reducible to language $L_2$, which in turn polynomial time reducible to language $L_4$. Which of the following is/are true? $\text{ if } L_4 \in P, \text{ then } L_2 \in P$ $\text{ if } L_1 ... \in P$ $\text{ if } L_4 \in P, \text{ then } L_3 \in P$ II only III only I and IV only I only
asked
Feb 16, 2015
in
Theory of Computation
by
jothee
Veteran
(
112k
points)

1.3k
views
gate20153
theoryofcomputation
decidability
normal
+18
votes
3
answers
4
GATE2015352
Consider the following policies for preventing deadlock in a system with mutually exclusive resources. Process should acquire all their resources at the beginning of execution. If any resource is not available, all resources acquired so far are released. The resources are numbered uniquely, and ... IV but not II Any one of II and III but not I or IV Any one of I, II, III and IV
asked
Feb 16, 2015
in
Operating System
by
jothee
Veteran
(
112k
points)

2.1k
views
gate20153
operatingsystem
resourceallocation
normal
+32
votes
3
answers
5
GATE20153_51
Consider the following reservation table for a pipeline having three stages $S_1, S_2 \text{ and } S_3$. $\text{Time}\rightarrow$ 1 2 3 4 5 $S_1$ $X$ $X$ $S_2$ $X$ $X$ $S_3$ $X$ The minimum average latency (MAL) is ______
asked
Feb 16, 2015
in
CO & Architecture
by
jothee
Veteran
(
112k
points)

7.3k
views
gate20153
coandarchitecture
pipelining
difficult
numericalanswers
+8
votes
3
answers
6
GATE20153_50
The velocity $v$ (in kilometer/minute) of a motorbike which starts form rest, is given at fixed intervals of time $t$ (in minutes) as follows: t 2 4 6 8 10 12 14 16 18 20 v 10 18 25 29 32 20 11 5 2 0 The approximate distance (in kilometers) rounded to two places of decimals covered in 20 minutes using Simpson's $1/3^{rd}$ rule is ________.
asked
Feb 16, 2015
in
Numerical Methods
by
jothee
Veteran
(
112k
points)

890
views
gate20153
numericalmethods
simpsonsrule
normal
numericalanswers
+22
votes
5
answers
7
GATE20153_49
Suppose $c = \langle c[0], \dots, c[k1]\rangle$ is an array of length $k$, where all the entries are from the set $\{0, 1\}$. For any positive integers $a \text{ and } n$, consider the following pseudocode. DOSOMETHING (c, a, n) $z \leftarrow 1$ for $i \leftarrow 0 \text{ ... = \langle 1, 0, 1, 1 \rangle , a = 2, \text{ and } n=8$, then the output of DOSOMETHING(c, a, n) is _______.
asked
Feb 16, 2015
in
Algorithms
by
jothee
Veteran
(
112k
points)

1.3k
views
gate20153
algorithms
identifyfunction
normal
numericalanswers
+32
votes
1
answer
8
GATE20153_48
Consider the following C program: #include<stdio.h> int main() { int i, j, k = 0; j=2 * 3 / 4 + 2.0 / 5 + 8 / 5; k=j; for (i=0; i<5; i++) { switch(i+k) { case 1: case 2: printf("\n%d", i+k); case 3: printf("\n%d", i+k); default: printf("\n%d", i+k); } } return 0; } The number of times printf statement is executed is _______.
asked
Feb 16, 2015
in
Programming
by
jothee
Veteran
(
112k
points)

2.9k
views
gate20153
programming
programminginc
normal
numericalanswers
+22
votes
2
answers
9
GATE20153_47
Consider the following code sequence having five instructions from $I_1 \text{ to } I_5$. Each of these instructions has the following format. OP Ri, Rj, Rk Where operation OP is performed on contents of registers Rj and Rk and the result is stored in register Ri. $I_1$ ... above statements is/are correct? Only S1 is true Only S2 is true Only S1 and S3 are true Only S2 and S3 are true
asked
Feb 16, 2015
in
CO & Architecture
by
jothee
Veteran
(
112k
points)

2.5k
views
gate20153
coandarchitecture
pipelining
datadependences
normal
+24
votes
4
answers
10
GATE20153_46
Consider a B+ tree in which the search key is 12 bytes long, block size is 1024 bytes, recorder pointer is 10 bytes long and the block pointer is 8 byte long. The maximum number of keys that can be accommodated in each nonleaf node of the tree is ______.
asked
Feb 16, 2015
in
Databases
by
jothee
Veteran
(
112k
points)

3k
views
gate20153
databases
btree
normal
numericalanswers
+18
votes
1
answer
11
GATE20153_45
If for nonzero $x, \: af(x) + bf(\frac{1}{x}) = \frac{1}{x}  25$ where a $a \neq b \text{ then } \int_1^2 f(x)dx$ is $\frac{1}{a^2  b^2} \begin{bmatrix} a(\ln 2  25) + \frac{47b}{2} \end{bmatrix}$ $\frac{1}{a^2  b^2} \begin{bmatrix} a(2\ln 2  25) ... } a(2\ln 2  25) + \frac{47b}{2} \end{bmatrix}$ $\frac{1}{a^2  b^2} \begin{bmatrix} a(\ln 2  25)  \frac{47b}{2} \end{bmatrix}$
asked
Feb 16, 2015
in
Calculus
by
jothee
Veteran
(
112k
points)

1.6k
views
gate20153
calculus
integration
normal
+19
votes
5
answers
12
GATE2015344
Given the function $F = P' +QR$, where $F$ is a function in three Boolean variables $P, Q$ and $R$ and $P'=!P$, consider the following statements. $(S1) F = \sum(4, 5, 6)$ $(S2) F = \sum(0, 1, 2, 3, 7)$ $(S3) F = \Pi (4, 5, 6)$ $(S4) F = \Pi (0, 1, 2, ... )True, (S2)False, (S3)False, (S4)True (S1)False, (S2)False, (S3)True, (S4)True (S1)True, (S2)True, (S3)False, (S4)False
asked
Feb 15, 2015
in
Digital Logic
by
jothee
Veteran
(
112k
points)

1.6k
views
gate20153
digitallogic
canonicalnormalform
normal
+16
votes
6
answers
13
GATE2015343
The total number of prime implicants of the function $f(w, x, y, z) = \sum (0, 2, 4, 5, 6, 10)$ is __________
asked
Feb 15, 2015
in
Digital Logic
by
jothee
Veteran
(
112k
points)

2.3k
views
gate20153
digitallogic
canonicalnormalform
normal
numericalanswers
+29
votes
5
answers
14
GATE2015342
Let $f(n) = n$ and $g(n) = n^{(1 + sin \: n)}$ where $n$ is a positive integer. Which of the following statements is/are correct? $f(n) = O(g(n))$ $f(n) = \Omega(g(n))$ Only I Only II Both I and II Neither I nor II
asked
Feb 15, 2015
in
Algorithms
by
jothee
Veteran
(
112k
points)

2.7k
views
gate20153
algorithms
asymptoticnotations
normal
+21
votes
5
answers
15
GATE20153_41
Let $R$ be a relation on the set of ordered pairs of positive integers such that $((p,q),(r,s)) \in R$ if and only if $ps=qr$. Which one of the following is true about R? Both reflexive and symmetric Reflexive but not symmetric Not reflexive but symmetric Neither reflexive nor symmetric
asked
Feb 15, 2015
in
Set Theory & Algebra
by
jothee
Veteran
(
112k
points)

2.1k
views
gate20153
settheory&algebra
relations
normal
+24
votes
3
answers
16
GATE20153_40
Let $G$ be a connected undirected graph of $100$ vertices and $300$ edges. The weight of a minimum spanning tree of $G$ is $500$. When the weight of each edge of $G$ is increased by five, the weight of a minimum spanning tree becomes ______.
asked
Feb 15, 2015
in
Algorithms
by
jothee
Veteran
(
112k
points)

1.7k
views
gate20153
algorithms
spanningtree
easy
numericalanswers
+27
votes
4
answers
17
GATE20153_39
Consider the following recursive C function. void get(int n) { if (n<1) return; get (n1); get (n3); printf("%d", n); } If $get(6)$ function is being called in $main()$ then how many times will the $get()$ function be invoked before returning to the $main()$? $15$ $25$ $35$ $45$
asked
Feb 15, 2015
in
Algorithms
by
jothee
Veteran
(
112k
points)

2.1k
views
gate20153
algorithms
recurrence
normal
+17
votes
2
answers
18
GATE20153_38
In the network $200.10.11.144/27$, the $fourth$ octet (in decimal) of the last $IP$ address of the network which can be assigned to a host is _____.
asked
Feb 15, 2015
in
Computer Networks
by
jothee
Veteran
(
112k
points)

2.7k
views
gate20153
computernetworks
subnetting
normal
numericalanswers
+21
votes
2
answers
19
GATE20153_37
Suppose $X_i$ for $i=1, 2, 3$ are independent and identically distributed random variables whose probability mass functions are $Pr[X_i = 0] = Pr[X_i = 1] = \frac{1} {2} \text{ for } i = 1, 2, 3$. Define another random variable $Y = X_1X_2 \oplus X_3$, where $\oplus$ denotes XOR. Then $Pr[Y=0 \mid X_3 = 0] =$______.
asked
Feb 15, 2015
in
Probability
by
jothee
Veteran
(
112k
points)

1.8k
views
gate20153
probability
randomvariable
normal
numericalanswers
+40
votes
5
answers
20
GATE20153_36
Two hosts are connected via a packet switch with $10^7$ bits per second links. Each link has a propagation delay of 20 microseconds. The switch begins forwarding a packet 35 microseconds after it receives the same. If 10000 bits of data are to be transmitted ... between the transmission of the first bit of data and the reception of the last bit of the data in microseconds is ______.
asked
Feb 15, 2015
in
Computer Networks
by
jothee
Veteran
(
112k
points)

5.9k
views
gate20153
computernetworks
normal
numericalanswers
networkswitching
+17
votes
3
answers
21
GATE2015335
Consider the equation $(43)_x = (y3)_8$ where $x$ and $y$ are unknown. The number of possible solutions is _____
asked
Feb 15, 2015
in
Digital Logic
by
jothee
Veteran
(
112k
points)

2k
views
gate20153
digitallogic
numberrepresentation
normal
numericalanswers
+21
votes
5
answers
22
GATE2015334
For the processes listed in the following table, which of the following scheduling schemes will give the lowest average turnaround time? Process Arrival Time Process Time A 0 3 B 1 6 C 4 4 D 6 2 First Come First Serve Nonpreemprive Shortest job first Shortest Remaining Time Round Robin with Quantum value two
asked
Feb 15, 2015
in
Operating System
by
jothee
Veteran
(
112k
points)

2.3k
views
gate20153
operatingsystem
processschedule
normal
+16
votes
2
answers
23
GATE20153_33
If the following system has nontrivial solution, $px + qy + rz = 0$ $qx + ry + pz = 0$ $rx + py + qz = 0$, then which one of the following options is TRUE? $p  q + r = 0 \text{ or } p = q = r$ $p + q  r = 0 \text{ or } p = q = r$ $p + q + r = 0 \text{ or } p = q = r$ $p  q + r = 0 \text{ or } p = q = r$
asked
Feb 15, 2015
in
Linear Algebra
by
jothee
Veteran
(
112k
points)

1.6k
views
gate20153
linearalgebra
systemofequations
normal
+27
votes
2
answers
24
GATE20153_32
Which of the following languages are contextfree? $L_1: \left\{a^mb^na^nb^m \mid m, n \geq 1\right\}$ $L_2: \left\{a^mb^na^mb^n \mid m, n \geq 1\right\}$ $L_3: \left\{a^mb^n \mid m = 2n +1 \right\}$ $L_1$ and $L_2$ only $L_1$ and $L_3$ only $L_2$ and $L_3$ only $L_3$ only
asked
Feb 15, 2015
in
Theory of Computation
by
jothee
Veteran
(
112k
points)

2.4k
views
gate20153
theoryofcomputation
contextfreelanguage
normal
+26
votes
3
answers
25
GATE20153_31
Consider the following grammar G $S \rightarrow F  H$ $F \rightarrow p  c$ $H \rightarrow d  c$ Where $S$, $F$, and $H$ are nonterminal symbols, $p, d$, and $c$ are terminal symbols. Which of the following statement(s) is/are correct? S1: LL(1) can ... grammar G S2: LR(1) can parse all strings that are generated using grammar G Only S1 Only S2 Both S1 and S2 Neither S1 and S2
asked
Feb 15, 2015
in
Compiler Design
by
jothee
Veteran
(
112k
points)

2.2k
views
gate20153
compilerdesign
parsing
normal
+17
votes
3
answers
26
GATE20153_30
Consider the following two C code segments. $Y$ and $X$ are one and two dimensional arrays of size $n$ and $ n \times n$ respectively, where $2 \leq n \leq 10$. Assume that in both code segments, elements of $Y$ are initialized to 0 and each element $X[i] ... 2 are contiguous in main memory Only S2 is correct Only S3 is correct Only S1 and S2 are correct Only S1 and S3 are correct
asked
Feb 15, 2015
in
Programming
by
jothee
Veteran
(
112k
points)

1.2k
views
gate20153
programminginc
normal
+22
votes
4
answers
27
GATE2015329
Consider the partial Schedule $S$ involving two transactions $T1$ and $T2$. Only the $\textit{read}$ and the $\textit{write}$ operations have been shown. The $\textit{read}$ operation on data item $P$ is denoted by $\textit{read(P)}$ ... then restarted to ensure transaction atomicity Schedule $S$ is recoverable and can ensure transaction atomicity and nothing else needs to be done
asked
Feb 15, 2015
in
Databases
by
jothee
Veteran
(
112k
points)

2.2k
views
gate20153
databases
transactions
normal
+18
votes
5
answers
28
GATE20153_28
Consider a network connecting two systems located 8000 kilometers apart. The bandwidth of the network is $500 \times 10^6$ bits per second. The propagation speed of the media is $4 \times 10^6$ meters per second. It is need to design a GoBack$N$ ... Assume that processing delays at nodes are negligible. Then, the minimum size in bits of the sequence number field has to be ______.
asked
Feb 15, 2015
in
Computer Networks
by
jothee
Veteran
(
112k
points)

2.4k
views
gate20153
computernetworks
slidingwindow
normal
numericalanswers
+26
votes
3
answers
29
GATE20153_27
Assume that a mergesort algorithm in the worst case takes $30$ seconds for an input of size $64$. Which of the following most closely approximates the maximum input size of a problem that can be solved in $6$ minutes? $256$ $512$ $1024$ $2018$
asked
Feb 15, 2015
in
Algorithms
by
jothee
Veteran
(
112k
points)

2.9k
views
gate20153
algorithms
sorting
+27
votes
4
answers
30
GATE20153_26
Consider the following C program #include<stdio.h> int main() { static int a[] = {10, 20, 30, 40, 50}; static int *p[] = {a, a+3, a+4, a+1, a+2}; int **ptr = p; ptr++; printf("%d%d", ptrp, **ptr); } The output of the program is _______.
asked
Feb 15, 2015
in
Programming
by
jothee
Veteran
(
112k
points)

3.2k
views
gate20153
programming
programminginc
normal
numericalanswers
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
My GATE journey
Believe..!!
Need a Serious Career Advice
Failure... ?
Applying to NUS
Follow @csegate
Gatecse
Recent questions tagged gate20153
Recent Blog Comments
Congrats and Best of luck for life ahead :)
Congrats and Best of luck for life ahead :)
Congratulations @Hemant :) I am so happy for u. ...
Have u taken any online coaching ??
Same is for me. I am getting score 584. 2017 ...
34,239
questions
40,932
answers
116,230
comments
39,846
users