×
Detail Form
We will send your result on your email id and phone no. please fill detail
1.
If one uses straight two-way merge sort algorithm to sort the following elements in ascending order 20, 47, 15, 8, 9, 4, 40, 30, 12, 17 then the order of these elements after the second pass of the algorithm is:
2.
The minimum number of record movements required to merge five files A (with 10 records), B (with 20 records), C (with 15 records), D (with 5 records) and E (with 25 records) is:
3.
Suppose we want to arrange the ii numbers stored in an array such that all negative values occur before all positive ones. Minimum number of exchanges required in the worst case is:
4.
A sorting technique is called stable if:
5.
Which of the following is TRUE?
6.
The two numbers given below are multiplied using the Booth's algorithm.
Multiplicand : 0101 1010 1110 1110
Multiplier: 0111 0111 1011 1101
How many additions/Subtractions are required for the multiplication of the above two numbers?
Multiplicand : 0101 1010 1110 1110
Multiplier: 0111 0111 1011 1101
How many additions/Subtractions are required for the multiplication of the above two numbers?
7.
The auxiliary space of insertion sort is O(1), what does O(1) mean ?
The auxiliary space of insertion sort is O(1), what does O(1) mean ?
8.
The worst case running times of Insertion sort, Merge sort and Quick sort, respectively, are:
The worst case running times of Insertion sort, Merge sort and Quick sort, respectively, are:
9.
10.
A problem in NP is NP-complete if