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

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
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 gate20142
+6
votes
2
answers
1
Modified GATE2014236
Let $L=\left \{ w\in\{0,1\}^*  \text{number of occurances of }(110)=\text{number of occurances of}(011) \right \}$ What is $L$? I think $L$ is regular . Regular expression is : $L=\left \{ 0^{*}+1^{*}+\left ( \left ( \varepsilon +0+1 \right ) \left ( \varepsilon +0+1 \right ) \right ) + 0^{*}\left ( 0110 \right )^*0^{*}+1^* \left ( 11011 \right )^{*}1^{*} \right \}$
asked
Oct 9, 2017
in
Theory of Computation
by
sourav.
Boss
(
16.2k
points)

509
views
gate20142
theoryofcomputation
regularlanguages
normal
+35
votes
3
answers
2
GATE2014255
Consider the main memory system that consists of $8$ memory modules attached to the system bus, which is one word wide. When a write request is made, the bus is occupied for $100$ nanoseconds (ns) by the data, address, and control signals. During the same ... the bus at any time. The maximum number of stores (of one word each) that can be initiated in $1$ millisecond is ________
asked
Sep 28, 2014
in
Operating System
by
jothee
Veteran
(
106k
points)

4.6k
views
gate20142
operatingsystem
memorymanagement
numericalanswers
normal
+30
votes
4
answers
3
GATE2014254
SQL allows duplicate tuples in relations, and correspondingly defines the multiplicity of tuples in the result of joins. Which one of the following queries always gives the same answer as the nested query shown below: select * from R where a in (select S.a from S) select R.* from R, S ... (select distinct a from S) as S1 where R.a=S1.a select R.* from R,S where R.a=S.a and is unique R
asked
Sep 28, 2014
in
Databases
by
jothee
Veteran
(
106k
points)

3.4k
views
gate20142
databases
sql
normal
+15
votes
5
answers
4
GATE2014253
Which one of the following Boolean expressions is NOT a tautology? $((\,a\,\to\,b\,)\,\wedge\,(\,b\,\to\,c))\,\to\,(\,a\,\to\,c)$ $(\,a\,\to\,c\,)\,\to\,(\,\sim b\,\to\,(a\,\wedge\,c))$ $(\,a\,\wedge\,b\,\wedge\,c)\,\to\,(\,c\vee\,a)$ $a\,\to\,(b\,\to\,a)$
asked
Sep 28, 2014
in
Mathematical Logic
by
jothee
Veteran
(
106k
points)

2k
views
gate20142
mathematicallogic
propositionallogic
normal
+21
votes
2
answers
5
GATE2014252
The number of distinct minimum spanning trees for the weighted graph below is _____
asked
Sep 28, 2014
in
Algorithms
by
jothee
Veteran
(
106k
points)

2.9k
views
gate20142
algorithms
spanningtree
numericalanswers
normal
+19
votes
5
answers
6
GATE2014251
A cycle on $n$ vertices is isomorphic to its complement. The value of $n$ is _____.
asked
Sep 28, 2014
in
Graph Theory
by
jothee
Veteran
(
106k
points)

2.8k
views
gate20142
graphtheory
numericalanswers
normal
graphisomorphism
+37
votes
5
answers
7
GATE2014250
Consider the following relation on subsets of the set $S$ of integers between 1 and 2014. For two distinct subsets $U$ and $V$ of $S$ we say $U\:<\:V$ if the minimum element in the symmetric difference of the two sets is in $U$. Consider the following two ... Both $S1$ and $S2$ are true $S1$ is true and $S2$ is false $S2$ is true and $S1$ is false Neither $S1$ nor $S2$ is true
asked
Sep 28, 2014
in
Set Theory & Algebra
by
jothee
Veteran
(
106k
points)

3k
views
gate20142
settheory&algebra
normal
sets
+13
votes
4
answers
8
GATE2014249
The number of distinct positive integral factors of $2014$ is _____________
asked
Sep 28, 2014
in
Set Theory & Algebra
by
jothee
Veteran
(
106k
points)

2.2k
views
gate20142
settheory&algebra
easy
numericalanswers
numbertheory
+12
votes
3
answers
9
GATE2014248
The probability that a given positive integer lying between $1$ and $100$ (both inclusive) is NOT divisible by $2$, $3$ or $5$ is ______ .
asked
Sep 28, 2014
in
Probability
by
jothee
Veteran
(
106k
points)

