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 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
0
answers
1
teatbook questions
commented
8 hours
ago
in
Theory of Computation

29
views
0
answers
2
Ambiguity
Ques. S > Aa/bAc/dc A > d Isn't this grammar Ambiguous? If First(S) has more than one production giving the same first value, isn't it ambiguous?
commented
21 hours
ago
in
Compiler Design

16
views
#ambiguity
1
answer
3
Recusive enumerable recursive
If a language L and its complement L' are recursively enumerable then choose the correct statement a) L is recursive but not L' b) Both L and L' are recursive c) L' is recursive but not in L d) None of these
commented
21 hours
ago
in
Theory of Computation

25
views
theoryofcomputation
recursiveandrecursivelyenumerablelanguages
turingmachine
recursion
complement
1
answer
4
NPTEL
Consider a system having n CPUs, k processes, and k > n. Calculate the upper bound for the number of processes in the READY, RUNNING and BLOCKED states 1 k, k, k. 2 n, n, n 3 k, k, n 4 k, n, k
commented
1 day
ago
in
Operating System

85
views
processschedule
1
answer
5
Fragmentation
User has generated 200 bytes of SMTP data for which 32 bytes of TCP header is added with various required options. When such a packet is flowing through a network with MTU size of 100 bytes and network related header of 5 bytes. Find the number ... 16 I am confused with network related header of 5 bytes. What to to with it. Is it a control information ??
commented
1 day
ago
in
Computer Networks

133
views
0
answers
6
Page tables
Suppose you have a computer system with a 48bit logical address, page size of 16K and 4 bytes per page table entry. If we have a 48MB program such that the entire program and all necessary page tables are in memory. How much memory is used by program, including its page tables? A.216(3121) B.216(3211) C.217(3121) D.217(3211)
commented
2 days
ago
in
Operating System

25
views
1
answer
7
anyone who can solve this i know how to solve but i have a doubt ?
answered
2 days
ago
in
Mathematical Logic

49
views
2
answers
8
paging
Q. Suppose you have a computer system with a 48bit logical address, page size of 16KB and 4 bytes per page table entry. If we have a 48MB program such that the entire program and all necessary page tables are in memory. Assume that each page table at diff level fits in a single page.How much memory is used by program, including its page tables?
commented
2 days
ago
in
Operating System

874
views
paging
operatingsystem
pagetable
memorymanagement
virtualmemory
1
answer
9
regular languages
Given that a language L = L1 ∪ L2, where L1 and L2 are two other languages. If L is known to be a regular language, then which of the following statements is necessarily TRUE? (a) If L1 is regular then L2 will also be regular (b) If L1 ... then L2 will be regular (c) If L1 is regular and finite the L2 will also be regular and finite (d) None of these
commented
2 days
ago
in
Theory of Computation

23
views
theoryofcomputation
regularlanguages
1
answer
10
Context free languages and Regular Languages
answered
2 days
ago
in
Theory of Computation

17
views
theory
theoryofcomputation
contextfreelanguage
1
answer
11
Theory Of Computation
Construct a minimal dfa over {0,1} which neither accept 00 as a substring nor 11 as a substring.
commented
2 days
ago
in
Theory of Computation

27
views
theoryofcomputation
finiteautomata
normal
1
answer
12
regular languages
A Language is said to be regular iff (a) There exists a Right Linear Regular Grammar for L (b) There exists a Left Linear Regular Grammar for L (c) There exists a nfa with single final state (d) There exists a dfa with single final state (e) There exists a nfa without ԑ ... All are true (b) a, b, c are true (c) a, b, c, e are true (d) a, b, d are true
commented
2 days
ago
in
Theory of Computation

14
views
theoryofcomputation
regularlanguages
1
answer
13
#TOC what will be the R.E of this DFA?
commented
2 days
ago
in
Theory of Computation

65
views
finiteautomata
regularexpressions
2
answers
14
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.
comment edited
3 days
ago
in
Computer Networks

59
views
fragmentation
computernetworks
networklayering
tcp
1
answer
15
Gate Compiler Design Sample Question First & Follow
commented
3 days
ago
in
Compiler Design

40
views
gate
sample
first
follow
question
2
answers
16
Gate Sample Practice First & Follow Question
answered
3 days
ago
in
Compiler Design

