GATE CSE Doubts - Recent questions and answers
https://csedoubts.gateoverflow.in/qa
Powered by Question2AnswerLecturer In Information Technology KPSC-2015
https://csedoubts.gateoverflow.in/357630/lecturer-in-information-technology-kpsc-2015
Which is true for typical RISC architecture?<br />
<br />
A.Micro Programmed Control Unit<br />
<br />
B.Instruction takes multiple clock cycles.<br />
<br />
C.Have few register in CPU<br />
<br />
D.Emphasis on optimising instruction pipelinesCO & Architecturehttps://csedoubts.gateoverflow.in/357630/lecturer-in-information-technology-kpsc-2015Fri, 18 Jun 2021 14:18:23 +0000[SELF DOUBT] DSA BUBBLE SORT
https://csedoubts.gateoverflow.in/357631/self-doubt-dsa-bubble-sort
is bubble sort an online algorithm? cause whenever new element is fed, it can be take to its place by swapping the adjacent numbers. is my thinking right?Algorithmshttps://csedoubts.gateoverflow.in/357631/self-doubt-dsa-bubble-sortFri, 18 Jun 2021 14:18:13 +0000Book name:- computer networking top down approach
https://csedoubts.gateoverflow.in/357632/book-name-computer-networking-top-down-approach
<p>I am reading <strong>packet switching vs circuit switching from computer networking a top down approach(pg no. 57)</strong> . I came across an example: </p>
<p>Suppose there are 10 users and that one user suddenly generates one thousand 1000-bit packets, while other users remain quiescent and don’t generate packets. Under TDM circuit switching with 10 slots per frame and each slot consisting of 1000 bits, the active user can only use its one time slot per frame to transmit data, while the remaining nine time slots in each frame remain idle. It will be <strong>10 seconds </strong>before all of the active user’s one million bits<br>
of data has been transmitted.</p>
<p>Now I don,t know how author got 10s as answer while i am getting 100s as answer.</p>
<p>Kindly help.</p>Computer Networkshttps://csedoubts.gateoverflow.in/357632/book-name-computer-networking-top-down-approachFri, 18 Jun 2021 14:17:21 +0000Answered: GATE CSE 2021 Set 1 | Question: 12 | Video Solution
https://csedoubts.gateoverflow.in/357440/gate-cse-2021-set-1-question-12-video-solution?show=357635#a357635
<p>for video solution refer below link</p>
<p><a rel="nofollow" href="https://youtu.be/jvYYRWjhblQ">https://youtu.be/jvYYRWjhblQ</a></p>Theory of Computationhttps://csedoubts.gateoverflow.in/357440/gate-cse-2021-set-1-question-12-video-solution?show=357635#a357635Fri, 18 Jun 2021 08:15:12 +0000Answered: GATE CSE 2021 Set 1 | Question: 3 | Video Solution
https://csedoubts.gateoverflow.in/357449/gate-cse-2021-set-1-question-3-video-solution?show=357634#a357634
<p>for video solution refer below link.</p>
<p><a href="https://youtu.be/VoOj10aroPs" rel="nofollow">https://youtu.be/VoOj10aroPs</a></p>Algorithmshttps://csedoubts.gateoverflow.in/357449/gate-cse-2021-set-1-question-3-video-solution?show=357634#a357634Fri, 18 Jun 2021 08:12:43 +0000Self doubt
https://csedoubts.gateoverflow.in/357621/self-doubt
What is the range of IP addresses spanned by the CIDR address 192.168.10.0/20?Computer Networkshttps://csedoubts.gateoverflow.in/357621/self-doubtThu, 17 Jun 2021 06:43:44 +0000[SELF DOUBT] DSA INSERTION SORT
https://csedoubts.gateoverflow.in/357624/self-doubt-dsa-insertion-sort
for an almost sorted array, which algorithm is better, shell sort or insertion sort? and also for a fully sorted array?Algorithmshttps://csedoubts.gateoverflow.in/357624/self-doubt-dsa-insertion-sortThu, 17 Jun 2021 06:43:41 +0000Which problems in dynamic programming are the most important for GATE 2022?
https://csedoubts.gateoverflow.in/357625/which-problems-dynamic-programming-most-important-gate-2022
I am currently studying dynamic programming for GATE 2022. I am kinda stuck with which problems to prioritize. Can someone help?<br />
<br />
#dynamic-programmingAlgorithmshttps://csedoubts.gateoverflow.in/357625/which-problems-dynamic-programming-most-important-gate-2022Thu, 17 Jun 2021 06:43:34 +0000self doubght
https://csedoubts.gateoverflow.in/357626/self-doubght
what is difference between preemption and inturrupts on process state diagramOperating Systemhttps://csedoubts.gateoverflow.in/357626/self-doubghtThu, 17 Jun 2021 06:43:28 +0000[SELF DOUBT] DSA , IN PLACE SORTING
https://csedoubts.gateoverflow.in/357623/self-doubt-dsa-in-place-sorting
if we require a large(more than size of array or 1000000mb) but constant( irrespective of size of input array) extra space for an algorithm, will the algorithm be in place or not? the extra space is not required to manipulate the elements of array but may be required for some other purpose.Algorithmshttps://csedoubts.gateoverflow.in/357623/self-doubt-dsa-in-place-sortingThu, 17 Jun 2021 01:30:45 +0000Answered: 1.GeeksforGeeks
https://csedoubts.gateoverflow.in/357604/1-geeksforgeeks?show=357618#a357618
<p>This question is already present, check.</p>
<p><a rel="nofollow" href="https://gateoverflow.in/226077/scheduling">https://gateoverflow.in/226077/scheduling</a></p>Operating Systemhttps://csedoubts.gateoverflow.in/357604/1-geeksforgeeks?show=357618#a357618Wed, 16 Jun 2021 08:25:22 +0000Made easy workbook c programming question
https://csedoubts.gateoverflow.in/357619/made-easy-workbook-c-programming-question
<p><img alt="" src="https://csedoubts.gateoverflow.in/?qa=blob&qa_blobid=7433128412010810480">The correct answer is (b).</p>
<p>I am not able to understand how it is the correct answer, please explain.</p>Programminghttps://csedoubts.gateoverflow.in/357619/made-easy-workbook-c-programming-questionTue, 15 Jun 2021 11:22:22 +0000Final exam 2020-2021
https://csedoubts.gateoverflow.in/357612/final-exam-2020-2021
If some T FFs are connected in series. The 1st FF is supplied by a clock with frequency 1 MHz and the<br />
last FF signal out is 31.25 KHz. Find the number of the Flip Flops are used in the circuit.Digital Logichttps://csedoubts.gateoverflow.in/357612/final-exam-2020-2021Mon, 14 Jun 2021 21:48:46 +0000Forouzan's Sliding Window Numerical
https://csedoubts.gateoverflow.in/357616/forouzans-sliding-window-numerical
I was scrolling through sample questions when I chanced over this question.<br />
<br />
Consider a sliding window flow control protocol between hosts A and B. Suppose the link propagation delay<br />
is 1 time unit, the retransmission timeout is 3 time units, and the window size is 3. Assume the link drops every<br />
third data packet, i.e., the link drops the 1st, 4th, 7th, .... data packets. (Note that here "k th packet" means the<br />
k th packet transmitted on the link, and not the sequence number of the packet.) How long does it take to<br />
transmit 6 packets between A and B?<br />
<br />
Now, since the window size is odd. Clearly the sliding window protocol that is being referred is a Go-Back-N protocol, rather than Selective-Repeat. There are a lot of things to consider. For example, in Forouzan, only the timer for the first packet is running. Secondly, do I count acknowledgement (ACK) frames to while calculating the drops? I would really appreciate any help regarding this question. Also, can someone please leave a link to similar questions?Computer Networkshttps://csedoubts.gateoverflow.in/357616/forouzans-sliding-window-numericalMon, 14 Jun 2021 21:48:27 +0000Probability books name :- Sheldon m. Ross
https://csedoubts.gateoverflow.in/357615/probability-books-name-sheldon-m-ross
"Normal distribution" :- probability density function f(x) =1/√2π σ e^-(x- μ )^2/( σ ) ^2.<br />
<br />
My question is, why are use √2π as constant.<br />
<br />
Please explain in details.Probabilityhttps://csedoubts.gateoverflow.in/357615/probability-books-name-sheldon-m-rossMon, 14 Jun 2021 18:33:04 +0000Endian concept gate 2021 -- set 2 Question 54
https://csedoubts.gateoverflow.in/357614/endian-concept-gate-2021-set-2-question-54
In what subject 'endian' concept had and where I study endian concept?Study Resourceshttps://csedoubts.gateoverflow.in/357614/endian-concept-gate-2021-set-2-question-54Mon, 14 Jun 2021 11:50:51 +0000Made Easy DBMS Practice Set - Normalisation - Question 53
https://csedoubts.gateoverflow.in/357610/made-easy-dbms-practice-set-normalisation-question-53
<p>Let R be a relation. Which of the following comments about the relation R are correct ? </p>
<ol>
<li>R will necessarily have a composite key if R is in BCNF but not in 4NF</li>
<li>If R is in 3NF and if every key of R is simple, then R is in BCNF</li>
<li>If R is in BCNF and if R has at least one simple key , then R is in 4NF</li>
<li>If R is in 3NF and if its every key is simple, then R is in 5NF</li>
</ol>
<p> </p>
<p>a) 1 and 4</p>
<p>b) 2 and 3</p>
<p>c) 1, 2 and 3</p>
<p>d) 1, 2, 3 and 4</p>
<p> </p>Databaseshttps://csedoubts.gateoverflow.in/357610/made-easy-dbms-practice-set-normalisation-question-53Mon, 14 Jun 2021 08:09:52 +0000Made Easy DBMS practice set - Normalization - Question 45
https://csedoubts.gateoverflow.in/357611/made-easy-dbms-practice-set-normalization-question-45
<p>Redundancy is dangerous as it is a potentiad threat to data</p>
<ol>
<li>integrity</li>
<li>consistency</li>
<li>sufficiency</li>
<li>both 1 and 2</li>
</ol>
<p> </p>
<p>Answer is 4 but why ?</p>Databaseshttps://csedoubts.gateoverflow.in/357611/made-easy-dbms-practice-set-normalization-question-45Mon, 14 Jun 2021 08:09:44 +0000Applied Gate Practice Test
https://csedoubts.gateoverflow.in/357605/applied-gate-practice-test
<p>Consider the following counter. If the initial states of Q0(MSB) and Q1(LSB) are 0. What is the sequence Q0 Q1 given by the following diagram?</p>
<p><img alt="" src="https://csedoubts.gateoverflow.in/?qa=blob&qa_blobid=12811697117997349438"></p>Digital Logichttps://csedoubts.gateoverflow.in/357605/applied-gate-practice-testSun, 13 Jun 2021 07:36:49 +0000Process management
https://csedoubts.gateoverflow.in/357603/process-management
In state transition diagram of scheduling if there is transition from running to ready then it will be preemptive scheduling otherwise not??<br />
<br />
My doubt is if process request for io then it will move to blocked state and after completion then it will be pushed to ready state and again can go to running the. It also should be preemptive scheduling na !!<br />
<br />
<br />
<br />
Plz clear this doubt.Operating Systemhttps://csedoubts.gateoverflow.in/357603/process-managementSat, 12 Jun 2021 10:53:11 +0000Self doubt
https://csedoubts.gateoverflow.in/357591/self-doubt
Can a person with B.E chemical do Mtech in CSE through Gate??Which colleges allow and at what rank??IISc/IITshttps://csedoubts.gateoverflow.in/357591/self-doubtSat, 12 Jun 2021 08:56:33 +0000MADE EASY TEST SERIES DBMS 2022
https://csedoubts.gateoverflow.in/357593/made-easy-test-series-dbms-2022
<p><img alt="" height="605" src="https://csedoubts.gateoverflow.in/?qa=blob&qa_blobid=9289133346971589562" width="605"></p>
<p> </p>
<p>I cannot understand why is option D) incorrect? Can anyone give an example of how in option D) first one can contain duplicate values and second one cannot ? Kindly help me.</p>
<p>Thanks in advance</p>Databaseshttps://csedoubts.gateoverflow.in/357593/made-easy-test-series-dbms-2022Sat, 12 Jun 2021 08:56:28 +0000What should I retain in round 4 of COAP?
https://csedoubts.gateoverflow.in/357594/what-should-i-retain-in-round-4-of-coap
Currently I have retained MTech CSE of iit kanpur one time in round 2 of COAP , and round 3 , i have only got iitK again.<br />
<br />
I will be retaining iitK again , but now I have retained iitK two times.<br />
<br />
I want iitMadras but in. Internet I found Iit madras last rank ends upto exactly my rank in last round, ie, round5 , but if in round 4 I got no new offer , then what should I do, retain iitK?? <br />
Or Take risk for round 5 ??<br />
<br />
What Would You advice ??IISc/IITshttps://csedoubts.gateoverflow.in/357594/what-should-i-retain-in-round-4-of-coapSat, 12 Jun 2021 08:56:20 +0000Go Back N flow control
https://csedoubts.gateoverflow.in/357596/go-back-n-flow-control
<p>I had a doubt regarding one scenario in Go Back N flow control algorithm. Consider the following scenario shown in the image</p>
<p style="text-align:center"><img alt="" src="https://csedoubts.gateoverflow.in/?qa=blob&qa_blobid=7181525215574853364"></p>
<p>The left hand side is the sender and the right hand side is the reciever. I referred to Kurose Ross Extended FSM Description of GBN sender and reciever to trace the above scenario. Here the reciever recieves the packets in order, and it sends the acknowledgement packets in order as well. But as we know, a packet can be in transit for about 180s (= 3 min) in the network before reaching the reciever(the sender as acknowledgement packet is sent from reciever to sender) and also since IP can deliver the packets out of order, acknowledgement packet 1 comes after packets 2 and 3. Moreover, packets 2 and 3 come well within the timer expires, but packet 1 comes just after the timer has expired. So according to the FSM description,, the sender will start resending the entire window(packets 1, 2 and 3). Is this correct? Can such a scenario even occur in real life? Thanks in advance. </p>Computer Networkshttps://csedoubts.gateoverflow.in/357596/go-back-n-flow-controlSat, 12 Jun 2021 08:56:12 +0000#forozoun#tannenbaum#computernetworks#syllabus#flowcontrol#errorcontrol
https://csedoubts.gateoverflow.in/357598/%23forozoun%23tannenbaum%23computernetworks%23syllabus%23flowcontrol%23errorcontrol
Do we have hdlc and ppp protocols(flow and error control) in syllabus?Computer Networkshttps://csedoubts.gateoverflow.in/357598/%23forozoun%23tannenbaum%23computernetworks%23syllabus%23flowcontrol%23errorcontrolSat, 12 Jun 2021 08:56:01 +0000Clear distinction between Finite automata, Regular expressions
https://csedoubts.gateoverflow.in/357599/distinction-between-finite-automata-regular-expressions
<p><strong><em>Given language L = </em></strong><em> strings starting with 'a'. Sigma(Alphabet) = {a,b}</em></p>
<p> </p>
<p><strong><em>DFA</em></strong>: It should only accept the given language and reject other languages. Therefore <strong>only</strong> strings starting with 'a' <strong>MUST </strong>be accepted by the DFA, and the strings starting with 'b' <strong>MUST NOT </strong>be accepted by the DFA<strong>.</strong></p>
<p> </p>
<p><strong><em>NFA:</em></strong> It must accept the given language but can also accept other languages. Therefore strings starting with 'a' <strong>MUST</strong> be accepted by the NFA, and the strings starting with 'b' <strong>can also </strong>be accepted by the NFA, as NFA only cares about the given language is accepted or not<strong>.</strong></p>
<p> </p>
<p><strong><em>Regular Expressions:</em></strong> It is also like NFA, It must contain the strings/words starting with 'a', but can also contain strings starting with 'b'. For example,</p>
<p><strong>r1 =a.(a+b)* </strong> <strong>r2= (a+b)*</strong></p>
<p>r1 is guaranteed to start with 'a', but r2 can also start with 'a', although r2 also contains strings starting with 'b', or, empty strings. But for us, r2 can start with 'a' also, so it is also a correct regular expression also.</p>
<p> </p>
<p> </p>
<p>I know the NFA and Regular expressions are not correctly defined by me, can you please define all these clearly so that it becomes easy to distinguish them.</p>Theory of Computationhttps://csedoubts.gateoverflow.in/357599/distinction-between-finite-automata-regular-expressionsSat, 12 Jun 2021 04:15:49 +0000GATE previous year question
https://csedoubts.gateoverflow.in/357597/gate-previous-year-question
<p>consider a direct mapped cache of 8 blocks used to implement the following program segment</p>
<pre class="prettyprint linenums lang-c_cpp" data-pbcklang="c_cpp" data-pbcktabsize="4">
float a[10][10];
int i;
for(i=0;i<10;i++)
for(j=0;j<10;j++)
a[i][j]=8.0;
</pre>
<p>float element occupies 4 bytes, the block size is 12 bytes and array is stored in row-major form. Find the number of hits.</p>
<p>also, if the array was stored in coloumn-major, What the number of hits would’ve been?</p>CO & Architecturehttps://csedoubts.gateoverflow.in/357597/gate-previous-year-questionSat, 12 Jun 2021 01:29:25 +0000Igate bhilai test gate 2022
https://csedoubts.gateoverflow.in/357595/igate-bhilai-test-gate-2022
What is the output of program?<br />
<br />
void swap (char *x, char *y)<br />
<br />
{<br />
<br />
char *t = x;<br />
<br />
x = y;<br />
<br />
y = t;<br />
<br />
}<br />
<br />
int main()<br />
<br />
{<br />
<br />
char *x = "IGATE";<br />
<br />
char *y = "BEST IN CG";<br />
<br />
char *t;<br />
<br />
swap(x, y);<br />
<br />
printf("(%s, %s)", x, y);<br />
<br />
t = x;<br />
<br />
x = y;<br />
<br />
y = t;<br />
<br />
printf("\n(%s, %s)", x, y);<br />
<br />
return 0;<br />
<br />
}<br />
<br />
Options Correct sequence of options.<br />
<br />
A: (IGATE, BEST IN CG)<br />
<br />
(BEST IN CG, IGATE) .<br />
<br />
B: (BEST IN CG, IGATE)<br />
<br />
(IGATE, BEST IN CG) .<br />
<br />
C: (IGATE, BEST IN CG)<br />
<br />
(IGATE, BEST IN CG).<br />
<br />
D: (BEST IN CG, IGATE)<br />
<br />
(BEST IN CG, IGATE).Programminghttps://csedoubts.gateoverflow.in/357595/igate-bhilai-test-gate-2022Fri, 11 Jun 2021 11:52:06 +0000This question is related to Intrested Variable Mechnanism in Operating System.
https://csedoubts.gateoverflow.in/357590/question-related-intrested-variable-mechnanism-operating
<p>Two processes, P1 and P2, need to access a critical section of code. Consider the following synchronization construct used by the processes:</p>
<pre class="prettyprint linenums lang-c_cpp" data-pbcklang="c_cpp" data-pbcktabsize="4">
/* P1 */
while (true) {
wants1 = true;
while (wants2 == true);
/* Critical Section */
wants1 = false;
}
/* Remainder section */
/* P2 */
while (true) {
wants2 = true;
while (wants1 == true);
/* Critical Section */
wants2=false;
}
/* Remainder section */</pre>
<p>Here, wants1 and wants2 are shared variables,</p>
<p>My question is to argue on PROGRESS.</p>
<p>A case can be possible when P1 wants to enter in the critical section and set its interested variable to true and checks whether the interested variable of P2 is true. Here, (consider )P2's interest variable to be True hence P1 will get stuck in the while loop and waits for P2 become uninterested. Since, P2 still stuck in the while loop waiting for the P1’s interested variable to become false. Therefore, both the processes are waiting for each other and none of them is getting into the critical section..</p>
<p>DEFINITION of progress:If no process is executing in its critical section and some processes wish to enter their critical sections, then only those processes that are not executing in their remainder section can participate in deciding which will enter its critical section next, AND THIS SELECTION CANNOT BE POSTPONED INDEFINITELY.</p>
<p>SO WHY EVERYWHERE IT IS WRITTEN PROGRESS IS THERE?</p>
<p>In the case when both wants1 and wants2 are true it will indefinitely be postponed then why progress is there?</p>Operating Systemhttps://csedoubts.gateoverflow.in/357590/question-related-intrested-variable-mechnanism-operatingThu, 10 Jun 2021 16:33:43 +0000NPTEL(Theory of Computation )
https://csedoubts.gateoverflow.in/357582/nptel-theory-of-computation
How is the regular expression (0+1)*0(0+1)*1(0+1)* is equivalent to (0+1)*01(0+1)* ?Theory of Computationhttps://csedoubts.gateoverflow.in/357582/nptel-theory-of-computationWed, 09 Jun 2021 16:23:32 +0000Topic name : heapify and heapsort
https://csedoubts.gateoverflow.in/357576/topic-name-heapify-and-heapsort
We can reduce the space complexity of heapsort to o(1) by using heapify using loops, then why we dont reduce the space complexity of heapify from o(logn) to o(1) by using loops here also.?Algorithmshttps://csedoubts.gateoverflow.in/357576/topic-name-heapify-and-heapsortWed, 09 Jun 2021 08:10:15 +0000Answered: ACE Academy Test series gate 2021
https://csedoubts.gateoverflow.in/357561/ace-academy-test-series-gate-2021?show=357577#a357577
<p>As a result of deletion<strong> ( X2 Y2 X1)</strong> – (X3 Y1 X2 ) , ( X4 Y2 X2 ) will be deleted.</p>
<p>As a result of deletion <strong>(X3 Y1 X2 )</strong>- (X5 Y4 X3 ) , ( X9 Y5 X3 ) will be deleted .</p>
<p>As a result of deletion <strong>(</strong> <strong>X4 Y2 X2 ) – </strong>No tuples </p>
<p>As a result of deletion <strong>( X5 Y4 X3 ) – </strong>No tuples</p>
<p>As a result of deletion <strong>( X9 Y5 X3 ) </strong>- No tuples</p>
<p> </p>
<p>Ans will be 4 . </p>
<p>PS – since Z is referencing X , X8 must be present in X </p>Databaseshttps://csedoubts.gateoverflow.in/357561/ace-academy-test-series-gate-2021?show=357577#a357577Wed, 09 Jun 2021 08:09:53 +0000Answered: I am getting admission in IIIT Lucknow M.tech.
https://csedoubts.gateoverflow.in/811/i-am-getting-admission-in-iiit-lucknow-m-tech?show=357578#a357578
Its not worth in any way. Better drop a year than going to such new and inexperienced colleges for masters. M.tech is a serious course and should be only done in old and reputed ones. These new IIITs are running based on btechs and competetive coding only. Nothing there for you to gain. Placements are pathetic for masters.IIITshttps://csedoubts.gateoverflow.in/811/i-am-getting-admission-in-iiit-lucknow-m-tech?show=357578#a357578Wed, 09 Jun 2021 08:09:44 +0000Answered: Madeeasy test series gate 2022
https://csedoubts.gateoverflow.in/357552/madeeasy-test-series-gate-2022?show=357579#a357579
In the increase () function , amount is initialized to 0 each time it is called. The final value of k will be when i =3 and j=3 .<br />
<br />
ans should be 3Programminghttps://csedoubts.gateoverflow.in/357552/madeeasy-test-series-gate-2022?show=357579#a357579Wed, 09 Jun 2021 08:09:30 +0000Answered: Ace Academy test series gate 2021
https://csedoubts.gateoverflow.in/357564/ace-academy-test-series-gate-2021?show=357581#a357581
<p><strong>AB->D and A->E are not preserved .</strong></p>
<p>In none of the decomposed tables , common attribute is a candidate key , so lossy decomposition .</p>
<p> </p>
<p>option D</p>Databaseshttps://csedoubts.gateoverflow.in/357564/ace-academy-test-series-gate-2021?show=357581#a357581Wed, 09 Jun 2021 08:08:53 +0000can we make DFA for a language where there is comparion between symbols but lanuage is finite a^nb^n;n<=3
https://csedoubts.gateoverflow.in/357568/language-where-there-comparion-between-symbols-lanuage-finite
can we make DFA for a language where there is comparion between symbols but lanuage is finite a^nb^n;n<=3Theory of Computationhttps://csedoubts.gateoverflow.in/357568/language-where-there-comparion-between-symbols-lanuage-finiteTue, 08 Jun 2021 09:20:15 +0000if language is finite then dfa possible irrespective of comparison between symbols exist or not.is it true??
https://csedoubts.gateoverflow.in/357569/language-possible-irrespective-comparison-between-symbols
if language is finite then dfa possible irrespective of comparison between symbols exist or not.is it true??Theory of Computationhttps://csedoubts.gateoverflow.in/357569/language-possible-irrespective-comparison-between-symbolsTue, 08 Jun 2021 09:20:03 +0000Answered: MAC address and its uniqueness
https://csedoubts.gateoverflow.in/29268/mac-address-and-its-uniqueness?show=357573#a357573
MAC address is unique per NIC and it is provided by the manufacturer following the IEEE rule at the time of manufacturing. <br />
<br />
So theoretically each MAC address will be unique.<br />
<br />
But with software software we can change the MAC address. <br />
<br />
Note: if a host has two NIC, then it will have two different MAC address, one per each NIC.Computer Networkshttps://csedoubts.gateoverflow.in/29268/mac-address-and-its-uniqueness?show=357573#a357573Tue, 08 Jun 2021 09:19:16 +0000Answered: Parity check in Error detection
https://csedoubts.gateoverflow.in/29292/parity-check-in-error-detection?show=357572#a357572
Yes, it is in syllabus (Computer Network).<br />
<br />
It is taught in my coaching classes.Computer Networkshttps://csedoubts.gateoverflow.in/29292/parity-check-in-error-detection?show=357572#a357572Tue, 08 Jun 2021 09:05:23 +0000Answered: Self Doubt (Digital Logic Design)
https://csedoubts.gateoverflow.in/29254/self-doubt-digital-logic-design?show=357571#a357571
I think, There is no any such procedure. But we can use the results like AND-OR operation (like AB+CD)can be replace by NAND-NAND.<br />
<br />
Anyway questions will always ask minimum number of NAND as we can easily increase the NAND gate. For example 'A' can be represent using 2 NAND gate as well as 4, 6,8 or more NAND gate.Digital Logichttps://csedoubts.gateoverflow.in/29254/self-doubt-digital-logic-design?show=357571#a357571Tue, 08 Jun 2021 09:00:25 +0000Answered: self doubt regarding the full binary tree
https://csedoubts.gateoverflow.in/29319/self-doubt-regarding-the-full-binary-tree?show=357567#a357567
Full m-ary tree means each node with 0 OR m children . For Full Binary tree , m=2 .<br />
<br />
<br />
<br />
Yes ,the picture is shown is a Full bianry treeAlgorithmshttps://csedoubts.gateoverflow.in/29319/self-doubt-regarding-the-full-binary-tree?show=357567#a357567Tue, 08 Jun 2021 08:42:10 +0000Answered: GeeksforGeeks
https://csedoubts.gateoverflow.in/29248/geeksforgeeks?show=357570#a357570
<p><a rel="nofollow" href="https://csedoubts.gateoverflow.in/?qa=blob&qa_blobid=9637775108037086928">https://csedoubts.gateoverflow.in/?qa=blob&qa_blobid=9637775108037086928</a></p>Digital Logichttps://csedoubts.gateoverflow.in/29248/geeksforgeeks?show=357570#a357570Tue, 08 Jun 2021 08:06:35 +0000Madeeasy test series gate 2021
https://csedoubts.gateoverflow.in/357566/madeeasy-test-series-gate-2021
Consider the following C function: void f(int m)<br />
<br />
{<br />
<br />
while (m! = 0) <br />
<br />
{ <br />
<br />
if(!(m &1)) <br />
<br />
printf("hello"); <br />
<br />
m = m >> 1; <br />
<br />
}<br />
<br />
}<br />
<br />
The number of times printf("hello") statement is executed, when 2048 is passed to the function ()Programminghttps://csedoubts.gateoverflow.in/357566/madeeasy-test-series-gate-2021Tue, 08 Jun 2021 02:08:03 +0000Madeeasy test series gate 2021
https://csedoubts.gateoverflow.in/357565/madeeasy-test-series-gate-2021
which of the following is/are illegal after the following declaration <br />
<br />
int A[10],B[20],*C;<br />
<br />
A) A=B <br />
<br />
B) B=A <br />
<br />
C) A= C <br />
<br />
D) C=AProgramminghttps://csedoubts.gateoverflow.in/357565/madeeasy-test-series-gate-2021Tue, 08 Jun 2021 00:51:39 +0000My final exam
https://csedoubts.gateoverflow.in/357562/my-final-exam
Suppose our computer requires 2048x16 bytes of RAM and 512x16 bytes of ROM.<br />
Design the necessary hardware using 512x16 byte RAM and 256x16 byte ROM chipsCO & Architecturehttps://csedoubts.gateoverflow.in/357562/my-final-examMon, 07 Jun 2021 17:37:38 +0000Answered: How to draw the serializability graph if transactions are getting commited
https://csedoubts.gateoverflow.in/29317/draw-serializability-graph-transactions-getting-commited?show=357563#a357563
Dependency exist between T1 and T3, T2 and T3 , T3 and T2 ( Dirty Read ) .<br />
<br />
Conclusion inferred – cycle exist in precendese graph hence not CSSDatabaseshttps://csedoubts.gateoverflow.in/29317/draw-serializability-graph-transactions-getting-commited?show=357563#a357563Mon, 07 Jun 2021 17:37:32 +0000Answered: Madeeasy test series gate 2022
https://csedoubts.gateoverflow.in/357553/madeeasy-test-series-gate-2022?show=357559#a357559
<p><a rel="nofollow" href="https://www.geeksforgeeks.org/difference-between-pointer-to-an-array-and-array-of-pointers/#:~:text=%E2%80%9CArray%20of%20pointers%E2%80%9D%20is%20an,Syntax%3A&text=We%20can%20make%20separate%20pointer,point%20to%20all%20the%20values">https://www.geeksforgeeks.org/difference-between-pointer-to-an-array-and-array-of-pointers/#:~:text=%E2%80%9CArray%20of%20pointers%E2%80%9D%20is%20an,Syntax%3A&text=We%20can%20make%20separate%20pointer,point%20to%20all%20the%20values</a>. if you are finding difficulty in solving that i have edited my answer on why b is right or you can look at the article,,,,option c is wrong because it mention array of pointers as argument which is wrong it is pointer to a character array</p>Programminghttps://csedoubts.gateoverflow.in/357553/madeeasy-test-series-gate-2022?show=357559#a357559Mon, 07 Jun 2021 02:30:07 +0000Madeeasy test series gate 2022
https://csedoubts.gateoverflow.in/357551/madeeasy-test-series-gate-2022
Which rule of recursion is violated in the following code<br />
<br />
int rec(int n)<br />
<br />
{<br />
<br />
if(n == 0)<br />
<br />
return 0;<br />
<br />
else<br />
<br />
return (n + rec(n/2) +rec(n/2+ 1);<br />
<br />
}<br />
<br />
A) No base case<br />
<br />
B ) Fails to make progress<br />
<br />
C) It performs redundant work<br />
<br />
D) No violationProgramminghttps://csedoubts.gateoverflow.in/357551/madeeasy-test-series-gate-2022Sun, 06 Jun 2021 12:18:59 +0000this is my assignment
https://csedoubts.gateoverflow.in/29287/this-is-my-assignment
For the following information systems determine<br />
the entities of interest, their attributes and<br />
the relationships that exist between the<br />
entities. Draw the E-R diagram for the system.<br />
Peoples Information Systems for a<br />
village/ward(that stores information about<br />
peoples)Databaseshttps://csedoubts.gateoverflow.in/29287/this-is-my-assignmentSat, 05 Jun 2021 16:43:36 +0000Self Doubt(Digital Logic)
https://csedoubts.gateoverflow.in/29305/self-doubt-digital-logic
Maximum how many number of functions are possible so that F(x,y,z) = F(x,y’,z) ?Digital Logichttps://csedoubts.gateoverflow.in/29305/self-doubt-digital-logicSat, 05 Jun 2021 16:42:43 +0000