Question 1
When will the 20K job complete?
Note - This question was subjective type.Question 2
A. O(log n) 1. Selection sort
B. O(n) 2. Insertion sort
C. O(nlog n) 3. Binary search
D. O(n^2) 4. Merge sort
codes:
A B C D
a. 3 1 2 4
b. 3 1 4 2
c. 1 3 4 2
d. 1 4 3 2
Question 3
Question 5
function fun (x:integer):integer; Begin If x >100 then fun = x-10 Else fun = fun(fun( x+11)) End;
Question 6
A: array [1 ... 10] [1 ... 15] of integer;Assuming that each integer takes one memory location, the array is stored in row-major order and the first element of the array is stored at location 100, what is the address of the element a[i][j] ?
Question 7
Question 8
Question 9
The overlay tree for a program is as shown below:
What will be the size of the partition (in physical memory) required to load (and run) this program?
Question 10
There are 83 questions to complete.