Register
Filter

Answers by Habibkhan

4 votes
301
CIDR notation
7 votes
302
ACE Basic test
Test Digital logic ques 15
Test Digital logic ques 15
0 votes
303
Binary Search tree
Consider an array with ‘n’ numbers, let “T” be time complexity for finding a number appeared maximum number of times in an array. Using Binary Search Tree data structure the T will be A. O(log n) B. O(n) C. O(n logn) D. O(n2)
Consider an array with ‘n’ numbers, let “T” be time complexity for finding a number appeared maximum number of times in an array. Using Binary Search Tree data st...
4 votes
304
Time Complexity
What is the time complexity of quick sort when (i) Choosing median of sorted array as pivot.
What is the time complexity of quick sort when (i) Choosing median of sorted array as pivot.
3 votes
305
made easy
Unix I-node has disk block size 8 KB and maximum file possible with the double indirect is 32 GB. Then the number of bits which represents disk block address is _______ bits.
Unix I-node has disk block size 8 KB and maximum file possible with the double indirect is 32 GB. Then the number of bits which represents disk block address is _______ b...
5 votes
306
ME-CN
Assume a CSMA/CD network that transmit data at a rate of 20 Mbps over a 20 km cable with no repeater. If minimum frame size require for network is 5,000 KB then speed of the signal inside cable is __________ (in Km/sec). What should be correct ans : 19.53 or 20
Assume a CSMA/CD network that transmit data at a rate of 20 Mbps over a 20 km cable with no repeater. If minimum frame size require for network is 5,000 KB then speed of ...
5 votes
308
Virtual Gate Test Series: Compiler Design - Triples
Which of the following is an advantage of $\text{'Triples'}$ Statements can be moved around Wastage of too much space Space is not wasted Two memory access per operation
Which of the following is an advantage of $\text{'Triples'}$Statements can be moved aroundWastage of too much spaceSpace is not wastedTwo memory access per operation
7 votes
309
probability
Let S be a sample space and two mutually exclusive events Aand B be such that A∪B=A∪B=S. If P(.)denotes the probability of the event, the maximum value of P(A)P(B) is_____.
Let S be a sample space and two mutually exclusive events Aand B be such that A∪B=A∪B=S. If P(.)denotes the probability of the event, the maximum value of P(A)P(B) is...
11 votes
310
DOUBT
my answer is "B" but the answer is given "C"
my answer is "B" but the answer is given "C"
7 votes
313
Addressing Mode
S1 : Relative mode is the addressing mode which can be used to write code in which reallocation is done at run time. S2 : Indirect addressing through registers can be used to access global variables. Which of the following option is correct?
S1 : Relative mode is the addressing mode which can be used to write code in which reallocation is done at run time.S2 : Indirect addressing through registers can be used...
1 votes
314
2PL doubt
2 votes
315
Am i right?
4 votes
316
combinatorics
coefficient of x^20 in (1+x+x^2+......................)^2 is?
coefficient of x^20 in (1+x+x^2+......................)^2 is?
10 votes
317
poisson distribution
2 votes
318
counter ques
Using four cascaded counters with a total of 16 bits, how many states must be deleted to achieve a modulus of 50,000? A. 50,000 B. 65,536 C. 25,536 D. 15,536
Using four cascaded counters with a total of 16 bits, how many states must be deleted to achieve a modulus of 50,000?A. 50,000B. 65,536C. 25,536D. 15,536
3 votes
321
Simple Doubt in Integration
$\int_{- \pi }^{\pi} t^{2} \sin t \ dt$
$\int_{- \pi }^{\pi} t^{2} \sin t \ dt$
3 votes
322
Combinatorics Doubt
A box contain 10 screws out of which 3 are defective.If two screws are drawn at random WITH REPLACEMENT.What is the probability that no screw is defective? Answer given as 7c2/10C2 my question is ,as its given With Replacement. So why not it is (7/10)*(7/10)
A box contain 10 screws out of which 3 are defective.If two screws are drawn at random WITH REPLACEMENT.What is the probability that no screw is defective?Answer given as...
3 votes
324
Adder
3 votes
325
Time Complexity
What is the time complexity of this? for(i=1;i<=n;i=i*2) { for(j=0;j<i;j++) {temp=temp+i;} }
What is the time complexity of this?for(i=1;i<=n;i=i*2) { for(j=0;j<i;j++) {temp=temp+i;}}
3 votes
326
IP ADDRESSING
if ip fragment offset is 32 then how many number of datagram bytes ahead of this fragment ?
if ip fragment offset is 32 then how many number of datagram bytes ahead of this fragment ?
3 votes
327
interrupt handling
Assume that memory is byte addressable with word size of 32 bits. The program has been loaded in memory 300(decimal) Address onwards. If an interrupt is occurred during the execution of HALT which is stored at 328. What will be the return Address pushed on to the stack?
Assume that memory is byte addressable with word size of 32 bits. The program has been loaded in memory 300(decimal) Address onwards. If an interrupt is occurred during t...
5 votes
329
DOUBT
Page: