Certification on Data Structures and Algorithms in C++
Master DSA in C++ with 8 weeks of hands-on coding in STL, trees, graphs, DP & greedy algorithms. Build strong problem-solving & interview-ready skills.
Instructor
Cognovera
Category
- Description
- Curriculum
- FAQ
- Notice
- Reviews
This 8-week certification program is designed for intermediate learners aiming to strengthen their knowledge of data structures and algorithms using C++. The course covers OOP concepts, STL (Standard Template Library), arrays, linked lists, stacks, queues, trees, graphs, hashing, recursion, sorting, searching, dynamic programming, and greedy algorithms. Students will gain hands-on coding experience and implement real-world projects, preparing them for competitive programming, technical interviews, and software engineering roles.
Week 1: C++ Fundamentals Refresher & Complexity Analysis
-
1
Day 1: C++ Basics- Structure of a C++ program
- Data types, operators, typecasting
- Input/output using cin, cout
-
2
Day 2: Control Structures
- If-else, switch
- Loops (for, while, do-while)
-
3
Day 3: Functions
- Function prototypes & overloading
- Inline functions
- Default arguments
-
4
Day 4: Pointers & References
- Pointers basics, pointer arithmetic
- References in C++
-
5
Day 5: Algorithm Analysis
- Big-O, Big-Ω, Big-Θ
- Space complexity
- Recurrence relations (intro)
Week 2: Object-Oriented Programming (OOP) in C++
-
6
Day 1: Classes & Objects
- Constructors, destructors
- Access specifiers
-
7
Day 2: Inheritance
- Single & multiple inheritance
- Virtual functions & overriding
-
8
Day 3: Polymorphism
- Function overloading & overriding
- Operator overloading
-
9
Day 4: Encapsulation & Abstraction
- Friend functions & classes
- Abstract classes & interfaces
-
10
Day 5: Templates in C++
- Function templates
- Class templates
Standard Template Library (STL) overview
Week 3: Searching & Sorting Algorithms
-
11
Day 1: Searching
- Linear & binary search (iterative & recursive)
-
12
Day 2: Basic Sorting
- Bubble sort, selection sort, insertion sort
-
13
Day 3: Efficient Sorting
- Merge sort
- Quick sort
-
14
Day 4: Advanced Sorting
- Heap sort
- Counting & radix sort
-
15
Day 5: Lab Practice
- Compare sorting algorithms using STL containers
Week 4: Stacks & Queues (Using Arrays, Pointers & STL)
-
16
Day 1: Stack Basics
- Array & linked list implementation
- Applications (expression conversion & evaluation)
-
17
Day 2: Queue Basics
- Simple & circular queues
- Implementation using arrays & linked lists
-
18
Day 3: Advanced Queues
- Deque (double-ended queue)
- Priority queues (STL: priority_queue)
-
19
Day 4: STL Stack & Queue
- Using stack, queue, and deque from STL
- Real-world examples
-
20
Day 5: Lab Practice
- Mini project: Expression evaluator using stacks
Week 5: Linked Lists
-
21
Day 1: Singly Linked List
- Creation, traversal, insertion, deletion
-
22
Day 2: Doubly Linked List
- Forward & backward traversal
- Insertion, deletion
-
23
Day 3: Circular Linked List
- Singly & doubly circular lists
- Applications
-
24
Day 4: Advanced Linked List Problems
- Reversing a linked list
- Detecting & removing cycles
-
25
Day 5: Lab Practice
- Implementing a mini project (e.g., playlist manager using linked lists)
Week 6: Trees
-
26
Day 1: Tree Basics
- Terminology, representation
- Binary trees
-
27
Day 2: Binary Tree Traversals
- Recursive & iterative inorder, preorder, postorder
-
28
Day 3: Binary Search Trees (BST)
- Insertion, deletion, searching
-
29
Day 4: Balanced Trees (Intro)
- AVL trees (rotations)
- STL set and map as balanced trees
-
30
Day 5: Lab Practice
- Implement expression trees & BST
Week 7: Graphs
-
31
Day 1: Graph Representation
- Adjacency matrix & adjacency list
- Directed vs. undirected graphs
-
32
Day 2: Graph Traversals
- BFS & DFS (recursive & iterative)
-
33
Day 3: Minimum Spanning Tree
- Kruskal’s & Prim’s algorithms
-
34
Day 4: Shortest Path Algorithms
- Dijkstra’s
- Bellman-Ford
-
35
Day 5: Lab Practice
- Implement BFS/DFS using STL
- Graph-based mini problems
Week 8: Advanced Topics & Capstone Project
-
36
Day 1: Hashing
- Hash tables
- Collision handling (chaining, open addressing)
-
37
Day 2: Dynamic Programming (DP)
- Fibonacci, knapsack, longest common subsequence
-
38
Day 3: Greedy Algorithms
- Activity selection
- Huffman coding (intro)
-
39
Day 4: Capstone Project Development
- Project options: Social network graph, Railway reservation system, File indexing using hashing
-
40
Day 5: Project Presentation & Certification Test
- Final project demo & viva
- Coding + written assessment
- Certification awarding
Q1. Do I need advanced C++ knowledge before enrolling?
No. You only need a basic understanding of C++ fundamentals; all advanced concepts will be taught step by step.
Q2. Will this course help in competitive programming (Codeforces, LeetCode, etc.)?
Yes, the course includes STL-based problem solving, graph algorithms, and dynamic programming, which are essential for competitive programming.
Q3. What kind of project will I work on?
You will develop a capstone project (e.g., Social Network Graph, File Indexing System, or Railway Reservation System) that integrates multiple data structures and algorithms.
Q4. Is this certification useful for job placements?
Absolutely. Most technical interviews focus heavily on DSA, and this course prepares you for coding rounds, whiteboard interviews, and problem-solving tests.
Q5. Do I get a certificate after completing the course?
Yes. Upon successful completion of the capstone project and certification exam, you will receive an industry-recognized certification.
Skills You Will Learn in This Course
- Mastering time & space complexity analysis
- Implementing searching & sorting algorithms (binary search, quick sort, merge sort, heap sort)
- Solving problems using recursion, backtracking, divide & conquer
- Designing and applying stacks, queues, linked lists, hash tables
- Implementing trees (binary trees, BSTs, AVL) and graph algorithms (BFS, DFS, MST, shortest paths)
- Applying STL containers (vector, list, map, set, priority_queue)
- Using dynamic programming & greedy algorithms for optimization problems
- Building & presenting a capstone project with real-world DSA applications
Please, login to leave a review
Course details
Lectures
40
Level
Intermediate
Basic info
- Program Name: Certification on Data Structures and Algorithms in C++
- Duration: 8 Weeks (5 days per week)
- Level: Intermediate
- Mode: Classroom / Online (Instructor-led)
- Final Assessment: Capstone Project + Certification Exam
- Outcome: Certification in Data Structures & Algorithms with C++ expertise
Course requirements
- Basic knowledge of C++ programming (syntax, loops, functions, OOP basics)
- Familiarity with compiling and running C++ programs
- Laptop/PC with GCC compiler or IDE (Code::Blocks, Dev-C++, or VS Code)
- Strong problem-solving interest and logical reasoning skills
Intended audience
- Computer Science & IT students looking to strengthen DSA foundations
- Developers with basic C++ knowledge seeking advanced algorithmic skills
- Students preparing for coding interviews & competitive programming
- Professionals aiming to improve their problem-solving & STL knowledge
- Anyone targeting roles like Software Engineer, Backend Developer, or Competitive Programmer
Popular courses
