The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
All Activity
Questions
Unanswered
Tags
Categories
Users
Ask a Question
Prev
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions. For hardcopy of previous year questions please see
here
Recent questions tagged gate20152
0
votes
0
answers
1
Doubt: gate2005 2015
https://gateoverflow.in/3784/gate2005it37 https://gateoverflow.in/8159/gate2015235 (the second answer of this question) both these follow different diagramatic representations how should one go about making these diagrams
asked
Jan 11
in
Theory of Computation
by
TUSHAR_BHATT
Junior
(
999
points)

59
views
gate20152
gate2005it
selfdoubt
+43
votes
2
answers
2
GATE2015255
Which one of the following wellformed 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)$
asked
Feb 13, 2015
in
Mathematical Logic
by
jothee
Veteran
(
98.7k
points)

5.6k
views
gate20152
mathematicallogic
normal
firstorderlogic
+24
votes
3
answers
3
GATE2015254
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 onetoone is ______.
asked
Feb 13, 2015
in
Set Theory & Algebra
by
jothee
Veteran
(
98.7k
points)

2.4k
views
gate20152
settheory&algebra
functions
normal
numericalanswers
+23
votes
4
answers
4
GATE2015253
The number of states in the minimal deterministic finite automaton corresponding to the regular expression $(0+1)^* (10)$ is _____.
asked
Feb 13, 2015
in
Theory of Computation
by
jothee
Veteran
(
98.7k
points)

2.6k
views
gate20152
theoryofcomputation
finiteautomata
normal
numericalanswers
minimalstateautomata
+42
votes
7
answers
5
GATE2015252
$\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}$ ... what will be the contents of offset field in the last fragment? $6$ and $925$ $6$ and $7400$ $7$ and $1110$ $7$ and $8880$
asked
Feb 13, 2015
in
Computer Networks
by
jothee
Veteran
(
98.7k
points)

7.3k
views
gate20152
computernetworks
ippacket
normal
+18
votes
2
answers
6
GATE2015251
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
asked
Feb 13, 2015
in
Theory of Computation
by
jothee
Veteran
(
98.7k
points)

3.1k
views
gate20152
theoryofcomputation
normal
regularlanguages
+31
votes
3
answers
7
GATE2015250
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
asked
Feb 13, 2015
in
Graph Theory
by
jothee
Veteran
(
98.7k
points)

2.9k
views
gate20152
graphtheory
graphconnectivity
easy
+25
votes
3
answers
8
GATE2015249
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 is $10$ times the disk transfer time, the average time (in milliseconds) to read or write a $512$byte sector of the disk is _____
asked
Feb 13, 2015
in
Operating System
by
jothee
Veteran
(
98.7k
points)

4.5k
views
gate20152
operatingsystem
disks
normal
numericalanswers
+43
votes
5
answers
9
GATE2015248
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 1.2 ... carry binary adder is implemented by using four full adders. The total propagation time of this 4bit binary adder in microseconds is ______.
asked
Feb 13, 2015
in
Digital Logic
by
jothee
Veteran
(
98.7k
points)

12k
views
gate20152
digitallogic
adder
normal
numericalanswers
+33
votes
3
answers
10
GATE2015247
A computer system implements $8$ $\text{kilobyte}$ pages and a $32bit$ 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.
asked
Feb 13, 2015
in
Operating System
by
jothee
Veteran
(
98.7k
points)

