Latest Activity In Study Groups

Join Your Study Groups

VU Past Papers, MCQs and More

We non-commercial site working hard since 2009 to facilitate learning Read More. We can't keep up without your support. Donate.

CS502 Assignment No 02 Fall 2019 Solution & Discussion Due Date: 27-11-2019

CS502 Fundamentals of Algorithms Assignment 2 Solution & Discussion Fall 2019


Assignment No. 02
SEMESTER Fall 2019

CS502- Fundamentals of Algorithms

 Total Marks: 20

Due Date: 27/11/2019


Please read the following instructions carefully before solving & submitting assignment:

It should be clear that your assignment will not get any credit  if:

·       The assignment is submitted after due date.

·       The submitted assignment does not open or file corrupt.

·       The assignment is full or partially copied from (other student or ditto copy from handouts or internet).

·       Student ID is not mentioned in the assignment File or name of file is other than student ID.

·       The assignment is not submitted in .doc or .docx format.

Uploading instructions

Your submission must include:

·       Assignment should be in .doc or .docx format.

·       Save your assignment with your ID (e.g. bx180200786.doc).

Assignment submission through email is NOT acceptable


The objective of this assignment is

·       To give basic knowledge and understanding of Algorithms.

·       To be able to design sorting algorithms.

·       To be able to understand and calculate the complexity of algorithms.



Your answer must follow the below given specifications.

·        Font style: “Times New Roman”

·        Font color: “Black”

·        Font size: “12”

·        Bold for heading only.

·        Font in Italic is not allowed at all.

·        No formatting or bullets are allowed to use.

·       Your answer should be precise and to the point, avoid irrelevant detail.


Lectures Covered: This assignment covers Lecture # 09 - 14


Your assignment must be uploaded/submitted at or before 27/11/2019.


Assignment diagram:


Consider the given diagram having an unsorted array and its sorting procedure through dry run. You are required to answer the following questions.


Question No  01:   (Marks:  5)

You are required to determine (write down the name) the algorithm being used while sorting the above given array.


Question No  02:   (Marks:  7)

You are required to design (write) the algorithm (Only Pseudo code) determined in Question 1.


Question No  03:   (Marks:  8)

You are required to calculate (Step by Step) the worst case time complexity T(n) of the algorithm designed in Question No. 02.


For any query about the assignment, contact at


Views: 2362

Replies to This Discussion

Please Discuss here about this assignment.Thanks

Our main purpose here discussion not just Solution

Students having same subject can start discussion here to solve assignment, GDB & Quiz and can clear their concepts until solution is provided. 


P.S:    Please always try to add the discussion in proper format title like “CS101 Assignment / GDB No 01 Solution & Discussion Due Date: ___________”

Then copy Questions from assignment file and paste in Discussion. (For Assignments, GDBs & Online Quizzes Solution) (For Past Papers, Solved MCQs, Short Notes & More)

Click Here to Search (Looking For something at

Click Here to Join (Our facebook study Group)


CS502 Assignment NO 02 Solution Fall 2019

Below link

CS502 Assignment  2 solution 2019CS502 Assignment  2 solution 2019VU ID: BCXXXXXXXXXXXXXXXXUSERNAME: ABCQ1:You are required to determine (write down the name ) of the algorithm being used while sorting the above given array ?Answer:The name of the algorithm is selection sort algorithm.
Q2:You are required to design the algorithm (only pseudo code) determined in question 1 ?Answer:SelectionSort(){
For(i= 0 to n -1){ Min = I C1 For(j = I+1 to n-1){ If(arr[min] > arr[j]) Min = j C2 }Temp = a[i]A[i] = a[min]A[min]=temp C3}

Q3:You are required to calculate (step by step) the worst case time complexity T(n) of the algorithm designed in question no 2 ?Ans:C1     = (N-1)C2     =(N-1)+(N+2)+(N+3)+…..+1 C3  = (n-1)T(n) = (n-1).C1 +  .C2 + (N-1)C3T(n) = an2 + bn + cHere a , b and c are constants in term of c1,c2 and c3T(n) = O(n2)

one more 

CS502 Assignment No 02 Solution Fall 2019

below link 

CS502 Assignment 2 solution 2019


below link


CS502 solution Assgnment#02

link below 

CS502 solution Assgnment#02

kindly bta den important topics for mid


© 2021   Created by + M.Tariq Malik.   Powered by

Promote Us  |  Report an Issue  |  Privacy Policy  |  Terms of Service