Register
Filter

Recent activity by nikunj

5 answers
2
#Regular Expression
The regular expression 0*(10*)* denotes the same set as (A) (1*0)*1* (B) 0 + (0 + 10)* (C) (0 + 1)* 10(0 + 1)* (D) none of these
The regular expression 0*(10*)* denotes the same set as(A) (1*0)*1*(B) 0 + (0 + 10)*(C) (0 + 1)* 10(0 + 1)*(D) none of these
1 answer
3
Stack
How many permutations can be obtained in the output using a stack assuming that the input 1,2,3,4,5,6 such that 3 will be popped out from stack at 3rd position ?
How many permutations can be obtained in the output using a stack assuming that the input 1,2,3,4,5,6 such that 3 will be popped out from stack at 3rd position ?
1 answer
4
Dining philosophers problem
In dining philosophers Algorithm the minimum number of forks or chopsticks to avoid deadlock is (assume there are 5 philosophers) a. 5 b. 6 c. 10 d. None of these
In dining philosophers Algorithm the minimum number of forks or chopsticks to avoid deadlock is (assume there are 5 philosophers)a. 5b. 6c. 10d. None of these
3 answers
7
GATE CSE 1998 | Question: 25-a
Free disk space can be used to keep track of using a free list or a bit map. Disk addresses require $d$ bits. For a disk with $B$ blocks, $F$ of which are free, state the condition under which the free list uses less space than the bit map.
Free disk space can be used to keep track of using a free list or a bit map. Disk addresses require $d$ bits. For a disk with $B$ blocks, $F$ of which are free, state the...
2 answers
8
GATE CSE 1992 | Question: 12-a
Draw the precedence graph for the concurrent program given below S1 parbegin begin S2:S4 end; begin S3; parbegin S5; begin S6:S8 end parend end; S7 parend; S9
Draw the precedence graph for the concurrent program given belowS1 parbegin begin S2:S4 end; begin S3; parbegin S5; begin S6:S8 end parend end; S7 parend; S9
4 answers
15
GATE CSE 2001 | Question: 2.20
Which of the following does not interrupt a running process? A device Timer Scheduler process Power failure
Which of the following does not interrupt a running process?A deviceTimerScheduler processPower failure
2 answers
21
GATE CSE 1987 | Question: 2m
State whether the following statements are TRUE or FALSE: The problem as to whether a Turing machine $M$ accepts input $w$ is undecidable.
State whether the following statements are TRUE or FALSE:The problem as to whether a Turing machine $M$ accepts input $w$ is undecidable.
5 answers
22
GATE CSE 1987 | Question: 2h
State whether the following statements are TRUE or FALSE: Regularity is preserved under the operation of string reversal.
State whether the following statements are TRUE or FALSE:Regularity is preserved under the operation of string reversal.
1 answer
23
CFL or not
L={ wε(a+b)* | #a - #b <=10 } CFL or Reg ?
L={ wε(a+b)* | #a - #b <=10 }CFL or Reg ?
2 answers
24
Regular or CFL
L={w| length of w is odd and its middle symbol is 0, wε{0,1}* } Reg or CFL?
L={w| length of w is odd and its middle symbol is 0, wε{0,1}* }Reg or CFL?
3 answers
29
PDA =FA+1stack??
we know that PDA = FA+1stack so why we use the stack data structure in PDA, we have much more data structure like linked liste,queue, array or tree/hashing???
we know that PDA = FA+1stack so why we use the stack data structure in PDA, we have much more data structure like linked liste,queue, array or tree/hashing???