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
+3
votes
1
rosen discrete
How many strings of six lowercase letters of the English alphabet contain exactly two vowel?
answered
4 days
ago
in
Combinatory

41
views
kennethrosen
discretemathematics
combinatorics
combinations
+4
votes
2
The intersection of a context free language and a regular language
answered
Apr 16
in
Theory of Computation

86
views
+3
votes
3
Gilbert Strang Problem set 1.3
Choose a coefficient b that makes this system singular. Then choose a righthand side g that makes it solvable. Find two solutions in that singular case. $2x +by = 16$ $4x + 8y = g$
answered
Apr 12
in
Linear Algebra

34
views
linearalgebra
gilbertstrang
+7
votes
4
GATEBOOK TEST
1 +2(1/2) +3(1/4)+ 4(1/8)+ .............. = ? getting 2 please check
answered
Apr 10
in
Numerical Ability

76
views
+7
votes
5
C programming  Output ?
#include <stdio.h> int main() { unsigned char a = 5; a = (1<<((sizeof(char)<<3)1)); char b = a; printf("%d %d\n",b,a); printf("%u %u\n",b,a); } If the size of a char datatype is 1 Byte, then what will be the output? [Edited]
answered
Apr 10
in
Programming

144
views
programminginc
+2
votes
6
cil2017 Q87
answered
Apr 9
in
Databases

40
views
cil2017
databases
losslessjoin
functionaldependencies
+4
votes
7
K&R BOOK
I have learnt that order of function call of f1() and f2() is compiler dependent from K&R book.Why precedence and associavity does not work in this case ?? Please clarify in details . #include<stdio.h> int x = 0; int f1() { x = 5; return x; } int f2() { x = 10; return x; } int main() { int p = f1() + f2(); printf("%d ", x); return 0; }
answered
Apr 2
in
Programming

126
views
programminginc
+2
votes
8
GATE200362
In a permutation \(a_1 ... a_n\), of n distinct integers, an inversion is a pair \((a_i, a_j)\) such that \(i < j\) and \(a_i > a_j\). What would be the worst case time complexity of the Insertion Sort algorithm, if the inputs are restricted to permutations ... most $n$ inversions? \(\Theta(n^2)\) \(\Theta(n\log n)\) \(\Theta(n^{1.5})\) \(\Theta(n)\)
answered
Apr 1
in
Algorithms

689
views
gate2003
algorithms
sorting
expectation
normal
+6
votes
9
CSMA/CD
answered
Mar 14
in
Computer Networks

59
views
computernetworks
csmacd
ethernet
+5
votes
10
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

154
views
programminginc
ieeerepresentation
undefinedbehaviour
+5
votes
11
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

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

61
views
+2
votes
13
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

31
views
+2
votes
14
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

36
views
+4
votes
15
TECHTUD, C PROGRAMMING
answered
Mar 8
in
Programming

148
views
programminginc
output
+3
votes
16
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

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

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

58
views
theoryofcomputation
regularexpressions
+3
votes
19
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

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

139
views
counter
digitallogic
#digitalcounter
+4
votes
21
GATEBOOK
answered
Feb 7
in
Mathematical Logic

65
views
discretemathematics
+4
votes
22
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

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

80
views
algorithms
+3
votes
24
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
25
Virtual Gate 2016mock1 Question 57
answered
Jan 18
in
Computer Networks

137
views
virtualgate
mock12016
computernetworks
+7
votes
26
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

83
views
+7
votes
27
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

261
views
datastructure
timecomplexity
algorithms
linkedlists
+5
votes
28
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

208
views
compilerdesign
parsing
viableprefix
+12
votes
29
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

249
views
probability
engineeringmathematics
+7
votes
30
Maths: Probability Distribution Que01
answered
Jan 12
in
Probability

129
views
probability
randomvariable
engineeringmathematics
discretemathematics
+5
votes
31
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

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

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

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

191
views
+17
votes
35
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

454
views
+5
votes
36
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

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

88
views
+9
votes
38
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

129
views
theoryofcomputation
decidability
+3
votes
39
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

89
views
tifr2016
combinatory
+3
votes
40
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

45
views
tifr2016
Page:
1
2
3
4
5
6
...
8
next »
22,073
questions
28,039
answers
63,226
comments
24,133
users