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 stblue
User stblue
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User stblue
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
+1
vote
1
anyone who can solve this i know how to solve but i have a doubt ?
answered
2 days
ago
in
Mathematical Logic

49
views
0
votes
2
Context free languages and Regular Languages
answered
2 days
ago
in
Theory of Computation

17
views
theory
theoryofcomputation
contextfreelanguage
+1
vote
3
#TOC what will be the R.E of this DFA?
answered
3 days
ago
in
Theory of Computation

65
views
finiteautomata
regularexpressions
0
votes
4
Gate Sample Practice First & Follow Question
answered
3 days
ago
in
Compiler Design

38
views
gate
question
sample
follow
first
+1
vote
5
Gate Compiler Design Sample Question First & Follow
answered
3 days
ago
in
Compiler Design

40
views
gate
sample
first
follow
question
0
votes
6
Fragmentation
Suppose a network: Suppose a TCP message contains 492 B of data and TCP header is of size 20B then deliver it to IP. IP header is 20 B. Assume link AR1 has the maximum frame size of 700 B including a frame size of 14 B, link ... B including a 12 B frame header. Then calculate the no of fragments at each link and show the format of fragments in each link.
answered
3 days
ago
in
Computer Networks

59
views
fragmentation
computernetworks
networklayering
tcp
+4
votes
7
Self_doubt
This is true that at every router the value of TTL is decremented by one but does that actually mean that other fields in the header are also recomputed?
answered
4 days
ago
in
Computer Networks

59
views
#networks
+3
votes
8
Context Free Languages
{${a^{i}b^{j}c^{k} (i\leq j)or(j\leq i),j=k}$} is CFL?
answered
4 days
ago
in
Theory of Computation

23
views
0
votes
9
Deadlock and Unsafe state
Why unsafe state not leads to deadlock? Please don't redirect to any other link. Explain it by taking an example.
answered
5 days
ago
in
Operating System

27
views
operatingsystem
deadlock
+1
vote
10
CN: TCP Window Size
Consider TCP congestion control. Assuming RTT as 4 seconds and segment size as 3KB, if bandwidth is 500kbps, what is the smallest window size for which there is no stalling in this case?
answered
6 days
ago
in
Computer Networks

61
views
computernetworks
tcp
0
votes
11
geeksforgeeks
Let X be a recursive language and Y be a recursively enumerable but not recursive language. Let W and Z be two languages such that Y' reduces to W, and Z reduces to X' (reduction means the standard manyone reduction). Which one ... enumerable. C W is not recursively enumerable and Z is recursive. D W is not recursively enumerable and Z is not recu
answered
Aug 15
in
Theory of Computation

18
views
recursiveandrecursivelyenumerablelanguages
+1
vote
12
geeksforgeeks
?
answered
Aug 15
in
Theory of Computation

18
views
recursiveandrecursivelyenumerablelanguages
decidability
0
votes
13
GATE20011.18
Which of the following statements is false? An unambiguous grammar has same leftmost and rightmost derivation An LL(1) parser is a topdown parser LALR is more powerful than SLR An ambiguous grammar can never be LR(k) for any k
answered
Aug 15
in
Compiler Design

1k
views
gate2001
compilerdesign
grammar
normal
0
votes
14
question set
An unambiguous grammar has same leftmost and rightmost derivation. True or False and how??
answered
Aug 15
in
Compiler Design

22
views
#compiler
design
#parsing
0
votes
15
GATE2005IT83b
Consider the contextfree grammar E → E + E E → (E * E) E → id where E is the starting symbol, the set of terminals is {id, (,+,),*}, and the set of nonterminals is {E}. For the terminal string id + id + id + id, how many parse trees are possible? 5 4 3 2
answered
Aug 14
in
Compiler Design

415
views
gate2005it
compilerdesign
parsing
normal
+2
votes
16
R.S.AGGARWAL
If log 2 =0.30103, find the number of digits in 256 ?
answered
Aug 13
in
Verbal Ability

69
views
numericalability
0
votes
17
CPU SCHEDULING
Consider 3 process P0, P1, P2 to be scheduled as per SRTF algorithm. The process P0 is known to be scheduled first and when P0 is running 5 units of time the process P2 arrived. The process P2 has own 2 units of time, the process P1 ha arrived and completed running in 4 units of time. Then the minimum burst time of P0 is
answered
Aug 13
in
Operating System

42
views
operatingsystem
cpuscheduling
processschedule
+3
votes
18
#combinotirics
Find the largest integer value of x such that the following inequality holds: (10 C x1) <2*(10 C x) In this question if solved line by line i am getting x<6. but clearly if you put x=7, it satisfies the inequality and 7 becomes the largest integer. Is there a procedure to get answer 7 step by step??
answered
Aug 12
in
Combinatory

17
views
#combinatorics
#math
+1
vote
19
Does this satisfy bounded wait ?
answered
Aug 12
in
Operating System

167
views
processsynchronization
operatingsystem
0
votes
20
#Disk
Consider a disk with seek time of 4 ms, rotation speed of 15,000 rpm and 512byte sectors with 500 sectors per track. Suppose that we wish to read a file consistinh of 2500 sectors for a total of 1.28 Mbytes. We would like to estimate the total time for the transfer?
answered
Aug 12
in
Operating System

33
views
+1
vote
21
Random question
Let ‘R’ be a regular expression, then which of the following statements is/are TRUE for every 'R'? S1: There exists 'S' which satisfies property R + S = S. S2: There exists 'S' which satisfies property R.S = S A) only S1 is true B) only S2 is true C) Both are true D) Both are false Please answer this with a suitable explanation.
answered
Aug 12
in
Theory of Computation

34
views
#regular
regularexpressions
+1
vote
22
CALCULATE PROPOGATION DELAY
For the circuit shown in figure, the delays of NOR gates, multiplexer and inverters are 2ns, 1.5ns and 1ns, respectively. If all the inputs P,Q,R,S and T are applied at the same time instant, the maximum propagation delay (in ns) of the circuit is _______
answered
Aug 12
in
Digital Logic

37
views
gate
0
votes
23
logic gate
In the logic circuit shown below the redundant gate is _________??????
answered
Aug 11
in
Digital Logic

24
views
+2
votes
24
madeeasy workbook
if a disk system has an average seek time of 30ns and rotation rate of 360RPM. each track of the disk has 512 sectors each of size 512 Bytes. what is the time taken to read 4 successive sectors,also compute the effective data transfer rate a) 0.0843 sec , 1536 kbps b) 0.123 sec , 1436 kbps c) 0.156 sec ,1326 kbps d) 0.135 sec , 1252 kbps
answered
Aug 11
in
CO & Architecture

35
views
+3
votes
25
SRTF question
With the use of SRTF the execution of three processes is as follows, the process A is scheduled first and A has been running for 6 units of time, the process B is arrived process B ran for 2 units of time, later process C is arrived and completed running in 4 units of time. Find the minimum possible burst time of the process A and B. 9, 6 10, 6 2, 8 11, 7
answered
Aug 11
in
Operating System

37
views
cpuscheduling
0
votes
26
Primary difference between process and thread.
answered
Aug 11
in
Operating System

31
views
operatingsystem
threads
0
votes
27
TOC What language is this?
The given set is 1,2,4,8, . . . . . 2^n in unary number system which is shown in BOLD below L = {1,11,1111,11111111, . . . . . . . . } Is it regular or CFL?
answered
Aug 11
in
Theory of Computation

44
views
theoryofcomputation
regularexpressions
finiteautomata
identifyclasslanguage
+1
vote
28
counting
what does it mean that "each person has same left and right neighbour "?
answered
Aug 10
in
Combinatory

52
views
discretemathematics
kennethrosen
+2
votes
29
TOC Question
Sorry my BAD, it's an infinite language! The given set {1, 101, 11011,1110111,......} is a Regular Language or CFL?
answered
Aug 10
in
Theory of Computation

81
views
theoryofcomputation
finiteautomata
0
votes
30
# regular expression
what is the regular expression for this given DFA?
answered
Aug 9
in
Theory of Computation

53
views
0
votes
31
Demand paging
answered
Aug 9
in
Operating System

49
views
+1
vote
32
PAGING
answered
Aug 9
in
Operating System

63
views
operatingsystem
paging
+3
votes
33
REGULAR OR NOT
As given that 1st is not regular and 2nd is regular as 1st not form AP but 2nd form.but if in 2nd we fix value of m and n same then it will work as 1st(not regular) so 2nd also should not be regular.as i know if we fix m or n value as any constant it will be AP but what if same???
answered
Aug 8
in
Theory of Computation

53
views
theoryofcomputation
settheory&algebra
compilerdesign
ambiguous
regularlanguages
0
votes
34
DCFL or CFL
{w number of Zeros=number of Ones} Alphabet= {0,1} It is a CFL for sure. But,is it also a DCFL i.e. can we construct a DPDA for it? My Approach:: for 0 push in stack , for 1's pop > In end stack should be empty Hence, a DCFL. But, eg given string :: 1100 Now,for 1's pop but, nothing in stack to pop .... STUCK HERE !!
answered
Aug 8
in
Theory of Computation

29
views
theoryofcomputation
dcfl
+1
vote
35
REGULAR OR NOT
Please mention reason with answer:
answered
Aug 8
in
Theory of Computation

34
views
theoryofcomputation
compilerdesign
ambiguous
regularlanguages
settheory&algebra
+1
vote
36
Finding number of tokens
Find the number of tokens in the below C statement: result = x > y ? "x is greater than y" : "x is less than or equal to y"; My doubt is should we consider the ternary operator "? :" as 1 token or two separate tokens "?" and ":" ??
answered
Aug 7
in
Compiler Design

33
views
compilerdesign
tokens
0
votes
37
gate
A 1Mbps satellite link connects two ground stations. The altitude of the satellite is 6000 km and speed of the signal is 3 10^8 m/s. What should be the packet size for a channel utilization of 50% for a satellite link ... 63 sliding window protocol? Assume that the acknowledgment packets are negligible in size and that there are no errors during communication.
answered
Aug 2
in
Computer Networks

174
views
0
votes
38
DFA to accept a binary number divisible by 2
answered
May 8, 2015
in
Theory of Computation

3.2k
views
finiteautomata
25,071
questions
32,224
answers
75,102
comments
30,232
users