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.
Questions by Gabbar
User Gabbar
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Gabbar
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
+1
vote
3
answers
1
UPSC prelim test
A bag contains 20 balls. 8 balls are green, 7 are white and 5 are red. What is the minimum number of balls that must be picked up from the bag blindfolded (without replacing any of it) to be assured of picking atleast one ball of each colour? a) 15 b) 16 c) 17 d)18
asked
Aug 14
in
Combinatory

80
views
pigeonhole
discretemathematics
0
votes
1
answer
2
recursion
asked
Jul 14
in
Programming

113
views
recursion
programminginc
0
votes
0
answers
3
probability
a lot consists of 12 good pencils, 6 with minor defects and 2 with major defects. A pencil is chosen at random. The probability that this pencil is not defective is?
asked
Jul 14
in
Probability

135
views
probability
engineeringmathematics
eamcet
0
votes
0
answers
4
probability
a lot consists of good pencils, 6 with minor defects and 2 with major defects. A pencil is chosen at random. The probability that this pencil is not defective is?
asked
Jul 14
in
Probability

35
views
probability
engineeringmathematics
eamcet
+1
vote
1
answer
5
probability
India plays two matches each with West Indies and Srilanka. In any match the probabilities of India getting points 0,1 and 2 are 0.45,0.05 and 0.50 respectively. Assuming that the outcomes are independent, the probability of India getting at least 7 points is? a) 0.8750 b) 0.0875 c) 0.0625 d) 0.0250
asked
Jul 11
in
Probability

124
views
probability
engineeringmathematics
0
votes
1
answer
6
Turing machine
Design a turing machine that accept the language of odd integer written in binary
asked
Apr 17
in
Theory of Computation

105
views
theoryofcomputation
turingmachine
0
votes
1
answer
7
Ethernet
IF the propagation delay csma/cd network is 750 bit times then what is the slot if the jamming signal is 50 bits?
asked
Apr 4
in
Computer Networks

45
views
ethernet
computernetworks
0
votes
1
answer
8
RSA(self doubt)
asked
Apr 2
in
Computer Networks

52
views
computer
networking
0
votes
0
answers
9
Self doubt(Computer network security)
asked
Apr 2
in
Computer Networks

83
views
cns
networksecurity
0
votes
1
answer
10
Regular expression
The set of all strings with at most one pair of consecutive zeros and one pair of consecutive ones.
asked
Apr 1
in
Theory of Computation

248
views
0
votes
0
answers
11
peterlinz
asked
Apr 1
in
Theory of Computation

19
views
+1
vote
1
answer
12
context free grammar
Construct contextfree grammars to accept the following languages. $$\begin{align*} \large L = \left \{ 0^i1^j2^k \;\;  \;\; i \neq j \;\; or \;\; j \neq k \right \} \end{align*}$$
asked
Mar 25
in
Theory of Computation

70
views
cfg
contextfreelanguage
theoryofcomputation
0
votes
1
answer
13
Probability
The probability that a student knows the correct answer to a multiple choice question is 2/3. If the student doesn't know the answer then the student guess the answer. The probability of the guess answer is being correct is 1/4.given that student has answer the questions correctly, the conditional probability that the student knows the correct answer is
asked
Mar 2
in
Mathematical Logic

128
views
probability
0
votes
1
answer
14
Design a dfa
Construct a dfa which accept all strings which when interpreted is a multiple of 5
asked
Feb 27
in
Theory of Computation

42
views
theoryofcomputation
0
votes
2
answers
15
Design a dfa
Design a dfa which check whether the given no is even or not?
asked
Feb 27
in
Theory of Computation

49
views
theoryofcomputation
0
votes
1
answer
16
Self doubt toc
Construct a grammar for L={a^nb^n/m, n greater then equal to 0,m doesn't equal to n}
asked
Feb 27
in
Theory of Computation

47
views
theoryofcomputation
+1
vote
1
answer
17
Peter linz
L1={a^nb^m, n=>4,m<=3 L1=(aa)*(bb)*+a(aa)*b(bb)* Find L1 complement?
asked
Feb 19
in
Theory of Computation

72
views
0
votes
2
answers
18
RegulaR Expression
Find the regular expression No 2 a's and 2 b's should come together?
asked
Feb 19
in
Theory of Computation

257
views
theoryofcomputation
0
votes
1
answer
19
Toc self doubt
Design NDFA over {0,1} in which two 0s are separated by a string of length 2i, for i>0 and convert it into equivalent dfa?
asked
Feb 19
in
Theory of Computation

74
views
theoryofcomputation
+2
votes
1
answer
20
Grammar
Construct a grammar which generate even integer upto 998?
asked
Feb 19
in
Theory of Computation

278
views
theoryofcomputation
0
votes
1
answer
21
gate 2010
What is the value of Limn>∞(11/n)2n ? (A) 0 (B) e2 (C) e1/2 (D) 1
asked
Jan 27
in
Mathematical Logic

83
views
limits
calculus
0
votes
1
answer
22
memory management
If the no of pages in a 32 bit machine is 8kB then what is the size of the page table? a. 8kb b. 16kB c. 4 KB d. Cant say
asked
Dec 11, 2016
in
Operating System

91
views
+2
votes
1
answer
23
Indexing and Physical DB design
asked
Nov 5, 2016
in
Databases

57
views
0
votes
1
answer
24
transaction
S:R1(x),w1(x),R2(x),R1(y),w2(x),C2,A1 why it is violating Ti>Tj condition?
asked
Nov 1, 2016
in
Databases

64
views
+1
vote
2
answers
25
Transaction and concurrency control
asked
Nov 1, 2016
in
Databases

219
views
+1
vote
1
answer
26
Transaction and concurrency
• T1:W(X), T2:R(Y), T1:R(Y), T2:R(X) is it recoverable?
asked
Oct 30, 2016
in
Databases

100
views
0
votes
0
answers
27
relational algebra
Express in relational algebra supplier (SNO, SNAME) part (PNO, PNAME) project(JNO, JNAME) SUPPLY(SNO, PNO,JN0) a) Retrieve the parts no that are supplied to exactly two project?
asked
Oct 24, 2016
in
Databases

38
views
+1
vote
1
answer
28
self join
can somebody explain me about self join with example?.
asked
Oct 20, 2016
in
Databases

80
views
+1
vote
0
answers
29
relationalalgebra
Let R = (A, B) and S = (A, C), and let r(R) and s(S) be relations. Write relationalalgebra expressions equivalent to the following domainrelationalcalculus expressions {< a >  ∃ c (< a,c > ∈ s ∧ ∃ b1, b2 (< a,b1> ∈ r ∧ < c,b2>∈ r ∧ b1 > b2))}
asked
Oct 19, 2016
in
Databases

19
views
+1
vote
1
answer
30
normalisation
Suppose you are given a relation R with four attributes ABCD. For each of the following sets of FDs, assuming those are the only dependencies that hold for R, do the following: If R is not in BCNF, decompose it into a set of BCNF relations that preserve the dependencies. AB → C, AB → D, C → A, D → B
asked
Oct 13, 2016
in
Databases

157
views
Page:
1
2
next »
26,243
questions
33,815
answers
80,260
comments
31,168
users