1.7k
views
gate20142
probability
numericalanswers
normal
+35
votes
6
answers
10
GATE2014247
The product of the nonzero eigenvalues of the matrix is ____ $\begin{pmatrix} 1 & 0 & 0 & 0 & 1 \\ 0 & 1 & 1 & 1 & 0 \\ 0 & 1 & 1 & 1 & 0 \\ 0 & 1 & 1 & 1 & 0 \\ 1 & 0 & 0 & 0 & 1 \end{pmatrix}$
asked
Sep 28, 2014
in
Linear Algebra
by
jothee
Veteran
(
106k
points)

6.8k
views
gate20142
linearalgebra
eigenvalue
normal
numericalanswers
+5
votes
1
answer
11
GATE2014246
In the NewtonRaphson method, an initial guess of $x_0= 2 $ is made and the sequence $x_0,x_1,x_2\:\dots$ is obtained for the function $$0.75x^32x^22x+4=0$$ Consider the statements $x_3\:=\:0$ The method converges to a solution in a finite number of iterations. Which of the following is TRUE? Only I Only II Both I and II Neither I nor II
asked
Sep 28, 2014
in
Numerical Methods
by
jothee
Veteran
(
106k
points)

377
views
gate20142
numericalmethods
newtonraphson
normal
nongate
+19
votes
4
answers
12
GATE2014245
The value of a $\text{float}$ type variable is represented using the singleprecision $\text{32bit}$ floating point format of $IEEE754$ standard that uses $1$ $\text{bit}$ for sign, $\text{8 bits}$ for biased exponent ... type variable $X$ is assigned the decimal value of $−14.25$. The representation of $X$ in hexadecimal notation is $C1640000H$ $416C0000H$ $41640000H$ $C16C0000H$
asked
Sep 28, 2014
in
Digital Logic
by
jothee
Veteran
(
106k
points)

2k
views
gate20142
digitallogic
numberrepresentation
normal
+19
votes
1
answer
13
GATE2014244
If the associativity of a processor cache is doubled while keeping the capacity and block size unchanged, which one of the following is guaranteed to be NOT affected? Width of tag comparator Width of set index decoder Width of way selection multiplexer Width of processor to main memory data bus
asked
Sep 28, 2014
in
CO & Architecture
by
jothee
Veteran
(
106k
points)

2.1k
views
gate20142
coandarchitecture
cachememory
normal
+32
votes
4
answers
14
GATE2014243
In designing a computer's cache system, the cache block (or cache line) size is an important parameter. Which one of the following statements is correct in this context? A smaller block size implies better spatial locality A smaller block size implies a ... block size implies a larger cache tag and hence lower cache hit time A smaller block size incurs a lower cache miss penalty
asked
Sep 28, 2014
in
CO & Architecture
by
jothee
Veteran
(
106k
points)

4.3k
views
gate20142
coandarchitecture
cachememory
normal
+17
votes
4
answers
15
GATE2014242
Consider the C function given below. int f(int j) { static int i = 50; int k; if (i == j) { printf("something"); k = f(i); return 0; } else return 0; } Which one of the following is TRUE? The function returns $0$ for all values ... values of $j$. The function returns $0$ when $j = 50$. The function will exhaust the runtime stack or run into an infinite loop when $j = 50$.
asked
Sep 28, 2014
in
Programming
by
jothee
Veteran
(
106k
points)

1.3k
views
gate20142
programming
programminginc
+28
votes
6
answers
16
GATE2014241
Suppose a stack implementation supports an instruction $REVERSE$, which reverses the order of elements on the stack, in addition to the $PUSH$ and $POP$ instructions. Which one of the following statements is TRUE (with respect to this modified stack)? ... $DEQUEUE$ takes a single instruction. A queue can be implemented where both $ENQUEUE$ and $DEQUEUE$ take a single instruction each.
asked
Sep 28, 2014
in
DS
by
jothee
Veteran
(
106k
points)

