Competitive Programming

The course describes fundamental concept of design and analysis of algorithms in order to calculate time and space computation, complexity, and compare design algorithm methods. It gives the students ability to choose, apply and create good algorithms to solve algorithmic problems.

Course Information

Course Code: COMP6226001
Academic Year: 2026/2027
Semester: Ganjil
Materials: 0 items

Full Description

Competitive Programming

Course Code: COMP6226001 Course Name: Competitive Programming

Course Description

This course describes the fundamental concepts of the design and analysis of algorithms in order to calculate time and space computation, complexity, and compare algorithm design methods. It gives students the ability to choose, apply, and create good algorithms to solve algorithmic problems.

Learning Outcomes

On successful completion of this course, students will be able to:

Code	Cognitive Level	Outcome
LO1	(C3) Application	Apply algorithm techniques and methods
LO2	(C4) Analysis	Calculate processing time and memory space of algorithms
LO3	(C5) Synthesis	Create good and correct algorithms for problem solving

Evaluation

Component	Type	Weight
Theory: Assignment	Theory	40%
Theory: Final Exam	Theory	30%
Theory: Mid Exam	Theory	30%
Total		100%

Textbook

Halim, S., Halim, F., & Effendy, S. (2020). Competitive Programming 4 – Book 1. North Carolina: Lulu.com.

Course Content

Introduction to Competitive Programming
Data Structures
Graph I
String Processing
Greedy Algorithm
Mathematics I
Review I
Dynamic Programming
Computational Geometry
String Processing (Advanced)
Mathematics II
Graph II
Review II

Summary

Attribute	Detail
Course Code	COMP6226001
Course Name	Competitive Programming
Core Focus	Algorithm design & analysis
Reference	Competitive Programming 4 – Book 1 (Halim et al., 2020)
Assessment Components	3 (Assignment, Mid Exam, Final Exam)
Total Topics	13

Back to Course Materials0 materials available