Question 21
You have an array of n elements. Suppose you implement quick sort by always choosing the central element of the array as the pivot. Then the tightest upper bound for the worst case performance is
Question 22
a*b*(ba)*a*
Question 25
1) Static allocation of all data areas by a compiler makes it impossible to implement recursion. 2) Automatic garbage collection is essential to implement recursion. 3) Dynamic allocation of activation records is essential to implement recursion. 4) Both heap and stack are essential to implement recursion.
Question 26
Question 27
Question 30
In the following pairs of OSI protocol layer/sub-layer and its functionality, the INCORRECT pair is
There are 65 questions to complete.