



Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Community
Ask the community for help and clear up your study doubts
Discover the best universities in your country according to Docsity users
Free resources
Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors
Material Type: Exam; Class: Analysis Of Algorithms; Subject: Computer Science; University: Northeastern Illinois University; Term: Fall 2003;
Typology: Exams
1 / 6
This page cannot be seen from the preview
Don't miss anything!
CS 404-31 - Analysis of Algorithms Final Exam December 3, 2003
15 26 39 41 44 50 55 60
(a) Develop a recurrence equation for the number of rounds in the tournament (b) How many rounds are there in the tournament when there are 256 teams? (c) Solve the recurrence equation of part (a).
(a) Mergesort (b) Quicksort
252 176 315 121 343 276 122 305
(a) Prim’s Algorithm (b) Kruskal’s Algorithm
3
V
V4 V
V
V
2
3
6 5
4
1
w 1 = 2 w 2 = 10 w 3 = 13 w 4 = 17 w 5 = 22 w 6 = 42