Blog: CS502 1st Solved Quiz Spring 2013 Shared by jasmine's

jasmine's Quiz solved:

The time assumed for each basic operation to execute on RAM model of computation is-----
Infinite
Continuous
Constant          (p10)
Variable

If the indices passed to merge sort algorithm are not equal, the algorithm may return immediately.
True
False    (p28)

Brute-force algorithm uses no intelligence in pruning out decisions.
True     (p18)
False

In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
True     (p24)
False

For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
True     (p14)
Fast

The array to be sorted is not passed as argument to the merge sort algorithm.
True
False    (p28)

In simple brute-force algorithm, we give no thought to efficiency.
True     (p11)
False

Heaps can be stored in arrays without using any pointers; this is due to the ___ nature of the binary tree,
Left-complete   (p40)       
right-complete              
tree nodes
tree leaves

One of the clever aspects of heaps is that they can be stored in arrays without using any______
Pointers (p40)
constants     
variables       
functions

How much time merge sort takes for an array of numbers?
T(n^2)         
T(n)      
T( log n)           
T(n log n)      (p40)