COMPETITIVE PROGRAMMING (2 Credits)
Learning Outcomes:
On successful completion of this course, student will be able to:
- Apply algorithm techniques and methods
- Calculate processing time and memory space of algorithms.
- Create good and correct algorithm for problem solving
Topics:
- Introduction to Competitive Programming
- Data Structures
- Graph I
- Mathematics I
- String Processing
- Dynamic Programming
- Review I
- Standard Template Library (STL)
- Graph II
- Mathematics II
- Greedy Algorithm
- Computational Geometry
- Review II
SOCIAL MEDIA
Let’s relentlessly connected and get caught up each other.
Looking for tweets ...