My Quiz of CS502

On Wed, Nov 3, 2010 at 5:36 AM, mc090406557 Nadia Parveen <mc090406557@vu.edu.pk> wrote:

LO bucho...........

mojain karo..............

 

 

its all not conferm............yeh mera solution hia.......

pata nahi theek k galat........

 

 

 

 

 

 

 

 

 

MC090406557 : Nadia Parveen

 

 

 

Quiz Start Time: 06:18 PM  Time Left  55

sec(s)   

 

 

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

 

 

    

 

 

 

MC090406557 : Nadia Parveen

 

 

 

Quiz Start Time: 06:18 PM  Time Left  62

sec(s)   

 

 

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: 

 

 left-complete

 right-complete

 tree nodes

 tree leaves

 

 

    

 

 

 

MC090406557 : Nadia Parveen

 

 

 

Quiz Start Time: 06:18 PM  Time Left  77

sec(s)   

 

 

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

 

 

     

 

MC090406557 : Nadia Parveen

 

 

 

Quiz Start Time: 06:18 PM  Time Left  74

sec(s)   

 

 

Question # 4 of 10 ( Start time: 06:21:10 PM )  Total Marks: 1 

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

 

 

    

 

 

MC090406557 : Nadia Parveen

 

 

 

Quiz Start Time: 06:18 PM  Time Left  77

sec(s)   

 

 

Question # 5 of 10 ( Start time: 06:21:39 PM )  Total Marks: 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

 

 

    

 

 

 

MC090406557 : Nadia Parveen

 

 

 

Quiz Start Time: 06:18 PM  Time Left  72

sec(s)   

 

 

Question # 6 of 10 ( Start time: 06:22:04 PM )  Total Marks: 1 

Divide-and-conquer as breaking the problem into a small number of 

Select correct option: 

 

 pivot

 Sieve

 smaller sub problems

 Selection

 

 

    

 

 

 

MC090406557 : Nadia Parveen

 

 

 

Quiz Start Time: 06:18 PM  Time Left  48

sec(s)   

 

 

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

 

 

    

 

 

MC090406557 : Nadia Parveen

 

 

 

Quiz Start Time: 06:18 PM  Time Left  34

sec(s)   

 

 

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(n-1) 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 (yeh just tukka hai)

 

 

    

 

 

 

MC090406557 : Nadia Parveen

 

 

 

Quiz Start Time: 06:18 PM  Time Left  36

sec(s)   

 

 

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 (yeh b gup hi lugti hai)

 exponent

 

 

 

MC090406557 : Nadia Parveen

 

 

 

Quiz Start Time: 06:18 PM  Time Left  76

sec(s)   

 

 

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 (bongi hai...)

 

 

    

 

 

    

 

 

 

 

 

--

""One Day We Will Meet As Clouds On The Sky""

         *Chunda*

--
Contact to Admn. AamirAbbasMCS@gmail.com
 
Send email to group at: mcs-mit@googlegroups.com
Visit For Previous Papers http://groups.google.com/group/mcs-mit/files
 
Follow these Rules to stay long in Group:
http://groups.google.com/group/mcs-mit/web/group-rules