Recent activity by ashoklb / GATE Overflow for GATE CSE

2 answers

1

CMI2010-A-01
Over the alphabet $\{0, 1\}$, consider the language $L = \{ w | \: w \text{ does not contain the substring } 0011\}$ Which of the following is true about $L$. $L$ is not context free $L$ is regular $L$ is not regular but it is context free $L$ is context free but not recursively enumerable

Over the alphabet $\{0, 1\}$, consider the language$L = \{ w | \: w \text{ does not contain the substring } 0011\}$Which of the following is true about $L$.$L$ is not co...

1.3k views

answered Feb 2, 2018

4 answers

2

GATE CSE 1997 | Question: 75
An operating system handles requests to resources as follows. A process (which asks for some resources, uses them for some time and then exits the system) is assigned a unique timestamp are when it starts. The timestamps are monotonically increasing with time. Let us denote ... , show how. If not prove it. Can a process P ever starve? If yes, show how. If not prove it.

An operating system handles requests to resources as follows.A process (which asks for some resources, uses them for some time and then exits the system) is assigned a un...

7.6k views

answered Jan 28, 2018

0 answers

3

Transaction
Wait die is non preemptive technique :So cannot suffer from starvation. Wound wait is preemptive technique : is it suffers from starvation? i think yes but not sure plz explain with some example:

Wait die is non preemptive technique :So cannot suffer from starvation. Wound wait is preemptive technique : is it suffers from starvation? i think yes but not sureplz ex...

678 views

commented Jan 25, 2018

1 answer

4

Test by Bikram | Theory of Computation | Test 2 | Question: 19
Which of the following statements is correct about the given Turing Machine transitions below? ... in $\Sigma ^*$. TM halts on all strings of even length. I and II II and IV II and III I , II and III

Which of the following statements is correct about the given Turing Machine transitions below?$\begin{array}{|c|c|c|c|} \hline \delta & 0 & 1 & B \\ \hline q0 & (q1,1,R) ...

451 views

commented Aug 24, 2017

1 answer

5

Test by Bikram | Theory of Computation | Test 2 | Question: 4
Which of the following statements is FALSE? Recursive Enumerable Languages are not closed under set difference and complementation. Complement of context-free language must be recursive. If a problem $X$ is NP complete and $X \in P,$ then $NP = P$. Membership problem is not decidable for Recursive Languages.

Which of the following statements is FALSE?Recursive Enumerable Languages are not closed under set difference and complementation.Complement of context-free language must...

436 views

commented Aug 24, 2017

2 answers

6

Test by Bikram | Theory of Computation | Test 2 | Question: 5
Given two regular expressions: $p = (0^* 1^* )^*$ and $q = 0^* + 1^* + 0^*1 + 10^*$ The length of the smallest string that is present in the language corresponding to regular expression ‘$p$’ and not present in the language corresponding to regular expression ‘$q$’ is ________.

Given two regular expressions:$p = (0^* 1^* )^*$ and $q = 0^* + 1^* + 0^*1 + 10^*$The length of the smallest string that is present in the language corresponding to reg...

666 views

commented Aug 22, 2017

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true