4.5k
views
gate20142
datastructure
stack
easy
+25
votes
2
answers
17
GATE2014240
Consider the following function. double f(double x){ if( abs(x*x  3) < 0.01) return x; else return f(x/2 + 1.5/x); } Give a value $q$ (to $2$ decimals) such that $f(q)$ will return $q$:_____.
asked
Sep 28, 2014
in
Programming
by
jothee
Veteran
(
106k
points)

2.6k
views
gate20142
programming
recursion
numericalanswers
normal
+22
votes
7
answers
18
GATE2014239
Consider the expression tree shown. Each leaf represents a numerical value, which can either be $0$ or $1$. Over all possible choices of the values at the leaves, the maximum possible value of the expression represented by the tree is ___.
asked
Sep 28, 2014
in
Compiler Design
by
jothee
Veteran
(
106k
points)

1.4k
views
gate20142
compilerdesign
normal
expressionevaluation
numericalanswers
+36
votes
5
answers
19
GATE2014238
Suppose $P, Q, R, S, T$ are sorted sequences having lengths $20, 24, 30, 35, 50$ respectively. They are to be merged into a single sequence by merging together two sequences at a time. The number of comparisons that will be needed in the worst case by the optimal algorithm for doing this is ____.
asked
Sep 28, 2014
in
Algorithms
by
jothee
Veteran
(
106k
points)

4.4k
views
gate20142
algorithms
sorting
normal
numericalanswers
+21
votes
6
answers
20
GATE2014237
Consider two strings $A$="qpqrr" and $B$="pqprqrp". Let $x$ be the length of the longest common subsequence (not necessarily contiguous) between $A$ and $B$ and let $y$ be the number of such longest common subsequences between $A$ and $B$. Then $x +10y=$ ___.
asked
Sep 28, 2014
in
Algorithms
by
jothee
Veteran
(
106k
points)

