GATE Overflow - Recent questions without answers
https://gateoverflow.in/unanswered
Powered by Question2AnswerMade easy test series
https://gateoverflow.in/217501/made-easy-test-series
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=7886087586729908584"></p>Theory of Computationhttps://gateoverflow.in/217501/made-easy-test-seriesTue, 22 May 2018 02:10:41 +0000Reema Thareja
https://gateoverflow.in/217484/reema-thareja
Is reema thareja a suitable book for GATE Data structures?DShttps://gateoverflow.in/217484/reema-tharejaMon, 21 May 2018 17:33:54 +0000Data Structures Resource
https://gateoverflow.in/217476/data-structures-resource
Hello everyone.<br />
<br />
Can anyone suggest me a good book for Data Structures for GATE. Horowitz and Weiss are available in .chm format and its really difficult to read from them. Any other suggestions.<br />
<br />
<br />
<br />
Also, I have a good knowledge of C, but i have to formally study it for GATE. Any suggestions for this too?DShttps://gateoverflow.in/217476/data-structures-resourceMon, 21 May 2018 16:41:57 +0000Routing
https://gateoverflow.in/217408/routing
Can distance vector routing implementation is possible with delay??<br />
<br />
usually it is done by hopcount???<br />
<br />
also,Can link state routing implementation is possible with hopcount??<br />
<br />
usually it is done by delay???Computer Networkshttps://gateoverflow.in/217408/routingMon, 21 May 2018 10:44:25 +0000Is algorithm important for UGC-NET?
https://gateoverflow.in/217392/is-algorithm-important-for-ugc-net
<p>Is algorithm <strong><em>equally important</em></strong> and carry a good amount of<strong><em> wightage</em></strong> in <strong>UGC-NET </strong>as it is in <strong>GATE(CSE)?</strong></p>
<p>I'm aiming <strong>GATE-2019</strong> and also thinking to <strong><em>write</em></strong> <strong>UGC</strong>. I don't know much about <strong>UGC </strong><em>exam pattern, syllabus, cutoff etc.</em></p>
<p>So, any sort of <em>help highly appreciated.</em></p>CBSE/UGC NEThttps://gateoverflow.in/217392/is-algorithm-important-for-ugc-netMon, 21 May 2018 09:47:53 +0000UGC NET ONLINE MOCK TESTS – FREE
https://gateoverflow.in/217351/ugc-net-online-mock-tests-free
Is their any website for free test series(Mock Test) of UGC NET Computer Science And Application?CBSE/UGC NEThttps://gateoverflow.in/217351/ugc-net-online-mock-tests-freeSun, 20 May 2018 18:59:32 +0000Understanding multiversion timestamp ordering protocol in database systems
https://gateoverflow.in/217350/understanding-multiversion-timestamp-ordering-protocol
<p>I was reading multiversion timestamp ordering protocol from the book Database Systems Concepts by Korth. It can be explained in simpler words as follows:</p>
<blockquote>
<p>Each data item version $Q$ has two timestamps associated with it:</p>
<ul>
<li><strong>W-timestamp:</strong> the timestamp of the transaction that created version</li>
<li><strong>R-timestamp:</strong> the largest timestamp of any transaction that successfully read version</li>
</ul>
<p>Let $Q_k$ denote the version of $Q$ whose write timestamp is the largest write timestamp less than or equal to $TS(Ti)$.</p>
<ol>
<li>If transaction $T_i$ issues a $read(Q)$, then the value returned is the content of version $Q_k$, thus reading the most recent version that comes before $T_i$. </li>
<li>If transaction $T_i$ issues $write(Q)$, and
<ul>
<li>if $TS(T_i) < R-timestamp(Q_k)$, then the system rolls back transaction $T_i$.</li>
<li>if $TS(T_i) = W-timestamp(Q_k)$, the system overwrites the contents of $Q_k$; </li>
<li>if $TS(T_i) > R-timestamp(Q_k)$, it creates a new version of $Q$.</li>
</ul>
</li>
</ol>
</blockquote>
<p><strong>My doubts</strong></p>
<ol>
<li>What happens when TS(Ti) < W-timestamp(Qk) and when TS(Ti) > W-timestamp(Qk)?</li>
<li>The set of schedules possible under multiversion timestamp ordering protocol forms superset of set of schedules possible under Thomas write rule. I know that Thomas write rule allows non conflict serializable schedules. So same must be true for multiversion protocol. Right? </li>
<li>Also I know that Thomas write rule allows view serializable schedules. Does the schedules produced by multiversion protocol are also view serializable? </li>
</ol>
<p>Though above questions seems valid and important to me, I had following doubts: is it worth to give so much importance to this topic fo GATE perspective? Also it seems that Elmasri Navathe's book gives somewhat different definition for the multiversion timestamp ordering protocol. Also it seems that this topic was never being asked in previous year GATE papers. (Or I am wrong and it was indeed asked in previous year GATE paper?) Can we safely skip it?</p>Databaseshttps://gateoverflow.in/217350/understanding-multiversion-timestamp-ordering-protocolSun, 20 May 2018 18:57:00 +0000Number of Relations Required
https://gateoverflow.in/217343/number-of-relations-required
<p style="text-align:center"><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=16262716386692412799"></p>
<p>Soln. (My Solution)</p>
<p>.Lets Break it down shall we ?</p>
<p>Lets take an instance:- </p>
<p> Dno Dname Phone Office</p>
<p> 1 A X,Y Z,P</p>
<p>We know Dno --> Phone,Office,Dname</p>
<p>Currently above one is not in 1nf so by converting it we get:- </p>
<p>Dno Dname Phone Office</p>
<p> 1 A X Z</p>
<p>1 A X P</p>
<p>1 A Y Z</p>
<p>1 A Y P</p>
<p> </p>
<p>Now its in 1nf. But Now the Primary key is (Dno,Phone,Office) ---> Dname</p>
<p>but we know that Dno --> Dname</p>
<p>So its a Partial Dependency Hence not in 2nf</p>
<p>Lets Break it Down Further :----</p>
<p>A (Dno , Dname) Dno as Primary Key</p>
<p>B (Dno,Phone,Office) and Primary key is (Dno,Phone,Office) collectively. So only two tables is required.</p>
<p> </p>
<p>So is it a right statement :- "If a relation has m number of multi-valued attribute then no need for m extra table only 1 table extra required like i just showed above" Ain't that right?</p>
<p>Is my solution Worth it ?</p>Databaseshttps://gateoverflow.in/217343/number-of-relations-requiredSun, 20 May 2018 18:00:04 +0000ER Diagram to Relation Doubt
https://gateoverflow.in/217336/er-diagram-to-relation-doubt
When we have a many to one relationship between two entities and participation is total on many side then we can combine them and result in two tables. But why cant we do in one table ?<br />
<br />
When we merge the entire relationship then we will make the primary key of entity in many side as the primary key of combined relation of course there will be null values present because of partial participation of other entity but that's ok as the primary key won't have any null values and it won't be redundant as well then why can't we merge entire into one relation?Databaseshttps://gateoverflow.in/217336/er-diagram-to-relation-doubtSun, 20 May 2018 17:16:03 +0000Regular expression#previous year gate
https://gateoverflow.in/217334/regular-expression%23previous-year-gate
Give a regular expression for the set of binary strings where every 0 is immediately followed by exactly k number of 1's and preceded by at least k number of 1's (k is a fixed integer).Choose the correct one out of two.<br />
<br />
a)1*1^k(01^k)*1* b)1*(1^k01^k)*Theory of Computationhttps://gateoverflow.in/217334/regular-expression%23previous-year-gateSun, 20 May 2018 16:35:44 +0000Heap DataStructure
https://gateoverflow.in/217332/heap-datastructure
<p>A min heap having 1024 distinct elements with keys ranging from 0 to 1023 is stored in array of 1024 indices. The maximum difference between (<em>n</em>/2)<sup>th</sup> element present at maximum level and minimum level is ________. [Assume root is present at level-1] ?</p>
<p>Please Tell me the Approach</p>Algorithmshttps://gateoverflow.in/217332/heap-datastructureSun, 20 May 2018 16:25:50 +0000IIT interview
https://gateoverflow.in/217312/iit-interview
In case of dynamic scoping, will an undeclared variable 'a' take the value of previous function's variable even if the variable 'a' in prev function is declared as static?Programminghttps://gateoverflow.in/217312/iit-interviewSun, 20 May 2018 12:08:33 +0000korth
https://gateoverflow.in/217311/korth
do we have query optimaztion and processing and ch 16 from korth for gateDatabaseshttps://gateoverflow.in/217311/korthSun, 20 May 2018 12:03:17 +0000related to previous year
https://gateoverflow.in/217296/related-to-previous-year
<p>can someone verify my answer given to this matrices question ?</p>
<p><a rel="nofollow" href="https://gateoverflow.in/3319/gate2008-it-29">https://gateoverflow.in/3319/gate2008-it-29</a></p>Linear Algebrahttps://gateoverflow.in/217296/related-to-previous-yearSun, 20 May 2018 08:54:03 +0000C Programming by Balaguruswamy 6th edition
https://gateoverflow.in/217282/c-programming-by-balaguruswamy-6th-edition
<p>Where can I <strong>download the pdf</strong> book of " <strong>Programming in C</strong> by<strong> Balaguruswamy</strong> <strong>(6th edition)</strong> ". </p>
<p>So that I can <em><strong>write programs of my algorithm</strong></em> and subroutines.</p>
<p><strong>Help</strong> me out if anybody knows this.</p>
<p><strong>Thanks</strong> in Advance.</p>Programminghttps://gateoverflow.in/217282/c-programming-by-balaguruswamy-6th-editionSun, 20 May 2018 06:22:28 +0000Combinatrics
https://gateoverflow.in/217274/combinatrics
In Circular permutation generally we are taking (N-1)! <br />
<br />
we are fixing a reference at any point of the circle (we can't change the reference after fixing it)<br />
<br />
But (N-1)! is for N distinct objects but if there is some repetition in the word we are dividing with no of repetitions factorial<br />
<br />
<br />
<br />
BUT in this example <br />
<br />
Suppose a word PERMUTATION ans of this word in circular permutation is 11!/2!<br />
<br />
BUT how can we say cofirm because if we take one word t as a reference then ans is going to be 11! <br />
<br />
plzz clarify my doubt and after fixing the reference can we change the referenceMathematical Logichttps://gateoverflow.in/217274/combinatricsSun, 20 May 2018 05:21:53 +0000Trouble Understanding Master method Algorithm Proof.
https://gateoverflow.in/217265/trouble-understanding-master-method-algorithm-proof
<p>I'm having trouble understanding <strong>master method proof</strong>. I have gone through <strong>Cormen</strong> watched a bunch of <strong>lectures</strong> on the same topic. yet, having trouble. </p>
<p>Anybody Kind enough to explain so that I can understand. I will be really<strong> thankful.</strong></p>Algorithmshttps://gateoverflow.in/217265/trouble-understanding-master-method-algorithm-proofSun, 20 May 2018 04:41:18 +0000What is meant by sector offset in disk and disk capacity and surface capacity formula
https://gateoverflow.in/217255/what-meant-sector-offset-capacity-surface-capacity-formula
Operating Systemhttps://gateoverflow.in/217255/what-meant-sector-offset-capacity-surface-capacity-formulaSun, 20 May 2018 03:51:16 +0000ISI-MTECH-CSE-2018
https://gateoverflow.in/217251/isi-mtech-cse-2018
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=15607585925640538244"></p>Mathematical Logichttps://gateoverflow.in/217251/isi-mtech-cse-2018Sun, 20 May 2018 03:09:26 +0000IIIT Delhi M.Tech Interview
https://gateoverflow.in/217246/iiit-delhi-m-tech-interview
Do I need to prepare all the GATE subjects or just 2-3 subjects as my favorite subjects for IIIT Delhi Mtech Interview? Do Interviewers necessarily ask for favorite subjects? I request previous applicants at IIIT D to clear my doubt.<br />
<br />
ThanksIIITshttps://gateoverflow.in/217246/iiit-delhi-m-tech-interviewSat, 19 May 2018 20:26:36 +0000How to design a digital counter using 74193 that counts 0,1,2,8,0,1,2,8,0,1,2,8,0
https://gateoverflow.in/217245/how-to-design-digital-counter-using-74193-that-counts-2-0-1-2-8
How to design a digital counter using 74193 that counts 0,1,2,8,0,1,2,8,0,1,2,8,0Digital Logichttps://gateoverflow.in/217245/how-to-design-digital-counter-using-74193-that-counts-2-0-1-2-8Sat, 19 May 2018 19:57:25 +0000MS at IIT kanpur
https://gateoverflow.in/217205/ms-at-iit-kanpur
How is MS in CSE at IIT kanpur. For a student who is looking for placement as main objective and doing research work is not a problem but does not want to do PhD .Is it wise to go for MS at IIT kanpur and what should be the research area?IISc/IITshttps://gateoverflow.in/217205/ms-at-iit-kanpurSat, 19 May 2018 11:57:06 +0000Protocol
https://gateoverflow.in/217202/protocol
Self doubt:<br />
<br />
Is nmp a network protocol? Please briefly explain about nmp.Computer Networkshttps://gateoverflow.in/217202/protocolSat, 19 May 2018 10:27:44 +0000Computer Networks, Chapter Networks. Question-30.
https://gateoverflow.in/217192/computer-networks-chapter-networks-question-30
<p><em><strong>Q - A large number of consecutive IP address are available at 198.16.0.0. Suppose that four organizations A, B, C and D request for 4000, 2000, 4000 and 8000 addresses respectively. For each of these, give the first IP address assigned, the last IP address assigned, and the mask in dotted decimal notation.</strong></em>
<br>
</p>
<p><strong>DOUBT:</strong></p>
<p>Is it not our own choice how to give codes for the three organizations?</p>
<p>I mean like for org D, we need to fix 13 bits for host id so in third 8 bit segment of the IP address we get to have 3 bits to code. I gave it <strong>198.16.000</strong>00000.00000000 to <strong>198.16.000</strong>11111.11111111</p>
<p>Likewise,</p>
<p>org C- <strong>198.16.1000</strong>0000.00000000 to <strong>198.16.1000</strong>1111.11111111</p>
<p>org A - <strong>198.16.1100</strong>0000.00000000 to <strong>198.16.1100</strong>1111.11111111</p>
<p>org B - <strong>198.16.11100</strong>000.00000000 to <strong>198.16.11100</strong>111.11111111</p>
<p>The <strong>Bold </strong>represents the fixed bits.</p>
<p>The question is- Is there a standard way for giving code to the bits we need to fix by ourself? If not, there could be many ways for that, example : I can also give <strong>198.16.011</strong>00000.00000000 as first IP address to organization D. I only need to fix first 3 bits of 3rd 8 bit segment of this IP address and I can do it any way possible.(unless the IP address clashes with any IP address given to other organisations.)</p>Computer Networkshttps://gateoverflow.in/217192/computer-networks-chapter-networks-question-30Sat, 19 May 2018 06:37:44 +0000piggybacking
https://gateoverflow.in/217180/piggybacking
the receiver takes the hook the ack in its data frame. i dont understand whether the data frame belongs to different sender or same sender ??Computer Networkshttps://gateoverflow.in/217180/piggybackingSat, 19 May 2018 05:32:18 +0000C (strlen)
https://gateoverflow.in/217177/c-strlen
<p>In this question the length of a given string is given as 12 in the solution but it should be 11 as strlen function exclude null value and give the length.Please give the correct answer to this question?<img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=2548540469754803945"></p>Programminghttps://gateoverflow.in/217177/c-strlenSat, 19 May 2018 04:19:45 +0000Probability Density Function
https://gateoverflow.in/217145/probability-density-function
Given a probability density function $\frac{1}{x}$. Value exists in the interval $\left ( 2,3 \right )$<br />
<br />
Can this pdf has existence outside this range?Probabilityhttps://gateoverflow.in/217145/probability-density-functionFri, 18 May 2018 16:11:12 +0000Gate 2003 Graph-Algorithms Question Doubt.
https://gateoverflow.in/217125/gate-2003-graph-algorithms-question-doubt
<p>You can refer this question here - <a rel="nofollow" href="https://gateoverflow.in/957/gate2003-70">https://gateoverflow.in/957/gate2003-70</a>.</p>
<p>I have tried so much to understand this question, but I'm not getting it, how to take the sample graph and also, how to consider the options! In fact, options are very hard to comprehend. I've seen this question on Geeksforgeeks, but they don't have a valid explanation at all.</p>
<p>So, anyone help me get this in a simple layman terms, I'll be very much thankful to them.</p>Algorithmshttps://gateoverflow.in/217125/gate-2003-graph-algorithms-question-doubtFri, 18 May 2018 13:38:37 +0000IIIT-Sricity, MS (By Research)
https://gateoverflow.in/217062/iiit-sricity-ms-by-research
<p>Hello. I am a regular visitor of this website and this is my first question.</p>
<p><strong>Background: </strong>I am kinda non-GATE (Score <400 but Qualified). I have work experience of around 2 years.</p>
<p><strong>Situation: </strong>I sat for Written Test and Interview at IIIT-Sricity for its MS (by Research) programme. Whatever questions I could answer was because of GO.</p>
<p><strong>Main Questions: </strong>How is IIIT-Sricity. I only know that they are mentored by IIIT and IIT Hyderabad and follows a similar curriculum. If anybody knows about IIIT-Sricty, then kindly let me know.</p>
<p>Thank you.</p>IIITshttps://gateoverflow.in/217062/iiit-sricity-ms-by-researchFri, 18 May 2018 04:38:48 +0000Integration
https://gateoverflow.in/217052/integration
$f\left ( x \right )=$$\int_{-2}^{2}x^{-\frac{2}{7}}dx$<br />
<br />
Is this function f(x) is continuous, bounded and differentiable?<br />
<br />
(In exam hall is it possible to draw the graph for this function f(x), or some other procedure to follow to ans this)Calculushttps://gateoverflow.in/217052/integrationFri, 18 May 2018 02:06:38 +0000BITS-HD CSE
https://gateoverflow.in/217031/bits-hd-cse
Has anyone has any experience of bits-hd cs exam...if yes then please share it and give some last minute advce to crack it..........Written Examhttps://gateoverflow.in/217031/bits-hd-cseThu, 17 May 2018 17:00:55 +0000Parity Bit and Error Checking
https://gateoverflow.in/217027/parity-bit-and-error-checking
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=12452240193806563008">
<br>
<br>
When finding out error in this block matrix, the first error when checking column wise is in d2, right? So, the error in d2 in turn causes error at d3 too, since the 1 carry from d2 is omitted the d3 result is also wrong.
<br>
So, while calculating errors, don't we have to calculate the propogated errors? Bcoz if we count that then total number of errors is more than the highest number given in the options. </p>Computer Networkshttps://gateoverflow.in/217027/parity-bit-and-error-checkingThu, 17 May 2018 16:05:57 +0000ER Diagram Table
https://gateoverflow.in/217017/er-diagram-table
<p>Minimum number of Relations:- </p>
<p style="text-align:center"><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=17168597753366334518"></p>
<p>The Answer is $5$. Please see my Reason behind it:- </p>
<p>1. $R_6$ and $E_5$ CAN be merged giving $1$ relation we cant merge with $E_3$, because its a strong entity even though the participation is total.</p>
<p>2. $E_1$ and $E_4$ Gives total of $1$ relation.</p>
<p>3. $R_1$ Will have its separate relation</p>
<p>3.$E_2$, $E_3$ , $R_3$, and $R_5$ can be merged.</p>
<p>4. $R_2$ will have separate table because of many to many (Doubt here)</p>
<p>Hence total $5$ tables we got.</p>Databaseshttps://gateoverflow.in/217017/er-diagram-tableThu, 17 May 2018 15:10:09 +0000#computer-network #NAT-mechanism #Routing
https://gateoverflow.in/217016/%23computer-network-%23nat-mechanism-%23routing
<p>I have a Doubt regarding NAT mechanism provided by the routers/Modem. We know that private IPs assign to a device is dynamic using NAT mechanism it can differ for a device w.r.t to time means it can be changed. Lets Suppose a device having an IP address of 192.168.2.5 and that device sent an Email to a particular server (IP is 30.78.76.55 )through Internet and in NAT table router has stored this information means this combination along with external and private port, Now my question is <em>After some days IP of that particular device got changed to 192.168.2.10 then how does router will map the response coming from that server (IP is 30.78.76.55 ) in which it was previously requested?</em>
<br>
</p>Computer Networkshttps://gateoverflow.in/217016/%23computer-network-%23nat-mechanism-%23routingThu, 17 May 2018 15:09:09 +0000Theta Join
https://gateoverflow.in/217011/theta-join
When we do natural join say between R1(A,B,C) and R2(A,B,D) we get new Relation as ---> R(A,B,C,D)<br />
<br />
Say if we do Theta join using a Predicate P then the result will be ----> R(A,B,C,A,B,D) Am i right?Databaseshttps://gateoverflow.in/217011/theta-joinThu, 17 May 2018 14:32:22 +0000Vector
https://gateoverflow.in/217006/vector
<p><a rel="nofollow" href="https://www.youtube.com/watch?v=3SkCNpFOshk">https://www.youtube.com/watch?v=3SkCNpFOshk</a></p>
<p>In this lecture , can somebody define in 2nd question why $X_{1}+X_{2}\notin V_{1}\cup V_{2}$?</p>
<p>I cannot understand the proof</p>Linear Algebrahttps://gateoverflow.in/217006/vectorThu, 17 May 2018 13:42:22 +0000IIIT Hyderabad Interview 2017
https://gateoverflow.in/216988/iiit-hyderabad-interview-2017
<p>You have 1 billions elements, but memory which can hold only 1 million. How would you sort it using merge sort?</p>
<p>Source-:<a rel="nofollow" href="https://gateoverflow.in/blog/4532/iiit-hyderabad-interview-experience-2017" target="_blank">https://gateoverflow.in/blog/4532/iiit-hyderabad-interview-experience-2017</a></p>Algorithmshttps://gateoverflow.in/216988/iiit-hyderabad-interview-2017Thu, 17 May 2018 08:26:00 +0000TOC Language is CFL or not
https://gateoverflow.in/216981/toc-language-is-cfl-or-not
xx^r /x=[0,1]* , |x|=l<br />
<br />
Here we have restriction that on length of x should be exactly l <br />
<br />
If only the language is given How can we say that l is finite or infinite <br />
<br />
In one of the videos they have taken subsets of l also 2^l , how can this language be Regular and CFL<br />
<br />
plzz explain each point properlyTheory of Computationhttps://gateoverflow.in/216981/toc-language-is-cfl-or-notThu, 17 May 2018 07:16:32 +0000regular language and CFL
https://gateoverflow.in/216979/regular-language-and-cfl
$L=\left \{ a^{n}b^{n}c^{n}d^{n} | n<10^{10} \right \}$<br />
<br />
I know this language is regular language so it is DCFL AND CFL also<br />
<br />
but how can we implenment this language with DCFL with stack because till we reach c there will be nothing in the stack to compare c with<br />
<br />
this language can be implemented using FA We can have these many states to compare how we will compare in stack<br />
<br />
explain the logic of this language with DCFLTheory of Computationhttps://gateoverflow.in/216979/regular-language-and-cflThu, 17 May 2018 06:57:00 +0000data link layer
https://gateoverflow.in/216939/data-link-layer
why stop & wait is connection oriented protocal???Computer Networkshttps://gateoverflow.in/216939/data-link-layerWed, 16 May 2018 21:53:11 +0000sizeof() operrator
https://gateoverflow.in/216929/sizeof-operrator
#include <stdio.h><br />
<br />
int main()<br />
{<br />
int a=2;<br />
int b=4;<br />
double c;<br />
printf("%d",sizeof(c=a+b));<br />
<br />
}<br />
<br />
In the above program, sizeof () operator will not evaluate the expression passed. But how it will return the size of doubleProgramminghttps://gateoverflow.in/216929/sizeof-operratorWed, 16 May 2018 18:33:53 +0000Gate1994
https://gateoverflow.in/216914/gate1994
The number of substrings(of all lengths inclusive) that can be formed from character string of length n is<br />
<br />
a)n<br />
<br />
b)n^2<br />
<br />
c)n(n-1)/2<br />
<br />
d)(n(n+1)/2)+1Theory of Computationhttps://gateoverflow.in/216914/gate1994Wed, 16 May 2018 16:08:27 +0000data link layer
https://gateoverflow.in/216869/data-link-layer
piggybacking is full duplex or half duplex transmission protocol??<br />
<br />
plz explain !!Computer Networkshttps://gateoverflow.in/216869/data-link-layerWed, 16 May 2018 07:10:50 +0000ugc net 2014
https://gateoverflow.in/216865/ugc-net-2014
<p>The range of representable normalized numbers in the floating point binary fractional representation in a 3232-bit word with 11-bit sign, 88-bit excess 128128biased exponent and 2323-bit mantissa is</p>
<ol>
<li>2−1282−128 to (1−2−23)×2127(1−2−23)×2127</li>
<li>(1−2−23)×2−127(1−2−23)×2−127 to 21282128</li>
<li>(1−2−23)×2−127(1−2−23)×2−127 to 223223</li>
<li>2−1292−129 to (1−2−23)×2127</li>
</ol>Digital Logichttps://gateoverflow.in/216865/ugc-net-2014Wed, 16 May 2018 06:45:06 +0000TANENBAUM
https://gateoverflow.in/216861/tanenbaum
To provide error correction for 1000-bit blocks, that 10 check bits are needed in hamming code single bt error correction. Thus, a megabit of data would require 10,000 check bits. To merely detect a block with a single 1-bit error, one parity bit per block will suffice. Once every 1000 blocks, a block will be found to be in error and an extra block (1001 bits) will have to be transmitted to repair the error. The total overhead for the error detection and retransmission method is only 2001 bits per megabit of data, versus 10,000 bits for a Hamming code.<br />
<br />
<br />
<br />
Can anybody please explain me how it is 2001 bits if we do retrainmission of next block if error occurs, it should be 2000 bits ( block in error(1000) + retransmiited block(1000) ).Computer Networkshttps://gateoverflow.in/216861/tanenbaumWed, 16 May 2018 03:59:53 +0000DBMS- Relational Algebra
https://gateoverflow.in/216849/dbms-relational-algebra
If R1 with N1 tuples and R2 with N2 tuples are two relations which are not union compatible the number of tuples in R1 union R2 is?Databaseshttps://gateoverflow.in/216849/dbms-relational-algebraTue, 15 May 2018 18:56:30 +0000Integer in c
https://gateoverflow.in/216838/integer-in-c
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=12897655308811699530"></p>Programminghttps://gateoverflow.in/216838/integer-in-cTue, 15 May 2018 16:24:59 +0000Printf
https://gateoverflow.in/216834/printf
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=17524771538986362276"></p>Programminghttps://gateoverflow.in/216834/printfTue, 15 May 2018 15:29:05 +0000Printf
https://gateoverflow.in/216833/printf
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=10976283262624951192"></p>Programminghttps://gateoverflow.in/216833/printfTue, 15 May 2018 15:24:15 +0000ER Diagram to Table Doubt
https://gateoverflow.in/216812/er-diagram-to-table-doubt
1. If in a Question it says that find minimum number of tables and doesn't say anything that it should satisfy 1nf or 2nf then what we should consider by default while finding the minimum number of tables in the ER Diagram.<br />
<br />
And Please Verify The Below Statements and point if i am wrong somewhere:- <br />
<br />
The Rules of merging the tables 2 tables :<br />
<br />
a) For many to many it is only possible if we have total participation corresponding to that .Further entities in both sides can be merged if we have total participation both sides.<br />
<br />
b) For many to one or one to many , we can merge the "many" side with the relationship .If in "one" side we have total participation we can merge that entity as well<br />
<br />
c) For one to one we can merge the relationship with any .However if in any side we have total participation , then entities can be combined as well. <br />
<br />
d) For weak relationship , we can merge only the total participation side only.Even if there is total participation on the strong entity side , we cannot merge although this should not happen because weak relationship is between weak entity and weak relationship and the participation will be total this side.Also cardinality of strong to weak entity is "one to many".Databaseshttps://gateoverflow.in/216812/er-diagram-to-table-doubtTue, 15 May 2018 10:29:43 +0000