Register
Filter

Questions by eyeamgj

985
views
1 answers
0 votes
self doubt toc
assume pda stack is limited to 210 symbols .now stack can contain maximum of 2^10 symbols The language Accepted by such pda is a)regular lang but not ... finite automata so it will accept regular language is fine but not finite how???
511
views
3 answers
0 votes
doubt toc
wxw ;w,x belongs to {a,b}*this regular or dcfl or cfl??? somewhere it is written as regular but dontknow why??
313
views
1 answers
0 votes
SELF DOUBT DCFL
SUPPOSE WE HAVE A SITUATION IN BETWEEN LIKE THIS (DCFL) INTERSECTION (REGULAR LANG)..............................SITUATION 1NOW WE CAN WRITE DCFL ... UNDER REGULAR INTERSECTION HENCE DCFL ...........WHY THIS CONTRADICTION IS ARISING??????
1.5k
views
1 answers
2 votes
closure properties of cfl
cfl are closed undera) min b)max c)half d)alt e)none of thesecfl are not closed under initl/acycleset diffeence
4.6k
views
1 answers
1 votes
true or false finite automata
finite automata have no storage and no computing capability????
236
views
1 answers
0 votes
self doubt decidability
A Turing machine can compute product of any two numbers, hence decidable problemTuring machine can perform product of two numbers, then it is an undecidable problem what is the meaning of computing and performing here???
1.1k
views
1 answers
0 votes
SELF DOUBT REDUCTION
IF P1 IS REDUCIBLE TO P2 AND P1 IS RECURSIVE ENUMERABLE THEN P2 NEED NOT BE RECURSIVE ENUMERABLE ???IS IS TRUE ??WHAT I AM THINKING IS THAT P1 IS UNDECIABLE SO P2 WILL ALSO BE UNDECIABLE HENCE SHOULD BE RECURSIVE ENUMERABLE...
1.7k
views
0 answers
5 votes
DECIDABILITY
WHICH OF THE FOLLOWING IS DECIDABLE?1.WHEATHER AN ARBITRARY TURING MACHINE PRINTS SOME NON BLANK CHARACTER2.WHEATHER A TURING MACHINE PRINTS A SPECIFIC CHARACTER3.THE SET OF ... STATE6.T.M VISITS STATE Q ON SOME INPUT WITHIN 10 STEPS.7.
177
views
0 answers
0 votes
please answer and verify it
https://gateoverflow.in/168678/madeeasy-work-book
203
views
1 answers
0 votes
self doubt
halting problem for turing machine is undecidable it is clear but what about halting problem of total turing mchine???
134
views
0 answers
0 votes
TOC SELF DOUBT
https://gateoverflow.in/141979/toc-countabilityHOW TO PROVE B,C,D TRUE??
799
views
0 answers
1 votes
MADEEASY TEST SERIES
I AM GETTING 12KB ????PLEASE CHECK
313
views
0 answers
0 votes
ME TEST SERIES OS
Consider five memory partitions of size 100 KB, 500 KB, 200 KB, 450 KB and 600 KB in same order. If sequence of requests for blocks of size 212 KB, 417 KB ... FIT AS ANSWER BUT HOW CAN WE APPLY NEXT FIT WE DONT KNOW LAST ALLOCATION POINT ??
261
views
0 answers
0 votes
ME TEST SERIES OS
201
views
0 answers
0 votes
test series os
consider a system is having 4 processes each take 0.6 fraction of time for io processing then cpu utilization provided main memory is large enough to allocate all processes is............???
667
views
1 answers
0 votes
SELF DOUBT PROGRESS AND BOUND AND WAIT
LOAD Ri,M[LOCK]CMP Ri,#0JNZ TO STEP 1STORE M[LOCK],#1CRITICAL SECTIONSTORE M[LOCK],#0 progress and bound wait satisfying or not??
195
views
0 answers
0 votes
REGARDING SYLLABUS
https://gateoverflow.in/43294/gate2013-53PAGE COLOR??? IS IN SYLLABUS ??WHAT IS THIS??
461
views
0 answers
0 votes
DOUBT PAGING
https://gateoverflow.in/872/gate2002-19IN THE SOLUTION GIVEN BY Akash Kanase I am not getting the reason behind using this formulaNo. of bits in first level page ... HOW THE MAXIMUM NUMBER OF PAGETABLES IN 2ND LEVEL CAN BE 220 ....??
233
views
1 answers
0 votes
SELF DOUBT
https://gateoverflow.in/8114/gate2015-2-23CORRECT ANSWER IS 6 ???
440
views
0 answers
0 votes
self doubt os
https://gateoverflow.in/2774/gate1996-22what is correct answer for 2nd part sequence safe exist or not??? and i did like VS did is it correct??
Page: