AADS Grade
On Jan 24, I took my oral exam for the course Advanced Algorithms and Data Structures.
I picked the topic of “NP-completeness” to do the presentation randomly, and the questioning part was asked to analyze the expectation of the number of comparisons for the RandomizedQuickSort(S) Algorithm.
Even though I have been asked a lot during both periods, I replied to all the questions correctly. Finally, I got 12 in this course.
Process of Practices:
Max-flow
Video 1. Practice Recording for Max-flow
Figure 1. Handwritten Notes for Max-flow
Approximation
Video 2. Practice Recording for Approximation
Hashing
Video 3. Practice Recording for Hashing
van-Emde-Boas Tree
Video 4. Practice Recording for van-Emde-Boas Tree
NPc
Video 5. Practice Recording for NPc
Triangulation Geometry
Video 6. Practice Recording for Triangulation Geometry
Linear Programming
Video 7. Practice Recording for Linear Programming
Exact-Exponential
Video 8. Practice Recording for Exact-Exponential
Randomized Algorithms
Video 9. Practice Recording for Randomized Algorithms
Exam Notes
Figure 2. Handwritten Notes for Exam
This blog is to memorize the hard work I have done in this course.
Enjoy Reading This Article?
Here are some more articles you might like to read next: