Techniques for analyzing the time and space requirements of algorithms, amortized analysis, randomization, fundamental design strategies: divide-and-conquer, dynamic programming, and greedy methods, introduction to the intractable (NP-hard) problems.
- Teacher: abeer Saeed Tariq Saad
- Teacher: Eman Karim Khalid Ramy