GATE CSE
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.
Recent activity by Digvijay Pandey
User Digvijay Pandey
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Digvijay Pandey
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
1
answer
1
TIFR2012B9
Consider the concurrent program x := 1; cobegin x := x + x + 1  x := x + 2 coend; Reading and writing of a variable is atomic, but evaluation of an expression is not atomic. The set of possible values of variable $x$ at the end of execution of the program is $\ ... $\left\{7\right\}$ $\left\{3, 5, 7\right\}$ $\left\{3, 7\right\}$ $\left\{3, 5\right\}$
answer edited
Aug 20
in
Operating System

223
views
tifr2012
concurrency
5
answers
2
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 ... , 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
comment reshown
Jul 22
in
Computer Networks

2k
views
gate20142
computernetworks
networksecurity
normal
2
answers
3
#newgradiance #dbms #sql #joins Q2
answered
May 6
in
Databases

99
views
newgradiance
databases
sql
joins
1
answer
4
#Algorithms
Can somebody help me out to figure out an algorithm that would work in O(nlogn) for the following problem? Given a SORTED array of n elements. Find three numbers from the array that will add up to a given number k. My approach: Use two pointers ... I can't figure out when to increment L or when to decrement H, in case z is not found. Any ideas? Thank you
answered
May 6
in
Algorithms

56
views
algorithms
4
answers
5
GATE2016Session7GA5
The sum of the digits of a two digit number is $12$. If the new number formed by reversing the digits is greater than the original number by $54$, find the original number. $39$ $57$ $66$ $93$
answered
Apr 27
in
Numerical Ability

113
views
gate2016session7aptitude
numericalability
numericalcomputation
1
answer
6
Test Series
Consider a 4way set associative cache that has 8lines, with perfect LRU cache replacement and supports a block size of 16bytes. For the following memory access pattern (shown as byte addresses), find the hit ratio? 3, 5, 6, 21, 32, 14, 5, 10, 11, 12
comment reshown
Feb 9
in
CO & Architecture

175
views
co&architecture
cachememory
0
answers
7
Safe Sequence
I am getting 14 , what you think? intial choice can be A or C , and then we have 3! choice for both the branches.
commented
Feb 9
in
Operating System

59
views
operatingsystem
sequencenumber
1
answer
8
GATE2011_3
If two fair coins are flipped and at least one of the outcomes is known to be a head, what is the probability that both outcomes are heads? $1/3$ $1/4$ $1/2$ $2/3$
commented
Feb 9
in
Probability

744
views
gate2011
probability
easy
3
answers
9
cache  madeeasy test series
Question :
answered
Feb 9
in
CO & Architecture

488
views
madeeasytestseries
co&architecture
cachememory
badquestion
3
answers
10
Gate ECE 2017 Eigen Value
commented
Feb 9
in
Linear Algebra

398
views
matrix
eigenvalue
1
answer
11
Digital ECE Gate 2017 Set 1
answered
Feb 9
in
Digital Logic

281
views
digitallogic
3
answers
12
Test series: gatebook mock 2
Consider the collection of all un directed graphs with 10 nodes and 6 edges. Let M and m, respectively, be the maximum and minimum number of connected components in any graph in the collection. If a graph has no self loops and there is at most one edge between any pair ... m = 1 (C) M = 7, m = 4 (D) M = 6, m = 4 Shouldn't the answer be D?
answered
Feb 8
in
Graph Theory

170
views
gatebook_mt2
1
answer
13
gatebook mt2 qn 42
The intended purpose of this code is to precompute all the primes less than N. When it is finished executing, for r ∈ [2, N), bits[r] is supposed to equal 1 if and only if N is composite. Assume that the bits array is initialized to ... ; so why cant we just do a direct search? If it is 0 its prime, otherwise composite? What is the problem in this?
answered
Feb 7
in
Algorithms

87
views
algorithms
functions
2
answers
14
gatebook mock 2
Sender window size is 2^6 . So reciever window should be the same. i. e. 2^6. Sequence no = (sender window + rexiever window) =2^7 i.e. 7 bit
answer selected
Feb 7
in
Computer Networks

106
views
0
answers
15
GATEBOOK MOCK 2
closed
Feb 7
in
Computer Networks

58
views
4
answers
16
GateBook MockTest2
Suppose datagrams are limited to 1,500 bytes (including header) between source Host A and destination Host B. Assuming a 20byte IP header and a 20byte TCP header, how many datagrams would be required to send an MP3 consisting of 4 million bytes?
commented
Feb 7
in
Computer Networks

491
views
computernetworks
gatebook_mt2
ippacket
1
answer
17
Choose the correct statement about HEAP
commented
Feb 7
in
Algorithms

106
views
datastructure
1
answer
18
made easy test series
answered
Feb 7
in
Databases

64
views
1
answer
19
MADE EASY TEST SERIES
answer selected
Feb 7
in
Databases

100
views
2
answers
20
GATE 2017 EC Aptitude
$900$ men and $500$ woman complete a task in $2$ weeks. $1200$ men and $250$ woman took $3$ weeks to complete the same task. Then, how many men are required to complete the same task in $1$ week ?
answered
Feb 7
in
Numerical Ability

834
views
numericalanswers
2
answers
21
maximum records in join operation ME mock
answered
Feb 7
in
Databases

66
views
1
answer
22
GATEBOOK MOCK TEST 1
A computer can parallelize the instruction execution by using multiple copies of data path. Assume that instruction execution takes 100 nsec when there is only one copy of data path and it takes 40 nsec when there are 4 copies of data path. Assuming that ... what percentage of execution is non parallelizable? (A) 19.98 (B) 25.03 (C) 31.45 (D) 22.75
answered
Feb 7
in
CO & Architecture

