Admin Admin
Posts : 638 Points : 2155 Reputation : 19 Join date : 20100515 Age : 29 Location : islamabad
 Subject: QUIZ NO 1 OF CS502 FALL 2010 Wed Nov 03, 2010 7:49 pm  
  Quote :
Question # 1 of 10 ( Start time: 06:18:58 PM ) Total Marks: 1 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 Question # 2 of 10 ( Start time: 06:19:38 PM ) Total Marks: 1 Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree, Select correct option: leftcomplete rightcomplete tree nodes tree leaves Question # 3 of 10 ( Start time: 06:20:18 PM ) Total Marks: 1 Sieve Technique can be applied to selection problem? Select correct option: True False Question # 4 of 10 ( Start time: 06:21:10 PM ) Total Marks: 1 A heap is a leftcomplete binary tree that conforms to the ___________ Select correct option: increasing order only decreasing order only heap order (log n) order Question # 5 of 10 ( Start time: 06:21:39 PM ) Total Marks: 1 A (an) _________ is a leftcomplete binary tree that conforms to the heap order Select correct option: heap binary tree binary search tree array Question # 6 of 10 ( Start time: 06:22:04 PM ) Total Marks: 1 Divideandconquer as breaking the problem into a small number of Select correct option: pivot Sieve smaller sub problems Selection Question # 7 of 10 ( Start time: 06:22:40 PM ) Total Marks: 1 In Sieve Technique we do not know which item is of interest Select correct option: True False Question # 8 of 10 ( Start time: 06:23:26 PM ) Total Marks: 1 The recurrence relation of Tower of Hanoi is given below T(n)={1 if n=1 and 2T(n1) if n >1 In order to move a tower of 5 rings from one peg to another, how many ring moves are required? Select correct option: 16 10 32 31 Question # 9 of 10 ( Start time: 06:24:44 PM ) Total Marks: 1 In the analysis of Selection algorithm, we eliminate a constant fraction of the array with each phase; we get the convergent _______________ series in the analysis, Select correct option: linear arithmetic geometric exponent Question # 10 of 10 ( Start time: 06:25:43 PM ) Total Marks: 1 For the heap sort, access to nodes involves simple _______________ operations. Select correct option: arithmetic binary algebraic logarithmic


Admin Admin
Posts : 638 Points : 2155 Reputation : 19 Join date : 20100515 Age : 29 Location : islamabad
 Subject: Re: QUIZ NO 1 OF CS502 FALL 2010 Wed Nov 03, 2010 8:14 pm  
  Quote :
Question # 1 of 10 ( Start time: 06:18:58 PM ) Total Marks: 1 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 Question # 2 of 10 ( Start time: 06:19:38 PM ) Total Marks: 1 Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree, Select correct option: leftcomplete rightcomplete tree nodes tree leaves Question # 3 of 10 ( Start time: 06:20:18 PM ) Total Marks: 1 Sieve Technique can be applied to selection problem? Select correct option: True False Question # 4 of 10 ( Start time: 06:21:10 PM ) Total Marks: 1 A heap is a leftcomplete binary tree that conforms to the ___________ Select correct option: increasing order only decreasing order only heap order (log n) order
Question # 5 of 10 ( Start time: 06:21:39 PM ) Total Marks: 1 A (an) _________ is a leftcomplete binary tree that conforms to the heap order Select correct option: heap binary tree binary search tree array Question # 6 of 10 ( Start time: 06:22:04 PM ) Total Marks: 1 Divideandconquer as breaking the problem into a small number of Select correct option: pivot Sieve smaller sub problems Selection
Question # 7 of 10 ( Start time: 06:22:40 PM ) Total Marks: 1 In Sieve Technique we do not know which item is of interest Select correct option: True False
Question # 8 of 10 ( Start time: 06:23:26 PM ) Total Marks: 1 The recurrence relation of Tower of Hanoi is given below T(n)={1 if n=1 and 2T(n1) if n >1 In order to move a tower of 5 rings from one peg to another, how many ring moves are required? Select correct option: 16 10 32 31 Question # 9 of 10 ( Start time: 06:24:44 PM ) Total Marks: 1 In the analysis of Selection algorithm, we eliminate a constant fraction of the array with each phase; we get the convergent _______________ series in the analysis, Select correct option: linear arithmetic geometric exponent Question # 10 of 10 ( Start time: 06:25:43 PM ) Total Marks: 1 For the heap sort, access to nodes involves simple _______________ operations. Select correct option: arithmetic binary algebraic logarithmic For the sieve technique we solve the problem, Select correct option: recursively mathematically precisely accurately The sieve technique works in ___________ as follows Select correct option: phases numbers integers routines Slow sorting algorithms run in, Select correct option: T(n^2) T(n) T( log n) A (an) _________ is a leftcomplete binary tree that conforms to the heap order Select correct option: heap binary tree binary search tree array
In the analysis of Selection algorithm, we eliminate a constant fraction of the array with each phase; we get the convergent _______________ series in the analysis, Select correct option: linear arithmetic geometric exponent
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
The sieve technique is a special case, where the number of sub problems is just Select correct option: 5 many 1 few
In which order we can sort? Select correct option: increasing order only decreasing order only increasing order or decreasing order both at the same time
The recurrence relation of Tower of Hanoi is given below T(n)={1 if n=1 and 2T(n1) if n >1 In order to move a tower of 5 rings from one peg to another, how many ring moves are required? Select correct option: 16 10 32 31
Analysis of Selection algorithm ends up with, Select correct option: T(n) T(1 / 1 + n) T(n / 2) T((n / 2) + n)
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
Divideandconquer as breaking the problem into a small number of Select correct option:
pivot Sieve smaller sub problems Selection
The analysis of Selection algorithm shows the total running time is indeed ________in n, Select correct option:
arithmetic geometric linear orthogonal
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
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:
levelorder traversal inorder traversal preorder traversal postorder traversal

