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
2
answers
1
#newgradiance #dbms #sql #joins Q2
answered
May 6
in
Databases

55
views
newgradiance
dbms
sql
joins
1
answer
2
#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

39
views
algorithms
3
answers
3
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

63
views
gate2016session7aptitude
1
answer
4
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

152
views
co&architecture
cachememory
0
answers
5
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

50
views
operatingsystem
sequencenumber
1
answer
6
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? (A) $1/3$ (B) $1/4$ (C) $1/2$ (D) $2/3$
commented
Feb 9
in
Probability

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

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

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

243
views
digitallogic
3
answers
10
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

137
views
gatebook_mt2
1
answer
11
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

73
views
algorithms
functions
2
answers
12
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

97
views
0
answers
13
GATEBOOK MOCK 2
closed
Feb 7
in
Computer Networks

45
views
4
answers
14
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

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

94
views
datastructure
1
answer
16
made easy test series
answered
Feb 7
in
Databases

62
views
1
answer
17
MADE EASY TEST SERIES
answer selected
Feb 7
in
Databases

67
views
2
answers
18
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

547
views
numericalanswers
2
answers
19
maximum records in join operation ME mock
answered
Feb 7
in
Databases

55
views
1
answer
20
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

97
views
gatebook_caoexecutioninstruction_parallelisimmultiprocessor
2
answers
21
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

298
views
2
answers
22
gate me 2017 paper
answered
Feb 7
in
Numerical Ability

218
views
1
answer
23
ME TEST
answered
Feb 7
in
Computer Networks

58
views
madeeasytestseries
computernetworks
1
answer
24
ME TEST
answered
Feb 7
in
Databases

64
views
madeeasytestseries
dbms
2
answers
25
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.1k
views
gate1992
computernetworks
errordetection
normal
4
answers
26
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

1.8k
views
gate2007it
datastructure
hashing
probability
normal
3
answers
27
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

198
views
iitkanpur
2
answers
28
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

486
views
gate1998
algorithms
recursion
identifyfunction
normal
2
answers
29
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

115
views
1
answer
30
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

271
views
hashing
datastructure
algorithms
uniformhashing
1
answer
31
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

221
views
compilerdesign
lexicalanalysis
scope
1
answer
32
Virtual Test series
answered
Nov 1, 2016
in
Algorithms

133
views
3
answers
33
true/false
If all attributes are prime then the table is in BCNF.
commented
Oct 17, 2016
in
Databases

191
views
databasenormalization
3
answers
34
CPU Scheduling
Which are invalid process state transition? a. Timer Start: ready>running b. Timer Out: running>blocked c. I/O: running>ready d. Resume : suspend>running
commented
Oct 13, 2016
in
Operating System

161
views
cpuscheduling
operatingsystem
acebooklet
0
answers
35
..
What are Binary Relations ? How many of them possible on a set of N elements ?
commented
Oct 12, 2016
in
Set Theory & Algebra

78
views
0
answers
36
UGCNETJune2010II37
_______ synchronizes critical resources to prevent dead lock. Poperator Voperator Semaphore Swapping
closed
Sep 16, 2016
in
Others

23
views
ugcnetjune2010ii
1
answer
37
ISRO200742, UGCNETJune2010II37
edited
Sep 16, 2016
in
Operating System

737
views
isro2007
operatingsystem
processsynchronization
ugcnetjune2010ii37
2
answers
38
UGCNETJune2010II29
What services does the internet layer provide ? 1. Quality of service 2. Routing 3. Addressing 4. Connection oriented delivery 5. Framing bits $1, 2, 3$ $2, 3, 4$ $1, 3, 4, 5$ $2, 3, 4, 5$
commented
Sep 16, 2016
in
Others

126
views
ugcnetjune2010ii
0
answers
39
binary search
the avg successful search time taken by binary search on a sorted rray of 10 items is a)2.6 b) 2.7 c) 2.8 d) 2.9
closed
Sep 15, 2016
in
Programming

92
views
1
answer
40
GATE
$\large L=\left \{ a^m b^n c^k  k<=min(m,n) \right \}$ is this context free?
commented
Sep 13, 2016
in
Theory of Computation

149
views
23,355
questions
30,065
answers
67,365
comments
28,382
users