We have been working very hard since 2009 to facilitate in your learning Read More. We can't keep up without your support. Donate Now.

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

How to Add New Discussion in Study Group ? Step By Step Guide Click Here.

# CS502 Assignment No.1

Question # 1: 10 Marks

For the following code snippet, provide line-by-line analysis and construct function T(n) that give the runtime of this code snippet as a function of "n". Also determine the big-Oh of Best-case, Worst-case and Average case for this code snippet. [Marks: 4+2+2+2]

Search(A, Key)
i←1
while (A[i] ≠ key) and (i ≤ length[A])
i←i+1
if ( i≤ length[A])
return true
else
return false

Question # 2: 10 Marks

Find the 19thsmallest element from the array given below using Selection Algorithm (Sieve Technique);you are required to provide complete procedure along with array indexing and their values at each step.

933, 782, 116, 276, 904, 353, 416, 157, 277, 583, 525, 208, 269, 98, 181, 859, 573, 225, 526, 627, 631, 590, 257, 402, 335

Note: pivot must be the last element of the array in each iteration (i.e. q = r)

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

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

+ Click Here to Search (Looking For something at vustudents.ning.com?)

Views: 9399

Attachments:

### Replies to This Discussion

thanks bro or han yi array ki form main likhna hay

you can write it vertically or in horizontally. in array form or in boxes whatever what you feel easy you can do.

tou q.1?

uski abi smj ni a rhi ma try kr rha solve krne ki.
i'll share if done.

thanks _dastgeer

correct solution of cs502

Attachments:

itni mushkil hai kch pta nai chal raha question 1 k bary mein

Search(A, Key)

i←1

1 access

while (A[i] ≠ key) and (i ≤ length[A])

n times

i←i+1

1 access

if ( i ≤ length[A])

n times

return true

1 access

else

return false

1 access

T(search) = 1+ 2(n+1)+1+1

=5+2n

so Big O notation will be O(n)

bhai ye solution hai kiya????

check it...

Attachments:

thanks Naveed Qureshi

Naveed bhai es mai se kon sa solutoin thk ha? apka ya aysha ka?

## Latest Activity

3 hours ago
Saqib joined +M.Tariq Malik's group

### CS508 Modern Programming Languages

3 hours ago
3 hours ago
Musawar Ahmed joined +M.Tariq Malik's group

### CS603 Software Architecture and Design

3 hours ago
3 hours ago
4 hours ago
5 hours ago
Fatima and MUHAMMAD NAJEEB joined +M.Tariq Malik's group

### CS101 Introduction to Computing

5 hours ago
6 hours ago
+ " Şinger " and + "ραℓωαѕнα" are now friends
6 hours ago
+ " Şinger " replied to Pooja kumari's discussion quiz discussion
6 hours ago
6 hours ago

1

2

3