Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged gatecse-2004
55
votes
8
answers
1
GATE CSE 2004 | Question: 57
Consider three IP networks $A, B$ and $C$. Host $H_A$ in network $A$ sends messages each containing $180$ $bytes$ of application data to a host $H_C$ in network $C$. The TCP layer prefixes $20$ byte header to the message. This passes through an intermediate network $B$ ... overheads. $325.5$ $\text{Kbps}$ $354.5$ $\text{Kbps}$ $409.6$ $\text{Kbps}$ $512.0$ $\text{Kbps}$
Consider three IP networks $A, B$ and $C$. Host $H_A$ in network $A$ sends messages each containing $180$ $bytes$ of application data to a host $H_C$ in network $C$. The ...
go_editor
18.8k
views
go_editor
asked
Apr 24, 2016
Computer Networks
gatecse-2004
computer-networks
ip-addressing
tcp
normal
+
–
59
votes
4
answers
2
GATE CSE 2004 | Question: 64
Consider the following program segment for a hypothetical CPU having three user registers $R_1, R_2$ and $R_3.$ ... }\\\hline \end{array} The total number of clock cycles required to execute the program is $29$ $24$ $23$ $20$
Consider the following program segment for a hypothetical CPU having three user registers $R_1, R_2$ and $R_3.$\begin{array}{|l|l|c|} \hline \text {Instruction} & \text...
go_editor
19.5k
views
go_editor
asked
Apr 24, 2016
CO and Architecture
gatecse-2004
co-and-architecture
machine-instruction
normal
+
–
49
votes
4
answers
3
GATE CSE 2004 | Question: 10
Consider the grammar rule $E \rightarrow E1 - E2$ for arithmetic expressions. The code generated is targeted to a CPU having a single user register. The subtraction operation requires the first operand to be in the register. If $E1$ and $E2$ do ... Evaluation of $E1$ and $E2$ should necessarily be interleaved Order of evaluation of $E1$ and $E2$ is of no consequence
Consider the grammar rule $E \rightarrow E1 – E2$ for arithmetic expressions. The code generated is targeted to a CPU having a single user register. The subtraction...
Vikrant Singh
13.4k
views
Vikrant Singh
asked
Nov 12, 2014
Compiler Design
gatecse-2004
compiler-design
target-code-generation
normal
+
–
26
votes
5
answers
4
GATE CSE 2004 | Question: 90
Choose the best matching between the programming styles in Group 1 and their characteristics in Group 2. ... $P-3\quad Q-4 \quad R-1\quad S-2$ $P-3\quad Q-4\quad R-2\quad S-1$
Choose the best matching between the programming styles in Group 1 and their characteristics in Group 2.$$\begin{array}{|ll|ll|}\hline \rlap{\textbf{Group 1}} & & \rlap{...
Kathleen
6.9k
views
Kathleen
asked
Sep 18, 2014
Programming in C
gatecse-2004
programming
normal
programming-paradigms
match-the-following
+
–
52
votes
3
answers
5
GATE CSE 2004 | Question: 89
$L_1$ is a recursively enumerable language over $\Sigma$. An algorithm $A$ effectively enumerates its words as $\omega_1, \omega_2, \omega_3, \dots .$ Define another language $L_2$ over $\Sigma \cup \left\{\text{#}\right\}$ ... $S_1$ is true but $S_2$ is not necessarily true $S_2$ is true but $S_1$ is not necessarily true Neither is necessarily true
$L_1$ is a recursively enumerable language over $\Sigma$. An algorithm $A$ effectively enumerates its words as $\omega_1, \omega_2, \omega_3, \dots .$ Define another lang...
Kathleen
11.0k
views
Kathleen
asked
Sep 18, 2014
Theory of Computation
gatecse-2004
theory-of-computation
turing-machine
difficult
+
–
23
votes
2
answers
6
GATE CSE 2004 | Question: 88
Consider the following grammar G: $S \rightarrow bS \mid aA \mid b$ $A \rightarrow bA \mid aB$ $B \rightarrow bB \mid aS \mid a$ Let $N_a(w)$ and $N_b(w)$ denote the number of a's and b's in a string $\omega$ respectively. The language $L(G)$ ... $\left\{w \mid N_b(w) = 3k, k \in \left\{0, 1, 2, \right\}\right\}$
Consider the following grammar G:$S \rightarrow bS \mid aA \mid b$$A \rightarrow bA \mid aB$$B \rightarrow bB \mid aS \mid a$Let $N_a(w)$ and $N_b(w)$ denote the number o...
Kathleen
7.1k
views
Kathleen
asked
Sep 18, 2014
Compiler Design
gatecse-2004
compiler-design
grammar
normal
+
–
25
votes
4
answers
7
GATE CSE 2004 | Question: 87
The language $\left\{a^mb^nc^{m+n} \mid m, n \geq1\right\}$ is regular context-free but not regular context-sensitive but not context free type-0 but not context sensitive
The language $\left\{a^mb^nc^{m+n} \mid m, n \geq1\right\}$ isregularcontext-free but not regularcontext-sensitive but not context freetype-0 but not context sensitive
Kathleen
7.0k
views
Kathleen
asked
Sep 18, 2014
Theory of Computation
gatecse-2004
theory-of-computation
normal
identify-class-language
+
–
38
votes
4
answers
8
GATE CSE 2004 | Question: 86
The following finite state machine accepts all those binary strings in which the number of $1$’s and $0$’s are respectively: divisible by $3$ and $2$ odd and even even and odd divisible by $2$ and $3$
The following finite state machine accepts all those binary strings in which the number of $1$’s and $0$’s are respectively: divisible by $3$ and $2$odd and evene...
Kathleen
8.3k
views
Kathleen
asked
Sep 18, 2014
Theory of Computation
gatecse-2004
theory-of-computation
finite-automata
easy
+
–
103
votes
11
answers
9
GATE CSE 2004 | Question: 85
A program takes as input a balanced binary search tree with $n$ leaf nodes and computes the value of a function $g(x)$ for each node $x$. If the cost of computing $g(x)$ ... time complexity of the program is? $\Theta (n)$ $\Theta (n \log n)$ $\Theta(n^2)$ $\Theta (n^2\log n)$
A program takes as input a balanced binary search tree with $n$ leaf nodes and computes the value of a function $g(x)$ for each node $x$. If the cost of computing $g(x)$ ...
Kathleen
31.4k
views
Kathleen
asked
Sep 18, 2014
DS
gatecse-2004
binary-search-tree
normal
data-structures
+
–
47
votes
7
answers
10
GATE CSE 2004 | Question: 84
The recurrence equation $ T(1) = 1$ $T(n) = 2T(n-1) + n, n \geq 2$ evaluates to $2^{n+1} - n - 2$ $2^n - n$ $2^{n+1} - 2n - 2$ $2^n + n $
The recurrence equation$ T(1) = 1$$T(n) = 2T(n-1) + n, n \geq 2$evaluates to$2^{n+1} - n - 2$$2^n - n$$2^{n+1} - 2n - 2$$2^n + n $
Kathleen
17.3k
views
Kathleen
asked
Sep 18, 2014
Algorithms
gatecse-2004
algorithms
recurrence-relation
normal
+
–
31
votes
6
answers
11
GATE CSE 2004 | Question: 83, ISRO2015-40
The time complexity of the following C function is (assume $n > 0$) int recursive (int n) { if(n == 1) return (1); else return (recursive (n-1) + recursive (n-1)); } $O(n)$ $O(n \log n)$ $O(n^2)$ $O(2^n)$
The time complexity of the following C function is (assume $n 0$)int recursive (int n) { if(n == 1) return (1); else return (recursive (n-1) + recursive (n-1)); }$O(n)$$...
Kathleen
19.3k
views
Kathleen
asked
Sep 18, 2014
Algorithms
gatecse-2004
algorithms
recurrence-relation
time-complexity
normal
isro2015
+
–
66
votes
13
answers
12
GATE CSE 2004 | Question: 82
Let $A[1,\ldots,n]$ be an array storing a bit ($1$ or $0$) at each location, and $f(m)$ is a function whose time complexity is $\Theta(m)$. Consider the following program fragment written in a C like language: counter = 0; for (i=1; i<=n; i++) { if ( ... The complexity of this program fragment is $\Omega(n^2)$ $\Omega (n\log n) \text{ and } O(n^2)$ $\Theta(n)$ $o(n)$
Let $A[1,\ldots,n]$ be an array storing a bit ($1$ or $0$) at each location, and $f(m)$ is a function whose time complexity is $\Theta(m)$. Consider the following program...
Kathleen
20.0k
views
Kathleen
asked
Sep 18, 2014
Algorithms
gatecse-2004
algorithms
time-complexity
normal
+
–
55
votes
11
answers
13
GATE CSE 2004 | Question: 81
Let $G_1=(V,E_1)$ and $G_2 =(V,E_2)$ be connected graphs on the same vertex set $V$ with more than two vertices. If $G_1 \cap G_2= (V,E_1\cap E_2)$ is not a connected graph, then the graph $G_1\cup G_2=(V,E_1\cup E_2)$ cannot have a cut vertex must have a cycle must have a cut-edge (bridge) has chromatic number strictly greater than those of $G_1$ and $G_2$
Let $G_1=(V,E_1)$ and $G_2 =(V,E_2)$ be connected graphs on the same vertex set $V$ with more than two vertices. If $G_1 \cap G_2= (V,E_1\cap E_2)$ is not a connected gr...
Kathleen
11.7k
views
Kathleen
asked
Sep 18, 2014
Algorithms
gatecse-2004
algorithms
graph-algorithms
normal
+
–
31
votes
4
answers
14
GATE CSE 2004 | Question: 80
A point is randomly selected with uniform probability in the $X-Y$ plane within the rectangle with corners at $(0,0), (1,0), (1,2)$ and $(0,2).$ If $p$ is the length of the position vector of the point, the expected value of $p^{2}$ is $\left(\dfrac{2}{3}\right)$ $\quad 1$ $\left(\dfrac{4}{3}\right)$ $\left(\dfrac{5}{3}\right)$
A point is randomly selected with uniform probability in the $X-Y$ plane within the rectangle with corners at $(0,0), (1,0), (1,2)$ and $(0,2).$ If $p$ is the length of t...
Kathleen
9.5k
views
Kathleen
asked
Sep 18, 2014
Probability
gatecse-2004
probability
uniform-distribution
expectation
normal
+
–
86
votes
8
answers
15
GATE CSE 2004 | Question: 79
How many graphs on $n$ labeled vertices exist which have at least $\frac{(n^2 - 3n)}{ 2}$ edges ? $^{\left(\frac{n^2-n}{2}\right)}C_{\left(\frac{n^2-3n} {2}\right)}$ $^{{\large\sum\limits_{k=0}^{\left (\frac{n^2-3n}{2} \right )}}.\left(n^2-n\right)}C_k$ $^{\left(\frac{n^2-n}{2}\right)}C_n$ $^{{\large\sum\limits_{k=0}^n}.\left(\frac{n^2-n}{2}\right)}C_k$
How many graphs on $n$ labeled vertices exist which have at least $\frac{(n^2 - 3n)}{ 2}$ edges ?$^{\left(\frac{n^2-n}{2}\right)}C_{\left(\frac{n^2-3n} {2}\right)}$$^{{\l...
Kathleen
14.2k
views
Kathleen
asked
Sep 18, 2014
Graph Theory
gatecse-2004
graph-theory
combinatory
normal
counting
+
–
26
votes
6
answers
16
GATE CSE 2004 | Question: 78
Two $n$ bit binary strings, $S_1$ and $S_2$ are chosen randomly with uniform probability. The probability that the Hamming distance between these strings (the number of bit positions where the two strings differ) is equal to $d$ is $\dfrac{^{n}C_{d}}{2^{n}}$ $\dfrac{^{n}C_{d}}{2^{d}}$ $\dfrac{d}{2^{n}}$ $\dfrac{1}{2^{d}}$
Two $n$ bit binary strings, $S_1$ and $S_2$ are chosen randomly with uniform probability. The probability that the Hamming distance between these strings (the number of b...
Kathleen
7.3k
views
Kathleen
asked
Sep 18, 2014
Probability
gatecse-2004
probability
normal
uniform-distribution
+
–
37
votes
7
answers
17
GATE CSE 2004 | Question: 77
The minimum number of colours required to colour the following graph, such that no two adjacent vertices are assigned the same color, is $2$ $3$ $4$ $5$
The minimum number of colours required to colour the following graph, such that no two adjacent vertices are assigned the same color, is$2$$3$$4$$5$
Kathleen
12.6k
views
Kathleen
asked
Sep 18, 2014
Graph Theory
gatecse-2004
graph-theory
graph-coloring
easy
+
–
35
votes
4
answers
18
GATE CSE 2004 | Question: 76
In an $M \times N$ matrix all non-zero entries are covered in $a$ rows and $b$ columns. Then the maximum number of non-zero entries, such that no two are on the same row or column, is $\leq a +b$ $\leq \max(a, b)$ $\leq \min(M-a, N-b)$ $\leq \min(a, b)$
In an $M \times N$ matrix all non-zero entries are covered in $a$ rows and $b$ columns. Then the maximum number of non-zero entries, such that no two are on the same row ...
Kathleen
9.5k
views
Kathleen
asked
Sep 18, 2014
Linear Algebra
gatecse-2004
linear-algebra
normal
matrix
+
–
65
votes
9
answers
19
GATE CSE 2004 | Question: 75
Mala has the colouring book in which each English letter is drawn two times. She wants to paint each of these $52$ prints with one of $k$ colours, such that the colour pairs used to colour any two letters are different. Both prints of a letter can also be coloured with the same colour. What is the minimum value of $k$ that satisfies this requirement? $9$ $8$ $7$ $6$
Mala has the colouring book in which each English letter is drawn two times. She wants to paint each of these $52$ prints with one of $k$ colours, such that the colour pa...
Kathleen
16.5k
views
Kathleen
asked
Sep 18, 2014
Combinatory
gatecse-2004
combinatory
+
–
35
votes
4
answers
20
GATE CSE 2004 | Question: 74
An examination paper has $150$ multiple choice questions of one mark each, with each question having four choices. Each incorrect answer fetches $-0.25$ marks. Suppose $1000$ students choose all their answers randomly with uniform probability. The sum total of the expected marks obtained by all these students is $0$ $2550$ $7525$ $9375$
An examination paper has $150$ multiple choice questions of one mark each, with each question having four choices. Each incorrect answer fetches $-0.25$ marks. Suppose $1...
Kathleen
8.8k
views
Kathleen
asked
Sep 18, 2014
Probability
gatecse-2004
probability
expectation
normal
+
–
42
votes
8
answers
21
GATE CSE 2004 | Question: 73
The inclusion of which of the following sets into $S = \left\{ \left\{1, 2\right\}, \left\{1, 2, 3\right\}, \left\{1, 3, 5\right\}, \left\{1, 2, 4\right\}, \left\{1, 2, 3, 4, 5\right\} \right\} $ is necessary and sufficient to make $S$ a complete lattice under the partial order defined by ... $\{1\}, \{1, 3\}$ $\{1\}, \{1, 3\}, \{1, 2, 3, 4\}, \{1, 2, 3, 5\}$
The inclusion of which of the following sets into$S = \left\{ \left\{1, 2\right\}, \left\{1, 2, 3\right\}, \left\{1, 3, 5\right\}, \left\{1, 2, 4\right\}, \left\{1, 2, 3,...
Kathleen
12.8k
views
Kathleen
asked
Sep 18, 2014
Set Theory & Algebra
gatecse-2004
set-theory&algebra
partial-order
normal
+
–
40
votes
4
answers
22
GATE CSE 2004 | Question: 72
The following is the incomplete operation table of a $4-$ ... last row of the table is $c\;a\;e\; b$ $c\; b\; a\; e$ $c\; b\; e\; a$ $c\; e\; a\; b$
The following is the incomplete operation table of a $4-$element group.$$\begin{array}{|l|l|l|l|l|} \hline \textbf{*} & \textbf{e}& \textbf{a} &\textbf{b} & \textbf{c}\\\...
Kathleen
6.7k
views
Kathleen
asked
Sep 18, 2014
Set Theory & Algebra
gatecse-2004
set-theory&algebra
group-theory
normal
+
–
28
votes
4
answers
23
GATE CSE 2004 | Question: 71
How many solutions does the following system of linear equations have? $-x + 5y = -1$ $x - y = 2$ $x + 3y = 3$ infinitely many two distinct solutions unique none
How many solutions does the following system of linear equations have?$-x + 5y = -1$$x - y = 2$$x + 3y = 3$infinitely manytwo distinct solutionsuniquenone
Kathleen
8.3k
views
Kathleen
asked
Sep 18, 2014
Linear Algebra
gatecse-2004
linear-algebra
system-of-equations
normal
+
–
32
votes
5
answers
24
GATE CSE 2004 | Question: 70
The following propositional statement is $\left(P \implies \left(Q \vee R\right)\right) \implies \left(\left(P \wedge Q \right)\implies R\right)$ satisfiable but not valid valid a contradiction None of the above
The following propositional statement is $\left(P \implies \left(Q \vee R\right)\right) \implies \left(\left(P \wedge Q \right)\implies R\right)$ satisfiable but not v...
Kathleen
7.4k
views
Kathleen
asked
Sep 18, 2014
Mathematical Logic
gatecse-2004
mathematical-logic
normal
propositional-logic
+
–
35
votes
3
answers
25
GATE CSE 2004 | Question: 69
A 4-stage pipeline has the stage delays as $150$, $120$, $160$ and $140$ $nanoseconds$, respectively. Registers that are used between the stages have a delay of $5$ $nanoseconds$ ... be: $\text{120.4 microseconds}$ $\text{160.5 microseconds}$ $\text{165.5 microseconds}$ $\text{590.0 microseconds}$
A 4-stage pipeline has the stage delays as $150$, $120$, $160$ and $140$ $nanoseconds$, respectively. Registers that are used between the stages have a delay of $5$ $nano...
Kathleen
20.3k
views
Kathleen
asked
Sep 18, 2014
CO and Architecture
gatecse-2004
co-and-architecture
pipelining
normal
+
–
52
votes
10
answers
26
GATE CSE 2004 | Question: 68
A hard disk with a transfer rate of $10$ Mbytes/second is constantly transferring data to memory using DMA. The processor runs at $600$ MHz, and takes $300$ and $900$ ... percentage of processor time consumed for the transfer operation? $5.0 \%$ $1.0\%$ $0.5\%$ $0.1\%$
A hard disk with a transfer rate of $10$ Mbytes/second is constantly transferring data to memory using DMA. The processor runs at $600$ MHz, and takes $300$ and $900$ clo...
Kathleen
26.8k
views
Kathleen
asked
Sep 18, 2014
CO and Architecture
gatecse-2004
dma
normal
co-and-architecture
+
–
39
votes
2
answers
27
GATE CSE 2004 | Question: 67
The microinstructions stored in the control memory of a processor have a width of $26$ bits. Each microinstruction is divided into three fields: a micro-operation field of $13$ bits, a next address field $(X),$ and a MUX select field $(Y).$ There are $8$ status bits in the ... of the control memory in number of words? $10, 3, 1024$ $8, 5, 256$ $5, 8, 2048$ $10, 3, 512$
The microinstructions stored in the control memory of a processor have a width of $26$ bits. Each microinstruction is divided into three fields: a micro-operation field o...
Kathleen
13.4k
views
Kathleen
asked
Sep 18, 2014
CO and Architecture
gatecse-2004
co-and-architecture
microprogramming
normal
+
–
27
votes
5
answers
28
GATE CSE 2004 | Question: 66
Let $A = 1111 1010$ and $B = 0000 1010$ be two $8-bit$ $2’s$ complement numbers. Their product in $2’s$ complement is $1100 0100$ $1001 1100$ $1010 0101$ $1101 0101$
Let $A = 1111 1010$ and $B = 0000 1010$ be two $8-bit$ $2’s$ complement numbers. Their product in $2’s$ complement is$1100 0100$$1001 1100$$1010 0101$$1101 0101$
Kathleen
19.0k
views
Kathleen
asked
Sep 18, 2014
Digital Logic
gatecse-2004
digital-logic
number-representation
easy
+
–
17
votes
3
answers
29
GATE CSE 2004 | Question: 65
Consider a small two-way set-associative cache memory, consisting of four blocks. For choosing the block to be replaced, use the least recently used (LRU) scheme. The number of cache misses for the following sequence of block addresses is: $8, 12, 0, 12, 8$. $2$ $3$ $4$ $5$
Consider a small two-way set-associative cache memory, consisting of four blocks. For choosing the block to be replaced, use the least recently used (LRU) scheme. The num...
Kathleen
15.1k
views
Kathleen
asked
Sep 18, 2014
CO and Architecture
gatecse-2004
co-and-architecture
cache-memory
normal
+
–
70
votes
4
answers
30
GATE CSE 2004 | Question: 63
Consider the following program segment for a hypothetical CPU having three user registers $R_1, R_2$ and $R_3.$ ... after executing the HALT instruction, the return address (in decimal) saved in the stack will be $1007$ $1020$ $1024$ $1028$
Consider the following program segment for a hypothetical CPU having three user registers $R_1, R_2$ and $R_3.$ $$\begin{array}{|l|l|c|} \hline \text {Instruction} & \t...
Kathleen
28.9k
views
Kathleen
asked
Sep 18, 2014
CO and Architecture
gatecse-2004
co-and-architecture
machine-instruction
normal
+
–
Page:
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register