2.2k
views
gate20142
algorithms
normal
numericalanswers
dynamicprogramming
+54
votes
4
answers
21
GATE2014236
Let $L_1=\{w\in\{0,1\}^*\mid w$ $\text{ has at least as many occurrences of }$ $(110)'$ $\text{s as }$ $(011)'$ $\text{s} \}$. Let $L_2=\{w \in\{0,1\}^*\ \mid w$ $ \text{ has at least as many occurrences of }$ $( ... }$. Which one of the following is TRUE? $L_1$ is regular but not $L_2$ $L_2$ is regular but not $L_1$ Both $L_1$ and $L_2$ are regular Neither $L_1$ nor $L_2$ are regular
asked
Sep 28, 2014
in
Theory of Computation
by
jothee
Veteran
(
106k
points)

5.2k
views
gate20142
theoryofcomputation
normal
regularlanguages
+48
votes
3
answers
22
GATE2014235
Let $\langle M \rangle$ be the encoding of a Turing machine as a string over $\Sigma=\left\{0,1\right\}$. Let $$L=\left\{\langle M \rangle \mid M \text{ is a Turing machine}\\\text{ that accepts a ... right\}.$$ Then $L$ is: decidable and recursively enumerable undecidable but recursively enumerable undecidable and not recursively enumerable decidable but not recursively enumerable
asked
Sep 28, 2014
in
Theory of Computation
by
jothee
Veteran
(
106k
points)

6.6k
views
gate20142
theoryofcomputation
turingmachine
normal
+39
votes
5
answers
23
GATE2014234
For a C program accessing $\mathbf{X[i] [j] [k]}$, the following intermediate code is generated by a compiler. Assume that the size of an integer is $32$ bits and the size of a character is $8$ bits. t0 = i ∗ 1024 t1 = j ∗ 32 t2 = k ∗ 4 t3 = t1 + t0 t4 = t3 + t2 ... is declared as "char $\mathbf{X[4] [32] [8]}$ . $\mathbf{X}$ is declared as "char $\mathbf{X[32] [16] [2]}$ .
asked
Sep 28, 2014
in
Compiler Design
by
jothee
Veteran
(
106k
points)

4.4k
views
gate20142
compilerdesign
intermediatecode
programminginc
normal
+35
votes
5
answers
24
GATE2014233
A computer has twenty physical page frames which contain pages numbered $101$ through $120$. Now a program accesses the pages numbered $\text{1, 2, ..., 100}$ in that order, and repeats the access sequence THRICE. Which one of the following page ... as the optimal page replacement policy for this program? Leastrecentlyused Firstinfirstout Lastinfirstout Mostrecentlyused
asked
Sep 28, 2014
in
Operating System
by
jothee
Veteran
(
106k
points)

5.8k
views
gate20142
operatingsystem
pagereplacement
ambiguous
+20
votes
3
answers
25
GATE2014232
Three processes $A$, $B$ and $C$ each execute a loop of $100$ iterations. In each iteration of the loop, a process performs a single computation that requires $t_c$ CPU milliseconds and then initiates a single I/O operation that lasts for $t_{io}$ ... time slice of $50$ milliseconds. The time in milliseconds at which process C would complete its first I/O operation is ___________.
asked
Sep 28, 2014
in
Operating System
by
jothee
Veteran
(
106k
points)

2.1k
views
gate20142
operatingsystem
processschedule
numericalanswers
normal
+18
votes
4
answers
26
GATE2014231
Consider the procedure below for the ProducerConsumer problem which uses semaphores: semaphore n = 0; semaphore s = 1; void producer() { while(true) { produce(); semWait(s); addToBuffer(); semSignal(s); semSignal(n); } } void consumer() { while(true ... semaphore s when the buffer is empty. The starting value for the semaphore $n$ must be $1$ and not $0$ for deadlockfree operation.
asked
Sep 28, 2014
in
Operating System
by
jothee
Veteran
(
106k
points)

2.6k
views
gate20142
operatingsystem
processsynchronization
normal
+19
votes
2
answers
27
GATE2014230
Consider a join (relation algebra) between relations $r(R)$ and $s(S)$ using the nested loop method. There are 3 buffers each of size equal to disk block size, out of which one buffer is reserved for intermediate results. Assuming size(r(R))<size(s(S)) , the join will have ... $r(R)$ and $s(S)$ is more than 0.5. join selection factor between $r(R)$ and $s(S)$ is less than 0.5.
asked
Sep 28, 2014
in
Databases
by
jothee
Veteran
(
106k
points)

3.5k
views
gate20142
databases
normal
joins
+22
votes
2
answers
28
GATE2014229
Consider the following schedule S of transactions T1, T2, T3, T4: T1 T2 T3 T4 Reads(X) Writes(X) Commit Writes(X) Commit Writes(Y) Reads(Z) Commit Reads(X) Reads(Y) Commit Which one of the following statements is CORRECT? S is ... S is not conflictserializable but is recoverable S is both conflictserializable and recoverable S is neither conflictserializable not is it recoverable
asked
Sep 28, 2014
in
Databases
by
jothee
Veteran
(
106k
points)

2.5k
views
gate20142
databases
transactions
normal
+8
votes
2
answers
29
GATE2014228
A graphical HTML browser resident at a network client machine $Q$ accesses a static HTML webpage from a HTTP server $S$. The static HTML page has exactly one static embedded image which is also at $S$. Assuming no caching, which one of the following is ... this A single HTTP request from $Q$ to $S$ is sufficient, and this is possible without any TCP connection between $Q$ and $S$
asked
Sep 28, 2014
in
Web Technologies
by
jothee
Veteran
(
106k
points)

1.4k
views
gate20142
webtechnologies
html
easy
+36
votes
6
answers
30
GATE2014227
An IP machine Q has a path to another IP machine H via three IP routers R1, R2, and R3. $QR1R2R3H$ H acts as an HTTP server, and Q connects to H via HTTP and downloads a file. Session layer encryption is used, with DES as the shared key ... $I2$, $I3$, and $I4$ can an intruder learn through sniffing at R2 alone? Only $I1$ and $I2$ Only $I1$ Only $I2$ and $I3$ Only $I3$ and $I4$
asked
Sep 28, 2014
in
Computer Networks
by
jothee
Veteran
(
106k
points)

4.1k
views
gate20142
computernetworks
networksecurity
normal
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
SCREENSHOT
Basic LaTeX guide
IIT Madras Phd
Databases GO Classroom
Happy Birthday Sir Arjun
Follow @csegate
Gatecse
Recent questions tagged gate20142
Recent Blog Comments
Sir for final year student who have exam in...
I guess you meant while chasing :) Anyway those...
I'll write a post on how to best...
@Gaurav Go through all the previous yr questions,...
42,613
questions
48,608
answers
155,801
comments
63,795
users