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 saurabh rai
User saurabh rai
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User saurabh rai
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
+1
vote
2
answers
1
Dynamic Programming
Find an optimal parenthesization of a matrixchain product whose sequence of dimensions <5,10,3,12,5,50,6>.
asked
Mar 21
in
Algorithms

164
views
algorithms
dynamicprogramming
0
votes
1
answer
2
Regular grammar
asked
Mar 8
in
Theory of Computation

153
views
theoryofcomputation
0
votes
1
answer
3
regular expression
Find dfa that accept regular expression ab(a+ab)*(a+aa)
asked
Mar 8
in
Theory of Computation

256
views
theoryofcomputation
+1
vote
2
answers
4
regular expression
Find the regular expression for $L=a^nb^m$ where $n>=3$ , $m$ is even ?
asked
Mar 7
in
Theory of Computation

98
views
theoryofcomputation
regularexpressions
+2
votes
4
answers
5
csma/cd
A network with CSMA/CD protocol in the MAC layer is running at 1 Gbps over a 1 km cable with no repeaters. The signal speed in the cable is 2 x 108 m/sec. The frame size for this network 10000 bits what is the total time requires to send this frame completly ?
asked
Dec 28, 2016
in
Computer Networks

368
views
computernetworks
csmacd
ethernet
+1
vote
0
answers
6
Doubt regarding unix inode file system implementation
asked
Dec 26, 2016
in
Operating System

191
views
operatingsystem
inode
unix
filesystem
+1
vote
1
answer
7
operating system
what is the difference between relocatable code and position independent code? and what is relocation?
asked
Dec 17, 2016
in
Operating System

65
views
operatingsystem
0
votes
0
answers
8
shift register
how many clock pulse are required for complete operation of 4 bit parallelinserialoutshiftregister ?
asked
Dec 9, 2016
in
Digital Logic

135
views
digitallogic
+1
vote
1
answer
9
Function
Which of the following statement/s representing OnetoOne Function. S1; ∀a∀b(f (a) = f (b) → a = b) S2: ∀a∀b( a ≠ b→f (a) ≠ f (b) ) S3: ∀a∀b(a = b → f (a) = f (b)), S4: ∀a∀b(f (a) ≠ f (b) → a ≠ b)
asked
Dec 2, 2016
in
Mathematical Logic

116
views
functions
+1
vote
0
answers
10
B+ tree
How to prove that if no of leaf nodes in a B+ tree is n then total no of keys in internal nodes will be n1. I am able 2 prove it by taking min no of nodes or maximum no of nodes but how 2 prove in a generalized way ??
asked
Nov 17, 2016
in
Databases

115
views
databases
0
votes
1
answer
11
No of Tokens
Find no of Tokens in bellow program int main() { a=b+c; "printf("%d%d%d,a,b,c")"; } nd my other doubt is if we replace a=b+c to "a=b+c or a=b+c" will it give lexical error nd if ,then in which case.
asked
Nov 15, 2016
in
Compiler Design

155
views
lexeme
tokens
compilerdesign
0
votes
1
answer
12
mimimum no of comparison
Minimum no of comparison to find minimum element out of n elements.
asked
Nov 13, 2016
in
Algorithms

97
views
algorithms
+5
votes
2
answers
13
no of essential prime implicants
asked
Nov 10, 2016
in
Digital Logic

418
views
digitallogic
+3
votes
1
answer
14
decomposition
For givem relation R(A,B,C,D,E) F:{B >D,CD >E,E>A,A>BC} Is it possible 2 decompose R into two relations R1and R2 such that Decomposition is losslessjoin ,dependencypreserving and in BCNF normal form ??
asked
Nov 6, 2016
in
Databases

285
views
databases
databasenormalization
dependencypreserving
functionaldependencies
+1
vote
0
answers
15
ME test
Suppose you needed to use HTTP to download a webpage with three embedded images. The total number messages saved between the client and server starting from initiates TCP connection to receive the third object and close connection when using persistent HTTP without pipelining insteed of nonpersistent HTTP are
asked
Nov 3, 2016
in
Computer Networks

42
views
testseries
0
votes
0
answers
16
ME test
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 ... frame on fifth round of the algorithm (assuming every time both X and Y will collide in backoff race till 4th round) is
asked
Nov 2, 2016
in
Computer Networks

81
views
testseries
+1
vote
2
answers
17
scheduling
For calculation of turn around time = completion time arrival time and as i know that arrival time is time at which process arrives in ready state/ready queue but in galvin book it is given thatit also includes "periods spent waiting to get into ... memory. bt it is not into( completion time arrival time) so why we r not including that in t.a.t.
asked
Oct 29, 2016
in
Operating System

