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.
Answers 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
0
votes
1
cache  madeeasy test series
Question :
answered
Feb 9
in
CO & Architecture

438
views
madeeasy_testseries
co&architecture
cachememory
badquestion
+2
votes
2
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
answered
Feb 9
in
CO & Architecture

119
views
co&architecture
cachememory
+3
votes
3
Digital ECE Gate 2017 Set 1
answered
Feb 9
in
Digital Logic

226
views
digitallogic
+10
votes
4
Gate ECE 2017 Eigen Value
answered
Feb 9
in
Linear Algebra

315
views
matrix
eigenvalue
eigenvector
+2
votes
5
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 of nodes, ... 10, m = 1 (C) M = 7, m = 4 (D) M = 6, m = 4 Shouldn't the answer be D?
answered
Feb 8
in
Graph Theory

113
views
gatebook_mt2
+1
vote
6
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

64
views
algorithms
functions
+4
votes
7
made easy test series
answered
Feb 7
in
Databases

55
views
+3
votes
8
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

425
views
numericalanswers
aptitude
0
votes
9
maximum records in join operation ME mock
answered
Feb 7
in
Databases

45
views
+1
vote
10
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

91
views
gatebook_caoexecutioninstruction_parallelisimmultiprocessor
+1
vote
11
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

287
views
+2
votes
12
gate me 2017 paper
answered
Feb 7
in
Numerical Ability

189
views
0
votes
13
ME TEST
answered
Feb 7
in
Computer Networks

39
views
madeeasy_testseries
computernetworks
0
votes
14
ME TEST
answered
Feb 7
in
Databases

57
views
madeeasy_testseries
dbms
+4
votes
15
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

162
views
iitkanpur
+2
votes
16
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
answered
Nov 3, 2016
in
Theory of Computation

93
views
+9
votes
17
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

254
views
hashing
datastructure
algorithms
uniformhashing
+3
votes
18
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

185
views
compilerdesign
lexicalanalysis
scope
+1
vote
19
Virtual Test series
answered
Nov 1, 2016
in
Algorithms

127
views
Page:
1
2
3
4
5
6
...
14
next »
21,446
questions
26,759
answers
60,943
comments
22,955
users