Register
Filter

Questions by sourojit

0 votes
1 answer
1
Made easy test series
0 votes
0 answers
2
Ace test series
Which of the following problem is recursive but not CSL? a> Equality of NFA b> Equality of DFA c> Emptiness of Extended Regular Expression d> None of the above
Which of the following problem is recursive but not CSL?a Equality of NFAb Equality of DFAc Emptiness of Extended Regular Expressiond None of the above
1 votes
1 answer
5
made easy test series
3 votes
1 answer
7
MadeEasy Subject Test: Algorithms - Asymptotic Notations
run(n) { if(n<=2) return 1; else return run(log(n)+log(n)); } Which of the following represents the running time for run(n) function? a> O(log n) b> O(log log(n)) c> O(log * n) d> O(n) Can someone provide a detailed solution?
run(n) { if(n<=2) return 1; else return run(log(n)+log(n)); }Which of the following represents the running time for run(n) function?a O(log n)b O(log log(n))c O(log * ...
0 votes
5 answers
8
Ace test series
Which of the following scheduling algorithms can cause indefinite blocking of a process? a>FIFO b>SRTF c>Round Robin d>Priority scheduling According to me answer should be B and D.Am I correct??
Which of the following scheduling algorithms can cause indefinite blocking of a process?a>FIFOb>SRTFc>Round Robin d>Priority scheduling According to me answer should be B...
0 votes
0 answers
10
Ace test series
A DRAM chip is designed with capacity of 512MBytes with row size of 32 bits each, one refresh operation takes one nanosecond time.Total refresh time to refresh the DRAM chip once is _______________ milliseconds. My answer is 134.22 milliseconds while the answer given is 128 milliseconds.
A DRAM chip is designed with capacity of 512MBytes with row size of 32 bits each, one refresh operation takes one nanosecond time.Total refresh time to refresh the DRAM c...
0 votes
1 answer
11
Computer Networks Doubt
What will be the formula for the efficiency of a link in stop and wait protocol when acknowledgements are piggybacked??? My guess is $2*T/(2*T+2*P)$ where T=Transmission delay P=propagation delay And frames sent by sender and reciever are of equal size
What will be the formula for the efficiency of a link in stop and wait protocol when acknowledgements are piggybacked???My guess is $2*T/(2*T+2*P)$where T=Transmission d...