135
views
operatingsystem
processschedule
cpuscheduling
+1
vote
1
answer
18
class of language
1. L = {<M>M is a TM and L(M) is countable} 2. L = {<M>M is a TM and L(M) is uncountable} what is the class of 1 and 2 recursive/RE/NOT RE
asked
Oct 26, 2016
in
Theory of Computation

169
views
theoryofcomputation
identifyclasslanguage
decidability
turingmachine
0
votes
0
answers
19
decidability
So my doubt is it is a problem from a document given on http://gatecse.in/wiki/Rice%27s_Theorem_with_Examples but i m not able to understand their ideas to prove decidable/semidecidable/undecidable so i m ploadinng one problem from ... from halting problem or its complement link of source is http://www.cs.rice.edu/~nakhleh/COMP481/final_review_sp06_sol.pdf
asked
Oct 26, 2016
in
Theory of Computation

57
views
0
votes
0
answers
20
Decidability ME test series
Which of the following language is decidable? a. {(M) M is a TM and there exist an input whose length is less than 100, on which M halts} b. {(M) M is a TM and L(M) = {00, 11}} c. Both (a) and (b) d. None of the above
asked
Oct 25, 2016
in
Theory of Computation

110
views
decidability
theoryofcomputation
+1
vote
1
answer
21
Decidability
Consider the language L, L = {< M >M is a turing machine and L(M) ≤p {0p 12pp > 0}} Where the symbol ‘≤p’ refers to polynomial time reducible which of the following is true regarding the above language? a. L is undecidable b. L is decidable c. L is regular d. none
asked
Oct 25, 2016
in
Theory of Computation

156
views
+2
votes
1
answer
22
Decidability
i m confused between 2 problems 1. X={M L(M)=ε} 2. Y ={M M accepts ε} where M is Turing Machine is this 2 problems are different and also explain decidability of both ie. decidable/semidecidable/undecidable....
asked
Oct 24, 2016
in
Theory of Computation

351
views
decidability
theoryofcomputation
turingmachine
+3
votes
1
answer
23
class of language
is the language L is CFL ?? L={w w is a palindrome over (a,b,c)}
asked
Oct 23, 2016
in
Theory of Computation

70
views
theoryofcomputation
0
votes
0
answers
24
decidability
1. I know that whether a cfg generates regular language is undecidable .... somone plzz help me to prove that whether a given cfl is regular language also undecidable .... 2. how equvilance problem on 2 dcfl is decidable??
asked
Oct 22, 2016
in
Theory of Computation

211
views
decidability
theoryofcomputation
0
votes
0
answers
25
countability
as i know that two infinite sets are equal in size if there is a correspondence between them suppose N={1,2,3..........} set of natural numbers E={2,4,6............} set of even natural numbers A={0,2,4,...........}  set of ... think N and A wiil not be of equal size bcoz A={0} U E so my doubt is that is my approach and answer both are right r not ??
asked
Oct 22, 2016
in
Theory of Computation

58
views
+3
votes
1
answer
26
Context free language
Is the language $L=\left \{ (0^{n}1^{n})^{*} n\geq 0 \right \}$ is DCFL ?
asked
Oct 21, 2016
in
Theory of Computation

252
views
contextfreelanguage
identifyclasslanguage
dcfl
+2
votes
1
answer
27
no of dfa
http://gateoverflow.in/10853/howmanydfasexistwiththreestatesovertheinputalphabet For n states and m input alphabets we can have the formula for total no of DFA n×nnm×2n=nnm+1×2n  my doubt is that can we generalize a result like above for no of dfa that accepts empty language. after so many effort i m not able to get that...
asked
Oct 19, 2016
in
Theory of Computation

141
views
theoryofcomputation
dfa
+1
vote
1
answer
28
context free language
Σ ={a,b} L={W na(W)*nb(W) ≥ 5} Is the above language is REGULAR ??
asked
Oct 18, 2016
in
Theory of Computation

92
views
identifyclasslanguage
closureproperty
0
votes
2
answers
29
structure
i have a doubt regarding this #include <stdio.h> typedef struct { char *a; char *b; } t; void f1 (t s); void f2 (t *p); main() { static t s = {"A", "B"}; printf ("%s %s\n", s.a, ... "A" to "v" so why there is no any problem loke above ?? code given above is from http://gateoverflow.in/3704/gate2004it_61
asked
Oct 11, 2016
in
Programming

84
views
0
votes
1
answer
30
layering
Assume that source S and destination D are connected through two intermediate routers labeled R. Determine how many times each packet has to visit the network layer and the data link layer during a transmission from S to D.  for above ans is network layer =4 data link layer=6 what will be the ans if two intermediate routers are replaced by a 2layer bridge
asked
Oct 8, 2016
in
Computer Networks

78
views
Page:
1
2
next »
27,324
questions
35,176
answers
84,111
comments
33,280
users