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 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
0
answers
1
Turing machine
Design a turing machine that accept the language of odd integer written in binary
asked
6 days
ago
in
Theory of Computation

23
views
theoryofcomputation
turingmachine
1
answer
2
Self doubt toc
Construct a grammar for L={a^nb^n/m, n greater then equal to 0,m doesn't equal to n}
commented
6 days
ago
in
Theory of Computation

35
views
theoryofcomputation
0
answers
3
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

20
views
ethernet
computernetworks
1
answer
4
RSA(self doubt)
answer selected
Apr 3
in
Computer Networks

32
views
computer
networking
4
answers
5
GATE2017144
In a RSA cryptosystem, a participant $A$ uses two prime numbers $p = 13$ and $q = 17$ to generate here public and private keys. If the public key of $A$ is $35$, then the private key of $A$ is __________ .
commented
Apr 2
in
Computer Networks

701
views
gate20171
networksecurity
computernetworks
rsasecuritynetworks
numericalanswers
normal
0
answers
6
Self doubt(Computer network security)
commented
Apr 2
in
Computer Networks

54
views
cns
networksecurity
1
answer
7
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

62
views
0
answers
8
peterlinz
asked
Apr 1
in
Theory of Computation

16
views
3
answers
9
Peter Linz Exercise 7.3
#3 : Is the language L= { anbn : n>=1 } U {b} deterministic ? #4 : Is the language L={anbn : n>=1} U {a} deterministic ? #7 Is the following regular language deterministic? L= { anbmck : n=m or m=k } #8 Is ... WR has started. #11 No Idea about it. Please someone verify and tell me is my way of analysis and the analysis is correct or not?
commented
Mar 31
in
Theory of Computation

65
views
theoryofcomputation
deterministiccontextfreegrammars
contextfree
1
answer
10
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*}$$
commented
Mar 26
in
Theory of Computation

39
views
cfg
contextfree
theoryofcomputation
1
answer
11
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

42
views
probability
1
answer
12
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

33
views
theoryofcomputation
2
answers
13
Design a dfa
Design a dfa which check whether the given no is even or not?
commented
Feb 27
in
Theory of Computation

37
views
theoryofcomputation
2
answers
14
ISRO 2015EC Finte State Machine
commented
Feb 23
in
Theory of Computation

95
views
isro2015ece
isro
1
answer
15
Peter linz
L1={a^nb^m, n=>4,m<=3 L1=(aa)*(bb)*+a(aa)*b(bb)* Find L1 complement?
commented
Feb 19
in
Theory of Computation

61
views
2
answers
16
RegulaR Expression
Find the regular expression No 2 a's and 2 b's should come together?
commented
Feb 19
in
Theory of Computation

121
views
theoryofcomputation
1
answer
17
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

55
views
theoryofcomputation
1
answer
18
Grammar
Construct a grammar which generate even integer upto 998?
commented
Feb 19
in
Theory of Computation

119
views
theoryofcomputation
1
answer
19
gate 2010
What is the value of Limn>∞(11/n)2n ? (A) 0 (B) e2 (C) e1/2 (D) 1
answer selected
Feb 13
in
Mathematical Logic

62
views
limits
calculus
1
answer
20
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
commented
Dec 14, 2016
in
Operating System

77
views
1
answer
21
Indexing and Physical DB design
answer selected
Nov 6, 2016
in
Databases

49
views
1
answer
22
transaction
S:R1(x),w1(x),R2(x),R1(y),w2(x),C2,A1 why it is violating Ti>Tj condition?
commented
Nov 1, 2016
in
Databases

58
views
2
answers
23
Transaction and concurrency control
commented
Nov 1, 2016
in
Databases

154
views
1
answer
24
Transaction and concurrency
• T1:W(X), T2:R(Y), T1:R(Y), T2:R(X) is it recoverable?
commented
Oct 30, 2016
in
Databases

76
views
0
answers
25
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

36
views
1
answer
26
self join
can somebody explain me about self join with example?.
answer selected
Oct 21, 2016
in
Databases

60
views
0
answers
27
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

18
views
1
answer
28
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
commented
Oct 13, 2016
in
Databases

126
views
1
answer
29
normalisation
can someone explain me dependency preserving by taking example?
asked
Oct 13, 2016
in
Databases

49
views
3
answers
30
GATE201043
The following functional dependencies hold for relations $R(A, B, C)$ and $S(B, D, E).$ $ B \to A$ $A \to C$ The relation $R$ contains 200 tuples and the relation $S$ contains 100 tuples. What is the maximum number of tuples possible in the natural join $R \bowtie S$? 100 200 300 2000
commented
Oct 12, 2016
in
Databases

797
views
gate2010
databases
normal
2
answers
31
DataBase
R(A,B,C,D,E) is a relation with candidate keys AB BC CD.Find the total number of super keys possible?
commented
Oct 12, 2016
in
Databases

81
views
3
answers
32
dbms
Consider the relation schema R(A,B,C), which has the FD B → C. If A is a candidate key for R, is it possible for R to be in BCNF? If so, under what conditions? If not, explain why not.
commented
Oct 12, 2016
in
Databases

88
views
0
answers
33
morris mano
How can i find the delay of 4 bit adder? plz explain
reshown
Oct 11, 2016
in
Digital Logic

31
views
2
answers
34
3NF
Consider a relation R with five attributes ABCDE. You are given the following dependencies: A → B, BC → E, and ED → A. 1. List all keys for R. 2. Is R in 3NF? 3. Is R in BCNF?
answer selected
Oct 10, 2016
in
Databases

162
views
0
answers
35
Morris mano
How i can I find the delay of 4 bit adder?
asked
Oct 8, 2016
in
Digital Logic

38
views
0
answers
36
MORRIS MANO
How can i find the delay of 4 bit adder?
asked
Oct 8, 2016
in
Digital Logic

22
views
0
answers
37
gate2006..topic digital logic
consider numbers represented in 4bit graycode. let h3h2h1h0 be the graycode representation of a number n and let g3g2g1g0 be the graycode of (n+1)modulo16) value of the number?
commented
Oct 7, 2016
in
Digital Logic

66
views
digitallogic
22,076
questions
28,047
answers
63,239
comments
24,137
users