106
views
gatebook_caoexecutioninstruction_parallelisimmultiprocessor
2
answers
23
the gatebook mock 2
actually i don't understand the part "what are the meant by process is in 1st frame..." i don't know why but i m a bit confuse with this qn. please help...
answered
Feb 7
in
CO & Architecture

308
views
2
answers
24
gate me 2017 paper
answered
Feb 7
in
Numerical Ability

265
views
1
answer
25
ME TEST
answered
Feb 7
in
Computer Networks

75
views
madeeasytestseries
computernetworks
1
answer
26
ME TEST
answered
Feb 7
in
Databases

73
views
madeeasytestseries
databases
2
answers
27
GATE1992_01,ii
Consider a 3bit error detection and 1bit error correction hamming code for 4bit datq. The extra parity bits required would be ___ and the 3bit error detection is possible because the code has a minimum distance of ____
answer selected
Feb 2
in
Computer Networks

1.4k
views
gate1992
computernetworks
errordetection
normal
5
answers
28
GATE2007IT28
Consider a hash function that distributes keys uniformly. The hash table size is 20. After hashing of how many keys will the probability that any new key hashed collides with an existing one exceed 0.5. 5 6 7 10
commented
Jan 3
in
DS

2.1k
views
gate2007it
datastructure
hashing
probability
normal
3
answers
29
IIT Kanpur Written Test
There are 16072016 users in Facebook. A graph is formed where an edge(u,v) is defined when a male is friend to a female and vice versa. Estimate the number of simple cycle of length 1607 formed in the graph?
answered
Dec 1, 2016
in
Algorithms

205
views
iitkanpur
2
answers
30
GATE1998_2.12
What value would the following function return for the input $x=95$? Function fun (x:integer):integer; Begin If x > 100 then fun = x – 10 Else fun = fun(fun (x+11)) End; 89 90 91 92
edited
Nov 11, 2016
in
Algorithms

751
views
gate1998
algorithms
recursion
identifyfunction
normal
2
answers
31
TOCRegular Expression
Consider the following grammar which is not regular but it generates a regular language. S → SSSaab Which of the following regular expression best describes the language ? a. ((a + ab) (a + ab) (a + ab))* b. ((a + ab)* (a + ab)* (a + ab)*)* c. (a + ab) ((a + ab) (a + ab))* d. None of these
answer edited
Nov 3, 2016
in
Theory of Computation

188
views
1
answer
32
Hashing
Using open addressing with linear probing, we sequentially insert three distinct keys k1, k2 and k3 into a hash table of size m. Assuming simple uniform hashing, what is the probability that we will need three probes, when inserting the third key, k3? 3/m 2/m2 3/m2 2/m Please explain the solution.
answered
Nov 2, 2016
in
Algorithms

317
views
hashing
datastructure
algorithms
uniformhashing
1
answer
33
Self Doubt
I came across few Compiler Design Doubts, Please provide your cent. $Q_1 :$ Can lexical analyser detect some/any type of errors? I think yes, because while scanning to identify tokens, it may be the cases that a string pattern doesn't match with any ... $\color{navy}{A \rightarrow aA}$(Right Linear). What can be said about $\color{navy}{A \rightarrow aAb}$
answered
Nov 1, 2016
in
Compiler Design

284
views
compilerdesign
lexicalanalysis
variablescope
2
answers
34
GO2017Programming121
The value returned by the following code is _____ int foo() { int a[] = { 10, 20, 30, 40, 50, 60 }; int *p = &a[1] , *q = &a[5] ; return qp; }
commented
Nov 1, 2016
in
Programming

174
views
go2017programming1
programming
programminginc
numericalanswers
1
answer
35
Virtual Test series
answered
Nov 1, 2016
in
Algorithms

133
views
1
answer
36
GO2017Programming124
The output of the following C program will be (assume IEEE754 floating point representation) #include <stdio.h> int main() { float a = 0.25; if(a == 0.25) printf("Hello"); printf(" World"); } Hello World World Compile Error Hello
answer selected
Oct 28, 2016
in
Programming

419
views
go2017programming1
programming
1
answer
37
GO2017Programming113
What is the following function doing? unsigned int foo(unsigned int x) { unsigned int c = sizeof x; c <<= 3; if(x == 0) return c; c; while(x = x & x1) c; return c; } Counting the number ... the number of set bits in the binary representation of x Counting the number of unset bits in the binary representation of x None of the above
commented
Oct 21, 2016
in
Programming

234
views
go2017programming1
programming
identifyfunction
1
answer
38
GO2017Programming119
Arnold is a novice in C and by mistake he typed "intt" for all usage of "int" in a C code. Which of the following statement added at the beginning of the code should fix the issue for him? typedef int intt; typedef intt int; #define intt int; #define intt int 1 and 3 2 and 4 3 and 4 1 and 4
answered
Oct 21, 2016
in
Programming

120
views
go2017programming1
programming
programminginc
1
answer
39
GO2017Programming17
The output for the following C program will be #include <stdio.h> int temp; int new(int t) { static int cal; cal = cal + t; return(cal); } int main() { int t, p; for(t=0; t<=4; t++) p = new(t) + ++temp; printf("%d", p); } 25 20 15 Garbage Value
answered
Oct 21, 2016
in
Programming

141
views
go2017programming1
programming
programminginc
1
answer
40
GO2017Programming123
The value returned by the following function for foo(10) is ____ int foo(int x) { if(x < 1) return 1; int sum = 0; for(i = 1; i <= x; i++) { sum += foo(xi); } return sum; }
answered
Oct 20, 2016
in
Programming

171
views
go2017programming1
programming
numericalanswers
27,349
questions
35,204
answers
84,249
comments
33,328
users