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-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
TUSHAR_BHATT
asked
in
Theory of Computation
Jan 11, 2019
by
TUSHAR_BHATT
363
views
gatecse-2015-set2
gateit-2005
self-doubt
76
votes
3
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)$
go_editor
asked
in
Mathematical Logic
Feb 13, 2015
by
go_editor
14.1k
views
gatecse-2015-set2
mathematical-logic
normal
first-order-logic
36
votes
4
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 ______.
go_editor
asked
in
Set Theory & Algebra
Feb 13, 2015
by
go_editor
6.1k
views
gatecse-2015-set2
set-theory&algebra
functions
normal
numerical-answers
32
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 _____.
go_editor
asked
in
Theory of Computation
Feb 13, 2015
by
go_editor
12.5k
views
gatecse-2015-set2
theory-of-computation
finite-automata
normal
numerical-answers
minimal-state-automata
72
votes
8
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$
go_editor
asked
in
Computer Networks
Feb 13, 2015
by
go_editor
17.7k
views
gatecse-2015-set2
computer-networks
ip-packet
normal
28
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
go_editor
asked
in
Theory of Computation
Feb 13, 2015
by
go_editor
8.7k
views
gatecse-2015-set2
theory-of-computation
normal
regular-language
46
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
go_editor
asked
in
Graph Theory
Feb 13, 2015
by
go_editor
11.4k
views
gatecse-2015-set2
graph-theory
graph-connectivity
easy
43
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$ ... the disk transfer time, the average time (in milliseconds) to read or write a $512$-byte sector of the disk is _____
go_editor
asked
in
Operating System
Feb 13, 2015
by
go_editor
13.6k
views
gatecse-2015-set2
operating-system
disk
normal
numerical-answers
86
votes
11
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 ______.
go_editor
asked
in
Digital Logic
Feb 13, 2015
by
go_editor
34.7k
views
gatecse-2015-set2
digital-logic
adder
normal
numerical-answers
57
votes
3
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.
go_editor
asked
in
Operating System
Feb 13, 2015
by
go_editor
14.0k
views
gatecse-2015-set2
operating-system
virtual-memory
normal
numerical-answers
49
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
go_editor
asked
in
Databases
Feb 13, 2015
by
go_editor
19.2k
views
gatecse-2015-set2
databases
transaction-and-concurrency
normal
48
votes
6
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)$
go_editor
asked
in
Algorithms
Feb 13, 2015
by
go_editor
12.4k
views
gatecse-2015-set2
algorithms
normal
sorting
72
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 _________.
go_editor
asked
in
CO and Architecture
Feb 13, 2015
by
go_editor
20.5k
views
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
go_editor
asked
in
IS&Software Engineering
Feb 13, 2015
by
go_editor
2.1k
views
gatecse-2015-set2
is&software-engineering
software-testing
normal
53
votes
2
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}$
go_editor
asked
in
CO and Architecture
Feb 13, 2015
by
go_editor
12.8k
views
gatecse-2015-set2
co-and-architecture
machine-instructions
easy
22
votes
5
answers
16
GATE CSE 2015 Set 2 | Question: 41
Consider the following routing table at an IP router: ... -c, iii-e, iv-d i-a, ii-d, iii-b, iv-e i-b, ii-c, iii-d, iv-e i-b, ii-c, iii-e, iv-d
go_editor
asked
in
Computer Networks
Feb 13, 2015
by
go_editor
10.0k
views
gatecse-2015-set2
computer-networks
subnetting
easy
48
votes
12
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 ______.
go_editor
asked
in
Set Theory & Algebra
Feb 13, 2015
by
go_editor
15.5k
views
gatecse-2015-set2
set-theory&algebra
functions
normal
numerical-answers
7
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)) $
go_editor
asked
in
Numerical Methods
Feb 13, 2015
by
go_editor
3.6k
views
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 ________.
go_editor
asked
in
DS
Feb 12, 2015
by
go_editor
7.8k
views
gatecse-2015-set2
data-structures
stack
easy
numerical-answers
48
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]'$
go_editor
asked
in
Digital Logic
Feb 12, 2015
by
go_editor
13.0k
views
gatecse-2015-set2
digital-logic
boolean-algebra
normal
numerical-answers
23
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}$
go_editor
asked
in
Algorithms
Feb 12, 2015
by
go_editor
5.1k
views
gatecse-2015-set2
algorithms
easy
algorithm-design-techniques
51
votes
11
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$
go_editor
asked
in
Theory of Computation
Feb 12, 2015
by
go_editor
14.5k
views
gatecse-2015-set2
theory-of-computation
regular-grammar
normal
64
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}$
go_editor
asked
in
Computer Networks
Feb 12, 2015
by
go_editor
21.4k
views
gatecse-2015-set2
computer-networks
difficult
tcp
62
votes
3
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$
go_editor
asked
in
DS
Feb 12, 2015
by
go_editor
13.0k
views
gatecse-2015-set2
data-structures
hashing
normal
29
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$.
go_editor
asked
in
Databases
Feb 12, 2015
by
go_editor
6.5k
views
gatecse-2015-set2
databases
normal
natural-join
68
votes
8
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 _____.
go_editor
asked
in
DS
Feb 12, 2015
by
go_editor
9.2k
views
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}$
go_editor
asked
in
Operating System
Feb 12, 2015
by
go_editor
5.7k
views
gatecse-2015-set2
operating-system
memory-management
easy
37
votes
6
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$
go_editor
asked
in
Compiler Design
Feb 12, 2015
by
go_editor
19.2k
views
gatecse-2015-set2
compiler-design
intermediate-code
normal
26
votes
5
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.
go_editor
asked
in
Graph Theory
Feb 12, 2015
by
go_editor
6.8k
views
gatecse-2015-set2
graph-theory
graph-isomorphism
out-of-syllabus-now
31
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 _____.
go_editor
asked
in
Linear Algebra
Feb 12, 2015
by
go_editor
5.1k
views
gatecse-2015-set2
linear-algebra
matrix
easy
numerical-answers
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-set2
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...