We are here with you hands in hands to facilitate your learning & don't appreciate the idea of copying or replicating solutions. Read More>>

www.vustudents.ning.com

 www.bit.ly/vucodes + Link For Assignments, GDBs & Online Quizzes Solution www.bit.ly/papersvu + Link For Past Papers, Solved MCQs, Short Notes & More

Dear Students! Share your Assignments / GDBs / Quizzes files as you receive in your LMS, So it can be discussed/solved timely. Add Discussion

# Quiz # 05 date February 15, 2013

+ How to Join Subject Study Groups & Get Helping Material?

+ How to become Top Reputation, Angels, Intellectual, Featured Members & Moderators?

+ VU Students Reserves The Right to Delete Your Profile, If?

Views: 1045

.

+ http://bit.ly/vucodes (Link for Assignments, GDBs & Online Quizzes Solution)

+ http://bit.ly/papersvu (Link for Past Papers, Solved MCQs, Short Notes & More)

Attachments:

### Replies to This Discussion

thanx alot

CS502 - Quiz 5 - 15 Feb, 2013 - Lahore

Attached file main say kuch questions aye thay

Question # 1 of 10 ( Start time: 09:15:52 AM

Theta asymptotic notation for T (n) :

Select correct option:

Set of functions described by: c1g(n)<=f(n) for c1 some constant and n=n0

Set of functions described by c1g(n)>=f(n) for c1 some constant and n=n0

Theta for T(n)is actually upper and worst case complexity of the code

Set of functions described by: c1g(n)<=f(n)<=c2g(n) for c1 and c2 some constants and n=n0

Question # 2 of 10 ( Start time: 09:17:24 AM

For the Sieve Technique we take time

Select correct option:

T(nk)

T(n / 3)

n^2

n/3

Question # 3 of 10 ( Start time: 09:18:48 AM

The sieve technique is a special case, where the

number of sub problems is just

Select correct option:

5

many

1

few

Question # 4 of 10 ( Start time: 09:19:42 AM

For the sieve technique we solve the problem,

Select correct option:

recursively

mathematically

precisely

accurately

Question # 5 of 10 ( Start time: 09:20:45 AM

Consider the following Algorithm: Fun(n){ if (n=1)

return 1 else return (n * Fun(n-1)) } Recurrence

for the above algorithm is:

Select correct option:

nT(n-1)+1

2T(n-1)+1

T(n-1)+cn

T(n-1)+1

Question # 6 of 10 ( Start time: 09:22:11 AM

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

Question # 7 of 10 ( Start time: 09:23:40 AM

The sieve technique works in ___________ as follows

Select correct option:

phases

numbers

integers

routines

Question # 8 of 10 ( Start time: 09:24:38 AM

Sieve Technique can be applied to selection

problem?

Select correct option:

True

False

Question # 9 of 10 ( Start time: 09:25:19 AM

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: 09:25:59 AM

Divide-and-conquer as breaking the problem into a

small number of

Select correct option:

pivot

Sieve

smaller sub problems

Selection

tHanks for sharing

thanx

Ali mera quiz abhi same ap k quiz k jaisa aya ha :) thanks for sharing :)

hmmmmmm

Abdul Rauf

Quiz Start Time: 11:48 AM                    Time Left         53

sec(s)

Question # 1 of 10 ( Start time: 11:48:16 AM )            Total Marks: 1

In Sieve Technique we do not know which item is of interest

Select correct option:

True

False   page34)

Abdul Rauf

Quiz Start Time: 11:48 AM                    Time Left         45

sec(s)

Question # 4 of 10 ( Start time: 11:50:12 AM )            Total Marks: 1

Dijkstra’s algorithm :

Select correct option:

Sorry I could not copy option of this question

Abdul Rauf

Quiz Start Time: 11:48 AM                    Time Left         59

sec(s)

Question # 6 of 10 ( Start time: 11:52:07 AM )            Total Marks: 1

The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,

Select correct option:

divide-and-conquer page(34)

decrease and conquer

greedy nature

2-dimension Maxima

Abdul Rauf

Quiz Start Time: 11:48 AM                    Time Left         50

sec(s)

Question # 10 of 10 ( Start time: 11:54:12 AM )          Total Marks: 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 (page 34)

phases

pointers

constant

remaining questions are same as ali bhai uploaded.

all the quizez from obve quizez.........

aj tu same quiz he sab kah a raha ha

Sb k Quiz same hain.... mera bhi same hai. aisy kis tarah

## Latest Activity

20 minutes ago
20 minutes ago
23 minutes ago
+ + + Haniya + + + liked +!!!StRaNGeR!!! +'s discussion کیا تم بھی۔۔۔۔۔۔۔۔؟؟؟؟
23 minutes ago
28 minutes ago
29 minutes ago
34 minutes ago
34 minutes ago
38 minutes ago
UMER UMER posted photos
52 minutes ago
56 minutes ago
56 minutes ago

1

2

3