Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions tagged gatecse-2015-set1
73
votes
7
answers
1
GATE CSE 2015 Set 1 | Question: 55
The least number of temporary variables required to create a three-address code in static single assignment form for the expression $q + r / 3 + s - t * 5 + u * v/w$ is__________________.
makhdoom ghaya
asked
in
Compiler Design
Feb 14, 2015
by
makhdoom ghaya
23.7k
views
gatecse-2015-set1
compiler-design
intermediate-code
normal
numerical-answers
static-single-assignment
25
votes
8
answers
2
GATE CSE 2015 Set 1 | Question: 54
Let G be a connected planar graph with 10 vertices. If the number of edges on each face is three, then the number of edges in G is_______________.
makhdoom ghaya
asked
in
Graph Theory
Feb 14, 2015
by
makhdoom ghaya
19.5k
views
gatecse-2015-set1
graph-theory
graph-connectivity
normal
graph-planarity
numerical-answers
34
votes
6
answers
3
GATE CSE 2015 Set 1 | Question: 53
Suppose that the stop-and-wait protocol is used on a link with a bit rate of $64$ $\text{kilobits}$ per second and $20$ $\text{milliseconds}$ propagation delay. Assume that the transmission time for the acknowledgment and the processing time ... . Then the minimum frame size in bytes to achieve a link utilization of at least $50$ $\text{%}$ is_________________.
makhdoom ghaya
asked
in
Computer Networks
Feb 14, 2015
by
makhdoom ghaya
20.2k
views
gatecse-2015-set1
computer-networks
stop-and-wait
normal
numerical-answers
58
votes
12
answers
4
GATE CSE 2015 Set 1 | Question: 52
Consider the DFAs $M$ and $N$ given above. The number of states in a minimal DFA that accept the language $L(M) \cap L(N)$ is_____________.
makhdoom ghaya
asked
in
Theory of Computation
Feb 14, 2015
by
makhdoom ghaya
12.8k
views
gatecse-2015-set1
theory-of-computation
finite-automata
easy
numerical-answers
minimal-state-automata
71
votes
3
answers
5
GATE CSE 2015 Set 1 | Question: 51
Consider the NPDA ... follows: Which one of the following sequences must follow the string $101100$ so that the overall string is accepted by the automaton? $10110$ $10010$ $01010$ $01001$
makhdoom ghaya
asked
in
Theory of Computation
Feb 13, 2015
by
makhdoom ghaya
18.2k
views
gatecse-2015-set1
theory-of-computation
pushdown-automata
normal
53
votes
3
answers
6
GATE CSE 2015 Set 1 | Question: 50
A variable $x$ is said to be live at a statement $s_{i}$ in a program if the following three conditions hold simultaneously: There exists a statement $S_{j}$ that uses $x$ There is a path from $S_{i}$ to $S_{j}$ in the flow graph corresponding to the program The path ... above control flow graph are $\text{p, s, u}$ $\text{r, s, u}$ $\text{r, u}$ $\text{q, v}$
makhdoom ghaya
asked
in
Compiler Design
Feb 13, 2015
by
makhdoom ghaya
20.4k
views
gatecse-2015-set1
compiler-design
live-variable-analysis
normal
52
votes
4
answers
7
GATE CSE 2015 Set 1 | Question: 49
Let a$_{n}$ represent the number of bit strings of length n containing two consecutive $1$s. What is the recurrence relation for $a_{n}$? $a_{n - 2} + a_{n - 1} + 2^{n - 2}$ $a_{n - 2} + 2a_{n - 1} + 2^{n - 2}$ $2a_{n - 2} + a_{n - 1} + 2^{n - 2}$ $2a_{n - 2} + 2a_{n - 1} + 2^{n - 2}$
makhdoom ghaya
asked
in
Algorithms
Feb 13, 2015
by
makhdoom ghaya
7.9k
views
gatecse-2015-set1
algorithms
recurrence-relation
normal
46
votes
7
answers
8
GATE CSE 2015 Set 1 | Question: 48
Consider a disk pack with a seek time of $4$ milliseconds and rotational speed of $10000$ rotations per minute (RPM). It has $600$ sectors per track and each sector can store $512$ bytes of data. Consider a file stored in ... sector is half of the time for one complete rotation. The total time (in milliseconds) needed to read the entire file is__________________
makhdoom ghaya
asked
in
Operating System
Feb 13, 2015
by
makhdoom ghaya
15.6k
views
gatecse-2015-set1
operating-system
disk
normal
numerical-answers
23
votes
2
answers
9
GATE CSE 2015 Set 1 | Question: 47
Consider a main memory with five-page frames and the following sequence of page references: $\text{3, 8, 2, 3, 9, 1, 6, 3, 8, 9, 3, 6, 2, 1, 3}$. Which one of the following is true with respect to page replacement policies First ... faults FIFO incurs $2$ more page faults than LRU LRU incurs $2$ more page faults than FIFO FIFO incurs $1$ more page faults than LRU
makhdoom ghaya
asked
in
Operating System
Feb 13, 2015
by
makhdoom ghaya
15.1k
views
gatecse-2015-set1
operating-system
page-replacement
normal
86
votes
14
answers
10
GATE CSE 2015 Set 1 | Question: 46
Consider a uniprocessor system executing three tasks $T_{1}, T_{2}$ and $T_{3}$ each of which is composed of an infinite sequence of jobs (or instances) which arrive periodically at intervals of $3, 7$ and $20$ ... $T_{3}$ completes its execution at the end of_____________________milliseconds.
makhdoom ghaya
asked
in
Operating System
Feb 13, 2015
by
makhdoom ghaya
28.0k
views
gatecse-2015-set1
operating-system
process-scheduling
normal
numerical-answers
38
votes
9
answers
11
GATE CSE 2015 Set 1 | Question: 45
Let $G = (V, E)$ be a simple undirected graph, and $s$ be a particular vertex in it called the source. For $x \in V$, let $d(x)$ denote the shortest distance in $G$ from $s$ to $x$. A breadth first search (BFS) is performed starting at $s$. Let $T$ be the ... that is not in $T$, then which one of the following CANNOT be the value of $d(u) - d(v)$? $-1$ $0$ $1$ $2$
makhdoom ghaya
asked
in
Algorithms
Feb 13, 2015
by
makhdoom ghaya
13.5k
views
gatecse-2015-set1
algorithms
graph-algorithms
normal
graph-search
19
votes
2
answers
12
GATE CSE 2015 Set 1 | Question: 44
Compute the value of: $ \large \int \limits_{\frac{1}{\pi}}^{\frac{2}{\pi}}\frac{\cos(1/x)}{x^{2}}dx$
makhdoom ghaya
asked
in
Calculus
Feb 13, 2015
by
makhdoom ghaya
5.6k
views
gatecse-2015-set1
calculus
integration
normal
numerical-answers
63
votes
5
answers
13
GATE CSE 2015 Set 1 | Question: 43
The graph shown below has $8$ edges with distinct integer edge weights. The minimum spanning tree (MST) is of weight $36$ and contains the edges: $\{(A, C), (B, C), (B, E), (E, F), (D, F)\}$. The edge weights of only ... which are in the MST are given in the figure shown below. The minimum possible sum of weights of all $8$ edges of this graph is_______________.
makhdoom ghaya
asked
in
Algorithms
Feb 13, 2015
by
makhdoom ghaya
13.8k
views
gatecse-2015-set1
algorithms
spanning-tree
normal
numerical-answers
10
votes
2
answers
14
GATE CSE 2015 Set 1 | Question: 42
Consider the following C program segment. while (first <= last) { if (array[middle] < search) first = middle + 1; else if (array[middle] == search) found = TRUE; else last = middle - 1; middle = (first + last)/2; } if (first > last) notpresent = TRUE; The cyclomatic complexity of the program segment is_______________.
makhdoom ghaya
asked
in
IS&Software Engineering
Feb 13, 2015
by
makhdoom ghaya
8.0k
views
gatecse-2015-set1
is&software-engineering
cyclomatic-complexity
normal
out-of-syllabus-now
numerical-answers
52
votes
7
answers
15
GATE CSE 2015 Set 1 | Question: 41
Consider an Entity-Relationship $(\text{ER})$ model in which entity sets $E_{1}$ and $E_{2}$ are connected by an $m:n$ relationship $R_{12}$. $E_{1}$ and $E_{3}$ are connected by a $1 : n$ ($1$ ... from the above $\text{ER}$ model, then the minimum number of relations that would be generated if all relation are in $\text{3NF}$ is________________.
makhdoom ghaya
asked
in
Databases
Feb 13, 2015
by
makhdoom ghaya
13.2k
views
gatecse-2015-set1
databases
er-diagram
normal
numerical-answers
84
votes
5
answers
16
GATE CSE 2015 Set 1 | Question: 40
An algorithm performs $(\log N)^{\frac{1}{2}}$ find operations , $N$ insert operations, $(\log N)^{\frac{1}{2}}$ delete operations, and $(\log N)^{\frac{1}{2}}$ decrease-key operations on a set of data ... if the goal is to achieve the best total asymptotic complexity considering all the operations? Unsorted array Min - heap Sorted array Sorted doubly linked list
makhdoom ghaya
asked
in
Algorithms
Feb 13, 2015
by
makhdoom ghaya
17.6k
views
gatecse-2015-set1
algorithms
data-structures
normal
time-complexity
86
votes
7
answers
17
GATE CSE 2015 Set 1 | Question: 39
Consider the operations $\textit{f (X, Y, Z) = X'YZ + XY' + Y'Z'}$ and $\textit{g (X, Y, Z) = X'YZ + X'YZ' + XY}$ Which one of the following is correct? Both $\left\{\textit{f} \right\}$ ... $\left\{ \textit{f}\right\}$ nor $\left\{\textit{g}\right\}$ is functionally complete
makhdoom ghaya
asked
in
Digital Logic
Feb 13, 2015
by
makhdoom ghaya
18.8k
views
gatecse-2015-set1
boolean-algebra
difficult
51
votes
5
answers
18
GATE CSE 2015 Set 1 | Question: 38
Consider a non-pipelined processor with a clock rate of $2.5$ gigahertz and average cycles per instruction of four. The same processor is upgraded to a pipelined processor with five stages; but due to the internal pipeline delay, ... $2$ gigahertz. Assume that there are no stalls in the pipeline. The speedup achieved in this pipelined processor is_______________.
makhdoom ghaya
asked
in
CO and Architecture
Feb 13, 2015
by
makhdoom ghaya
23.6k
views
gatecse-2015-set1
co-and-architecture
pipelining
normal
numerical-answers
40
votes
7
answers
19
GATE CSE 2015 Set 1 | Question: 37
A positive edge-triggered $D$ flip-flop is connected to a positive edge-triggered $JK$ flip-flop as follows. The $Q$ output of the $D$ flip-flop is connected to both the $J$ and $K$ inputs of the $JK$ ... $JK$ flip-flops. Both the flip-flops have non-zero propagation delays. $0110110\ldots$ $0100100\ldots$ $011101110\ldots$ $011001100\ldots$
makhdoom ghaya
asked
in
Digital Logic
Feb 13, 2015
by
makhdoom ghaya
9.9k
views
gatecse-2015-set1
digital-logic
flip-flop
normal
24
votes
4
answers
20
GATE CSE 2015 Set 1 | Question: 36
Consider the following $2 \times 2$ matrix $A$ where two elements are unknown and are marked by $a$ and $b$. The eigenvalues of this matrix are $-1$ and $7.$ What are the values of $a$ and $b$? $\qquad A = \begin{pmatrix}1 & 4\\ b&a \end{pmatrix}$ $a = 6, b = 4$ $a = 4, b = 6$ $a = 3, b = 5$ $a = 5, b = 3 $
makhdoom ghaya
asked
in
Linear Algebra
Feb 13, 2015
by
makhdoom ghaya
4.9k
views
gatecse-2015-set1
linear-algebra
eigen-value
normal
101
votes
5
answers
21
GATE CSE 2015 Set 1 | Question: 35
What is the output of the following C code? Assume that the address of $x$ is $2000$ (in decimal) and an integer requires four bytes of memory. int main () { unsigned int x [4] [3] = {{1, 2, 3}, {4, 5, 6}, {7, 8, 9}, {10, 11, 12}}; printf ("%u, %u, %u", x + 3, *(x + 3), *(x + 2) + 3); } $2036, 2036, 2036$ $2012, 4, 2204$ $2036, 10, 10$ $2012, 4, 6$
makhdoom ghaya
asked
in
Programming
Feb 13, 2015
by
makhdoom ghaya
21.3k
views
gatecse-2015-set1
programming
programming-in-c
normal
64
votes
5
answers
22
GATE CSE 2015 Set 1 | Question: 34
Suppose $L = \left\{ p, q, r, s, t\right\}$ is a lattice represented by the following Hasse diagram: For any $x, y \in L$, not necessarily distinct , $x \vee y$ and $x \wedge y$ are join and meet of $x, y$ ... $p_r = 0$ $p_r = 1$ $0 < p_r ≤ \frac{1}{5}$ $\frac{1}{5} < p_r < 1$
makhdoom ghaya
asked
in
Set Theory & Algebra
Feb 13, 2015
by
makhdoom ghaya
12.7k
views
gatecse-2015-set1
set-theory&algebra
normal
lattice
50
votes
7
answers
23
GATE CSE 2015 Set 1 | Question: 33
Consider the following pseudo code, where $x$ and $y$ are positive integers. begin q := 0 r := x while r ≥ y do begin r := r - y q := q + 1 end end The post condition that needs to be satisfied after the program terminates is $\{ r = qx + y \wedge r < y\}$ ... $\{ y = qx + r \wedge 0 < r < y\}$ $\{ q + 1 < r - y \wedge y > 0\}$
makhdoom ghaya
asked
in
Programming
Feb 13, 2015
by
makhdoom ghaya
11.4k
views
gatecse-2015-set1
programming
loop-invariants
normal
26
votes
1
answer
24
GATE CSE 2015 Set 1 | Question: 32
Consider a max heap, represented by the array: $40, 30, 20, 10, 15, 16, 17, 8, 4$ ... $40, 30, 20, 10, 35, 16, 17, 8, 4, 15$ $40, 35, 20, 10, 15, 16, 17, 8, 4, 30$
makhdoom ghaya
asked
in
DS
Feb 13, 2015
by
makhdoom ghaya
5.3k
views
gatecse-2015-set1
data-structures
heap
easy
50
votes
7
answers
25
GATE CSE 2015 Set 1 | Question: 31
Consider the following C function. int fun1 (int n) { int i, j, k, p, q = 0; for (i = 1; i < n; ++i) { p = 0; for (j = n; j > 1; j = j/2) ++p; for (k = 1; k < p; k = k * 2) ++q; } return q; } Which one of the following most closely approximates the return value of the function $\text{fun1}$? $n^3$ $n(\log n)^2$ $n \log n$ $n \log(\log n)$
makhdoom ghaya
asked
in
Algorithms
Feb 13, 2015
by
makhdoom ghaya
14.8k
views
gatecse-2015-set1
algorithms
normal
identify-function
43
votes
9
answers
26
GATE CSE 2015 Set 1 | Question: 29
Consider a LAN with four nodes $S_1, S_2, S_3,$ and $S_4$. Time is divided into fixed-size slots, and a node can begin its transmission only at the beginning of a slot. A collision is said to have occurred if more than ... respectively. The probability of sending a frame in the first slot without any collision by any of these four stations is__________________.
makhdoom ghaya
asked
in
Computer Networks
Feb 13, 2015
by
makhdoom ghaya
9.5k
views
gatecse-2015-set1
computer-networks
normal
numerical-answers
congestion-control
39
votes
4
answers
27
GATE CSE 2015 Set 1 | Question: 26
$\sum\limits_{x=1}^{99}\frac{1}{x(x+1)}$ = ______.
makhdoom ghaya
asked
in
Combinatory
Feb 13, 2015
by
makhdoom ghaya
5.7k
views
gatecse-2015-set1
combinatory
normal
numerical-answers
summation
20
votes
3
answers
28
GATE CSE 2015 Set 1 | Question: 21
Suppose that everyone in a group on $N$ people wants to communicate secretly with the $(\text{N - 1})$ others using symmetric Key cryptographic system. The communication between any two person should not be decodable by the others in the group. The numbers of keys required ... satisfy the confidentiality requirement is $2N$ $N(N-1)$ $\dfrac{N(N-1)}{2}$ $(N-1)^{2}$
makhdoom ghaya
asked
in
Computer Networks
Feb 13, 2015
by
makhdoom ghaya
5.8k
views
gatecse-2015-set1
computer-networks
network-security
normal
out-of-gate-syllabus
29
votes
5
answers
29
GATE CSE 2015 Set 1 | Question: 18
In the LU decomposition of the matrix $\begin{bmatrix}2 & 2 \\ 4 & 9\end{bmatrix}$, if the diagonal elements of $U$ are both $1$, then the lower diagonal entry $l_{22}$ of $L$ is_________________.
makhdoom ghaya
asked
in
Linear Algebra
Feb 13, 2015
by
makhdoom ghaya
7.7k
views
gatecse-2015-set1
linear-algebra
matrix
numerical-answers
58
votes
5
answers
30
GATE CSE 2015 Set 1 | Question: 16
For a set $A$, the power set of $A$ is denoted by $2^{A}$. If $A = \left\{5,\left\{6\right\}, \left\{7\right\}\right\}$, which of the following options are TRUE? $\varnothing \in 2^{A}$ $\varnothing \subseteq 2^{A}$ ... I and III only II and III only I, II and III only I, II and IV only
makhdoom ghaya
asked
in
Set Theory & Algebra
Feb 13, 2015
by
makhdoom ghaya
11.9k
views
gatecse-2015-set1
set-theory&algebra
set-theory
normal
Page:
1
2
3
next »
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
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
POWER GRID CORPORATION OF INDIA LIMITED
INSTITUTE OF BANKING PERSONNEL SELECTION
GATE Overflow books for TIFR, ISRO, UGCNET and NIELIT
RECRUITMENT IN OIL AND GAS CORPORATION LIMITED
Aptitude Overflow Book
Subjects
All categories
General Aptitude
(2.4k)
Engineering Mathematics
(9.1k)
Digital Logic
(3.2k)
Programming and DS
(5.8k)
Algorithms
(4.5k)
Theory of Computation
(6.6k)
Compiler Design
(2.3k)
Operating System
(4.9k)
Databases
(4.5k)
CO and Architecture
(3.7k)
Computer Networks
(4.5k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(647)
Exam Queries
(841)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(855)
Recent questions tagged gatecse-2015-set1
Recent Blog Comments
@abir_banerjee Thanks Abir. I'm third year...
@nolan_keats Currently I am in third year...
@abir_banerjee thank you Abir.Supposing you...
@nolan_keats just a suggestion as I also...
@abir_banerjee Hope I can do this in span of one...