Register

Recent questions tagged self-doubt

0 votes
0 answers
211
MADEASY TEST SERIES
https://gateoverflow.in/200279/control-memory CAN ANY ONE EXPLAIN THE 3 FIELDS SPECIFIED IN QUESTION??/
https://gateoverflow.in/200279/control-memoryCAN ANY ONE EXPLAIN THE 3 FIELDS SPECIFIED IN QUESTION??/
User Avatar
0 votes
0 answers
212
Self Doubt
Since a DMA contoller is connected with the number of I/O devices. Is it possible that DMA controller (say master) is connected with number of other DMA controllers (say slaves). And with these slaves DMA controller, a number of I/O devices are connected?
Since a DMA contoller is connected with the number of I/O devices. Is it possible that DMA controller (say master) is connected with number of other DMA controllers (say ...
User Avatar
0 votes
0 answers
215
Dout Write_back
IN write-back policies what does meant by the update in memory is supposed to happen when block in cache is evicted?
IN write-back policies what does meant by the update in memory is supposed to happen when block in cache is evicted?
User Avatar
0 votes
1 answer
220
SELF DOUBT
https://gateoverflow.in/1036/gate2004-39 WHAT IS DIFFERENCE BETWEEN TYM COMPLEXITY AND PROGRAM EXECUTION TIME??
https://gateoverflow.in/1036/gate2004-39WHAT IS DIFFERENCE BETWEEN TYM COMPLEXITY AND PROGRAM EXECUTION TIME??
User Avatar
1 votes
1 answer
221
Made Easy Theory Book
Can somebody please explain the meaning of the following statement : An automation is a cognitive device and a grammar is a generative device.
Can somebody please explain the meaning of the following statement : An automation is a cognitive device and a grammar is a generative device.
User Avatar
0 votes
0 answers
224
pipelining
What is difference between in both questions https://gateoverflow.in/3690/gate2004-it-47#c165909 https://gateoverflow.in/1314/gate2009-28
What is difference between in both questionshttps://gateoverflow.in/3690/gate2004-it-47#c165909https://gateoverflow.in/1314/gate2009-28
User Avatar
0 votes
1 answer
225
algo self doubt
consider the following c program A(n) { if(n<=1) return(n2 +n+1) else return(5A(n/2)+3A(n/2)+MA(n)) } where MA(n) has complexity O(n2). 1.what is the recurrence relation for value.? 2.what is the the recurrence relation for time complexity?
consider the following c program A(n){if(n<=1)return(n2 +n+1)elsereturn(5A(n/2)+3A(n/2)+MA(n))}where MA(n) has complexity O(n2).1.what is the recurrence relation for valu...
User Avatar
3 votes
0 answers
229
SQL Query
Why this Query is illigal? i.e. Answer given is option C I tried this on W3school IDE it is giving result as option A.
Why this Query is illigal? i.e. Answer given is option CI tried this on W3school IDE it is giving result as option A.
User Avatar
3 votes
0 answers
230
Exam Queries
How many question Gate Toppers attempt in actual Gate Exam and How many marks they do negative? In case of both Easy or Tough paper. Seniors, Please share your experiences.
How many question Gate Toppers attempt in actual Gate Exam and How many marks they do negative? In case of both Easy or Tough paper. Seniors, Please share your experience...
User Avatar
1 votes
0 answers
232
Turing machine
Can anybody explain how a Two stack PDA behaves as a TM?
Can anybody explain how a Two stack PDA behaves as a TM?
User Avatar
1 votes
0 answers
233
Rice's Theorem
What is monotonic and non-monotonic property. Please explain the second postulate of Rice's Theorem.
What is monotonic and non-monotonic property. Please explain the second postulate of Rice's Theorem.
User Avatar
4 votes
1 answer
235
3NF Fully functional dependent
Consider the following statements: A relation R is in 3NF, if every non-prime attribute of R, is fully functionally dependent on some key of R. State True or False
Consider the following statements:A relation R is in 3NF, if every non-prime attribute of R, is fully functionally dependent on some key of R.State True or False
User Avatar
1 votes
1 answer
236
Sql query gate
Provide the correct answer
Provide the correct answer
User Avatar
0 votes
0 answers
239
TOC CFL
Is it a viable possibility: For both L and L complement to be Context Free Language but not Regular? Why?
Is it a viable possibility: For both L and L complement to be Context Free Language but not Regular? Why?
User Avatar
0 votes
0 answers
240
TOC CFL Closure property doubt
Is it viable possibility that L and L complement can both be CFL but not Regular?
Is it viable possibility that L and L complement can both be CFL but not Regular?
User Avatar
Page: