Register
Filter

Questions by aaru14

0 votes
1 answer
1
mmadeeasy work book
https://gateoverflow.in/?qa=blob&qa_blobid=14725486734069728898 in this question what is the total transmission in go back N? someone plz tell?
https://gateoverflow.in/?qa=blob&qa_blobid=14725486734069728898in this question what is the total transmission in go back N? someone plz tell?
0 votes
1 answer
2
madeeasy work book
Tcp operates over a 40 Gbps link if TCP uses the full bandwidth continously how long in ms would it take the sequence number to wraparound completely?? answer is 0.859sec ??
Tcp operates over a 40 Gbps link if TCP uses the full bandwidth continously how long in ms would it take the sequence number to wraparound completely??answer is 0.859sec ...
0 votes
0 answers
3
madeeasy booklet
while(1) { flag[i]=true; while(flag[j]); <cs> flag[i]=false; } someone please tell bounded wait is satisfying or not???
while(1) {flag[i]=true;while(flag[j]);<cs>flag[i]=false;}someone please tell bounded wait is satisfying or not???
0 votes
0 answers
4
madeeasy work book
https://gateoverflow.in/?qa=blob&qa_blobid=17252928676307264993 how to solve these type of question someone please help?
https://gateoverflow.in/?qa=blob&qa_blobid=17252928676307264993how to solve these type of question someone please help?
0 votes
1 answer
6
MadeEasy Test Series: Operating System - Resource Allocation
https://gateoverflow.in/?qa=blob&qa_blobid=16406706223773445572 someone plz help how to detect deadlock in this type of question??
https://gateoverflow.in/?qa=blob&qa_blobid=16406706223773445572someone plz help how to detect deadlock in this type of question??
0 votes
0 answers
7
madeeasy work book
consider a system having one process which is reffering ' M' pages in the logical address and out of which 'N ' unique pages occur in it And 's' is the number of frames allocated to the process then what is the minimum and maximum number of page faults possible?
consider a system having one process which is reffering ' M' pages in the logical address and out of which 'N ' unique pages occur in it And 's' is the number of frames ...
1 votes
2 answers
8
MadeEasy Test Series: Programming & DS - Trees
assume the preorder tŕaversal of binary tree is "abc" how many total different binary trees are possible whose postorder traversal.is "cba" with the given preorder traversal.?? how to find it ?
assume the preorder tŕaversal of binary tree is "abc" how many total different binary trees are possible whose postorder traversal.is "cba" with the given preorder trave...
0 votes
0 answers
9
madeeasy work book
Assume that a lower traingular matrix A[0.....n-1,0...n-1] is stored in a linear array B [0....1/2 n (n+1)-1] in row by row order for n=100 if A[0,0] is stored inB[0] where is A[90,80] stored in B array??
Assume that a lower traingular matrix A[0.....n-1,0...n-1] is stored in a linear array B [0....1/2 n (n+1)-1] in row by row order for n=100 if A[0,0] is stored inB[0] whe...
0 votes
1 answer
10
madeeasy work book
https://gateoverflow.in/?qa=blob&qa_blobid=12037309044418228871 someone plz solve this question??
https://gateoverflow.in/?qa=blob&qa_blobid=12037309044418228871someone plz solve this question??
0 votes
1 answer
11
pointer
int *p, A[3]={0,1,2}; p=A; *(P+2)=5; p=A++; *P=7; what are the values stored in the atray A from index 0 to index 2 after execution of the above cod?
int *p, A[3]={0,1,2};p=A;*(P+2)=5;p=A++;*P=7; what are the values stored in the atray A from index 0 to index 2 after execution of the above cod?
0 votes
0 answers
12
data structure
what is complexity 1)to convert infix to prefix 2) to convert infix to postfix 3)convert infix to prefix using stack plz someone tell?
what is complexity1)to convert infix to prefix 2) to convert infix to postfix 3)convert infix to prefix using stackplz someone tell?
1 votes
1 answer
13
probability
a dice is tossed seven times what is the probability that all six faces appear at least once? a)63/64 b)35/648 c)2/9 d)5/324
a dice is tossed seven times what is the probability that all six faces appear at least once?a)63/64b)35/648c)2/9d)5/324
0 votes
1 answer
14
huffman code
question based on huffman coding for symbol A with probability 0.3 , B with 0.15 ,c with 0.1 ,D with 0.25 ,E with 0.2 (with the convention 0 labeled for left branch and 1 for right) the minimum no of bits required to represent all the symbols together is?? a)1 b)2 c)3 d)4 which bit this question asking??
question based on huffman coding for symbol A with probability 0.3 , B with 0.15 ,c with 0.1 ,D with 0.25 ,E with 0.2 (with the convention 0 labeled for left branch and 1...
0 votes
1 answer
17
MadeEasy Subject Test: Algorithms - Graph Algorithms
complexity of kruskal algorithum for finding the minimum cost spanning tree of an undirected graph contain n vertices and m edges if the edge are already sorted.??
complexity of kruskal algorithum for finding the minimum cost spanning tree of an undirected graph contain n vertices and m edges if the edge are already sorted.??
0 votes
0 answers
19
madeeasy class notes
https://gateoverflow.in/?qa=blob&qa_blobid=15895383759487537860 find complexity ?? where n is prime. someone plz explain??
https://gateoverflow.in/?qa=blob&qa_blobid=15895383759487537860find complexity ??where n is prime.someone plz explain??
1 votes
2 answers
20
MadeEasy Subject Test: Digital Logic - Boolean Expressions
https://gateoverflow.in/?qa=blob&qa_blobid=13313697975716394852 how to solve this??
https://gateoverflow.in/?qa=blob&qa_blobid=13313697975716394852how to solve this??
Page: