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 manu00x
User manu00x
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User manu00x
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
0
answers
1
Automata: Conversion from CFG to CNF
commented
3 days
ago
in
Theory of Computation

23
views
theoryofcomputation
contextfreelanguage
cnf
simplification
1
answer
2
virtual gate test series
answered
3 days
ago
in
Digital Logic

29
views
1
answer
3
Linked List
Suppose p and q are 2 nodes in linked list, where p pointing to head node and q pointing to next to head node. Now, chk this condition while(A) { if(p==q)exit(0); p=p>next; q=(q>next)?(q>next>next) ... next? And what should be value of A, so that this while loop satisfies the condition that this linked list satisfies the condition for a loop?
answered
3 days
ago
in
DS

27
views
linkedlists
datastructure
0
answers
4
Automata: Number of Productions in the CFG
asked
3 days
ago
in
Theory of Computation

34
views
theoryofcomputation
contextfreelanguage
simplification
1
answer
5
up or down counter
commented
3 days
ago
in
Digital Logic

41
views
1
answer
6
Computer Networks  Transport Layer  Sequence number wrap around
commented
3 days
ago
in
Computer Networks

37
views
computernetworks
tcp
sequencenumber
transportlayer
1
answer
7
UGCNETAUG2016III56
Given a Turing Machine M = ({q0 , q1 }, {0, 1}, {0, 1, B}, δ, B, {q1 }) Where δ is a transition function defined as δ(q0 , 0) = (q0 , 0, R) δ(q0 , B) = (q1 , B, R) The language L(M) accepted by Turing machine is given as : (1) 0* 1* (2) 00* (3) 10* (4) 1*0*
commented
4 days
ago
in
Theory of Computation

87
views
3
answers
8
TOC: Number of states in minimum DFA
answer selected
4 days
ago
in
Theory of Computation

96
views
minimalstateautomata
theoryofcomputation
dfa
2
answers
9
K. Rosen: Countings
Question How many different strings of length 2 can be made from the letters in 'ORONO'? I am getting 7 strings as follows: OO, ON, OR, NO, RO, RN, NR but given answer is 6.
answer selected
5 days
ago
in
Combinatory

30
views
kennethrosen
discretemathematics
counting
permutationsandcombinations
1
answer
10
Kneath Rosen: DM: Counting
Following is the given solution in the solution manual: I understood how we got x1 + x2 + x3 + x4 + x5 = 5, I understood too how we got x1+x2+x3+x4+x5 = 1, when x1>=4. but I am unable to understand the highlighted ... x4 + x5 = 2. please explain. PS: i solved this question using generating functions and i am getting the same answer as 106.
answer selected
5 days
ago
in
Algorithms

57
views
discretemathematics
kennethrosen
permutationsandcombinations
2
answers
11
TCP and UDP
Why TCP requires three way handshake why not two way is sufficient.. What is the actual use of SYN packet
answered
5 days
ago
in
Computer Networks

49
views
2
answers
12
Compiler Design, Number Of Tokens
commented
6 days
ago
in
Compiler Design

360
views
compilerdesign
tokens
lexeme
1
answer
13
Number of tokens in the C program
commented
Oct 9
in
Compiler Design

80
views
compilerdesign
tokens
0
answers
14
Decidable problems concerning Turing machine
commented
Oct 5
in
Theory of Computation

58
views
theoryofcomputation
turingmachine
decidability
1
answer
15
Relations
Consider the set S = {a, b} and ‘L’ be a binary relation such that L = {all binary relations except reflexive relation set S}. The number of relation which are symmetric _______.
commented
Oct 5
in
Set Theory & Algebra

65
views
relations
discretemathematics
1
answer
16
Virtual gate
answer edited
Oct 4
in
Theory of Computation

46
views
2
answers
17
Data structure
Ttotal number of BST's possible with 6 nodes numbered 1,2,3,4,5 and 6 having a height of 4 are ??
commented
Oct 4
in
DS

111
views
0
answers
18
Back off algorithm
How the collison probability for A and B for the first round is 1?? A and B can take values between (0,1) .. this gives 4 combinations (0,0),(0,1),(1,0) and (1,1) ? Prob(collison)= 2/4 =0.5 . . Isn't it??? plz check this http://gateoverflow.in/66836/madeeasy2017
commented
Oct 4
in
Computer Networks

46
views
1
answer
19
State True or False: Classes of Grammar and respective automata
commented
Oct 4
in
Theory of Computation

52
views
theoryofcomputation
regularexpressions
regular
finiteautomata
2
answers
20
MadeEasy 2017
Assume that X and Y are the only two stations on an Ethernet. Each has a steady queue of frames to send. Both X and Y attempt to transmit a frame, they wait to get the control of channel using binary exponential algorithm. The probability ... on fifth round of the algorithm (assuming every time both X and Y will collide in backoff race till 4th round) is
commented
Oct 4
in
Computer Networks

343
views
madeeasytestseries
computernetworks
1
answer
21
doubt
C intersection P(C) != phir ?why? (phi is subset of every set)???
commented
Oct 3
in
Mathematical Logic

28
views
discretemathematics
0
answers
22
Madeeasy#workbook
commented
Oct 3
in
Compiler Design

32
views
2
answers
23
self doubt
there is a proof for equivalence of empty stack and final state but what about the prefix property cases empty stack cant accept regular languages which donot accept the prefix property isnt it less powerful than the acceptance by final state ?? what kind of equivalence they have ??
answered
Oct 3
in
Theory of Computation

24
views
theoryofcomputation
empty
stack
final
state
1
answer
24
Can any one explain this question
comment edited
Oct 3
in
Mathematical Logic

32
views
discretemathematics
1
answer
25
RSA CRYPTOSYSTEM
answer edited
Oct 3
in
Computer Networks

47
views
computernetworks
1
answer
26
made easy test
commented
Oct 2
in
Algorithms

51
views
2
answers
27
What is the maximum speedup achieved in new pipeline system?
commented
Oct 2
in
CO & Architecture

85
views
co&architecture
pipelining
2
answers
28
Matrix Chain
Total no. of ways to perform matrix multiplication having 7 matrices is ? Total no. of ways to by which we could parenthesize 7 matrices is ? Does the above two questions are different or same ? Plz explain the answer.
answer edited
Oct 2
in
Algorithms

83
views
algorithms
dynamicprogramming
4
answers
29
Bit Stuffing
Answer is 4 or 6 ?
commented
Oct 1
in
Computer Networks

56
views
2
answers
30
Bit stuffing
commented
Oct 1
in
Computer Networks

131
views
bitstuffing
computernetworks
1
answer
31
m array tree
A 3ary tree is a tree in Which every internal node has exactly three children. Now if the tree has n internal nodes then what will be the number of leaves________??
answered
Oct 1
in
DS

40
views
2
answers
32
Pumping Lemma
Could we say that Pumping lemma is generally used to prove whether given grammar is not regular.
commented
Oct 1
in
Theory of Computation

55
views
0
answers
33
Graphs
We know that every 2colourable graph is bipartite. To prove that we divide the vertices having different colors and put them separately in 2 partitions. Suppose there are n vertices in an empty graph and they are randomly colored as 1 and 2. The ones ... called a bipartite case even when there is no connection b/w the vertices of partition A and B? If not, why?
commented
Oct 1
in
Graph Theory

53
views
graph
coloring
0
answers
34
CFG: Removal of Unit Productions
edited
Sep 30
in
Theory of Computation

37
views
theoryofcomputation
contextfreelanguage
simplification
1
answer
35
ace test
How mny relations they satisfy the property of equivalence relation as well as partial order over set A={1,2,3,4}.
answer edited
Sep 30
in
Set Theory & Algebra

49
views
2
answers
36
Depth first Search
What should be the answer?? Key is given as opttion B. . !! I was getting D) None
answer edited
Sep 30
in
Programming

121
views
1
answer
37
Livelock and Spinlock
State the difference between livelock and spinlock.
answer edited
Sep 30
in
Operating System

41
views
operatingsystem
processsynchronization
1
answer
38
Resource preemption
Which of the following transitions are not possible? (Assume resource preemption is not allowed) A) 2 and 4 B) 3 and 5 C)4 and 5 D)3 and 5 if resource preemption is not allowed then answer should be A) but answer given is D) how it is possible?
commented
Sep 30
in
Operating System

36
views
operatingsystem
process
1
answer
39
Made easy practice book
If an input string w has n symbols and can be recognized by a mealy machine M1 and equivalent Moore machine M2 then number of output symbols by M1 and M2 are respectively?
answered
Sep 29
in
Theory of Computation

30
views
mealymooremachine
madeeasybooklet
0
answers
40
TOC: Complement of the given language
commented
Sep 29
in
Theory of Computation

49
views
theoryofcomputation
contextfreelanguage
27,249
questions
35,071
answers
83,728
comments
33,183
users