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

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

 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

How to Add New Discussion in Study Group ? Step By Step Guide Click Here.

# Fundamentals of Algorithms (CS502), Fall 2018, Assignment No. 1, Deadline = 29/11/2018

Fundamentals of Algorithms (CS502)

Assignment # 01

Fall 2018

Total marks = 20

Deadline = 29/11/2018

Lectures Covered: This assignment covers Lecture # 1 to 11.

Objectives:

Objectives of this assignment are:

• To view the asymptotically equivalent functions.
• To understand the concept of lower, upper and tight Bounds.
• To perform iteration method on recurrence relations.

Instructions:

Please read the following instructions carefully before solving & submitting the assignment:

1. The assignment will not be accepted after due date.
2. Zero marks will be awarded if the assignment does not open or the file is corrupt.
3. The assignment file must be an MS Word (.doc/.docx) file format; Assignment will not be accepted in any other format.
4. Zero marks will be awarded if assignment is copied (from other student or copied from handouts or internet).
5. 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

Compute Lower Bound and Upper Bound of the following given function by directly finding constants n0, c1 and c2.

Hint:

Question # 2:                                                                         10 Marks

Write down the Recurrence Relation for binary search tree; solve it using iterative method and give answer at the end in asymptotic form.

Note: need to show all possible steps.

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?

See Your Saved Posts Timeline

Views: 3771

.

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

+ Click Here To Join (Our facebook study Group)

Attachments:

### Replies to This Discussion

CS502 Assignment#01 Solution

Attachments:

Question # 1:   10 Marks

Compute Lower Bound and Upper Bound of the following given function by directly finding constants n0, c1 and c2.

I think, this is the recurrence relation for Binary search, not Binary Search Tree

## Latest Activity

+++ Haniya+++ liked +++ Haniya+++'s discussion WO BACHPAN KA ZAMANA THA....
9 minutes ago
+++ Haniya+++ posted discussions
9 minutes ago
12 minutes ago
+++ Haniya+++ liked +++ Haniya+++'s discussion HAZRAT ALI R. A
20 minutes ago
+++ Haniya+++ liked +++ Haniya+++'s discussion chata ho bhool jaoo tumhy....
29 minutes ago
1 hour ago
+ ! ! ❥maho ++ posted a discussion

### Happy birthday "Student"

1 hour ago
2 hours ago
2 hours ago
2 hours ago
2 hours ago
+ ! ! ❥maho ++ liked Maham Raza.'s discussion Kabhi Aesa Bhi Hota Hai.
3 hours ago

## Today Top Members

1

2

3

### CUTE MUNDA

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

.