CS502 assignment 1 Solution 2016
#1

 
 
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 n^2 + 5n+ 7 = Big Theta of n^2 and also calculate values C1, C2 and n0 by definition of Big theta. 
 
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


Attached Files
.pdf cs502 assignment solved by rubaisha.pdf Size: 190.7 KB  Downloads: 447
Reply


Possibly Related Threads…
Thread / Author Replies Views Last Post
Last Post by reewmella
09-18-2021, 11:22 PM
Last Post by bontainia
09-18-2021, 04:19 PM
Last Post by Plaquenil
09-17-2021, 03:22 PM
Last Post by Stromectol
09-11-2021, 04:22 PM



Users browsing this thread: 1 Guest(s)