Register

Recent questions tagged gatecse-2015-set3

5.9k
views
4 answers
7 votes
GATE CSE 2015 Set 3 | Question: 55
Consider the following software items: Program-$X$, Control Flow Diagram of Program-$Y$ and Control Flow Diagram of Program-$Z$ as shown belowThe values of McCabe's Cyclo...
User Avatar
12.1k
views
4 answers
41 votes
GATE CSE 2015 Set 3 | Question: 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", ...
User Avatar
9.3k
views
4 answers
38 votes
GATE CSE 2015 Set 3 | Question: 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 l...
User Avatar
13.0k
views
4 answers
40 votes
GATE CSE 2015 Set 3 | Question: 52
Consider the following policies for preventing deadlock in a system with mutually exclusive resources.Process should acquire all their resources at the beginning of execu...
User Avatar
41.8k
views
5 answers
70 votes
GATE CSE 2015 Set 3 | Question: 51
Consider the following reservation table for a pipeline having three stages $S_1, S_2 \text{ and } S_3$.$$\begin{array}{|ccccc|} \hline \textbf{Time} \rightarrow \\\hline...
User Avatar
7.7k
views
3 answers
12 votes
GATE CSE 2015 Set 3 | Question: 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:t2468101214161820v1018252932...
User Avatar
7.6k
views
7 answers
35 votes
GATE CSE 2015 Set 3 | Question: 49
Suppose $c = \langle c[0], \dots, c[k-1]\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...
User Avatar
22.9k
views
1 answers
77 votes
GATE CSE 2015 Set 3 | Question: 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: ...
User Avatar
22.3k
views
3 answers
46 votes
GATE CSE 2015 Set 3 | Question: 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, RkWhere operatio...
User Avatar
21.7k
views
4 answers
51 votes
GATE CSE 2015 Set 3 | Question: 46
Consider a B+ tree in which the search key is $12$ $\text{bytes}$ long, block size is $1024$ $\text{bytes}$, record pointer is $10$ $\text{bytes}$ long and the block poin...
User Avatar
8.3k
views
1 answers
43 votes
GATE CSE 2015 Set 3 | Question: 45
If for non-zero $x, \: af(x) + bf(\frac{1}{x}) = \frac{1}{x} - 25$ where $a \neq b \text{ then } \int\limits_1^2 f(x)dx$ is$\frac{1}{a^2 - b^2} \begin{bmatrix} a(\ln 2 - ...
User Avatar
8.6k
views
6 answers
39 votes
GATE CSE 2015 Set 3 | Question: 44
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)$...
User Avatar
18.7k
views
7 answers
44 votes
GATE CSE 2015 Set 3 | Question: 43
The total number of prime implicants of the function $f(w, x, y, z) = \sum (0, 2, 4, 5, 6, 10)$ is __________
User Avatar
17.8k
views
11 answers
67 votes
GATE CSE 2015 Set 3 | Question: 42
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))$On...
User Avatar
13.2k
views
7 answers
45 votes
GATE CSE 2015 Set 3 | Question: 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 $p-s=q-r$. Which one of the following is true about ...
User Avatar
11.1k
views
5 answers
44 votes
GATE CSE 2015 Set 3 | Question: 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 i...
User Avatar
18.7k
views
5 answers
60 votes
GATE CSE 2015 Set 3 | Question: 39
Consider the following recursive C function.void get(int n) { if (n<1) return; get (n-1); get (n-3); printf("%d", n); }If $get(6)$ function is being called in $main()$ th...
User Avatar
16.8k
views
5 answers
46 votes
GATE CSE 2015 Set 3 | Question: 38
In the network $200.10.11.144/27$, the $\text{fourth}$ octet (in decimal) of the last $\text{IP}$ address of the network which can be assigned to a host is _______.
User Avatar
18.7k
views
6 answers
55 votes
GATE CSE 2015 Set 3 | Question: 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} ...
User Avatar
34.1k
views
11 answers
107 votes
GATE CSE 2015 Set 3 | Question: 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 pack...
User Avatar
10.2k
views
5 answers
36 votes
GATE CSE 2015 Set 3 | Question: 35
Consider the equation $(43)_x = (y3)_8$ where $x$ and $y$ are unknown. The number of possible solutions is _____
User Avatar
19.4k
views
5 answers
42 votes
GATE CSE 2015 Set 3 | Question: 34
For the processes listed in the following table, which of the following scheduling schemes will give the lowest average turnaround time?$$\small \begin{array}{|c|c|c|} \h...
User Avatar
11.1k
views
5 answers
35 votes
GATE CSE 2015 Set 3 | Question: 33
If the following system has non-trivial 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 \t...
User Avatar
15.3k
views
2 answers
44 votes
GATE CSE 2015 Set 3 | Question: 32
Which of the following languages are context-free?$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^...
User Avatar
15.5k
views
5 answers
45 votes
GATE CSE 2015 Set 3 | Question: 31
Consider the following grammar G$S \rightarrow F \mid H$$F \rightarrow p \mid c$$H \rightarrow d \mid c$ Where $S$, $F$, and $H$ are non-terminal symbols, $p, d$, and $c...
User Avatar
9.1k
views
3 answers
44 votes
GATE CSE 2015 Set 3 | Question: 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 th...
User Avatar
14.8k
views
5 answers
63 votes
GATE CSE 2015 Set 3 | Question: 29
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{rea...
User Avatar
15.0k
views
10 answers
47 votes
GATE CSE 2015 Set 3 | Question: 28
Consider a network connecting two systems located $8000$ $\text{Km}$ apart. The bandwidth of the network is $500 \times 10^6$ $\text{bits}$ per second. The propagation sp...
User Avatar
20.5k
views
5 answers
60 votes
GATE CSE 2015 Set 3 | Question: 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 ...
User Avatar
23.1k
views
11 answers
62 votes
GATE CSE 2015 Set 3 | Question: 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++; print...
User Avatar
Page: