-->

# CS502 Assignment no 1 Solution Fall 2016

### CS502 Assignment no 1 Fall 2016

Here is the Solution of CS502 Fundamentals of Algorithm Assignment No. 01, Semester Fall 2016 –
cs502 assignment Total Marks: 15
CS502 Assignment Due Date:17/11/2016

### CS502 Assignment Instructions:

Mathtype tool can be used for mathematical notations.
It should be clear that your assignment will not get any credit (zero marks) if:
The assignment is submitted after due date.
1. The submitted assignment is other than .doc file.
2. The submitted assignment does NOT open or file is corrupted.
3. The assignment is copied (from other student or ditto copy from any other source).

### CS502 Assignment Submission:

You are required to submit your solution through VULMS as MS Word document.
For any query about the assignment, contact at CS502@vu.edu.pk

### CS502 Assignment Question. 1

(Marks = 5)
Identify the maximal points (the points that are NOT dominated by other points) in the given set according to 2-D maxima problem.
{(2,4), (4,3), (4,10), (5,2), (6,14), (7,6), (8,13), (9,11), (11,6), (12,12), (13,4), (14,11), (15,6),(15,8),(16,5)}

### CS502 Assignment Question. 2

(Marks = 5)
Show that and also calculate values by definition of Big- .

### CS502 Assignment Question. 3

(Marks = 5)
Consider the Merge Sort Algorithm for sorting a set of n points. Draw recursion tree for this algorithm for n = 30.

### CS502 Assignment no 1 Solution

CS502 Design and Analysis of Algorithm Assignment no 1 Fall 2016