5.5k
views
gate20152
operatingsystem
virtualmemory
normal
numericalanswers
+30
votes
4
answers
11
GATE2015246
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); (write, T3, z, ... list? Undo: T3, T1; Redo: T2 Undo: T3, T1; Redo: T2, T4 Undo: none; Redo: T2, T4, T3, T1 Undo: T3, T1, T4; Redo: T2
asked
Feb 13, 2015
in
Databases
by
jothee
Veteran
(
98.7k
points)

6.2k
views
gate20152
databases
transactions
normal
+27
votes
3
answers
12
GATE2015245
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 left part of the ... $(a, $ left_end$, k)$ $(a, n$left_end$1, k$left_end$1)$ and $(a, $left_end$, k)$
asked
Feb 13, 2015
in
Algorithms
by
jothee
Veteran
(
98.7k
points)

3.6k
views
gate20152
algorithms
normal
sorting
+45
votes
4
answers
13
GATE2015244
Consider the sequence of machine instruction given below: ... uses operand 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 _________.
asked
Feb 13, 2015
in
CO and Architecture
by
jothee
Veteran
(
98.7k
points)

8.4k
views
gate20152
coandarchitecture
pipelining
normal
numericalanswers
+3
votes
2
answers
14
GATE2015243
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
asked
Feb 13, 2015
in
IS&Software Engineering
by
jothee
Veteran
(
98.7k
points)

849
views
gate20152
is&softwareengineering
softwaretesting
normal
+34
votes
2
answers
15
GATE2015242
Consider a processor with byteaddressable 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 pointer (SP) points ... the value of the stack pointer is: $(016A)_{16}$ $(016C)_{16}$ $(0170)_{16}$ $(0172)_{16}$
asked
Feb 13, 2015
in
CO and Architecture
by
jothee
Veteran
(
98.7k
points)

4.5k
views
gate20152
coandarchitecture
machineinstructions
easy
+13
votes
3
answers
16
GATE2015241
Consider the following routing table at an IP router: $\begin{array}{lll} \hline \textbf {Network No} & \textbf {Net Mask} & \textbf{Next Hop} \\\hline \text {128.96.170.0} & \text{255.255.254.0} & \text{Interface $ ... a, iic, iiie, ivd ia, iid, iiib, ive ib, iic, iiid, ive ib, iic, iiie, ivd
asked
Feb 13, 2015
in
Computer Networks
by
jothee
Veteran
(
98.7k
points)

3.2k
views
gate20152
computernetworks
subnetting
easy
+28
votes
9
answers
17
GATE2015240
The number of onto functions (surjective functions) from set $X = \{1, 2, 3, 4\}$ to set $Y=\{a,b,c\}$ is ______.
asked
Feb 13, 2015
in
Set Theory & Algebra
by
jothee
Veteran
(
98.7k
points)

7.4k
views
gate20152
settheory&algebra
functions
normal
numericalanswers
+7
votes
2
answers
18
GATE2015239
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 the solution. ... $x_b  (x_bx_a) f_b / (f_bf(x_a)) $ $x_a  (x_bx_a) f_a / (f_bf(x_a)) $
asked
Feb 13, 2015
in
Numerical Methods
by
jothee
Veteran
(
98.7k
points)

1.3k
views
gate20152
numericalmethods
secantmethod
normal
+22
votes
3
answers
19
GATE2015238
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: if (stkTop ... stkFunc (0, 10); printf ("%d\n", stkFunc(1, 0)+ stkFunc(1, 0)); } The value printed by the above program is ________.
asked
Feb 12, 2015
in
DS
by
jothee
Veteran
(
98.7k
points)

2.8k
views
gate20152
datastructure
stack
easy
numericalanswers
+26
votes
9
answers
20
GATE2015237
The number of minterms after minimizing the following Boolean expression is _______. [D'+AB'+A'C+AC'D+A'C'D]'
asked
Feb 12, 2015
in
Digital Logic
by
jothee
Veteran
(
98.7k
points)

4.2k
views
gate20152
digitallogic
booleanalgebra
normal
numericalanswers
+16
votes
3
answers
21
GATE2015236
Given below are some algorithms, and some algorithm design paradigms. ... $\text{1iii, 2ii, 3i, 4iv}$ $\text{1iii, 2ii, 3i, 4v}$
asked
Feb 12, 2015
in
Algorithms
by
jothee
Veteran
(
98.7k
points)

1.9k
views
gate20152
algorithms
easy
algorithmdesigntechniques
+28
votes
6
answers
22
GATE2015235
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 nonterminals 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$ ... $X_0$? $10(0^*+(10)^*)1$ $10(0^*+(10)^*)^*1$ $1(0+10)^*1$ $10(0+10)^*1 +110(0+10)^*1$
asked
Feb 12, 2015
in
Theory of Computation
by
jothee
Veteran
(
98.7k
points)

4.1k
views
gate20152
theoryofcomputation
regulargrammar
normal
+29
votes
3
answers
23
GATE2015234
Assume that the bandwidth for a $TCP$ connection is $1048560$ bits/sec. Let $\alpha$ be the value of RTT in milliseconds (rounded off to the nearest integer) after which the $TCP$ window scale option is needed. Let $\beta$ be the maximum possible window size with window scale ... 2$^{16}$ $500$ milliseconds, $65535$ $\times $2$^{14}$ $500$ milliseconds, $65535$ $\times $2$^{16}$
asked
Feb 12, 2015
in
Computer Networks
by
jothee
Veteran
(
98.7k
points)

8.9k
views
gate20152
computernetworks
difficult
tcp
+37
votes
3
answers
24
GATE2015233
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$
asked
Feb 12, 2015
in
DS
by
jothee
Veteran
(
98.7k
points)

3.6k
views
gate20152
datastructure
hashing
normal
+20
votes
2
answers
25
GATE2015232
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$ ... . $R$ 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$.
asked
Feb 12, 2015
in
Databases
by
jothee
Veteran
(
98.7k
points)

2.1k
views
gate20152
databases
normal
naturaljoin
+43
votes
6
answers
26
GATE2015231
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 consists of ... $1$) to be shifted, to remove $1$ from the given Young tableau is _____.
asked
Feb 12, 2015
in
DS
by
jothee
Veteran
(
98.7k
points)

3.3k
views
gate20152
databases
arrays
normal
numericalanswers
+20
votes
4
answers
27
GATE2015230
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 sizes $357$ ... $250$ $\text{KB}$ $250$ $\text{KB}$ and $300$ $\text{KB}$ $300$ $\text{KB}$ and $400$ $\text{KB}$
asked
Feb 12, 2015
in
Operating System
by
jothee
Veteran
(
98.7k
points)

1.7k
views
gate20152
operatingsystem
memorymanagement
easy
+25
votes
5
answers
28
GATE2015229
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 controlflowgraph constructed for the above code, respectively, are 5 and 7 6 and 7 5 and 5 7 and 8
asked
Feb 12, 2015
in
Compiler Design
by
jothee
Veteran
(
98.7k
points)

6.2k
views
gate20152
compilerdesign
intermediatecode
normal
outofsyllabusnow
+15
votes
3
answers
29
GATE2015228
A graph is selfcomplementary if it is isomorphic to its complement. For all selfcomplementary graphs on $n$ vertices, $n$ is A multiple of 4 Even Odd Congruent to 0 $mod$ 4, or, 1 $mod$ 4.
asked
Feb 12, 2015
in
Graph Theory
by
jothee
Veteran
(
98.7k
points)

2.6k
views
gate20152
graphtheory
graphisomorphism
outofsyllabusnow
+20
votes
4
answers
30
GATE2015227
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 _____.
asked
Feb 12, 2015
in
Linear Algebra
by
jothee
Veteran
(
98.7k
points)

1.8k
views
gate20152
linearalgebra
matrices
easy
numericalanswers
Page:
1
2
3
next »
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
ISI MTECH CS 2019 INTERVIEW EXPERIENCE
IIT HYDERABAD MTECH TA INTERVIEW EXPERIENCE
How to prepare for GATE with a fulltime job??
Interview Experience at IISc
All subject Gate notes from Standard Books!!
Follow @csegate
Recent questions tagged gate20152
Recent Blog Comments
Refund time depends on the payment mode ...
@Arjun Sir , when can i expect my refund in the...
This book is returned you can enable a pay now...
@Pranavcool The book stocks are over and no one...
@Lokesh Thats unfortunate. I have refunded you....
49,830
questions
54,807
answers
189,530
comments
80,840
users