Assignment No. 01
Semester:Fall 2016
Fundamentals of Algorithm – CS502
Total Marks: 15
Semester:Fall 2016
Fundamentals of Algorithm – CS502
Total Marks: 15
Due Date:17/11/2016
Instructions
Please read the following instructions carefully
before submitting the assignment:
§ Mathtype tool can be used for mathematical notations.
It should be clear that your assignment will not get any credit (zero marks) if:
§ Mathtype tool can be used for mathematical notations.
It should be clear that your assignment will not get any credit (zero marks) if:
You are required to submit your solution through
LMS as MS Word document.
For any query about the assignment, contact at CS502@vu.edu.pk
For any query about the assignment, contact at CS502@vu.edu.pk
Assignment Questions
Question. 1 (5 Marks)
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)}
Question. 2 (5 Marks)
Show that and also calculate values by definition of Big- .
{(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)}
Question. 2 (5 Marks)
Show that and also calculate values by definition of Big- .
Question # 3 (5 Marks)
Consider the Merge Sort Algorithm for sorting a
set of n points. Draw recursion tree for this algorithm for n = 30.
Best of Luck
No comments:
Post a Comment