Register
Filter

Answers by anjali007

0 votes
81
made easy
Dispatch latency is (a) Time taken to swap a process. (b) The time taken to the submission and completion of the process. (c) The time taken to stop a process and start another process. (d) Time taken to switch from one thread to another.
Dispatch latency is(a) Time taken to swap a process.(b) The time taken to the submission and completion of the process.(c) The time taken to stop a process and start anot...
0 votes
82
dbms sql
i don't know the actual answer for the question
i don't know the actual answer for the question
0 votes
83
test series
A bit stuffing based framing protocol used an 8-bit delimiter pattern of HDLC's flag. if the input bit string is 1011111110111110 then the output bit string after stuffing is_ ans is -101111101101111100 plz explain with concept .
A bit stuffing based framing protocol used an 8-bit delimiter pattern of HDLC's flag. if the input bit string is 1011111110111110 then the output bit string after stuffin...
1 votes
84
circular queue
1 votes
85
#self dount
is there anyone who can tell where is Discrete Mathmatics in Gate overflow pdf ??
is there anyone who can tell where is Discrete Mathmatics in Gate overflow pdf ??
0 votes
86
probability of selecting an n-bit string in which there is a substring of length at least k in which each bit is a 1
An n-bit binary string is selected uniformly at random.For a k $\geq$ 1,what is the probability of selecting an n-bit string in which there is a substring of length at le...
0 votes
88
Control Statements
What will be the output of the below C program? #include <stdio.h> int xyz(int b) { return (b--); } int main() { int a = xyz(12); printf("%d", ++a); return 0; } (a)10 (b)11 (c)12 (d)13
What will be the output of the below C program?#include <stdio.h int xyz(int b) { return (b ); } int main() { int a = xyz(12); printf("%d", ++a); return 0; }(a)10 (b)11 (...
1 votes
91
Madeeasy_subjectTest_OperatingSystem
0 votes
92
Ace Algorithms
Suppose A is a sorted array and some of the elements are duplicates. What is the best upper bound to find out the number of elements that are equal to a given key 'k' a) O(log n) b) O(n) c) O(nlogn) d) O(n2)
Suppose A is a sorted array and some of the elements are duplicates. What is the best upper bound to find out the number of elements that are equal to a given key 'k'a)...
0 votes
93
Ace Algorithms
If given numbers are 12,7,15,8,19,20,17,21,5,3 in _______ passes of quick sort element 5 will be in sorted position. (Considering last element as pivot)
If given numbers are 12,7,15,8,19,20,17,21,5,3 in _______ passes of quick sort element 5 will be in sorted position. (Considering last element as pivot)
0 votes
94
flow control protocol
for stop and wait ARP,for n data packets sent ___acknowledgements needed.
for stop and wait ARP,for n data packets sent ___acknowledgements needed.
0 votes
95
CORMEN
What is the asymptotic performance of TREE-INSERT when used to insert n items with identical keys into an initially empty binary search tree?
What is the asymptotic performance of TREE-INSERT when used to insert nitems with identical keys into an initially empty binary search tree?
0 votes
96
Online made easy test series
Please someone explain this...how the language is phi and explain the problem..???? Thanks in advance
Please someone explain this...how the language is phi and explain the problem..????Thanks in advance
0 votes
99
algorithms practice question
problem of making change for n cents using the fewest number of coins
problem of making change for n cents using the fewest number of coins
0 votes
100
greedy technique
Assume coins with denominator 20,15,5 and 1 are available ,we are required to make a sum of 33,using minimum number of coins.Difference between answer using greedy technique and correct answer will be ____________
Assume coins with denominator 20,15,5 and 1 are available ,we are required to make a sum of 33,using minimum number of coins.Difference between answer using greedy techni...
0 votes
101
Greedy vs Dynamic
Unlike greedy algorithms, dynamic programming method always provide correct/optimal solution. Is the above statement correct?
Unlike greedy algorithms, dynamic programming method always provide correct/optimal solution.Is the above statement correct?
0 votes
103
binary semaphore
Say I have a Binary Semaphore S initialized to 1. Consider V() as Signal and P() as Wait. If I now invoke V(S), will it wait for S to become 0? Or will it go on with further execution without making any changes to S?
Say I have a Binary Semaphore S initialized to 1. Consider V() as Signal and P() as Wait. If I now invoke V(S), will it wait for S to become 0? Or will it go on with furt...
Page: