Competitive Problem-Solving using C & C++ with DSA
Level-1: Duration – 60 Hrs
Level-2: Duration – 60 Hrs
Modules
Level 1: Problem-solving with DSA using C program for competitive Programming
- Loops
- Functions
- Arrays
- Strings
- Pointers
- Solving Problems asked in HackerRank, Codecheff and other Competitive Platforms
- Data Structures
- STL Algorithms
- STL Container Classes
Program Objectives
By the end of this course, participants will:
- Understand Data Structures
- Develop Advanced Programming Skills
- Strengthen Object-Oriented Programming Concepts
- Master STL
- Efficiently Use STL Containers
- Acquire the skills and confidence to solve problems from platforms like CodeChef, HackerRank, and GeeksforGeeks.
Experiential Project Based Learning
Tools / Platform:
- Any C++ Compiler which supports C++14 and above
- Code Blocks / VS Code Preferred
| Level 1 – Problem Solving with DSA using C Programming for Competitive Programming (60 Hours) | ||
|---|---|---|
| Core Concepts & Fundamentals | ||
| Introduction to Problem Solving | Operators and Expressions | Decision Control Structures |
| Looping Constructs | Modular Programming using Functions | Scope and Lifetime |
| Coupling: Loose and Tight | ||
| Arrays, Strings & Memory Management | ||
| Arrays and 2D Arrays – Matrices | Macros | Strings and String Manipulation Functions |
| Pointers and Pointer Arithmetic | Dynamic Memory Allocation (malloc, calloc, realloc, free) | |
| Competitive Problem Solving using C – Sample Program List | ||
| Viral Advertising | Utopian Tree | Printing Patterns |
| Kaprekar Number | Birthday Cake Candles | Migratory Birds |
| Array Rotation | Pangram | String Anagram |
| String Palindrome Index | Encryption: Caesar Cipher | Game of Thrones |
| Level 2 – Problem Solving with DSA using C++ for Competitive Programming (60 Hours) | ||
| Object-Oriented Foundations & Data Structures | ||
| Data Structure Concepts | Encapsulation and Abstraction | Linear Data Structure Implementation |
| Implementation using Stack (Arrays and Classes) | Implementation using Queue (Arrays and Classes) | Linked List – Singly and Doubly Linked List |
| Non-Linear Data Structures & STL | ||
| Trees and Graphs | Function Templates | STL Algorithms |
| Function Pointers and Callback Methods | Lambda Expressions | STL Container Classes and Iterators |
| std::vector, std::list, std::deque | set, multiset, map, multimap | unordered_set, unordered_map |
| Competitive Problem Solving using C++ – Sample Program List | ||
| Parenthesis Matching using Stack | Jesse and Cookies using Heap | Tree Problems |
| Super Reduced String using Stack | Frequency Counting using Map | Implement Editor Undo Option using Stack |
| Program Outcomes | ||
| Build confidence in solving complex algorithmic problems. | Prepare candidates to crack top MNC interviews through competitive programming expertise. | |
