0 votes
1 answer
1
In fragmentation, if any fragment gets lostthen in which case whole packet will be sent again?and in which case only that fragment will be sent again?
0 votes
2 answers
2
The Total Combinations Possible of Min heap with 8 Distinct elements are ?
1 votes
2 answers
3
int i,j,k,s=0; for(i=1; i<=n; i++) { for(j=1 ; j<=i; j=j*2) { for(k=n; k>1;k=k/2) { s++; } } }What will be the time complexity of the above code?
3 votes
3 answers
7
what will be time complexity of this program?void function(int n){ int count = 0; for (int i=0; i<n; i++) { for (int j=1; j< i*i; j++) { ...
1 votes
0 answers
8
In a car race, Car X beats Car Y by $45$ km, Car Y beats Car Z by $50$ km, and Car X beats Car Z by $90$ km. The distance (in m) over which the race has been conducted is...
0 votes
1 answer
10
A frame buffer array is addressed in row major order for a monitor with pixel locations starting from (0,0) and ending with (100,100). What is address of the pixel(6,10)?...
0 votes
2 answers
11