Related Questions

Although we ofter use "Speed"and 'Velocity' interchangeably,"Speed" is not always________"Velocity".
A Alike
B similar
C the same as
D as
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
Randomized quick sort is an extension of quicksort where the pivot is chosen randomly. what is the worst case complexity of sorting a numbers using randomized quick sort?
A O (n)
B O (n2)
C O (n log n)
D O (n!)
The length of a rectangular field F is 3 km greater than the side of a square field M , and the width of field F is 3 km less then the side of field M. If the area of field M is m2 square km, what is the area of field F?
A m2 +6
B 6
C m2 - 6
D m2 +9
A farmer has two rectangular fields. The larger field has twice the length and four times the width of the smaller field. If the smaller field has area K, then the area of the largest field is greater than the area of the smaller field by what amount?
A 4K
B 6K
C 7K
D 8K
A farmer has two rectangular fields. The larger field has twice the length and four times the width of the smaller field. If the smaller field has area K, then the area of the larger field is greater than the area of the smaller field by what amount ?
A 2K
B 5 K
C 6K
D 7K
An aqueous solution of methanol is to be distilled in a tray column. High pressure steam is available as a source of heat. For a given reflux ratio and overhead composition, two options are being explored; (i) a reboiler is used and (ii) no reboiler is used but steam is fed directly to the bottom of the column. As compared to option (i), in option (ii)
A Less number of trays are required
B Composition of the residue remains unchanged
C More number of trays are required but the residue composition remains unchanged
D More number of trays are required and the residue composition is more dilute in methanol
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
If we have a very small amount of additional memory , but a large number of items to sort, which of the following sorting algorithm should we use?
A Merge sort
B Heap sort
C Buble sort
D Bogo sort
Assume you would like to sort an array in ascending order by value while preserving key associations. Which of the following PHP sorting functions would you use?
A ksort()
B asort()
C krsort()
D sort()
E usort()

Next steps