.... How to Find Your Subject Study Group & Join ....   .... Find Your Subject Study Group & Join ....  

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

Study Groups By Subject code Wise (Click Below on your university link & Join Your Subject Group)

[ + VU Study Groups Subject Code Wise ]  [ + COMSATS Virtual Campus Study Groups Subject Code Wise ]

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

Assignment No. 01

Semester: Spring 2017
Fundamentals of Algorithms – CS502


Total Marks: 20


Due Date: 03-05-2017



Please read the following instructions carefully before submitting the assignment:

  • You will submit your assignment before or on due date on VU-LMS.
  • Assignment sent via Email will not be replied and accepted/graded in any case.
  • If the submitted assignment does not open or file is corrupt, it will not be graded.
  • Assignment should be completed by your own efforts it should not be copied from internet, handouts or books.
  • You will submit solution only in the Microsoft Word File.
  • Assignment is covered from lectures 1 to 8.


Assignment Questions


Questions:                                                                                                                                Marks 20    


Question. 1                                                                                                                   (15 Marks)


Let the set A = { (1,5), (2,16), (3,7), (4,12), (5, 10), (6,6), (7,3),(8,9), (9,2), (10,8), (11,1), (12,6), (13, 3), (14, 5)}. Find the execution of sweep line algorithm for 2d-maxima.  Show status of stack in each step.


Note: Every step carry equal marks.


Question. 2                                                                                                                         (5 Marks)


Find out the complexity of an algorithm that measures the number of the print statements in an algorithm that considers a positive integer n and prints 1 one time, 2 two times, 3 three times, and n for n times.

That is


2 2

3 3 3



n n n n ……..n  (n times)






Best of Luck


Share This With Friends......

How to Find Your Subject Study Group & Join.

Find Your Subject Study Group & Join.

+ Click Here To Join also Our facebook study Group.

This Content Originally Published by a member of VU Students.

+ Prohibited Content On Site + Report a violation + Report an Issue

Views: 7939

See Your Saved Posts Timeline


Replies to This Discussion

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



For Important Helping Material related to this subject (Solved MCQs, Short Notes, Solved past Papers, E-Books, FAQ,Short Questions Answers & more). You must view all the featured Discussion in this subject group.

For how you can view all the Featured discussions click on the Back to Subject Name Discussions link below the title of this Discussion & then under featured Discussion corner click on the view all link.

Or visit this link 

Click Here For Detail.


.•°How to Download past papers from study groups°•.


Please Click on the below link to see…

.... How to Find Your Subject Study Group & Join .... 


i have been solved 1st Q

dear can you please share the 1st question solution here to help other bros?

bro you just upload 2nd qestion

Check kr k batain yeh final sahi banaya hai main ne?

Sana Can you please share the complete solution of above output?

hi sana,

i would like to make a correction here regarding given above plot.when sweep line shift from 13,3 to 14,5 the coordinates 13,3 will be dominated as 14,5 both have greater then 13,3 so it will be out of stack as it is dominated by 14,5 and it will enter in stack rather than 13,3.....all other values in stack are correct except 13,3 so the sweep line will end up with 14,5.

check question 1!!!


still have error :)

any one can post the acurate solution of cs502.....

Dear Students Don’t wait for solution post your problems here and discuss ... after discussion a perfect solution will come in a result. So, Start it now, replies here give your comments according to your knowledge and understandings....


Forum Categorizes

Job's & Careers (Latest Jobs)

Admissions (Latest Admissons)

Scholarship (Latest Scholarships)

Internship (Latest Internships)

VU Study

Other Universities/Colleges/Schools Help

    ::::::::::: More Categorizes :::::::::::

Latest Activity

Today Top Members 

Member of The Month

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

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