Related Questions

Worst -case of Quicksort algorithm occurs when
A Data are sorted
B Data are random
C Number of items is low
D None of the above
What is the best case complexity of QuickSort?
A O(nlogn)
B O(logn)
C O(n)
D O(n2)
All possible three digit numbers are formed by 1,2,3. If one number is chosen randomly , the probability that is would be divisible by 111 is ____
A 00
B 2/9
C 1/3
D 1/4
All possible three digit numbers are formed by 1,3,5 . If one number is chosen randomly, the probability that it would be divisible by 5 is -
A 29
B 13
C 14
All possible three digit numbers are formed formes by 1, 2, 3 . If one number is chosen randomly, the probability that it would be divisible by 111 is____
A 2/9
B 1/3
C 1/4
A form sorting machine can sort 12 forms in 10 minutes. How many forms can it sort in one and half hours at this rate ?
A 150
B 158
C 152
D 108
The people interviewed for the survey were randomly selected. Select the closest meaning of randomly;
A sincerely
B carefully
C mindfully
D indiscriminately
Two hundred multiples of seven are chosen at random. and 300 multiples of eight are chosen at random. Approximately what percentage of the 500 selected numbers are odd?
A 20%
B 25%
C 40%
D 80%
all possible three num areformed by 1 ,2 ,3 ,.if one number is chosen randomly; the possibility that it would be divisible by 111 is
A 2/9
B 1/3
C 1/4
You have to sort 1 GB of data with only 100 MB of available main memory. Which sorting technique will be most appropriate ?
A Heap sort
B Quick sort
C Insertion sort
D Merge Sort

Next steps