Fundamentals of Algorithms (CS502)
Assignment # 01
Total marks = 20
Deadline = 29/11/2018
Lectures Covered: This assignment covers Lecture # 1 to 11.
Objectives of this assignment are:
Please read the following instructions carefully before solving & submitting the assignment:
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.
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.
+ 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)
CS502 Assignment#01 Solution
I think, this is the recurrence relation for Binary search, not Binary Search Tree