Know Your Meme
University of Engineering and Technology Vietnam National University Hanoi Design and Analysis of Algorithms Final Exam - 20/12/2019 Duration: 90 minutes (closed-book) Instructions: 1. PLEASE READ THE QUESTIONS CAREFULLY AND ANSWER QUESTION IN CONSECUTIVE ORDER IF POSSIBLE. 2. THE QUESTION PAPER CONSISTS OF 7 QUESTIONS ON 2 PAGES. 3. ANSWER ALL QUESTIONS ON THE QUESTION PAPER. 4. CRYING IS ALLOWED BUT PLEASE DO SO QUIETLY. 5. DO NOT WIPE TEARS ON EXAM PAPER. 6. GOOD LUCK. THE QUESTIONS Question 1. [2.0 marks] Determine TRUE or FALSE for each of following statements. Explain i 1. A greedy algorithm could produce an optimal solution. 2. If T(n) = 9T(n/3) +n then T(n) E 0(n²). an+1 c 0(an)

+1

Examination paper of my university, for Design and Analysis of Algorithms | /r/mildlyinteresting


Uploaded by Reddit Moments Dec 20, 2019 at 06:12AM EST

Share Pin Download More

Origin Entry: Mildly Interesting

File type: jpg

Resolution: (1080px x 1440px)

File size: 116 KB


Donald's KNT 96190 KNT 96189
BOLE Paper comes o SHAND sere.
View All 13,916 Images


Moar:

Kym

Know Your Meme

  Like Page   1.8M likes