CS502 Assignment No.1

[ayesha]

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)

[Atif Hafeez Khan]

Thanks

[1gwev6trdxlos]

Solution 100% Correct http://virtualnkn.blogspot.com/2017/11/cs502-assignment-solution.html

[ayesha]

Thanks

[Mujtaba Ali Kiani]

CS502 Helping Video Complete

[sonaina]

good effort kindly es ko word formate ma b share kar do kal sy phly

[Umair ali]

Solution file

[Azam Azam]

ya sara solutions mian worst good ya bad case ko kasa calculate karna hia ya to batao pahla question main ###########################ßßßß