Algorithm analysis and asymptotic notation. Advanced data structures analysis. Design and analysis of: divide-and-conquer algorithms, dynamic programming, greedy algorithms, and amortized analysis; multithreaded algorithms, linear programming, number-theoretic algorithms, computational geometry and approximation algorithms.
Network layers, Internet protocol stack, network architectures, and network security concepts. Network programming interfaces, including sockets.
Write a concise and interesting paragraph here that explains what this course is about
Write a concise and interesting paragraph here that explains what this course is about
Write a concise and interesting paragraph here that explains what this course is about