Quiz # 1 of CS502

Sieve Technique can be applied to selection problem? 
Select correct option: 

True 
false


For the heap sort we store the tree nodes in 
Select correct option: 

level-order traversal 
in-order traversal 
pre-order traversal 
post-order traversal


One of the clever aspects of heaps is that they can be stored in arrays without using any _______________. 
Select correct option: 
pointers
constants
variables
functions

A (an) _________ is a left-complete binary tree that conforms to the heap order 
Select correct option: 
heap
binary tree
binary search tree
array

Divide-and-conquer as breaking the problem into a small number of 
Select correct option: 
pivot
Sieve
smaller sub problems
Selection


Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree, 
Select correct option: 
left-complete
right-complete
tree nodes
tree leaves

For the sieve technique we solve the problem, 
Select correct option: 
recursively
mathematically
precisely
accurately

A heap is a left-complete binary tree that conforms to the ___________ 
Select correct option: 
increasing order only
decreasing order only
heap order
(log n) order


We do sorting to, 
Select correct option: 
keep elements in random positions
keep the algorithm run in linear order
keep the algorithm run in (log n) order
keep elements in increasing or decreasing order


How many elements do we eliminate in each time for the Analysis of Selection algorithm? 
Select correct option: 
n / 2 elements
(n / 2) + n elements
n / 4 elements
2 n elements


How much time merge sort takes for an array of numbers? 
Select correct option: 
T(n^2)
T(n)
T( log n)
T(n log n)


The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of, 
Select correct option: 
divide-and-conquer
decrease and conquer
greedy nature
2-dimension Maxima

Question # 1 of 10 ( Start time: 08:17:23 AM ) Total M a r k s: 1
The number of nodes in a complete binary tree of height h is
Select correct option:
2^(h+1) – 1
2 * (h+1) – 1
2 * (h+1)
((h+1) ^ 2) – 1
Question # 2 of 10 ( Start time: 08:18:46 AM ) Total M a r k s: 1
A (an) _________ is a left-complete binary tree that conforms to the heap order
Select correct option:
heap
binary tree
binary search tree
array

Question # 3 of 10 ( Start time: 08:19:38 AM ) Total M a r k s: 1
In Sieve Technique we do not know which item is of interest
Select correct option:
True
False

Question # 4 of 10 ( Start time: 08:20:33 AM ) Total M a r k s: 1
Heaps can be stored in arrays without using any pointers; this is due to the
____________ nature of the binary tree,
Select correct option:
left-complete
right-complete
tree nodes
tree leaves

Question # 5 of 10 ( Start time: 08:21:59 AM ) Total M a r k s: 1
In the analysis of Selection algorithm, we make a number of passes, in fact it could be as
many as,
Select correct option:
T(n)
T(n / 2)
log n
n / 2 + n / 4

Question # 6 of 10 ( Start time: 08:23:01 AM ) Total M a r k s: 1
For the sieve technique we solve the problem,
Select correct option:
recursively
mathematically
precisely
accurately
Theta asymptotic notation for T (n) :
Select correct option:
Set of functions described by: c1g(n)Set of functions described by c1g(n)>=f(n) for c1 s
Theta for T(n)is actually upper and worst case comp
Set of functions described by:
c1g(n)

Question # 8 of 10 ( Start time: 08:24:39 AM ) Total M a r k s: 1
The sieve technique is a special case, where the number of sub problems is just
Select correct option:
5
many
1
few
Question # 9 of 10 ( Start time: 08:25:54 AM ) Total M a r k s: 1
Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
Select correct option:
n items
phases
pointers
constant

Question # 10 of 10 ( Start time: 08:26:44 AM ) Total M a r k s: 1
The sieve technique works in ___________ as follows
Select correct option:
phases
numbers
integers
routines

Memorization is?
To store previous results for future use
To avoid this unnecessary repetitions by writing down the results of recursive calls and looking them up again if we need them later
To make the process accurate
None of the above

Question # 2 of 10 Total M a r k s: 1
Which sorting algorithm is faster
O (n log n)
O n^2
O (n+k)
O n^3

Quick sort is
Stable & in place
Not stable but in place
Stable but not in place
Some time stable & some times in place

One example of in place but not stable algorithm is
Merger Sort
Quick Sort
Continuation Sort
Bubble Sort

In Quick Sort Constants hidden in T(n log n) are
Large
Medium
Small
Not Known

--

Need Your Comments.....!

-- 
For University of Pakistan Study Material Sharing, Discussion, etc, Come and join us at http://4e542a34.linkbucks.com
You received this message because you are subscribed to the Google
Groups "Study" group.
To post to this group, send email to http://ca13054d.tinylinks.co
For more options, visit this group at
http://004bbb67.any.gs