38
views
gate
question
sample
follow
first
0
answers
17
SELF DOUBT
Can we find FIRST and FOLLOW for a left recursive grammar?
commented
3 days
ago
in
Compiler Design

26
views
compilerdesign
leftrecursion
first
follow
2
answers
18
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?
answer edited
4 days
ago
in
Computer Networks

59
views
#networks
1
answer
19
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
2
answers
20
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?
commented
4 days
ago
in
Computer Networks

61
views
computernetworks
tcp
1
answer
21
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.
answer reshown
5 days
ago
in
Operating System

27
views
operatingsystem
deadlock
2
answers
22
Does this satisfy bounded wait ?
comment edited
6 days
ago
in
Operating System

167
views
processsynchronization
operatingsystem
0
answers
23
rosen example 20
how many different ways are there to seat 4 people around a circular table ,where two sittings are considered the same when each person has same left and right neighbour?
commented
6 days
ago
in
Combinatory

27
views
0
answers
24
Regular Languages
L = {w1w2 : w1, w2 ϵ {a, b}* , w1 = w2}, Is the Language regular? Explain.
comment edited
6 days
ago
in
Theory of Computation

46
views
theoryofcomputation
regularlanguages
0
answers
25
is the language L={a^nb^n : n>=1} U {b} is determinstic
commented
6 days
ago
in
Theory of Computation

35
views
0
answers
26
self doubt in ambiguous grammar
commented
Aug 15
in
Compiler Design

16
views
1
answer
27
Syntax directed translation
Consider the following transition rules: A> BC C>+BC  A  epsilion B> DB{print '+';}  epsilion D> (A) id{print id.value;} On input ' 5+67 ', this translation schem will print..............
commented
Aug 15
in
Compiler Design

16
views
0
answers
28
postal course
hi all, i am going to buy postal course plese suggest me which coaching offers good quality postal course. ACE OR MADEEASY.
commented
Aug 15
in
Others

31
views
0
answers
29
TOC KLP Mishra
commented
Aug 15
in
Theory of Computation

25
views
klpmishra
theoryofcomputation
0
answers
30
Disk Scheduling
Consider a disk head with 500 tracks numbered 0499 is currently on 60. The following sequence of requests arrive: 170, 37, 98, 122, 53, 14, 39, 28. Total head movements needed to satisfy these requests with SSTF scheduling algorithm is ______. I am getting 202.
commented
Aug 15
in
Operating System

20
views
operatingsystem
disks
diskscheduling
madeeasytestseries
1
answer
31
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
answer edited
Aug 15
in
Theory of Computation

18
views
recursiveandrecursivelyenumerablelanguages
0
answers
32
Dfa toc
construct a mininal DFA which accept sets of all strings over {a,b} such that 2nd symbol from RHS in each string is 'a'?
commented
Aug 15
in
Theory of Computation

15
views
dfa
1
answer
33
geeksforgeeks
?
answered
Aug 15
in
Theory of Computation

18
views
recursiveandrecursivelyenumerablelanguages
decidability
0
answers
34
Self doubt
In the case of multilevel paging, only the innermost page table contains the frame number corresponding to page number whereas the other highlevel page table contains the base (or starting) physical address of the next lower level page table to which they point???
commented
Aug 15
in
Operating System

10
views
operatingsystem
multilevelpaging
1
answer
35
question set
An unambiguous grammar has same leftmost and rightmost derivation. True or False and how??
answer edited
Aug 15
in
Compiler Design

22
views
#compiler
design
#parsing
3
answers
36
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
1
answer
37
classification of lexical and syntactic errors in complier phases
commented
Aug 14
in
Compiler Design

84
views
lexicalanalysis
tokens
compilertokenization
1
answer
38
R.S.AGGARWAL
If log 2 =0.30103, find the number of digits in 256 ?
comment edited
Aug 14
in
Verbal Ability

69
views
numericalability
3
answers
39
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
1
answer
40
For even no a's RE (b*ab*ab*)* + b* correct or (b*ab*ab*)*.b* or both are equal
commented
Aug 14
in
Theory of Computation

61
views
theoryofcomputation
finiteautomata
regularexpressions
25,071
questions
32,224
answers
75,102
comments
30,232
users