We are here with you hands in hands to facilitate your learning & don't appreciate the idea of copying or replicating solutions. Read More>>


Looking For Something at vustudents.ning.com? Click Here to Search

Assignment No. 01
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:
 The assignment is submitted after due date.
 The submitted assignment is other than .doc file.
 The submitted assignment does NOT open or file is corrupted.
 The assignment is copied (from other student or ditto copy from any other source).
Submission

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

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- .

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

+ Click Here To Join also Our facebook study Group.

..How to Join Subject Study Groups & Get Helping Material?..


See Your Saved Posts Timeline

Views: 16613

.

+ 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?)

Replies to This Discussion

Soon solution will be uploaded

bro mjhe solution nai chahye mjhe samajhna hai plz samjha do.

Dear solution post kardo na plz plz plz

plz boss need solution. time is ticking .......

Please Discuss here about this assignment.Thanks

Our main purpose here discussion not just Solution

We are here with you hands in hands to facilitate your learning and do not appreciate the idea of copying or replicating solutions.

Please koi Big-O notaion samjha da.

mujy b smjna hai

first question ho tu ho gaya

koe hai is discussion mae koe tu discuss karo assignment

3rd question kysy ho ga recurrence tree page no 32 py diya hova hai kaya us tarha banana hai?

or second question mae kaya sirf lower or upper bounds hi nikalni hai ya agy b solve karna hai?

mjy b smjhna h

Bohat mushkil subject hai yar ye 

RSS

Latest Activity

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

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