Employment Enhancement
Program – Cracking the
Code Mastering Interview Success
Level-1: Duration – 60 Hrs
Level-2: Duration – 60 Hrs
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.
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
Level 2: Problem-solving with DSA using C ++ for competitive programming
- Data Structures
- STL Algorithms
- STL Container Classes
Tools / Platform:
- Any C++ Compiler which supports C++14 and above
- Code Blocks / VS Code Preferred
| Level 1: Problem Solving with DSA using C program for Competitive Programming (60 Hours) | ||
|---|---|---|
| Introduction to Problem Solving | Operators and Expressions | Decision Control Structures |
| Looping Constructs | Modular Programming using Functions | Scope and Lifetime |
| Coupling: Loose and Tight | Arrays | 2D Arrays – Matrices |
| Macros | Strings | String Manipulation Functions |
| Pointers | Pointer Arithmetic and Arrays | Dynamic Memory Allocation |
| 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) | ||
| Data Structure | Encapsulation and Abstraction | Linear Data Structure |
| Implementation using Stacks using Arrays and Class | Implementation using Queue using Arrays and Class | Linked List |
| Singly Linked List | Doubly Linked List | Non-Linear Data Structures |
| Trees | Graphs | Function Templates |
| STL Algorithms | Function Pointer | Callback Methods |
| Lambda | STL Container Classes | Iterators |
| std::vector, std::list, std::dequeue | Set, multiset, Map, multimap (Tree Based Data Structures) | Unordered Set and Map (Hash Based Data Structures) |
| Competitive Problem-Solving using C++: Sample Program List | ||
| Parenthesis Matching using Stack | Jesse and Cookies using Heap Tree | Super Reduced String using Stack |
| Frequency Counting using Map | Implement Editor Undo option using Stack | |
| Program Outcomes | ||
| • Making Candidates to grow in confidence in solving Complex Problems | ||
| • Candidates should be able to crack top MNC companies Interviews | ||
