A list of n strings, each of length n, is sorted into lexicographic order using the merge-sort algorithm. The worst case running time of this computation is(A) O(n log n)(B) O(n2 log n)(C) O(n2 + log n)(D) O(n2)

A list of n strings, each of length n, is sorted into lexicographic or

1.	A list of n strings, each of length n, is sorted into lexicographic order using the merge-sort algorithm. The worst case running time of this computation is(A) O(n log n)(B) O(n2 log n)(C) O(n2 + log n)(D) O(n2)
Answer»

Discussion

No Comment Found

Related InterviewSolutions

Consider the following relations A, B, C. How many tuples does the result of the following relational algebra expression contain? Assume that the schema of A U B is the same as that of A.Table AId Name Age----------------12 Arun 6015 Shreya 2499 Rohit 11Table BId Name Age----------------15 Shreya 2425 Hari 4098 Rohit 2099 Rohit 11Table CId Phone Area-----------------10 2200 02 99 2100 01(A) 7(B) 4(C) 5(D) 9
The amount of ROM needed to implement a 4 bit multiplier is(A) 64 bits(B) 128 bits(C) 1 Kbits(D) 2 Kbits
Consider the 3 processes, P1, P2 and P3 shown in the table.Process Arrival time Time Units Required P1 0 5 P2 1 7 P3 3 4The completion order of the 3 processes under the policies FCFS and RR2 (round robin scheduling with CPU quantum of 2 time units) are(A)FCFS: P1, P2, P3 RR2: P1, P2, P3(B) FCFS: P1, P3, P2 RR2: P1, P3, P2(C)FCFS: P1, P2, P3 RR2: P1, P3, P2(D)FCFS: P1, P3, P2 RR2: P1, P2, P3
Suppose a fair six-sided die is rolled once. If the value on the die is 1, 2, or 3, the die is rolled asecond time. What is the probability that the sum total of values that turn up is at least 6?(A) 10/21(B) 5/12(C) 2/3(D) 1/6
Consider the above tables A, B and C. How many tuples does the result of the following SQL query contains?SELECT A.id FROM A WHERE A.age > ALL (SELECT B.age FROM B WHERE B. name = "arun") (A) 4(B) 3(C) 0(D) 1
Consider a random variable X that takes values +1 and −1 with probability 0.5 each. The values of the cumulative distribution function F(x) at x = −1 and +1 are(A) 0 and 0.5(B) 0 and 1(C) 0.5 and 1(D) 0.25 and 0.75
The truth tablerepresents the Boolean function(A) X(B) X+Y(C) X xor Y(D) Y
Consider the data given in previous question. The size of the cache tag directory is(A) 160 Kbits(B) 136 bits(C) 40 Kbits(D) 32 bits
(A) Both I1 and I2 are correct inferences(B) I1 is correct but I2 is not a correct inference(C) I1 is not correct but I2 is a correct inference(D) Both I1 and I2 are not correct inferences
Which of the following isTRUE?(A) Every relation in 3NF is also in BCNF(B) A relation R is in 3NF if every non-prime attribute of R is fully functionally dependent on every key of R(C) Every relation in BCNF is also in 3NF(D) No relation can be in both BCNF and 3NF

A list of n strings, each of length n, is sorted into lexicographic order using the merge-sort algorithm. The worst case running time of this computation is(A) O(n log n)(B) O(n2 log n)(C) O(n2 + log n)(D) O(n2)

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment