Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged gatecse-2015-set2
0
votes
0
answers
1
Doubt: gate2005 2015
https://gateoverflow.in/3784/gate2005-it-37 https://gateoverflow.in/8159/gate2015-2-35 (the second answer of this question) both these follow different diagramatic representations how should one go about making these diagrams
https://gateoverflow.in/3784/gate2005-it-37https://gateoverflow.in/8159/gate2015-2-35 (the second answer of this question)both these follow different diagramatic represen...
TUSHAR_BHATT
578
views
TUSHAR_BHATT
asked
Jan 10, 2019
Theory of Computation
gatecse-2015-set2
gateit-2005
self-doubt
+
–
88
votes
5
answers
2
GATE CSE 2015 Set 2 | Question: 55
Which one of the following well-formed formulae is a tautology? $\forall x \, \exists y \, R(x,y) \, \leftrightarrow \, \exists y \, \forall x \, R(x, y)$ ... $\forall x \, \forall y \, P(x,y) \, \rightarrow \, \forall x \, \forall y \, P(y, x)$
Which one of the following well-formed formulae is a tautology? $\forall x \, \exists y \, R(x,y) \, \leftrightarrow \, \exists y \, \forall x \, R(x, y)$$( \forall x \,...
go_editor
20.6k
views
go_editor
asked
Feb 13, 2015
Mathematical Logic
gatecse-2015-set2
mathematical-logic
normal
first-order-logic
+
–
38
votes
5
answers
3
GATE CSE 2015 Set 2 | Question: 54
Let $X$ and $Y$ denote the sets containing $2$ and $20$ distinct objects respectively and $F$ denote the set of all possible functions defined from $X$ to $Y$. Let $f$ be randomly chosen from $F$. The probability of $f$ being one-to-one is ______.
Let $X$ and $Y$ denote the sets containing $2$ and $20$ distinct objects respectively and $F$ denote the set of all possible functions defined from $X$ to $Y$. Let $f$ be...
go_editor
8.2k
views
go_editor
asked
Feb 13, 2015
Set Theory & Algebra
gatecse-2015-set2
set-theory&algebra
functions
normal
numerical-answers
+
–
36
votes
6
answers
4
GATE CSE 2015 Set 2 | Question: 53
The number of states in the minimal deterministic finite automaton corresponding to the regular expression $(0+1)^* (10)$ is _____.
The number of states in the minimal deterministic finite automaton corresponding to the regular expression $(0+1)^* (10)$ is _____.
go_editor
15.5k
views
go_editor
asked
Feb 13, 2015
Theory of Computation
gatecse-2015-set2
theory-of-computation
finite-automata
normal
numerical-answers
minimal-state-automata
+
–
76
votes
9
answers
5
GATE CSE 2015 Set 2 | Question: 52
$\text{Host A}$ sends a $\text{UDP}$ datagram containing $8880\text{ bytes}$ of user data to $\text{host B}$ over an $\text{Ethernet LAN}.$ Ethernet frames may carry data up to $1500\text{ bytes (i.e. MTU = 1500 bytes)}.$ Size of $\text{UDP}$ ... be the contents of offset field in the last fragment? $6$ and $925$ $6$ and $7400$ $7$ and $1110$ $7$ and $8880$
$\text{Host A}$ sends a $\text{UDP}$ datagram containing $8880\text{ bytes}$ of user data to $\text{host B}$ over an $\text{Ethernet LAN}.$ Ethernet frames may carry data...
go_editor
25.4k
views
go_editor
asked
Feb 13, 2015
Computer Networks
gatecse-2015-set2
computer-networks
ip-packet
normal
+
–
30
votes
3
answers
6
GATE CSE 2015 Set 2 | Question: 51
Which of the following is/are regular languages? $L_1: \left\{ wxw^R \mid w, x \in \{a, b\} ^* \text{ and } |w|, |x| > 0\right\}, w^R \text{ is the reverse of string } w$ $L_2: \left\{ a^nb^m \mid m \neq n \text { and } m, n \geq 0 \right\}$ $L_3: \left\{ a^pb^qc^r \mid p, q, r \geq 0 \right\}$ $L_1$ and $L_3$ only $L_2$ only $L_2$ and $L_3$ only $L_3$ only
Which of the following is/are regular languages?$L_1: \left\{ wxw^R \mid w, x \in \{a, b\} ^* \text{ and } |w|, |x| 0\right\}, w^R \text{ is the reverse of string } w$$L...
go_editor
11.0k
views
go_editor
asked
Feb 13, 2015
Theory of Computation
gatecse-2015-set2
theory-of-computation
normal
regular-language
+
–
48
votes
4
answers
7
GATE CSE 2015 Set 2 | Question: 50
In a connected graph, a bridge is an edge whose removal disconnects the graph. Which one of the following statements is true? A tree has no bridges A bridge cannot be part of a simple cycle Every edge of a clique with size $\geq 3$ is a bridge (A clique is any complete subgraph of a graph) A graph with bridges cannot have cycle
In a connected graph, a bridge is an edge whose removal disconnects the graph. Which one of the following statements is true?A tree has no bridgesA bridge cannot be part ...
go_editor
14.5k
views
go_editor
asked
Feb 13, 2015
Graph Theory
gatecse-2015-set2
graph-theory
graph-connectivity
easy
+
–
44
votes
4
answers
8
GATE CSE 2015 Set 2 | Question: 49
Consider a typical disk that rotates at $15000$ rotations per minute (RPM) and has a transfer rate of $50 \times 10^6$ bytes/sec. If the average seek time of the disk is twice the average rotational delay and the controller's transfer time ... the disk transfer time, the average time (in milliseconds) to read or write a $512$-byte sector of the disk is _____
Consider a typical disk that rotates at $15000$ rotations per minute (RPM) and has a transfer rate of $50 \times 10^6$ bytes/sec. If the average seek time of the disk is ...
go_editor
17.5k
views
go_editor
asked
Feb 13, 2015
Operating System
gatecse-2015-set2
operating-system
disk
normal
numerical-answers
+
–
99
votes
12
answers
9
GATE CSE 2015 Set 2 | Question: 48
A half adder is implemented with XOR and AND gates. A full adder is implemented with two half adders and one OR gate. The propagation delay of an XOR gate is twice that of an AND/OR gate. The propagation delay of an AND/OR gate is ... adder is implemented by using four full adders. The total propagation time of this $4$-bit binary adder in microseconds is ______.
A half adder is implemented with XOR and AND gates. A full adder is implemented with two half adders and one OR gate. The propagation delay of an XOR gate is twice that o...
go_editor
58.4k
views
go_editor
asked
Feb 13, 2015
Digital Logic
gatecse-2015-set2
digital-logic
adder
normal
numerical-answers
+
–
66
votes
4
answers
10
GATE CSE 2015 Set 2 | Question: 47
A computer system implements $8\;\text{kilobyte}$ pages and a $32\text{-bit}$ physical address space. Each page table entry contains a valid bit, a dirty bit, three permission bits, and the translation. If the maximum size of the page table of a process is $24\;\text{megabytes}$, the length of the virtual address supported by the system is _______ bits.
A computer system implements $8\;\text{kilobyte}$ pages and a $32\text{-bit}$ physical address space. Each page table entry contains a valid bit, a dirty bit, three permi...
go_editor
18.9k
views
go_editor
asked
Feb 13, 2015
Operating System
gatecse-2015-set2
operating-system
virtual-memory
normal
numerical-answers
+
–
57
votes
5
answers
11
GATE CSE 2015 Set 2 | Question: 46
Consider a simple checkpointing protocol and the following set of operations in the log. (start, T4); (write, T4, y, 2, 3); (start, T1); (commit, T4); (write, T1, z, 5, 7); (checkpoint); (start, T2); (write, T2, x, 1, 9); (commit, T2); (start, T3); ( ... Undo: T3, T1; Redo: T2 Undo: T3, T1; Redo: T2, T4 Undo: none; Redo: T2, T4, T3, T1 Undo: T3, T1, T4; Redo: T2
Consider a simple checkpointing protocol and the following set of operations in the log.(start, T4); (write, T4, y, 2, 3); (start, T1); (commit, T4); (write, T1, z, 5, 7)...
go_editor
24.6k
views
go_editor
asked
Feb 13, 2015
Databases
gatecse-2015-set2
databases
transaction-and-concurrency
normal
+
–
55
votes
7
answers
12
GATE CSE 2015 Set 2 | Question: 45
Suppose you are provided with the following function declaration in the C programming language. int partition(int a[], int n); The function treats the first element of $a[\:]$ as a pivot and rearranges the array so that all elements less than or equal to the pivot is in the ... $(a, $ left_end$, k)$ $(a, n-$left_end$-1, k-$left_end$-1)$ and $(a, $left_end$, k)$
Suppose you are provided with the following function declaration in the C programming language.int partition(int a[], int n);The function treats the first element of $a[\...
go_editor
16.4k
views
go_editor
asked
Feb 13, 2015
Algorithms
gatecse-2015-set2
algorithms
normal
sorting
+
–
81
votes
4
answers
13
GATE CSE 2015 Set 2 | Question: 44
Consider the sequence of machine instruction given below: ... forwarding from the PO stage to the OF stage. The number of clock cycles taken for the execution of the above sequence of instruction is _________.
Consider the sequence of machine instruction given below:$$\begin{array}{ll} \text{MUL} & \text{R5, R0, R1} \\ \text{DIV} & \text{R6, R2, R3} \\ \text{ADD} & \text{R7,...
go_editor
26.2k
views
go_editor
asked
Feb 12, 2015
CO and Architecture
gatecse-2015-set2
co-and-architecture
pipelining
normal
numerical-answers
+
–
3
votes
1
answer
14
GATE CSE 2015 Set 2 | Question: 43
Which one of the following assertions concerning code inspection and code walkthrough is true? Code inspection is carried out once the code has been unit tested Code inspection and code walkthrough are synonyms Adherence to coding standards is checked during code inspection Code walkthrough is usually carried out by an independent test team
Which one of the following assertions concerning code inspection and code walkthrough is true?Code inspection is carried out once the code has been unit testedCode inspec...
go_editor
2.7k
views
go_editor
asked
Feb 12, 2015
IS&Software Engineering
gatecse-2015-set2
is&software-engineering
software-testing
normal
non-gate
out-of-gate-syllabus
+
–
57
votes
3
answers
15
GATE CSE 2015 Set 2 | Question: 42
Consider a processor with byte-addressable memory. Assume that all registers, including program counter (PC) and Program Status Word (PSW), are size of two bytes. A stack in the main memory is implemented from memory location $(0100)_{16}$ and it grows upward. The stack ... value of the stack pointer is: $(016A)_{16}$ $(016C)_{16}$ $(0170)_{16}$ $(0172)_{16}$
Consider a processor with byte-addressable memory. Assume that all registers, including program counter (PC) and Program Status Word (PSW), are size of two bytes. A stack...
go_editor
16.8k
views
go_editor
asked
Feb 12, 2015
CO and Architecture
gatecse-2015-set2
co-and-architecture
machine-instruction
easy
+
–
26
votes
5
answers
16
GATE CSE 2015 Set 2 | Question: 41
Consider the following routing table at an IP router: ... $\text{i-b, ii-c, iii-d, iv-e}$ $\text{i-b, ii-c, iii-e, iv-d}$
Consider the following routing table at an IP router:$$\begin{array}{|l|l|l|} \hline \textbf {Network No} & \textbf {Net Mask} & \textbf{Next Hop} \\\hline \text {128.96...
go_editor
14.1k
views
go_editor
asked
Feb 12, 2015
Computer Networks
gatecse-2015-set2
computer-networks
subnetting
easy
+
–
51
votes
15
answers
17
GATE CSE 2015 Set 2 | Question: 40
The number of onto functions (surjective functions) from set $X = \{1, 2, 3, 4\}$ to set $Y=\{a,b,c\}$ is ______.
The number of onto functions (surjective functions) from set $X = \{1, 2, 3, 4\}$ to set $Y=\{a,b,c\}$ is ______.
go_editor
19.2k
views
go_editor
asked
Feb 12, 2015
Set Theory & Algebra
gatecse-2015-set2
set-theory&algebra
functions
normal
numerical-answers
+
–
8
votes
2
answers
18
GATE CSE 2015 Set 2 | Question: 39
The secant method is used to find the root of an equation $f(x)=0$. It is started from two distinct estimates $x_a$ and $x_b$ for the root. It is an iterative procedure involving linear interpolation to a root. The iteration stops if $f(x_b)$ is very small and then $x_b$ is ... $x_b - (x_b-x_a) f_b / (f_b-f(x_a)) $ $x_a - (x_b-x_a) f_a / (f_b-f(x_a)) $
The secant method is used to find the root of an equation $f(x)=0$. It is started from two distinct estimates $x_a$ and $x_b$ for the root. It is an iterative procedure i...
go_editor
4.7k
views
go_editor
asked
Feb 12, 2015
Numerical Methods
gatecse-2015-set2
numerical-methods
secant-method
+
–
35
votes
4
answers
19
GATE CSE 2015 Set 2 | Question: 38
Consider the C program below #include <stdio.h> int *A, stkTop; int stkFunc (int opcode, int val) { static int size=0, stkTop=0; switch (opcode) { case -1: size = val; break; case 0: if (stkTop < size ) A[stkTop++]=val; break; default ... 0, 10); printf ("%d\n", stkFunc(1, 0)+ stkFunc(1, 0)); } The value printed by the above program is ________.
Consider the C program below#include <stdio.h int *A, stkTop; int stkFunc (int opcode, int val) { static int size=0, stkTop=0; switch (opcode) { case -1: size = val; brea...
go_editor
10.6k
views
go_editor
asked
Feb 12, 2015
DS
gatecse-2015-set2
data-structures
stack
easy
numerical-answers
+
–
56
votes
12
answers
20
GATE CSE 2015 Set 2 | Question: 37
The number of min-terms after minimizing the following Boolean expression is _______. $[D'+AB'+A'C+AC'D+A'C'D]'$
The number of min-terms after minimizing the following Boolean expression is _______.$[D'+AB'+A'C+AC'D+A'C'D]'$
go_editor
18.7k
views
go_editor
asked
Feb 12, 2015
Digital Logic
gatecse-2015-set2
digital-logic
boolean-algebra
normal
numerical-answers
+
–
25
votes
3
answers
21
GATE CSE 2015 Set 2 | Question: 36
Given below are some algorithms, and some algorithm design paradigms. ... $\text{1-iii, 2-ii, 3-i, 4-iv}$ $\text{1-iii, 2-ii, 3-i, 4-v}$
Given below are some algorithms, and some algorithm design paradigms.$$\begin{array}{ll|ll}\hline \text{1.} & \text{Dijkstra's Shortest Path} & \text{i.} & \text{Divide a...
go_editor
6.9k
views
go_editor
asked
Feb 12, 2015
Algorithms
gatecse-2015-set2
algorithms
easy
algorithm-design-technique
match-the-following
+
–
54
votes
13
answers
22
GATE CSE 2015 Set 2 | Question: 35
Consider the alphabet $\Sigma = \{0, 1\}$, the null/empty string $\lambda$ and the set of strings $X_0, X_1, \text{ and } X_2$ generated by the corresponding non-terminals of a regular grammar. $X_0, X_1, \text{ and } X_2$ are related as follows. $X_0 = 1 X_1$ $X_1 = 0 X_1 + 1 X_2$ ... $10(0^*+(10)^*)1$ $10(0^*+(10)^*)^*1$ $1(0+10)^*1$ $10(0+10)^*1 +110(0+10)^*1$
Consider the alphabet $\Sigma = \{0, 1\}$, the null/empty string $\lambda$ and the set of strings $X_0, X_1, \text{ and } X_2$ generated by the corresponding non-terminal...
go_editor
18.7k
views
go_editor
asked
Feb 12, 2015
Theory of Computation
gatecse-2015-set2
theory-of-computation
regular-grammar
normal
+
–
70
votes
5
answers
23
GATE CSE 2015 Set 2 | Question: 34
Assume that the bandwidth for a $\text{TCP}$ connection is $1048560$ bits/sec. Let $\alpha$ be the value of RTT in milliseconds (rounded off to the nearest integer) after which the $\text{TCP}$ window scale option is needed. Let $\beta$ be the maximum possible ... $^{16}$ $500$ milliseconds, $65535$ $\times $2$^{14}$ $500$ milliseconds, $65535$ $\times $2$^{16}$
Assume that the bandwidth for a $\text{TCP}$ connection is $1048560$ bits/sec. Let $\alpha$ be the value of RTT in milliseconds (rounded off to the nearest integer) afte...
go_editor
27.6k
views
go_editor
asked
Feb 12, 2015
Computer Networks
gatecse-2015-set2
computer-networks
difficult
tcp
+
–
72
votes
4
answers
24
GATE CSE 2015 Set 2 | Question: 33
Which one of the following hash functions on integers will distribute keys most uniformly over $10$ buckets numbered $0$ to $9$ for $i$ ranging from $0$ to $2020$? $h(i) = i^2 \text{mod } 10$ $h(i) = i^3 \text{mod } 10$ $h(i) = (11 \ast i^2) \text{mod } 10$ $h(i) = (12 \ast i^2) \text{mod } 10$
Which one of the following hash functions on integers will distribute keys most uniformly over $10$ buckets numbered $0$ to $9$ for $i$ ranging from $0$ to $2020$?$h(i) ...
go_editor
16.9k
views
go_editor
asked
Feb 12, 2015
DS
gatecse-2015-set2
data-structures
hashing
normal
+
–
31
votes
2
answers
25
GATE CSE 2015 Set 2 | Question: 32
Consider two relations $R_1(A,B)$ with the tuples $(1,5), (3,7)$ and $R_2(A,C) = (1,7),(4,9)$. Assume that $R(A,B,C)$ is the full natural outer join of $R_1$ and $R_2$. Consider the following tuples of the form $(A,B,C):$ ... contains all $a, b, c, d, e, f, g$. $R$ contains $e, f, g$ but not $a, b$. $R$ contains $e$ but not $f, g$.
Consider two relations $R_1(A,B)$ with the tuples $(1,5), (3,7)$ and $R_2(A,C) = (1,7),(4,9)$.Assume that $R(A,B,C)$ is the full natural outer join of $R_1$ and $R_2$. Co...
go_editor
8.9k
views
go_editor
asked
Feb 12, 2015
Databases
gatecse-2015-set2
databases
normal
natural-join
+
–
71
votes
9
answers
26
GATE CSE 2015 Set 2 | Question: 31
A Young tableau is a $2D$ array of integers increasing from left to right and from top to bottom. Any unfilled entries are marked with $\infty$, and hence there cannot be any entry to the right of, or below a $\infty$. The following Young tableau ... The minimum number of entries (other than $1$) to be shifted, to remove $1$ from the given Young tableau is _____.
A Young tableau is a $2D$ array of integers increasing from left to right and from top to bottom. Any unfilled entries are marked with $\infty$, and hence there cannot be...
go_editor
13.0k
views
go_editor
asked
Feb 12, 2015
DS
gatecse-2015-set2
databases
array
normal
numerical-answers
+
–
29
votes
3
answers
27
GATE CSE 2015 Set 2 | Question: 30
Consider $6$ memory partitions of sizes $200$ $\text{KB}$, $400$ $\text{KB}$, $600$ $\text{KB}$, $500$ $\text{KB}$, $300$ $\text{KB}$and $250$ $\text{KB}$, where $\text{KB}$refers to $\text{kilobyte}$. These partitions need to be allotted to four processes of ... and $250$ $\text{KB}$ $250$ $\text{KB}$ and $300$ $\text{KB}$ $300$ $\text{KB}$ and $400$ $\text{KB}$
Consider $6$ memory partitions of sizes $200$ $\text{KB}$, $400$ $\text{KB}$, $600$ $\text{KB}$, $500$ $\text{KB}$, $300$ $\text{KB}$and $250$ $\text{KB}$, where $\text{K...
go_editor
7.2k
views
go_editor
asked
Feb 12, 2015
Operating System
gatecse-2015-set2
operating-system
memory-management
easy
+
–
41
votes
7
answers
28
GATE CSE 2015 Set 2 | Question: 29
Consider the intermediate code given below. (1) i=1 (2) j=1 (3) t1 = 5 * i (4) t2 = t1 + j (5) t3 = 4 * t2 (6) t4 = t3 (7) a[t4] = -1 (8) j = j + 1 (9) if j <= 5 goto (3) (10) i = i +1 (11) if i < 5 goto (2) The number of nodes and edges in control-flow-graph constructed for the above code, respectively, are $5$ and $7$ $6$ and $7$ $5$ and $5$ $7$ and $8$
Consider the intermediate code given below.(1) i=1 (2) j=1 (3) t1 = 5 * i (4) t2 = t1 + j (5) t3 = 4 * t2 (6) t4 = t3 (7) a[t4] = -1 (8) j = j + 1 (9) if j <= 5 goto (3) ...
go_editor
25.5k
views
go_editor
asked
Feb 12, 2015
Compiler Design
gatecse-2015-set2
compiler-design
intermediate-code
normal
+
–
28
votes
6
answers
29
GATE CSE 2015 Set 2 | Question: 28
A graph is self-complementary if it is isomorphic to its complement. For all self-complementary graphs on $n$ vertices, $n$ is A multiple of 4 Even Odd Congruent to 0 $mod$ 4, or, 1 $mod$ 4.
A graph is self-complementary if it is isomorphic to its complement. For all self-complementary graphs on $n$ vertices, $n$ isA multiple of 4EvenOddCongruent to 0 $mod$ 4...
go_editor
12.8k
views
go_editor
asked
Feb 12, 2015
Graph Theory
gatecse-2015-set2
graph-theory
graph-isomorphism
out-of-syllabus-now
+
–
35
votes
4
answers
30
GATE CSE 2015 Set 2 | Question: 27
Perform the following operations on the matrix $\begin{bmatrix} 3 & 4 & 45 \\ 7 & 9 & 105 \\ 13 & 2 & 195 \end{bmatrix}$ Add the third row to the second row Subtract the third column from the first column. The determinant of the resultant matrix is _____.
Perform the following operations on the matrix $\begin{bmatrix} 3 & 4 & 45 \\ 7 & 9 & 105 \\ 13 & 2 & 195 \end{bmatrix}$Add the third row to the second rowSubtract the th...
go_editor
7.3k
views
go_editor
asked
Feb 12, 2015
Linear Algebra
gatecse-2015-set2
linear-algebra
matrix
easy
numerical-answers
+
–
Page:
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register