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

www.vustudents.ning.com

 www.bit.ly/vucodes + Link For Assignments, GDBs & Online Quizzes Solution www.bit.ly/papersvu + Link For Past Papers, Solved MCQs, Short Notes & More

Dear Students! Share your Assignments / GDBs / Quizzes files as you receive in your LMS, So it can be discussed/solved timely. Add Discussion

# Fundamentals of Algorithms (CS502) Assignment # 01 Spring 2018 due date 10-05-2018

Fundamentals of Algorithms (CS502)
Assignment # 01
Spring 2018
Total marks = 20
Lectures Covered: This assignment covers Lecture # 1 to 7.
Objectives:
Objectives of this assignment are:
To understand line by line analysis of an algorithm
To understand how to calculate running time of an algorithm
To perform comparison of different algorithms

Instructions:
Please read the following instructions carefully before solving & submitting the assignment:
The assignment will not be accepted after due date.
Zero marks will be awarded if the assignment does not open or the file is corrupt.
The assignment file must be an MS Word (.doc/.docx) file format; Assignment will not be accepted in any other format.
Zero marks will be awarded if assignment is copied (from other student or copied from handouts or internet).
Zero marks will be awarded if Student ID is not mentioned in the assignment file.

For any query about the assignment, contact only at CS502@vu.edu.pk
Please do not post queries related to assignment on MDB.

Question # 1: 10 Marks

For the following code segment, provide line-by-line analysis and construct function T(n) that give the runtime of this code as a function of "n". Also determine the big-O for this code segment. [Marks: 5+3+2]

Code segment Cost

i = 1
j = 1
k = 1
while (i <= n)
i = i + 1
while (j < n)
a = 2 + g
j = j + 1
if (k <= n)
a = 2
else
a = 3

Question # 2: 5 Marks
Which of the following two functions is faster?
f1 = 10n2
f2 = n3

Question # 3: 5 Marks

In the context of 2D Maxima problem, Brute Force algorithm runs in Θ(n2) time and Plane-Sweep algorithm runs in Θ(nlog2n) time. For n = 500,000, if Plane-Sweep takes 1 second, how much time (in hours) Brute Force algorithm will take? Calculate and show all the steps.
Note: Base of log is 2 (e.g. log210 = 3.321928095)

Good Luck

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

+ How to become Top Reputation, Angels, Intellectual, Featured Members & Moderators?

+ VU Students Reserves The Right to Delete Your Profile, If?

Views: 3211

.

+ http://bit.ly/vucodes (Link for Assignments, GDBs & Online Quizzes Solution)

+ http://bit.ly/papersvu (Link for Past Papers, Solved MCQs, Short Notes & More)

Attachments:

### Replies to This Discussion

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

Discussed & be touched with this discussion. After discussion a perfect solution will come in a result at the end.

Note:-

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.

&

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

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

any clue ?

soltion req?

sir koi to solutin send ker dy

cs502 assignment solution complete dont copy past

Attachments:

thnk you

es ma all question complete ha answer

Attachments:

thankiuu

Is it correct???

yes it is correct.....

Thanks for solution

## Latest Activity

2 minutes ago
40 minutes ago
Muhammad Ahtisham Butt posted a discussion

### Log Kehte Hain K Tera Dost Bewafa Hai

40 minutes ago
Alone Struggler liked иαвєєℓ αнмє∂'s discussion !!!! Yaad !!!!
40 minutes ago
Alone Struggler liked zohaib iftikhar's discussion ...* JANNAT K SULTAN ...*
41 minutes ago
41 minutes ago
43 minutes ago
46 minutes ago
47 minutes ago
47 minutes ago
47 minutes ago
53 minutes ago

1

2

3