Competitive Programming 1

CSE-1230
SHAYHAN AMEEN CHOWDHURY
ASSISTANT PROFESSOR,
DEPT. OF CSE, IIUC
About Myself
Instructor name : Shayhan Ameen Chowdhury
E-mail : Shayhan.ameen@gmail.com
Phone : 01919998883 (only in emergency)

COMPETITIVE PROGRAMMING 1 2
Description
Course Title : Competitive Programming 1
Course Code: CSE-1230
Credit Hour: 1
Contact Hours: 2
Pre-requisite: Computer Programming I (CSE-1121)

COMPETITIVE PROGRAMMING 1 3
Administration
Class time : Monday (10:45 - 12:15)
Classroom : P-Lab2

COMPETITIVE PROGRAMMING 1 4
Expected Work
Lectures
Assignments [10%]
Solve problems (provided in each class)
Participation: [10% ]
Ask questions
Answer questions
Give me feedback: I’m learning too!
Midterm Exam [30%]
Final Exam [50%]
COMPETITIVE PROGRAMMING 1 5
Mission and Vision Of IIUC
Mission of The University
• Properly trained up manpower to contribute to socio-economic development, Moral upliftment of the
society, Ethical sensitivity

Vision of The University

• Centre of Excellence in different areas of scholarship, Highest seat of learning and creator of
knowledge in the South East Asia

Moot of The University

• “Combine Quality with Morality”

COMPETITIVE PROGRAMMING 1 6
Mission, Vision & PEO Of CSE
Mission: Offer the strong academic program needed to produce
well-educated CSE profession
Vision: Knowledge, skills, attitude, and ethical values necessary to
be successful and impart positive social impacts
Program Educational Objectives of CSE
• Within the first few years after graduation, CSE graduates should be employed by an organization that
serves the profession or enrolled in postgraduate studies.
• About five years beyond graduation, CSE graduates should be participating effectively in design
processes and developing CSE solutions within a team setting.
• At all stages, CSE graduates should exhibit their potential for a sustained productive career through life-
long learning.

COMPETITIVE PROGRAMMING 1 7
Course learning Objectives
Focus on the fundamentals
Practice fast coding
Prepare for technical interviews
Team work
Improve yourself

COMPETITIVE PROGRAMMING 1 8
Course learning Outcomes:
Structure deliberate practice routine
Challenging problems
Demonstrate your skills

COMPETITIVE PROGRAMMING 1 9
Key characteristics of the course
Problem solving
Time management
Allah grant me the serenity
Communication skill To accept the problems that I cannot solve
Never give-up The persistence to solve the problems that I can
And the wisdom to know the difference
Competition with yourself

COMPETITIVE PROGRAMMING 1 10
Course Synopsis
Section-A (Mid-term: 30 Marks)
1. Input and Output: Managing data input (scanf, getchar, gets etc),
Managing data output (printf, putchar, puts etc), formatted input
and output
2. Control Statements: Branching- If and if… else statements, nested
if, switch statement
3. Looping & Array: while, do…while and for looping statements,
Jumps in loops, goto statement, break and continue statement,
array, processing an array, passing arrays to functions,
Multidimensional
COMPETITIVE PROGRAMMING 1 11
Course Synopsis (Cont.)
Section-B (Final Exam: 50 Marks)
4. String: String, Array of Strings , String operations; Pattern
matching algorithms
5. Standard Library: implementation of different STL function
6. Computational Geometry : Computational Geometry, Line
Segment Properties, Convex Hull, Graham Scan Algorithm of Convex
Hull
7. Number Theory : Number Theory, GCD, Modular Arithmetic,
Prime Number generation, Complexity analysis of the algorithms

COMPETITIVE PROGRAMMING 1 12
Course Plan
SL Topic Learning Problem Set Outcome
Hours
1 INTRODUCTION
2 Basic knowledge 2
3 Input Methods 2 10055 [C]
4 Branching 2 11984[C], 11854[C], 12403[H], Implement branching
11715[H]
5 Iteration 2 382[C], 1078[C], 100[C], 10346[H] Understand the concept of
iteration
6 Nested Iteration 2 386 [C], 488 [H] Extend the existing
knowledge about iteration
7 One dimensional 2 561[C], 10038[C], 10050[H], 10450[H], Develop the concept of
Array array
8 Multi-dimensional 2 541[C], 11716[C], 11385[H], 441[H] Extend the existing
Array knowledge about array
9 Mid-term 3 problems (Time: 1:30 Hours)
COMPETITIVE PROGRAMMING 1 13
Course Plan
SL Topic Learning Problem Set Outcome
Hours
10 String 458[C], 272[C], 10062[C], 494[H],
11 C++ Standard library 2/ per Utilize STL to solve
- week problems
13
14 Geometry problem 2 Solve geometry problems
15 Number Theory 2 10127[C], 369[C], 389[H], 579[H] Solve problems related to
number theory
Final exam 5 problems (Time: 2:30 ~ 3:00 Hours)

COMPETITIVE PROGRAMMING 1 14
References
1. Competitive Programming, 3rd Edition by Steven Halim (Author)
2. Programming Challenges: The Programming Contest Training Manual (Texts in Computer
Science) by Steven S Skiena , Miguel A. Revilla
3. From Baylor to Baylor by William B. Poucher , Miguel A. Revilla

COMPETITIVE PROGRAMMING 1 15
 Thank you all

COMPETITIVE PROGRAMMING 1 16