menu
search
Log In
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

Subjects

Recent questions tagged self-doubt

Network Sites

 GO Mechanical
 GO Electrical
 GO Electronics
 GO Civil
 CSE Doubts

Recent questions tagged self-doubt

0 votes
0 answers
1
General
How to see my bookmark question ?
How to see my bookmark question ?
asked Nov 4, 2018 in Others Vishal sakariya 132 views
0 votes
0 answers
2
c language
in char data type ,plzzz tell me initilization can be seprated from declaration..
in char data type ,plzzz tell me initilization can be seprated from declaration..
asked Nov 2, 2018 in Programming saurabh111 32 views
3 votes
0 answers
3
Difference between efficency and throughput?
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 ... I am not trying to mug up formulas but trying to understand how they are derived and how each term have its significance
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
asked Oct 26, 2018 in Computer Networks vupadhayayx86 917 views
0 votes
1 answer
4
Compiler self doubt
Can we comment/compare the number of GOTO moves in LALR and CLR CLR and SLR?
Can we comment/compare the number of GOTO moves in LALR and CLR CLR and SLR?
asked Oct 21, 2018 in Compiler Design manisha11 72 views
0 votes
0 answers
5
Self Doubt
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 ... or we deduce it logically? Is there any resource to support this? How is time complexity calculated for unreachable code? Thanks Registered user 48
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
asked Oct 4, 2018 in Algorithms Registered user 48 49 views
0 votes
1 answer
6
No of flip flops required
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
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
asked Sep 16, 2018 in Digital Logic Balaji Jegan 181 views
0 votes
0 answers
7
Doubt in memory hierarchy
What are the external connections in memory circuit ?
What are the external connections in memory circuit ?
asked Sep 15, 2018 in CO and Architecture Abbas Ahmad 28 views
1 vote
1 answer
10
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.
asked Aug 1, 2018 in Theory of Computation Sid865 99 views
0 votes
0 answers
11
#OS #Semaphores Producer Consumer Problem Self Doubt.
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 ... ? Basically, both P and C can send this integer bit or only P can send this to C to wake him up? Thank you!
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!
asked Jul 22, 2018 in Operating System iarnav 154 views
0 votes
2 answers
12
Normalization - 3NF doubt
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 }$ ... A LOSSLESS AND DEPENDENCY PRESERVING PROPERTY IN 3NF - But I am not getting the Dependency Preservation property. Is something wrong with the decomposition ?
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 ?
asked Jul 4, 2018 in Databases Harsh Kumar 214 views
0 votes
0 answers
13
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 questions https://gateoverflow.in/3690/gate2004-it-47#c165909 https://gateoverflow.in/1314/gate2009-28
asked Jun 30, 2018 in CO and Architecture Bhavna kumrawat 44 views
0 votes
0 answers
15
Cache coloring
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 )?
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 )?
asked May 13, 2018 in Operating System Harsh Kumar 140 views
0 votes
0 answers
17
Codes of Turing Machine
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 ... state and codes of turing machine is the representation of transition function,so how do these two turing machines will have different codes?
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?
asked Apr 11, 2018 in Theory of Computation rahul sharma 5 460 views
2 votes
0 answers
18
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 C I tried this on W3school IDE it is giving result as option A.
asked Jan 29, 2018 in Databases Ashwin Kulkarni 150 views
3 votes
0 answers
19
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 experiences.
asked Jan 29, 2018 in GATE Rajnish Kumar 1 97 views
1 vote
1 answer
20
3NF Normalization Doubt
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 ... given is correct or not.And if it is correct can you please provide some other reference illustrating the same concept.
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.
asked Jan 25, 2018 in Databases Sourajit25 142 views
1 vote
0 answers
21
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?
asked Jan 24, 2018 in Theory of Computation Na462 60 views
1 vote
0 answers
22
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.
asked Jan 23, 2018 in Theory of Computation Sumaiya23 129 views
2 votes
0 answers
23
Self doubt
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
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
asked Jan 22, 2018 in Revision Ajay Jadhav 184 views
2 votes
1 answer
24
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
asked Jan 15, 2018 in Databases anabee 561 views
1 vote
1 answer
25
Sql query gate
Provide the correct answer
Provide the correct answer
asked Jan 13, 2018 in Databases Harikesh Kumar 124 views
1 vote
1 answer
27
Starvation
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 ... do we consider a Single processor system or a Multiprocessor i.e. when we have multiple processing cores or CPUs available?
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?
asked Jan 9, 2018 in Operating System VS 171 views
0 votes
0 answers
28
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?
asked Dec 16, 2017 in Theory of Computation Nefarious Monkey 62 views
0 votes
0 answers
29
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?
asked Dec 15, 2017 in Theory of Computation Nefarious Monkey 131 views
0 votes
0 answers
30
Doubt in Rice's Theorem
I have a doubt while understanding step 2 in proof of Rice's Theorem- According to my understanding,proof of Rice's theorem as follows ( Please suggest If something is wrong in my understanding) P is a property of languages of TM which is non-trivial ... Same problem as ATM). Can M' take decision in finite time. Please give me some insights to I can understand this point.
I have a doubt while understanding step 2 in proof of Rice's Theorem- According to my understanding,proof of Rice's theorem as follows ( Please suggest If something is wrong in my understanding) P is a property of languages of TM which is non-trivial and semantic. We ... at all(Same problem as ATM). Can M' take decision in finite time. Please give me some insights to I can understand this point.
asked Dec 15, 2017 in Theory of Computation Durgesh Singh 176 views
Page:
Dark theme
Muffin by Hélio Chun
Thanks to Q2A
...