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 Kapil
User Kapil
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Kapil
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
+5
votes
1
CSMA/CD
answered
Mar 14
in
Computer Networks

38
views
computernetworks
csmacd
ethernet
+5
votes
2
float vs double
Program 1: #include<stdio.h> int main() { float x = 0.1; if (x == 0.1) printf("IF"); else if (x == 0.1f) printf("ELSE IF"); else printf("ELSE"); } The output of above program is ... weird output and is there any way to predict these outputs on the same processor. Also how comparison is done of two variables in C ?
answered
Mar 11
in
Programming

131
views
programminginc
ieeerepresentation
undefinedbehaviour
+4
votes
3
GATE201717
The nbit fixedpoint representation of an unsigned real number $X$ uses $f$ bits for the fraction part. Let $i = nf$. The range of decimal values for $X$ in this representation is (A) $2^{f}$ to $2^{i}$ (B) $2^{f}$ to $\left ( 2^{i}  2^{f} \right )$ (C) 0 to $2^{i}$ (D) 0 to $\left ( 2^{i}  2^{f} \right )$
answered
Mar 10
in
Digital Logic

605
views
gate20171
digitallogic
numberrepresentation
fixedpointrepresentation
+5
votes
4
what is the probability that a randomly chosen bit string of length 10 is palindrome
answered
Mar 9
in
Combinatory

42
views
+2
votes
5
Rosen excercise
How many ways are there for 10 women and 6 men to stand in a line so that no two men stand to each other
answered
Mar 9
in
Combinatory

29
views
+2
votes
6
C. L. Liu 3.38(b)
Among $3n + 1$ objects, $n$ of them are identical. Find the number of ways to select $n$ objects out of these $3n + 1$ objects.
answered
Mar 9
in
Combinatory

33
views
+4
votes
7
TECHTUD, C PROGRAMMING
answered
Mar 8
in
Programming

124
views
programminginc
output
+3
votes
8
ISRO 2013 Calculus [Mech]
Lim x $\rightarrow$0 $\frac{x^{2}+ x  Sin x}{x^{2}}$ (a) 0 (b) ∞ (c) 1 (d) None of these
answered
Mar 8
in
Calculus

28
views
engineeringmathematics
isromech
isro
+3
votes
9
ISRO 2013 Angle between vectors [Mech]
answered
Mar 8
in
Linear Algebra

25
views
isro
engineeringmathematics
isromech
+3
votes
10
regular expression
Find the regular expression for $L=a^nb^m$ where $n>=3$ , $m$ is even ?
answered
Mar 8
in
Theory of Computation

44
views
theoryofcomputation
regularexpressions
+3
votes
11
ISRO 2014 Probability [Mech]
A purse contains 4 copper coins and 3 silver coins. A second purse contains 6 copper coins and 4 silver coins. A purse is chosen randomly and a coin is taken out of it. What is the probability that it is a copper coin? a) 70/82 b) 35/70 c) 41/82 d) 41/70
answered
Mar 7
in
Probability

57
views
engineeringmathematics
isro
isromech
+2
votes
12
Asynchronous counter circuit with feedback input GATEBOOK QS
answered
Feb 7
in
Digital Logic

133
views
counter
digitallogic
#digitalcounter
+4
votes
13
GATEBOOK
answered
Feb 7
in
Mathematical Logic

59
views
discretemathematics
+4
votes
14
Cache Access Time
Assume that a system is using writethrough cache. It has 70% write hits. The cache operates in lookaside mode with a readhit ratio of 80%. The program run on the system is such that it has memory reference for read 70% of time and for write is ... are using no write allocate policy). Average access time of the system is A. 43 B. 55.2 C. 41.5 D. 60
answered
Jan 22
in
CO & Architecture

67
views
+5
votes
15
time required to fins the unknowm integer
answered
Jan 22
in
Algorithms

71
views
algorithms
+3
votes
16
COA_RAW DEPENDENCY
Assume that ADD x, y, z; denotes x ← y + z, SUB x, y, z; x ← y – z and MUL x, y, z; denotes x ← y ∗ z. Consider the following assembly code. I1: SUB R1,R2,R3 I2:ADD R2,R1 R3 I3:ADD R3 R1 R2 I4:SUB R1 R2 R2 Find the number of RAW dependencies in the above assembly code. a. 2 b. 5 c. 3 d. 6
answered
Jan 18
in
CO & Architecture

73
views
+6
votes
17
Virtual Gate 2016mock1 Question 57
answered
Jan 18
in
Computer Networks

134
views
virtualgate
mock12016
computernetworks
+7
votes
18
Hashing
Consider the hashing table with ‘m’ slots and ‘n’ keys. If the expected number of probes in unsuccessful search is 3. The expected number of probes in a successful search is _______ (upto 2 decimal place).
answered
Jan 17
in
Algorithms

76
views
+7
votes
19
DSCLL
Time complexity to insert a node in the end of circular linked list, if the pointer to the 1st node is given and number of nodes in list is N is A)O(1) B)O(log N) C)O(N) D)O(N log N)
answered
Jan 16
in
DS

247
views
datastructure
timecomplexity
algorithms
linkedlists
+5
votes
20
Compiler: Viable Prefixes
Consider the following grammaer: S>0S1  01 How many of the following are the viable prefixes of the grammar? i. 01 ii. 001 iii. 00011 iv. 00S1 PS: given answer i, ii and iv , please explain!
answered
Jan 13
in
Compiler Design

196
views
compilerdesign
parsing
viableprefix
+12
votes
21
Probability
2 friends Alice and Bob have found an unfair coin,It has 72% chance of coming up heads.Alice and Bob plays a game with this coin.If coin comes up head then tails,Alice wins.If it's reverse(tails,then heas),Bob wins.And if neither of those two things happens,the game restarts and continues untill there is a winner What is Bob's probability of winning?
answered
Jan 12
in
Mathematical Logic

233
views
probability
engineeringmathematics
+7
votes
22
Maths: Probability Distribution Que01
answered
Jan 12
in
Probability

123
views
probability
randomvariable
engineeringmathematics
discretemathematics
+5
votes
23
CN TCP
Imagine a TCP connection is transferring 6000B. First Byte is numbered as 10010.The sequence number of the last byte sent,if data are sent in 5 segments with the first 4 segments carrying 1000B and last segement carrying 2000B are ?
answered
Jan 11
in
Computer Networks

106
views
tcp
computernetworks
+6
votes
24
Time Complexity
what is the tightest upper bound of T(n)=T(n1)+2n
answered
Jan 8
in
Algorithms

121
views
+5
votes
25
How many memory accesses required by the following instructions?
answered
Jan 8
in
CO & Architecture

169
views
co&architecture
+3
votes
26
error in sentence
answered
Jan 7
in
Verbal Ability

187
views
+17
votes
27
min heap
The number of binary min. heaps that can be formed from a set of 7 distinct integers is _________?
answered
Jan 7
in
DS

439
views
+5
votes
28
cache and main memory
Assume the following performance characteristics on a cache read miss: one clock cycle to send an address to main memory and four clock cycles to access a 32bit word from main memory and transfer it to the processor and cache. ... transfer? What would be the answer if memory is not interleaved and word access is done sequentially from main memory?
answered
Jan 6
in
CO & Architecture

127
views
co&architecture
cachememory
#computerorganisationandarchitecture
+3
votes
29
First Order Logic
answered
Jan 1
in
Mathematical Logic

85
views
+9
votes
30
REVERSE = { M  M is a TM with the property: for all w, M(w) accepts iff M(wR) accepts}.
answered
Dec 31, 2016
in
Theory of Computation

123
views
theoryofcomputation
decidability
+3
votes
31
TIFR2016A15
In a tournament with 7 teams, each team plays one match with every other team. For each match, the team earns two points if it wins, one point if it ties, and no points if it loses. At the end of all matches, the teams are ordered in ... the minimum total number of points a team must earn in order to be guaranteed a place in the next round? 13 12 11 10 9
answered
Dec 29, 2016
in
Combinatory

82
views
tifr2016
combinatory
+3
votes
32
TIFR2016B5
Consider the recursive function $\mathsf{mc91}$. int mc91(int n) { print n if (n > 100) { return n10; } else { return mc91(mc91(n+11)); } } Let $\mathsf{Out}=\{n : \text{ there is an } x \in \{0, 1, \dots , 100 \} \text{ such that } n \text{ is one of the ... }$ $\{ n: 0 \leq n \leq 110 \}$ $\{ n: 0 \leq n \leq 111 \}$ $\{ n: 0 \leq n < + \infty \}$
answered
Dec 28, 2016
in
Others

44
views
tifr2016
+3
votes
33
how many stall cycles in this system on cache miss ?
answered
Dec 27, 2016
in
CO & Architecture

320
views
co&architecture
cachememory
pipeline
+15
votes
34
TIFR2017B1
A vertex colouring with three colours of a graph $G=(V, E)$ is a mapping $c: V \rightarrow \{R, G, B\}$ so that adjacent vertices receive distinct colours. Consider the following undirected graph. How many vertex colouring with three colours does this graph have? $3^9$ $6^3$ $3 \times 2^8$ $27$ $24$
answered
Dec 23, 2016
in
Graph Theory

145
views
tifr2017
graphtheory
graphcoloring
+6
votes
35
C programming
int func(int n) { if(n<3) return 1; else return func(n1)+func(n3)+1; } How many invocations for calculating func(func(5))
answered
Dec 23, 2016
in
Programming

130
views
programminginc
recursion
+6
votes
36
toc dfa
Minimum Number of states required by a DFA to accept the String (a+b) * a(a+b)(a+b) ?
answered
Dec 22, 2016
in
Theory of Computation

40
views
theoryofcomputation
+5
votes
37
DAG compilers
How to find unnecessary production while optimising DAG. for ex a = b * c d = b e = d * c b = e f = b + c g = f + d How many production need to be removed and how to find them . ?
answered
Dec 22, 2016
in
Compiler Design

158
views
compilerdesign
dag
+9
votes
38
TIFR2017A4
Which of the following functions asymptotically grows the fastest as $n$ goes to infinity? $(\log \: \log \: n)!$ $(\log \: \log \: n)^ {\log \: n}$ $(\log \: \log \: n)^{\log \: \log \: \log \: n}$ $(\log \: n)^{\log \: \log \: n}$ $2^{\sqrt{\log \: \log \: n}}$
answered
Dec 21, 2016
in
Algorithms

131
views
tifr2017
algorithms
asymptoticnotations
+4
votes
39
Cache memory
Cache memory with a line size of $\large\color{maroon}{\text{32}}$B. In a cache miss situation block of words are loaded from Main memory to cache and then accessed from the cache. $A$. Main memory has only word transfer ... text{cache line}}$ should get on average before being replaced such that write back policy becomes more effective than writethrough?
answered
Dec 19, 2016
in
CO & Architecture

130
views
co&architecture
cachememory
+6
votes
40
Convert the given Three Address Code (TAC) into Static Single Assignment (SSA) ?
answered
Dec 17, 2016
in
Compiler Design

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