# Recent questions tagged self-doubt

1
How to see my bookmark question ?
2
in char data type ,plzzz tell me initilization can be seprated from declaration..
3
I am confused with this silly doubt.. someone please help me. To calculate efficiency of sliding window protocol we use formula Efficiency = 1/1+2a ------Formula1 i understood how this formula derived by series of steps. And the we calculate throughput by using formula ... P:S I am not trying to mug up formulas but trying to understand how they are derived and how each term have its significance
4
Can we comment/compare the number of GOTO moves in LALR and CLR CLR and SLR?
5
What would be the worst case time complexity of an unreachable code? Let's say there are two parts to the code, where first part is if (0) with complexity O(n) and the else part with O(1). Something like this: if (0) { Time complexity O(n ... aspects or we deduce it logically? Is there any resource to support this? How is time complexity calculated for unreachable code? Thanks Registered user 48
6
If there are total 21 different states in a system and there is one external input, then how many flip flops are required in case of : ripple counter ring counter johnson counter
7
What are the external connections in memory circuit ?
8
How $H'$ ending with initial state $q_{0}$? Plz explain with the figure given
9
Need some explanation on these two states. How from first state we can go to the last state as shown the symbol?
1 vote
10
Can somebody please explain the meaning of the following statement : An automation is a cognitive device and a grammar is a generative device.
11
I know, that both P and C can go and fall into sleeping state in case of preemption and this can be solved via Semaphores. Now, my doubt is that integer bit that will be set by the P and being sent to C and C will see the semaphore bit = 1 and won't go to sleep and ... bit and go to sleep? Basically, both P and C can send this integer bit or only P can send this to C to wake him up? Thank you!
12
A relation has the attributes R(ABCDEPG). The set of Functional Dependencies are : $F: { AB \to CD, DE \to P, C\to E, P\to C, B \to G }$ ... TO GET A LOSSLESS AND DEPENDENCY PRESERVING PROPERTY IN 3NF - But I am not getting the Dependency Preservation property. Is something wrong with the decomposition ?
13
What is difference between in both questions https://gateoverflow.in/3690/gate2004-it-47#c165909 https://gateoverflow.in/1314/gate2009-28
14
Is it Dynamic programming?
15
I am stuck in two doubts. Is page-coloring / cache-coloring same as set-associative mapping in cache ( that is are they different names for same concept)? Is the cache line size always equal to the page-size, or it depends upon implementation details ( that is it will be given in the question )?
16
17
As codes of turing machines are unique for a given turing machine,Say no i have two turing machines ,one for even a's and other for odd a's over the input a,b. Now both these machines will have same transition function but different final state and codes of turing machine is the representation of transition function,so how do these two turing machines will have different codes?
18
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.
19
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.
1 vote
20
Is a relation with multiple candidate keys in 3NF? According to this, As per the first definition any relation having multiple candidate keys will have transitive dependency to a non key attribute. My Inference : Since it has a Transitive dependency thus any ... inference given is correct or not.And if it is correct can you please provide some other reference illustrating the same concept.
1 vote
21
Can anybody explain how a Two stack PDA behaves as a TM?
1 vote
22
What is monotonic and non-monotonic property. Please explain the second postulate of Rice's Theorem.
23
This may seem trivial I'm scoring little less in Made-easy than what I'm scoring in other Test series. Is made-easy test closer to actual gate difficulty?Or they are just trying to make it difficult. Overall. I want to know so that I'm ready for tough paper too. I'd appreciate any experiences or suggestion
24
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
1 vote
25
26
1 vote
27
I am confused with what exactly Starvation mean ? AFAIK Considering Process Scheduling eg SRTF and SJF , Starvation can be considered when some process is getting preempted by other high priority processes and hence not getting a chance to execute on CPU and hence ... solving do we consider a Single processor system or a Multiprocessor i.e. when we have multiple processing cores or CPUs available?
28
Is it a viable possibility: For both L and L complement to be Context Free Language but not Regular? Why?
29
Is it viable possibility that L and L complement can both be CFL but not Regular?