THE COMPETITIVE PROGRAMMING
SYLLABUS
Advisors
Professor Dr. Md. Ashikur Rahman Khan
Chairman, Department of ICE
Zayed-Us-Salehin
Assistant Professor, Department of ICE
Tanvir Zaman Khan
Assistant Professor, Department of ICE
Md. Sabbir Ejaz
Lecturer, Department of ICE
Level-0 Syllabus
Round 0
General Information
Prerequisite
• Positive Mindset
• Don't give up mentality
Target Audience
• Batch 9 and Batch 10
• Batch 7 and Batch 8 is also welcomed!
Expectations and Goals
• Getting into the arena of Competitive Programming.
• Clear Ideology about Problem Solving.
• Improve the power Critical Thinking.
• How to overcome Frustration.
Course Materials
Will be Uploaded into the corresponding Google Classroom.
Assessment (Total 1000 points)
• Attendance: 100 points (12.5 points per Attendance)
• Assignment: 100 points (12.5 points per Assignment)
• Problem Solving: 100 points
• OJ Contest: 200 points
• Solo Contest: 200 points
• Team Contest: 300 points
Pass Rating: 600 Points
Contest Plan
Contest Subject
Contest 01 Solo Contest
Contest 02 Team Contest
Page 1
Outline
Session Title Topics
Session 1 Competitive Programming: • Why not CP?
The Art of Thinking Clearly • How to read a problem
statement?
• How to attack a
Problem?
• Thinking vs Coding
• WA is life!
• What’s after AC?
Session 2 Five jewels of programming • Data Holders
• If-else
• The Loop
• Array
• Function
Session 3 The linear data structure • Array
• String (Character Array)
• Implementing Queue
• Implementing Stack
Session 4 Basic Mathematics • How to kill big numbers
• Arithmetic & Geometric
Progression
• SSC level Probability
• Basic Geometry
• Basic Trigonometry
• Playing with bits
Session 5 OJ's and Code sharing sites • Codeforces
• CodeChef
• AtCoder
• UVA
Session 6 Basic Number Theory • Divisor
• Prime Numbers
• Sieve
• GCD & LCM
Session 7 Basic Number Theory • Factorization
• Number of Divisor
• Sum of Divisor
• Weapons for Number
Theory
Session 8 Back Tracking & Searching Technique • Recursion (Factorial)
• Linear Search
• Binary Search
• Upper Bound & Lower
Bound
• Bisection Method
Page 2
Level-1 Syllabus
Round 0
General Information
Prerequisite
• Positive Mindset
• Don't give up mentality
• Basic C or C++
• Basic knowledge of Level 0
Target Audience
• Batch 7, Batch 8 and Batch 9
Expectations and Goals
• Getting comfortable in Competitive Programming.
• Improve Online Judge’s Rating
• Realize CP is as like a Game
Course Materials
Will be Uploaded into the corresponding Google Classroom.
Assessment (Total 1000 points)
• Attendance: 100 points (12.5 points per Attendance)
• Assignment: 100 points (12.5 points per Assignment)
• Problem Solving: 100 points
• OJ Contest: 200 points
• Solo Contest: 200 points
• Team Contest: 300 points
Pass Rating: 600 Points
Contest Plan
Contest Subject
Contest 01 Solo Contest
Contest 02 Team Contest
Page 3
Outline
Session Title Topics
Session 1 Can you make it on time? • Time Complexity
• Space Complexity
• Brute force to
optimization
Session 2 The power of STL • Dynamic Array
• Set Structures
• Map Structures
• Iterators and Ranges
• Bit Set
• Stack
• Queue
• Priority Queue
• Policy-based data
structures
Session 3 Number Theory • Divisor
• Prime & Sieve
• Factorization
• Number of Divisor
• Sum of Divisor
Session 4 Number Theory • Basic and Extended
Euclidean algorithms
• GCD & LCM
• Modular Arithmetic
• Weapons for Number
Theory
Session 5 Mathematics • How to kill big numbers
• Playing with Bits
• Probability
• Basic Combinatorics
• Greedy in Math
Session 6 Complete Search • Binary Search
• Upper Bound Lower
Bound
• Bisection Method
• Ternary Search
• Generating Subsets
• Generating Permutation
Session 7 Linear Data Structures • String
• Stack
• Queue
• Linked List
• Prefix Sum
• Two Pointer
Page 4
Session Title Topics
Session 8 Non-linear Data Structures • Basics of Graphs
• Tree
• Segment Tree
• Binary Index Tree
Page 5
Level-2 Syllabus
Round 0
General Information
Prerequisite
• Positive Mindset
• Don't give up mentality
• Those who are familiar with CP
Target Audience
• Batch 7, Batch 8
Expectations and Goals
• Be the Ninja in Competitive Programming
• Become Specialist in Codeforces
• Do well in Onsite Contest
Course Materials
Will be Uploaded into the corresponding Google Classroom.
Assessment (Total 1000 points)
• Attendance: 100 points (12.5 points per Attendance)
• Assignment: 100 points (12.5 points per Assignment)
• Problem Solving: 100 points
• OJ Contest: 200 points
• Solo Contest: 200 points
• Team Contest: 300 points
Pass Rating: 600 Points
Outline
Session Title Topics
Session 1 Number Theory • Euler Phi
• Inverse Phi
• Segmented Sieve
• Gaussian Elimination
Page 6
Session Title Topics
Session 2 String Theory • String Terminology
• Trie Structure
• String Hashing
• KMP
Session 3 Life Hacks • How to Balance Social
Relationship
• How to apply Critical
Thinking in real life
problem
• How to tackle Anxiety
• Rating is not the
ultimate goal!
Session 4 Graph Theory • DFS
• BFS
• Shortest Path Algorithms
• Minimal Spanning Tree
Session 5 Dynamic Programming • Knapsack
• Coin
• LIS
• DP on Grid
Session 6 Combinatorics • Binomial Coefficients
• Inclusion Exclusion
• PigeonHole Principle
• Stars & bars
Session 7 Game Theory • 1 Game State
• Nim game
• Sprague Grundy
Theorem
Session 8 Geometry • 1 Complex number
• Points and lines
• Polygon
Contest Plan
Contest Subject
Contest 01 Solo Contest
Contest 02 Team Contest
Page 7
