The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
All Activity
Questions
Unanswered
Tags
Categories
Users
Ask a Question
Prev
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. For hardcopy of previous year questions please see
here
Recent activity by Sourav_35
User Sourav_35
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Sourav_35
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
3
answers
1
Critical Section
Consider the following code to solve the critical section problem for two processes P0 and P1. Initially flag [i] contain false for i = 0 and 1. Assume i refers to the current process Pi and j refers the other process Pj. If two processes ... following satisfy the above solution? A. Mutual exclusion and progress B. Mutual exclusion and bounded wait C. Progress D. None of these
commented
Feb 17
in
Operating System

387
views
operatingsystem
criticalsection
processsynchronization
deadlock
busywait
1
answer
2
KLP MISHRA
Given {L: every 'a' is followed by "bb"} Design a DFA for LATE(L) and TRUNCATE(L) LATE(L) is obtained by removing the first symbol from L and TRUNCATE(L) is obtained by removing the last symbol from L Eg: If L is 00(0+1)*01 then LATE(L) will be 0(0+1)*01 and TRUNCATE(L) would be 00(0+1)*0
asked
Jun 9, 2018
in
Theory of Computation

84
views
theoryofcomputation
finiteautomata
1
answer
3
Peter Linz
Given L=a^nb ,n>=0.Construct a DFA for L^2
closed
Jun 9, 2018
in
Theory of Computation

62
views
theoryofcomputation
1
answer
4
Peter Linz Edition 4 Exercise 2.1 Question 9 (Page No. 48)
Consider the set of strings on {$0,1$} defined by the requirements below. For each, construct an accepting dfa. (a) Every $00$ is followed immediately by a $1$. For example, the strings $101, 0010, 0010011001$ ... strings of length four or greater in which the leftmost three symbols are the same, but different from the rightmost symbol.
asked
Jun 9, 2018
in
Theory of Computation

289
views
theoryofcomputation
peterlinz
finiteautomata
1
answer
5
Geeksforgeeks
// C program to illustrate sizes of // pointer of array #include<stdio.h> int main() { int arr[] = { 3, 5, 6, 7, 9 }; int *p = arr; printf("p = %p\n", p); printf("*p = %d\n", *p); printf("sizeof(p) = %lu\n", sizeof(p)); return 0; }
commented
Jun 7, 2018
in
Programming

63
views
1
answer
6
Peter Linz
Design DFA for L={a^n such that n is a multiple of 3 but not 5}
answer selected
Jun 3, 2018
in
Theory of Computation

58
views
theoryofcomputation
2
answers
7
theory of computation
Construct minimal DFA for L = {an: n is either a multiple of three or a multiple of 5 }
commented
Jun 3, 2018
in
Theory of Computation

392
views
theoryofcomputation
finiteautomata
0
answers
8
TOC question from NET DEC 2015
The pushdown automation M = ( {q0, q1, q2}',{a, b}, {0, 1}, ?, q0,0, {q0}) with ? (q0, a, 0) = {(q1,10)} ? (q1,a, 1) = {(q1,11)} ? (q1,b, 1) = {(q2 , ?)} ?(q2 , b, 1) = {(q2 , ?)} ? (q2 , A, 0) = {(q0, ?)} Accepts the language
commented
Jun 2, 2018
in
Theory of Computation

289
views
1
answer
9
Regular/ Non Regular. Language is regular or not?
Is the following two languages regular? L = { $w$  the number of occurrences of $'01'$ in $w$ is equal to the number of occurrences of $'10'$} Late(L) = {$x\in \Sigma^*$ : for some $a\in \Sigma$, string $ax\in L$ where $L$ is regular} (A) Only $I$ (B) Only $II$ (C) Both $I$ & $II$ (D) Neither $I$ nor $II$
commented
Jun 2, 2018
in
Theory of Computation

472
views
theoryofcomputation
identifyclasslanguage
1
answer
10
Regular languages
L={wthe number of occurences of '011' in w is equal to the number of occurences of '111'in w} Is the above language regular?
asked
Jun 2, 2018
in
Theory of Computation

38
views
3
answers
11
How many DFA with 4 state can be constructed over alphabet a and b with desiginated intial state?
answered
Jun 2, 2018
in
Theory of Computation

2k
views
finiteautomata
1
answer
12
Regular expression
S > AaB A > aC  $\epsilon$ B > aB  bB  $\epsilon$ C > aCb  $\epsilon$ Is the regular expression for the above is this: a(a + b)* a ( a* + b* )* ?
commented
Jun 1, 2018
in
Theory of Computation

172
views
theoryofcomputation
regularexpressions
2
answers
13
MadeEasy Test Series: Theory Of Computation
(a^n)^m b^n where n>=0 and m>1 is a) regular b) cfl c) csl d) none
commented
Jun 1, 2018
in
Theory of Computation

134
views
madeeasytestseries
theoryofcomputation
regularlanguages
contextfreelanguage
contextsensitivelanguages
2
answers
14
Pipeline
Consider a 4 stage pipeline that consists of IF,ID,EX and WB stages.The time taken by these stages are 50ns,60ns,110ns and 80ns respectively.The pipeline registers are required after every pipeline stage and each of these pipeline registers consumes 10ns delay.What is the speedup of the pipeline under ideal conditions compare to the corresponding nonpipelined implementation?
commented
May 31, 2018
in
CO and Architecture

186
views
pipelining
0
answers
15
WBUT 2012
A 30% enhancement in speedup for a component of the processor has been proposed for a new architecture.If the enhancement is usable only for 50% for the time,what is the fraction of the time must enhancement is used to achieve an overall speedup of 10?
asked
May 31, 2018
in
CO and Architecture

64
views
speedup
1
answer
16
WBUT 2018
Given the grammar $E>E+E/E^*E/a$ you are required to remove the ambiguity.
commented
May 29, 2018
in
Theory of Computation

48
views
theoryofcomputation
1
answer
17
WBUT 2011
Construct a NFA for $r=(11+0)^*(00+1)^*$
asked
May 27, 2018
in
Theory of Computation

123
views
nfa
regularexpressions
theoryofcomputation
0
answers
18
Turing Machine
Design a TM that accepts strings over the alphabet{a,b} i)Of even length ii)containing the substring "abababa" iii)not containing two consecutive zeros
closed
Apr 29, 2018
in
Theory of Computation

76
views
turingmachine
2
answers
19
Regular Expressions
Can (ab* + b)* be written as (a + b)*.If so then how?
asked
Apr 7, 2018
in
Theory of Computation

233
views
regularexpressions
1
answer
20
Regular Grammar
Is a regular grammar either "completely LEFT LINEAR " OR "completely RIGHT LINEAR" or can it be a combination of both left linear and right linear ?
edited
Apr 7, 2018
in
Theory of Computation

170
views
theoryofcomputation
3
answers
21
Regular Grammars
$S\rightarrow AB$ $A\rightarrow a$ $B\rightarrow b$ The language generated by the above grammar is ab and since we can give a FA for the language then it must be a regular language.Now,since the given grammar generates a regular language then it must be a ... grammar but again it is not in the form of TYPE 3 or regular grammar,then how to identify if the grammar is regular or not?
asked
Apr 6, 2018
in
Theory of Computation

197
views
regulargrammar
theoryofcomputation
finiteautomata
1
answer
22
THEORY OF COMPUTER SCIENCE BY KLP MISHRA
Construct a DFA such that it accepts all strings over $\{a,b\}$ in which there are at least two occurrences of $b$ between any two occurrences of $a$.
asked
Mar 16, 2018
in
Theory of Computation

117
views
theoryofcomputation
finiteautomata
49,833
questions
54,800
answers
189,502
comments
80,723
users