Recent questions without answers

252
views
0 answers
1 votes
https://gateoverflow.in/32145/find-the-size-of-senders-window-if?show=32145#q32145During a TCP connection, the size of the window advertised by the receiver is 20 KB. The last ... 's window is _______ (in KB).Shldn't the ans be 13.81 KB?
685
views
0 answers
3 votes
Let 'n' processes competing to enter their critical sections and mutex be a global binary semaphore initialized to 1. The process is coded as follows:Signal( ... competition to enter as well. can we take this as progress?Please answer.
219
views
0 answers
1 votes
How to solve this question.?
246
views
0 answers
1 votes
How to solve this question. Please guide.!
475
views
0 answers
2 votes
#include<stdio.h>int main(){char arr[5][7][6];char *p[5][7][6];printf("%d\t", (unsigned)(arr+1)-(unsigned)arr);printf("%d", (unsigned)(p+1)-(unsigned)p);}
1.3k
views
0 answers
2 votes
Context switches can occur only in kernel mode. So for process switches first we have to move from user to kernel mode. Then we have to save the PCB of ... above-given statement and its explanation is true or not??if not please correct it!
314
views
0 answers
1 votes
The answer should be 29.6ms right?
306
views
0 answers
1 votes
How to solve this question in exam.?
304
views
0 answers
1 votes
What should be the answer.. please explain the solution.!
394
views
0 answers
1 votes
Please explain how to solve this question.!
241
views
0 answers
1 votes
is it always true when we convert nfa to dfa...we always get minimised dfa?
481
views
0 answers
1 votes
Database file consist 50000 records with record size 100 bytes, block size 512 bytes. If sparse B+ tree index build over given database file with search key size 20 ... if node order P is defined as between ⎡P/2⎤ to P pointers per node?
228
views
0 answers
1 votes
The solution given wrt to above grammar is correct? the number of production after simplified CFG??
417
views
0 answers
1 votes
Consider a language over Σ={a,b} such that each string has at most two a’s and at least two b’s. The number of states in minimized DFA and number of final states are respectively.
251
views
0 answers
1 votes
Consider the below-given languages. Choose the correct option L1= { wwr x | w,x ∈{a,b}} is regular. L3= { wwr x | w,x ∈{a,b}+}is regular. L2= { wwr x | w,x ∈{a,b}*} is not regular. All are non-regular.
240
views
0 answers
1 votes
what is spilling ..?help me i can't find theory about this topic.
622
views
0 answers
1 votes
Which of the following statement true about B tree and B+ tree index? Assume order of B tree node same as order of B+ tree node.(A) B tree index has more ... of records.(D) B tree index nodes more than B+ tree for large number of keys.
427
views
0 answers
2 votes
Consider the following pseudo-code to perform push and pop operation on a stack using enqueue(EQ)and dequeue(DQ) operations on 2 queues q1 and q2.Let x be an ... on queue q2,if we perform 6 push and 2 pop operations on the above algorithm?
758
views
0 answers
1 votes
What is the number of records in 4 level B+ treeAnswer is $24 \times 24 \times24 \times 19$ is correct na ?
272
views
0 answers
1 votes
IF any ICMP packet discacted by some router ,is icmp packet generated in response to it ?If ICMP echo request and reply is descarted by some router is icmp packet generated in response to it ?
271
views
0 answers
1 votes
How New to Running is valid? how Running to Ready is invalid??
152
views
0 answers
1 votes
264
views
0 answers
2 votes
Consider alphabet Σ = {a, b}, the null/empty string λ and the set of strings X0, X1, X2 and X3 generated by the corresponding non-terminals of a regular grammar ... b*answer given is c but how becz c is representing x0........please check
783
views
0 answers
1 votes
L = { 011 ,0111 ,0111111 ,......... , 1011 ,101111 ,} is this language then why R.E = (1+ 011)*
278
views
0 answers
1 votes
1) In Distance vector routing when there is any change in the link cost is it updated in the routing tables of the routers connected via that link ... distance would have been updated with Q's old distance?Any help highly appreciated..
945
views
0 answers
2 votes
Suppose a file F of size 8KB is shared by 50 processes, each process read the entire F 5 times sequentially, disk uses linked allocation policy to store both ... access related to access the file F in executing all the 50 processes is:
663
views
0 answers
1 votes
Identify the language. apbqcrds | p+r=q+s
168
views
0 answers
2 votes
What is the Time complexities of LL(1),SLR,CLR(1) and LALR(1) parsers.
454
views
0 answers
1 votes