Dev Skill - Competitive Programming

Competitive Programming - Beginner

Beginner

Tk. 5,000

Registration will resume when new batch is announced

Solving a problem is meaningless if you can't convert it to a workable code in a contest that covers all the edge cases. Solving a problem, writing its code in an efficient language is a must for a problem solver. And currently, the fastest known coding language for a competitive programmer is undoubtedly C++. We will go through each C++ concepts needed for a competitive programmer in order to ace in contests and problem solving.

Who Can Join This Course?

Good logic sense. Familiarity with at least one programming language will even boost your learning, but it is not mandatory.

Course Outline

Basic Computer Fundamentals

● Components of computer.
● How CPU, Memory / RAM works and why do we need them.
● Number System, thinking in terms of number system, example of using it in
problem solving.

First Program in C++

● IDE vs Compiler.
● Compiling, Running and Understanding First Program.
● Coding styles and header files.
● Variables and C++ I/O.

Data Types and Operators

● Understanding Data Types and Constants.
● Working with Arithmetic Expressions.
● Relational, Logical and Conditional operators.
● Bitwise operators and their tricky applications.

Making Decisions

● The if and if-else Statement.
● Nested if and if-else Statement.
● The switch Statement
● Boolean Variables

Loops

● Loops - While and For
● Loops - Do-while
● Break, Continue, Goto and Labels

Arrays

● Defining and Initializing Arrays.
● Operations: Find, Insert, Erase, Copy, Reverse, etc.
● Subarray, Subsequence.
● Multidimensional Arrays and Variable-Length Arrays.

Strings

● Arrays of Characters.
● Variable-Length Character Strings.
● The Null String, Escape Character.
● String in C++.
● Palindrome, Anagram.

Working with Function

● Defining a function.
● Arguments and Local Variable.
● Returning function results.
● Global, Automatic and Static Variables.
● Call by Pointers, Call by Reference.

OJ's and Code sharing sites

● IDE vs Compiler.
● Introduction to various OJ i.e. CF, UVA, Codechef, vjudge etc.
● Introduction to code sharing sites.

Complexity Analysis

● Time/Memory Complexity, examples.
● Recaping previous topics in terms of complexity.

Sorting

● Insertion and selection sort
● Counting sort
● Using in problem solving
● STL Sort

Binary search

● Insight of binary search and binary property.
● Binary search on arrays.
● Binary search on math problems.
● Bisection in geometry problems.
● Complexity Analysis.

Structures and Classes

● Using structure.
● Operator Overloading.
● Arrays of Structures.
● Sorting of structures.
● Structures Containing Array.
● Basic Object Oriented Programming.

Recursion

● Insight, recursive equation
● Binary search with recursion

Number Theory

● GCD, LCM, Divisibility.
● Primality check and generation.
● Sieve of Eratosthenes.
● Basic Modular Arithmetic.
● Combinatorics from HSC.

A glimpse of the next course

● Data Structures: Vector, Stack, Queue etc.
● Algorithms: Fast sorting.

Technical Assignment

● A final technical assignment from the whole syllabus to assess the overall
learning of a student.

Instructors

Sharif Minhazul Islam

I am a competitive programmer with 7+ years of experience in participating in many national & international contests. I love teaching, problem solving and learning new tech. CF Handle: MinhazIbnMizan.

LinkedIn Profile