GATE Overflow - Recent questions tagged self-doubt
https://gateoverflow.in/tag/self-doubt
Powered by Question2AnswerSelf Doubt:Paging
https://gateoverflow.in/314871/self-doubt-paging
I have read that paging does not suffer from external fragmentation as the frames and the pages are all of the equal sizes, but when we store a last level page table in a frame at that time it may not fully occupy the frame. Similarly, if n such page tables are stored, that does not occupy the frames entirely, then there can be a case where all the gaps exceed a page size. Then there should be external fragmentation, right? So why is it said that paging does not have external fragmentation?Operating Systemhttps://gateoverflow.in/314871/self-doubt-pagingThu, 13 Jun 2019 10:59:51 +0000Theory of Computation: Context Free Languages
https://gateoverflow.in/314547/theory-of-computation-context-free-languages
<p>Hi, I am having a doubt understanding the result of CFL – Regular:</p>
<p>Here’s my approach:</p>
<ol style="list-style-type:decimal" type="1">
<li>CFL – Regular = CFL INTERSECTION Regular’ = CFL INTERSECTION Regular = CFL</li>
<li>Suppose some CFL L1= {a^n b^n | n>=1} and some Regular R1= (a+b)* : </li>
</ol>
<p>Now if I do CFL – Reg = {ab,aabb,aaabbb, ….} – { epsilon, a, b, ab, aabb, aaabbb, …..} </p>
<p>It gives { phi } which is Regular (hence also CFL)
<br>
</p>
<p>So is it better to say CFL – Regular = Regular or CFL – Regular = CFL ? If both are separate options, which one should I go for? Thanks</p>
<p> </p>Theory of Computationhttps://gateoverflow.in/314547/theory-of-computation-context-free-languagesSun, 09 Jun 2019 13:37:14 +0000Algorithm-Self Doubt
https://gateoverflow.in/314017/algorithm-self-doubt
How in a heap there are at most $\lceil \frac{n}{2^{h+1}} \rceil$ nodes of height h.Algorithmshttps://gateoverflow.in/314017/algorithm-self-doubtMon, 03 Jun 2019 14:38:00 +0000asymptotic_Notations Self_Doubt
https://gateoverflow.in/313742/asymptotic_notations-self_doubt
Please give an example case for which all the three conditions<br />
<br />
$f(n)\neq O(g(n))$,<br />
<br />
$f(n)\neq \Theta (g(n))$ and<br />
<br />
$f(n)\neq \Omega (g(n))$<br />
<br />
holds true.Algorithmshttps://gateoverflow.in/313742/asymptotic_notations-self_doubtSat, 01 Jun 2019 10:24:41 +0000Self Doubt about ME Test Series
https://gateoverflow.in/312991/self-doubt-about-me-test-series
Are comparison charts of Made easy genuine?<br />
And say now if my rank is 3 in a test and after sometime if someone scores more than me will my rank get shifted to 4?GATEhttps://gateoverflow.in/312991/self-doubt-about-me-test-seriesSat, 25 May 2019 14:52:17 +0000Self Doubt :automata
https://gateoverflow.in/312683/self-doubt-automata
Is Mealy machine and Moore Machine in syllabus?Theory of Computationhttps://gateoverflow.in/312683/self-doubt-automataWed, 22 May 2019 13:39:13 +0000Self Doubt-Programming
https://gateoverflow.in/311989/self-doubt-programming
<p>Can someone explain the output of this code? and what (char*) is doing actually?</p>
<pre class="prettyprint linenums lang-c_cpp" data-pbcklang="c_cpp" data-pbcktabsize="4">
#include<stdio.h>
struct Ournode{
char x, y, z;
};
int main() {
struct Ournode p={'1', '0', 'a'+2};
struct Ournode *q=&p;
printf("%c, %c", '*((char*)q+1)', '*((char*)q+2)');
return 0;
}
</pre>Programminghttps://gateoverflow.in/311989/self-doubt-programmingMon, 13 May 2019 06:49:46 +0000Self Doubt : Regarding TLB entry for a page not present in memory
https://gateoverflow.in/311653/self-doubt-regarding-tlb-entry-for-page-not-present-in-memory
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=3825685776419834567">If a page is not present in the memory, then its corresponding entry in the page table would have the ‘Present’ bit set as 0 to indicate , the page is not present.
<br>
<br>
Will this entry be considered for caching in TLB?</p>
<p>As I understand from above line in Tanenbaum, The entry should not be present in TLB. Is my understanding right?</p>Operating Systemhttps://gateoverflow.in/311653/self-doubt-regarding-tlb-entry-for-page-not-present-in-memoryWed, 08 May 2019 21:21:21 +0000POSET self doubt
https://gateoverflow.in/310851/poset-self-doubt
What is dual of a POSET?Set Theory & Algebrahttps://gateoverflow.in/310851/poset-self-doubtSat, 27 Apr 2019 14:56:17 +0000turing machine self doubt a+b=c
https://gateoverflow.in/310809/turing-machine-self-doubt-a-b-c
Turing machine,<br />
<br />
language A = {a+b=c | a, b, c are sequences of 1's; |c| = |a| + |b|; |a| >= 0 and |b| > 0}.Theory of Computationhttps://gateoverflow.in/310809/turing-machine-self-doubt-a-b-cSat, 27 Apr 2019 04:32:42 +0000Self doubt - Programming
https://gateoverflow.in/309629/self-doubt-programming
X=2;<br />
<br />
Y=++x * ++x * ++x ;<br />
<br />
Printf("%d",Y);<br />
<br />
In the above question, we have to use the final value of x or it will be evaluated seperately and then multiplied.<br />
<br />
Ex: Y= 3*4*5; or Y=5*5*5;Programminghttps://gateoverflow.in/309629/self-doubt-programmingThu, 11 Apr 2019 01:57:58 +0000Algorithm Time Complexity-Self Doubt
https://gateoverflow.in/309619/algorithm-time-complexity-self-doubt
<p><strong>What </strong><strong>is</strong><strong> the best case and worst case of the algorithm? And when will best case and worst case will happen??</strong></p>
<pre class="prettyprint linenums lang-c_cpp" data-pbcklang="c_cpp" data-pbcktabsize="4">
int main()
{
for(i=1 ; i<=n ; i++)
{
if(n%i == 0)
{
for(j=1 ; j<=n ; j++)
{
printf("Hello");
}
}
}
}</pre>Algorithmshttps://gateoverflow.in/309619/algorithm-time-complexity-self-doubtWed, 10 Apr 2019 17:06:06 +0000#SELF DOUBT(WEAK ENTITY IN DBMS)
https://gateoverflow.in/309359/%23self-doubt-weak-entity-in-dbms
Can a weak entity depend on more than one strong entity?If yes then how does that exaclty work?Databaseshttps://gateoverflow.in/309359/%23self-doubt-weak-entity-in-dbmsMon, 08 Apr 2019 12:57:11 +0000self doubt
https://gateoverflow.in/308864/self-doubt
<p>In this <a rel="nofollow" href="https://gateoverflow.in/39550/gate2016-2-22">Question</a> , it is said that S is serializable….. so if S is conflict serializable then the precedence graph will be acyclic and we can use Topological sort to get a serial schedule, but what if the graph is not conflict serializable and is view serializable, then the precedence graph will be cyclic and we cannot use topological sort to get a serial schedule …….. then how come the answer is (A). Topological sort….. Please Help!!</p>Databaseshttps://gateoverflow.in/308864/self-doubtFri, 05 Apr 2019 08:35:48 +0000self doubt
https://gateoverflow.in/308752/self-doubt
<p>What is the correct answer of this <a href="https://gateoverflow.in/143588/minimum-number-of-tables-to-represent-er-diagram#c173569" rel="nofollow">Question </a>and what are the Minimized tables ???</p>Databaseshttps://gateoverflow.in/308752/self-doubtThu, 04 Apr 2019 13:21:05 +0000Self doubt
https://gateoverflow.in/308417/self-doubt
Hello guys !! Is solving previous 10 years gate qs suffice ?? Or should I practise more past year qs ?? Please help me outGATE Applicationhttps://gateoverflow.in/308417/self-doubtTue, 02 Apr 2019 15:04:24 +0000self doubt
https://gateoverflow.in/308361/self-doubt
<p>In this <a rel="nofollow" href="https://gateoverflow.in/118640/gate2017-2-44?show=289691#a289691">answer</a>, how is the number of conflict equivalent schedule equal to T1->T2 equal to 1(How is it being calculated). And how is the number of conflict equivalent schedule equal to T2->T1 being calculated??It is very confusing please Help!!!!!</p>Databaseshttps://gateoverflow.in/308361/self-doubtTue, 02 Apr 2019 08:10:19 +0000Self Doubt
https://gateoverflow.in/304244/self-doubt
How to prepare for BARC exam and how many marks required to confirm interview call from the previous cutoff’s.<br />
<br />
Thankyou.Othershttps://gateoverflow.in/304244/self-doubtSat, 16 Feb 2019 13:27:06 +0000GO_DecidabilitySlides
https://gateoverflow.in/300185/go_decidabilityslides
<p>This is from GO Decidability slides.</p>
<p>I have a doubt with 3 & 4 which is saying every TM ACCEPT L since accepted implies that it rejects all which is not part of language.Why we are using ACCEPTED instead of the word RECOGNISED?<img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=7985941438812323024"></p>Theory of Computationhttps://gateoverflow.in/300185/go_decidabilityslidesSun, 27 Jan 2019 05:07:38 +0000Virtual Memory (Self Doubt)
https://gateoverflow.in/296091/virtual-memory-self-doubt
<p>I have a simple doubt, Given a question that says that memory access time is x and page fault service time is y. We apply</p>
<p>T = h*x + (1-h)*y</p>
<p>Here assuming single level pagetable I suppose x is the time for accessing the page table and getting the frame number and to access the frame it should take an extra access to so why in hit case it's x instead of 2x.</p>
<p>In this question Arjun sir took in case of hit 3 access (2 level pagetable + 1 access for accessing frame I 0) why he considered here an extra access ? </p>
<p>Reference : <a rel="nofollow" href="https://gateoverflow.in/85404/gate1990-7-b">https://gateoverflow.in/85404/gate1990-7-b</a></p>
<p> </p>
<p>Help me out here :(</p>Operating Systemhttps://gateoverflow.in/296091/virtual-memory-self-doubtThu, 17 Jan 2019 10:50:28 +0000Doubt: gate2005 2015
https://gateoverflow.in/292689/doubt-gate2005-2015
<p><a href="https://gateoverflow.in/3784/gate2005-it-37" rel="nofollow">https://gateoverflow.in/3784/gate2005-it-37</a></p>
<p><a href="https://gateoverflow.in/8159/gate2015-2-35" rel="nofollow">https://gateoverflow.in/8159/gate2015-2-35</a> (the second answer of this question)</p>
<p>both these follow different diagramatic representations </p>
<p>how should one go about making these diagrams </p>
<p> </p>Theory of Computationhttps://gateoverflow.in/292689/doubt-gate2005-2015Thu, 10 Jan 2019 18:38:18 +0000Made easy theory book
https://gateoverflow.in/286653/made-easy-theory-book
<p>Solve this. <img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=1216770071397169523"></p>Digital Logichttps://gateoverflow.in/286653/made-easy-theory-bookSun, 30 Dec 2018 10:49:24 +0000MadeEasy WorkBook: Digital Logic - Multiplexer
https://gateoverflow.in/286337/madeeasy-workbook-digital-logic-multiplexer
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=2729335695017562547"></p>
<p>Can any explain the output function F? </p>
<p>According to me F=(Z'C'+Z'C) </p>
<p> </p>Digital Logichttps://gateoverflow.in/286337/madeeasy-workbook-digital-logic-multiplexerSat, 29 Dec 2018 17:37:31 +0000MadeEasy WorkBook: Digital Logic - Multiplexer
https://gateoverflow.in/286094/madeeasy-workbook-digital-logic-multiplexer
<p>Can anyone explain this.?? <img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=4604347807425476994"></p>Digital Logichttps://gateoverflow.in/286094/madeeasy-workbook-digital-logic-multiplexerSat, 29 Dec 2018 06:28:39 +0000DOUBT ON MINIMAL SPANNING TREE
https://gateoverflow.in/285756/doubt-on-minimal-spanning-tree
II. if an edge (u,v) is contained in some minimum spanning tree, then it is a light edge crossing some cut of the graph.<br />
<br />
III. If (u,v) is a light edge connecting CC(connected component) to some other component in the forest of graph G, then (u, v) is included in the minimum spanning tree.<br />
<br />
<br />
<br />
didn’t understand the part “light edge crossing some cut of the graph”<br />
<br />
can someone explain me with the diagram ??Algorithmshttps://gateoverflow.in/285756/doubt-on-minimal-spanning-treeFri, 28 Dec 2018 10:26:44 +0000MadeEasy WorkBook: Theory of Computation - Context Free Language
https://gateoverflow.in/280953/madeeasy-workbook-theory-computation-context-free-language
CNF may contain the following<br />
<br />
(a) null productions<br />
<br />
(b) unit productions<br />
<br />
(c) useless symbols<br />
<br />
(d) all of the above<br />
<br />
Given answer is (c)<br />
<br />
But in CNF<br />
<br />
A-->BC<br />
<br />
A-->a<br />
<br />
So, answer should be (b), isn't it?Theory of Computationhttps://gateoverflow.in/280953/madeeasy-workbook-theory-computation-context-free-languageWed, 19 Dec 2018 06:59:46 +0000MadeEasy Theorybook: Theory of Computation - Context Free Languages
https://gateoverflow.in/279096/madeeasy-theorybook-theory-computation-context-languages
<p> </p>
<p> </p>
<p>According to the given formula above, how many productions should be there ? </p>
<p>S-->aAbB</p>
<p>A-->aA | a</p>
<p>B-->bB | b</p>
<p>According to me., it should be 17 but in the book answer is 9, can anyone tell me how? </p>
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=5254016302740622049">mage widget</p>Theory of Computationhttps://gateoverflow.in/279096/madeeasy-theorybook-theory-computation-context-languagesSat, 15 Dec 2018 16:51:04 +0000How much time does it take to solve every problem in the GO Book,all 3 volumes?
https://gateoverflow.in/274957/much-time-does-take-solve-every-problem-the-book-all-volumes
What should my strategy be now as I have to cover OS,DLD,Maths,CN and CO along with revision and taking full length tests.<br />
<br />
I really don’t know what to do about aptitude.<br />
<br />
<br />
<br />
Edit 1: Can people share strategies as to how to divide the syllabus and solve the problems.GATEhttps://gateoverflow.in/274957/much-time-does-take-solve-every-problem-the-book-all-volumesThu, 06 Dec 2018 05:39:45 +0000sql doubt
https://gateoverflow.in/274266/sql-doubt
please give an example to differentiate between self join , natural join and join operation.Databaseshttps://gateoverflow.in/274266/sql-doubtTue, 04 Dec 2018 11:41:31 +0000Compiler Design Doubt
https://gateoverflow.in/262707/compiler-design-doubt
<p><strong>S->Aa | Bc
<br>
A->a
<br>
B->a</strong>
<br>
<br>
1. Is the above grammer <strong>left factored</strong> ?? If not ,then do left factoring on it ??
<br>
2. Is above grammer <strong>deterministic </strong>??
<br>
3. <strong>Is every left factored grammer deterministic ??</strong></p>Compiler Designhttps://gateoverflow.in/262707/compiler-design-doubtThu, 08 Nov 2018 12:40:52 +0000General
https://gateoverflow.in/261363/general
How to see my bookmark question ?Othershttps://gateoverflow.in/261363/generalSun, 04 Nov 2018 10:52:45 +0000c language
https://gateoverflow.in/260324/c-language
in char data type ,plzzz tell me initilization can be seprated from declaration..Programminghttps://gateoverflow.in/260324/c-languageFri, 02 Nov 2018 01:26:47 +0000Difference between efficency and throughput?
https://gateoverflow.in/257518/difference-between-efficency-and-throughput
I am confused with this silly doubt.. someone please help me.<br />
<br />
To calculate efficiency of sliding window protocol we use formula<br />
<br />
Efficiency = 1/1+2a ------Formula1<br />
<br />
i understood how this formula derived by series of steps. And the we calculate throughput by using formula<br />
<br />
Throughput= Efficiency * Bandwidth ------Formula2<br />
<br />
So if i re-write throughput formula as Efficiency = Throughput / Bandwidth.<br />
<br />
So how this efficiency differ in formula1 and formula2? And why we are multiplying Efficiency * Bandwidth to get throughput?<br />
<br />
P:S I am not trying to mug up formulas but trying to understand how they are derived and how each term have its significanceComputer Networkshttps://gateoverflow.in/257518/difference-between-efficency-and-throughputFri, 26 Oct 2018 14:58:32 +0000Compiler self doubt
https://gateoverflow.in/255186/compiler-self-doubt
Can we comment/compare the number of GOTO moves in <br />
<br />
LALR and CLR<br />
<br />
CLR and SLR?Compiler Designhttps://gateoverflow.in/255186/compiler-self-doubtSun, 21 Oct 2018 04:43:23 +0000Self Doubt
https://gateoverflow.in/249801/self-doubt
<p>What would be the worst case time complexity of an unreachable code?</p>
<p>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).</p>
<p> </p>
<p>Something like this:</p>
<p><strong>if (0) {</strong></p>
<p><strong> Time complexity O(n)</strong></p>
<p><strong>}</strong></p>
<p><strong>else </strong></p>
<p><strong> return</strong></p>
<p> </p>
<p>Logically, it would be O(1) because we'll never reach the fragment of code inside <strong>if(0)</strong>.</p>
<p>When we calculate worst case time complexity do we consider only the theoretical aspects or we deduce it logically?</p>
<p>Is there any resource to support this? How is time complexity calculated for unreachable code?</p>
<p> </p>
<p>Thanks</p>
<p><a rel="nofollow" href="https://gateoverflow.in/user/Registered+user+48">Registered user 48</a></p>
<p> </p>
<p> </p>Algorithmshttps://gateoverflow.in/249801/self-doubtThu, 04 Oct 2018 17:26:10 +0000No of flip flops required
https://gateoverflow.in/243819/no-of-flip-flops-required
<p>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 :</p>
<ol>
<li>ripple counter</li>
<li>ring counter</li>
<li>johnson counter</li>
</ol>Digital Logichttps://gateoverflow.in/243819/no-of-flip-flops-requiredSun, 16 Sep 2018 17:55:13 +0000Doubt in memory hierarchy
https://gateoverflow.in/243142/doubt-in-memory-hierarchy
What are the external connections in memory circuit ?CO and Architecturehttps://gateoverflow.in/243142/doubt-in-memory-hierarchySat, 15 Sep 2018 05:00:18 +0000Peter Linz Edition 4 Theorem 12.1 (Page No. 301)
https://gateoverflow.in/242619/peter-linz-edition-4-theorem-12-1-page-no-301
<p>How $H'$ ending with initial state $q_{0}$? Plz explain with the figure given</p>
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=4454207396069684050"></p>Theory of Computationhttps://gateoverflow.in/242619/peter-linz-edition-4-theorem-12-1-page-no-301Thu, 13 Sep 2018 05:45:58 +0000Peter Linz Edition 4 Theorem 12.1 (Page No. 300)
https://gateoverflow.in/242615/peter-linz-edition-4-theorem-12-1-page-no-300
<p>Need some explanation on these two states. How from first state we can go to the last state as shown the symbol?</p>
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=9827066483957470794"></p>Theory of Computationhttps://gateoverflow.in/242615/peter-linz-edition-4-theorem-12-1-page-no-300Thu, 13 Sep 2018 05:36:11 +0000Made Easy Theory Book
https://gateoverflow.in/229952/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.Theory of Computationhttps://gateoverflow.in/229952/made-easy-theory-bookWed, 01 Aug 2018 02:52:13 +0000#OS #Semaphores Producer Consumer Problem Self Doubt.
https://gateoverflow.in/227716/%23os-%23semaphores-producer-consumer-problem-self-doubt
<p>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.
<br>
<br>
</p>
<p>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 whenever C finally goes to sleep will decrement the bit, <em><strong>but is it also the case that when P is sleeping then C can also send a semaphore bit = 1 for P and when Producer sees that bit = 1 and start producing and when buffer is full, P will decrement that bit and go to sleep?</strong></em>
<br>
<br>
Basically, both P and C can send this integer bit or only P can send this to C to wake him up?
<br>
<br>
<br>
<br>
Thank you!</p>Operating Systemhttps://gateoverflow.in/227716/%23os-%23semaphores-producer-consumer-problem-self-doubtSun, 22 Jul 2018 16:45:33 +0000Normalization - 3NF doubt
https://gateoverflow.in/223761/normalization-3nf-doubt
<p>A relation has the attributes R(ABCDEPG). The set of Functional Dependencies are :</p>
<p>$F: { AB \to CD, DE \to P, C\to E, P\to C, B \to G }$</p>
<p>After <strong>normalising this relation till 3NF</strong>, I get the following tables : ${ABDE, DP, PC, CE, and BG}$</p>
<p>Please confirm the answer.</p>
<p>The decomposition is lossless, but I am not getting dependency preserving property. However, I read it in books that IT IS ALWAYS POSSIBLE TO GET A LOSSLESS AND DEPENDENCY PRESERVING PROPERTY IN 3NF - <strong>But I am not getting the Dependency Preservation property.</strong> Is something wrong with the decomposition ?</p>Databaseshttps://gateoverflow.in/223761/normalization-3nf-doubtWed, 04 Jul 2018 17:34:07 +0000pipelining
https://gateoverflow.in/223065/pipelining
<p>What is difference between in both questions</p>
<p><a rel="nofollow" href="https://gateoverflow.in/3690/gate2004-it-47#c165909">https://gateoverflow.in/3690/gate2004-it-47#c165909</a></p>
<p><a rel="nofollow" href="https://gateoverflow.in/1314/gate2009-28">https://gateoverflow.in/1314/gate2009-28</a></p>CO and Architecturehttps://gateoverflow.in/223065/pipeliningSat, 30 Jun 2018 17:25:34 +0000#Algorithm Bellman Ford uses which algorithm design technique
https://gateoverflow.in/217026/%23algorithm-bellman-ford-which-algorithm-design-technique
Is it Dynamic programming?Algorithmshttps://gateoverflow.in/217026/%23algorithm-bellman-ford-which-algorithm-design-techniqueThu, 17 May 2018 16:05:56 +0000Cache coloring
https://gateoverflow.in/216576/cache-coloring
<p>I am stuck in two doubts.</p>
<ul>
<li>Is page-coloring / cache-coloring same as set-associative mapping in cache ( that is are they different names for same concept)?</li>
<li>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 )?</li>
</ul>
Operating Systemhttps://gateoverflow.in/216576/cache-coloringSun, 13 May 2018 05:40:11 +0000pushdown-automata
https://gateoverflow.in/213866/pushdown-automata
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=13080564529593292427"></p>Theory of Computationhttps://gateoverflow.in/213866/pushdown-automataMon, 23 Apr 2018 12:10:04 +0000Codes of Turing Machine
https://gateoverflow.in/211780/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 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?Theory of Computationhttps://gateoverflow.in/211780/codes-of-turing-machineWed, 11 Apr 2018 12:33:08 +0000SQL Query
https://gateoverflow.in/201132/sql-query
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=9513503384806293600"></p>
<p>Why this Query is illigal? i.e. Answer given is option C</p>
<p>I tried this on W3school IDE it is giving result as option A.</p>Databaseshttps://gateoverflow.in/201132/sql-queryMon, 29 Jan 2018 08:11:24 +0000Exam Queries
https://gateoverflow.in/201107/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.GATEhttps://gateoverflow.in/201107/exam-queriesMon, 29 Jan 2018 06:43:21 +00003NF Normalization Doubt
https://gateoverflow.in/199486/3nf-normalization-doubt
<p>Is a relation with multiple candidate keys in 3NF?</p>
<p>According to this,</p>
<p><img alt="" height="207" src="https://gateoverflow.in/?qa=blob&qa_blobid=6877397350649965238" width="559"></p>
<p>As per the first definition any relation having multiple candidate keys will have transitive dependency to a non key attribute.</p>
<p><strong>My Inference :</strong> Since it has a Transitive dependency thus any relation having multiple candidate keys will not be in 3NF.</p>
<p>Image Source(<a rel="nofollow" href="http://www2.york.psu.edu/~lxn/IST_210/normal_form_definitions.html">Website</a>) and the website was mentioned here : <a rel="nofollow" href="https://gatecse.in/databases/">Gate CSE Database Page</a> (Normal Forms Quick View)</p>
<p>I just want to confirm that the definition and my inference given is correct or not.And if it is correct can you please provide some other reference illustrating the same concept.</p>Databaseshttps://gateoverflow.in/199486/3nf-normalization-doubtThu, 25 Jan 2018 02:01:49 +0000