#19621
242
views
0 answers
0 votes
Consider the SDT having left recursion .X→XY{X.x=f(X.x,Y.y)}X→Z{X.x=G(Z.z)} prove that after removal of left recursion it will beX→Z{X.x=G(Z.z)} RR→Y{X.x=f(X.x,Y.y)}RR→ℇ
#19622
656
views
0 answers
0 votes
https://gateoverflow.in/45555/c-programming-predict-the-outputmain() { { extern int i; int i=20; { const volatile unsigned i=30; printf("%d",i); } printf ... its giving error when i'm trying to run the program here https://ideone.com/xteXgV
#19623
405
views
2 answers
0 votes
#19624
246
views
0 answers
0 votes
Consider an unreliable channel that guarantees a propagation delay of at most d for every packet that gets through, but a packet is only successful with probability p. Furthermore, consider a ... $\frac{2d+t}{p}$Answer-(D)
#19625
700
views
0 answers
1 votes
Consider a misbehaving TCP receiver. The receiver modifies its TCP such that upon receiving a data segment containing N bytes, the receiver divides the resulting acknowledgment into M, where M≤Nseperate ... $M(M+1)^{n-1}$(D)$n^M$
#19626
907
views
1 answers
1 votes
Suppose host A is sending a large file to host B over a TCP connection. The two end hosts are 10msec apart (20msec RTT) connected by a 1Gbps link. Assume that ... (Window Size)And hence my answer came 2001. Is it correct?
#19627
766
views
0 answers
0 votes
consider a5 stage pipeline processor, 20% load instructions, 25% branches, 20% stores, 20% of all instructions are data dependent on instructions in front of them and branches are taken 75%of time. what would be the expected cpi?
#19628
1.5k
views
1 answers
1 votes
When a TCP segment arrives at a host, in order to direct it to the appropriate socket, the operating system's network stack uses which of ... port number is needed?Document Ref: https://gateoverflow.in/?qa=blob&qa_blobid=8025344419025703520
#19629
329
views
2 answers
0 votes
Given an array of distinct integers A[1, 2, n]. Find the tightest upper bound to check the existence of any index i for which A[i]= i.(a) O (1) ... (d) None of theseSolution: Option (c)
#19630
217
views
0 answers
0 votes
https://gateoverflow.in/86869/gate1990-16athe given grammar is this G1:S→ if S then S else S S→ if S then Sand in solution we used a terminal expr stmt→ if expr then ... ifexpr then stmt else stmt ∣other
#19631
681
views
0 answers
0 votes
For Given machine instructionsLW R4 #400L1:LW R1, 0,(R4)LW R2 400(R4)ADDI R3, R1, R2SW R3, 0(R4)SUB R4, R4, #4BNZ R4, L1on a 5 stage ... cycle per stage. how mAny clock cycles willtake execution of this segment on the regular architecture?
#19632
1.3k
views
3 answers
1 votes
Consider two processes X having P threads and Y having Q threads with equal time slices respectively.Threads are mixed with user level threads (ULT) and kernel level threads (KLT ... . I and II only4.I, II and III How statement-1 Is true??
#19635
1.2k
views
2 answers
0 votes
If NFA has 'n' states then how DFA can have 2^n states. Please help me in understanding how this is true.As per my understanding every DFA is NFA then how no of states can be more in DFA than nfaPlease suggestThanks
#19636
1.3k
views
1 answers
0 votes
Given 2 machine instructions,LW R4 #400LW R1, 0,(R4)IN second instruction what will be loaded in R1,is it the operand at memory location 400?or some ... to clarify whether the value stored in register is same as adress that register points.
#19637
236
views
0 answers
0 votes
10% of all phone calls you receive is spam. Your phone calls spam filter is 90% reliable: that is, 90% of the phone calls it marks as spam are indeed ... calls marked spam by your filter, what is the probability that it really is spam?
#19638
435
views
0 answers
0 votes
Is it a good idea to solve previous years gate questions multiple times as with time you get more awareness of certain topics and you can use different approaches to ... DAA,DSC till now what should I do?Is there enough time for all this?
#19639
698
views
1 answers
–1 votes
Consider the given below languages L1 and L2.L1= {pnqmrmsn | m,n ≥ 0}L2= {pnqnrmsm | m,n ≥ 0}Select the correct statement about, L such thatL= (L1 U L2 ) - ... the EX-OR of L1 and L2, couldn't visualize as how it will be cfl. please help.
#19640
1.1k
views
1 answers
0 votes
Can anyone explain answer is A