Register

Recent questions tagged gatecse-2015-set2

49 votes
10 answers
34
GATE CSE 2015 Set 2 | Question: 23
A system has $6$ identical resources and $N$ processes competing for them. Each process can request at most $2$ requests. Which one of the following values of $N$ could lead to a deadlock? $1$ $2$ $3$ $4$
A system has $6$ identical resources and $N$ processes competing for them. Each process can request at most $2$ requests. Which one of the following values of $N$ could l...
User Avatar
61 votes
6 answers
35
GATE CSE 2015 Set 2 | Question: 22
An unordered list contains $n$ distinct elements. The number of comparisons to find an element in this list that is neither maximum nor minimum is $\Theta(n \log n)$ $\Theta(n)$ $\Theta(\log n)$ $\Theta(1)$
An unordered list contains $n$ distinct elements. The number of comparisons to find an element in this list that is neither maximum nor minimum is$\Theta(n \log n)$$\Thet...
User Avatar
34 votes
3 answers
38
GATE CSE 2015 Set 2 | Question: 19
Match the following: ... $\text{P-2, Q-4, R-1, S-3}$ $\text{P-2, Q-3, R-4, S-1}$
Match the following:$$\begin{array}{ll|ll}\hline \text{P.} & \text{Lexical analysis} & \text{1.} & \text{Graph coloring} \\\hline \text{Q.} & \text{Parsing} & \text{2.}&...
User Avatar
62 votes
4 answers
40
GATE CSE 2015 Set 2 | Question: 17
Consider a complete binary tree where the left and right subtrees of the root are max-heaps. The lower bound for the number of operations to convert the tree to a heap is $\Omega(\log n)$ $\Omega(n)$ $\Omega(n \log n)$ $\Omega(n^2)$
Consider a complete binary tree where the left and right subtrees of the root are max-heaps. The lower bound for the number of operations to convert the tree to a heap is...
User Avatar
62 votes
12 answers
46
GATE CSE 2015 Set 2 | Question: 11
Consider the following C function. int fun(int n) { int x=1, k; if (n==1) return x; for (k=1; k<n; ++k) x = x + fun(k) * fun (n-k); return x; } The return value of $fun(5)$ is ______.
Consider the following C function.int fun(int n) { int x=1, k; if (n==1) return x; for (k=1; k<n; ++k) x = x + fun(k) * fun (n-k); return x; }The return value of $fun(5)$...
User Avatar
35 votes
12 answers
47
GATE CSE 2015 Set 2 | Question: 10
A binary tree T has $20$ leaves. The number of nodes in T having two children is ______.
A binary tree T has $20$ leaves. The number of nodes in T having two children is ______.
User Avatar
79 votes
8 answers
50
GATE CSE 2015 Set 2 | Question: 7
The minimum number of $\text{JK}$ flip-flops required to construct a synchronous counter with the count sequence $(0, 0, 1, 1, 2, 2, 3, 3, 0, 0, \ldots)$ is _______.
The minimum number of $\text{JK}$ flip-flops required to construct a synchronous counter with the count sequence $(0, 0, 1, 1, 2, 2, 3, 3, 0, 0, \ldots)$ is _______.
User Avatar
23 votes
3 answers
52
GATE CSE 2015 Set 2 | Question: 5
The larger of the two eigenvalues of the matrix $\begin{bmatrix} 4 & 5 \\ 2 & 1 \end{bmatrix}$ is _______.
The larger of the two eigenvalues of the matrix $\begin{bmatrix} 4 & 5 \\ 2 & 1 \end{bmatrix}$ is _______.
User Avatar
4 votes
1 answer
53
GATE CSE 2015 Set 2 | Question: 4
A software requirements specification (SRS) document should avoid discussing which one of the following? User interface issues Non-functional requirements Design specification Interfaces with third party software
A software requirements specification (SRS) document should avoid discussing which one of the following?User interface issuesNon-functional requirementsDesign specificati...
User Avatar
Page: