Register
Filter

Questions by Wanted

0 votes
0 answers
1
rice theorem problem
L(M) has at most 10 strings We can have Tyes for ϕ and Tno for Σ∗. Hence, L={M∣L(M) has at most 10 strings} is not Turing decidable (not recursive). problem : It should not b Tyes Σ∗ and Tno for ϕ
L(M)has at most 10 stringsWe can have Tyesfor ϕ and Tno for Σ∗. Hence, L={M∣L(M) has at most 10 strings} is not Turing decidable (not recursive). problem :It should...
0 votes
1 answer
2
ace : minimum mfa
i think answer b 3..and they give 2?
i think answer b 3..and they give 2?
0 votes
1 answer
3
is every recusrive is csl ?
i know every csl is recursive while viceversa is true?
i know every csl is recursive while viceversa is true?
0 votes
1 answer
4
ace toc 1
0 votes
0 answers
5
intersection between decidable and undecidabe b?
0 votes
1 answer
6
is this transition are right?
0 votes
1 answer
7
can complment of csl is cfl ?
0 votes
1 answer
8
is regular grammar does not generate empty string?
0 votes
0 answers
9
cormen question regarding max heap
can ny clarify thiz max heap insert heap extract max heap increase key heap maximum all thze take O(log n)?
can ny clarify thiz max heap insertheap extract maxheap increase keyheap maximumall thze take O(log n)?
0 votes
1 answer
10
Saurabh school lect..i think thiz is wrong interpretation..rt?
0 votes
0 answers
11
@arjun sir plz c thiz http://gateoverflow.in/104305/is-thiz-valid-code?show=104658#c104658 only last comment
https://gateoverflow.in/104305/is-thiz-valid-code?show=104658#c104658
0 votes
0 answers
12
ace dma transfer
0 votes
1 answer
13
ace co numerical
0 votes
0 answers
14
ace os paging
0 votes
0 answers
15
ace os
0 votes
1 answer
16
co : set associative
if we say that cache is k way set associative and there is n num of blocks so it means there is n/k sets and what is number of blocks in the set ??
if we say that cache is k way set associativeand there is n num of blocksso it means there is n/k sets and what is number of blocks in the set ??
0 votes
1 answer
17
IS WAITING TIME AND RESPONSE TIME BOTH ARE SAME ?
REFERENCE :https://gateoverflow.in/96844/operating-systems-2-8
REFERENCE :https://gateoverflow.in/96844/operating-systems-2-8
0 votes
0 answers
18
OS : previous year gate question < i did not get here
Which of the following require a device driver ? (GATE 2002) (a) has not been used for the longest time in the past? (b)will not be used for the longest time in the future ? (c)has been used least number of times? (d) has been used most number of times ?
Which of the following require a device driver ? (GATE 2002)(a) has not been used for the longest time in the past?(b)will not be used for the longest time in the futur...
0 votes
0 answers
19
operating system ace
0 votes
0 answers
20
OS : Its confusing
it seems confusing
it seems confusing
Page: