Course Overview:

This course is designed to take you from basic to advanced levels in competitive programming using C and C++. You will learn essential programming concepts, data structures, algorithms, and problem-solving techniques necessary to excel in coding contests and technical interviews.

Lecture No. 1: Introduction to Competitive Programming and C Programming Basics

• Title: Future of a Competitive Programmer, First C program
• Contents:
  • What is programming?
  • The future of a programmer
  • Basics of C programming:
    • Printing something using C
    • Keywords, identifiers, variables, constants
    • Data types, input/output, operators

Lecture No. 2: Problem Solving Basics

• Title: Problem Solving
• Contents:
  • Introduction to problem-solving techniques
  • Understanding algorithmic thinking

Lecture No. 3: Conditional Statements and Bitwise Operations

• Title: All about If-Else
• Contents:
  • If statement, if-else statement
  • Nested if-else
  • Ternary operator, macros
  • Bitwise operations

Lecture No. 4: Problem Solving

• Title: Problem Solving
• Contents:
  • Applying conditional statements to solve problems

Lecture No. 5: Looping Constructs and Switch Statement

• Title: All about Loops
• Contents:
  • While loop, do-while loop, for loop
  • Break, continue, goto statements
  • Switch statement

Lecture No. 6: Problem Solving

• Title: Problem Solving
• Contents:
  • Implementing loops to solve problems

Lecture No. 7: Functions, Arrays, and Multi-dimensional Arrays

• Title: All about Functions & Array
• Contents:
  • Built-in functions vs. user-defined functions
  • Types of functions
  • One-dimensional and multi-dimensional arrays

Lecture No. 8: Problem Solving

• Title: Problem Solving
• Contents:
  • Utilizing functions and arrays in problem-solving

Lecture No. 9: Strings and Number Conversion in C

• Title: All about C String and Number conversion
• Contents:
  • C strings and library functions
  • Decimal to binary, hexadecimal, and octal conversions

Lecture No. 10: Problem Solving

• Title: Problem Solving
• Contents:
  • Applying string manipulation and number conversion techniques

Lecture No. 11: Pointers, Structures, Unions, and File Handling

• Title: C Pointer, Structure, Union, and Files
• Contents:
  • Pointers in C
  • Structures and unions
  • File operations in C

Lecture No. 12: Searching Algorithms

• Title: Searching Algorithm
• Contents:
  • Complexity of algorithms
  • Linear search, binary search, ternary search

Lecture No. 13: Sorting Algorithms

• Title: Sorting Algorithm
• Contents:
  • Bubble sort, insertion sort, counting sort, quick sort

Lecture No. 14: C++ Introduction and Standard Template Library (STL)

• Title: C++ Introduction & C++ STL
• Contents:
  • Why C++ for competitive programming?
  • Introduction to C++ features
  • STL containers: pair, vector, string, stack, queue, dequeue

Lecture No. 15: Advanced STL and Data Structures

• Title: Advanced C++ STL
• Contents:
  • Priority queue, set, multiset, map, unordered_map
  • Custom sorting techniques
  • Overview of advanced data structures

Lecture No. 16: Graph Traversal Algorithms

• Title: Graph Traversal Algorithm
• Contents:
  • Depth First Search (DFS)
  • Breadth First Search (BFS)

Lecture No. 17: Advanced Binary Search and Recursion

• Title: Advanced Binary Search and Recursion
• Contents:
  • Solving problems using binary search
  • Bisection method
  • Recursive functions and their applications

Lecture No. 18: Dynamic Programming

• Title: Dynamic Programming (DP)
• Contents:
  • Understanding DP principles
  • Implementing DP solutions for optimization problems
  • Examples and practice exercises

Lecture No. 19: Advanced Topics in Competitive Programming

• Title: Advanced Topics in Competitive Programming
• Contents:
  • Advanced algorithms and techniques
  • Handling complex problems efficiently
  • Tips for competitive coding contests

Course Completion:

Upon completing this course, you will have a strong foundation in competitive programming using C and C++, enabling you to tackle complex problems efficiently and excel in programming competitions and technical interviews.