Master Data Structures & Algorithms in C++ with Groot Software’s 45-Day Internship Program
This 45-day internship is a comprehensive training and practice program designed to help students master core data structures and algorithms using C++. Ideal for B.Tech, BCA, and MCA students, the program enhances problem-solving skills, prepares them for technical interviews, and includes a hands-on real-world project hosted on GitHub.
Program Overview
-
Title: Mastering DSA in C++ – 45-Day Internship
-
Duration: 45 Days (6 Weeks)
-
Mode: Online (Self-paced with optional mentor support)
-
Daily Time Requirement: 2–3 hours
-
Outcome: Strong command over DSA, certified completion, GitHub project, interview-ready confidence
-
Fee: ₹5,000 (₹500 registration, ₹4,500 remaining)
Curriculum Breakdown
Week 1: C++ Refresher + DSA Introduction
-
Time and Space Complexity
-
1D and 2D Arrays
-
String Manipulation
-
STL Essentials: Vectors, Pairs
-
Recursion Basics
-
Practice Problems on Arrays, Strings, and Recursion
Week 2: Searching, Sorting, and Recursion Deep Dive
-
Linear and Binary Search
-
Bubble, Selection, Insertion Sort
-
Merge Sort, Quick Sort
-
Backtracking and Recursion-Based Problems
-
Subsets, Permutations, Combinations
Week 3: Linked Lists, Stack, and Queue
-
Singly, Doubly, and Circular Linked Lists
-
Stack and Queue Using Arrays and Linked Lists
-
Deque and Priority Queue
-
Practice Problems and Building a Library in C++
Week 4: Trees and Binary Search Trees (BST)
-
Binary Tree Traversals: Inorder, Preorder, Postorder
-
BST Operations: Insertion, Deletion
-
Balanced Trees (AVL Introduction)
-
Min Heap and Max Heap
-
Practice Problems on Tree and BST
Week 5: Graphs, Dynamic Programming, and Patterns
-
Graph Representation Using Matrix and List
-
Breadth First Search (BFS) and Depth First Search (DFS)
-
Shortest Path Algorithms: Dijkstra, Floyd-Warshall
-
Topological Sort and Cycle Detection
-
Introduction to Dynamic Programming
-
DP Problems: 0/1 Knapsack, Longest Increasing Subsequence (LIS), Longest Common Subsequence (LCS)
Week 6: Final Project + Career Preparation
-
Internship Project Development
-
Resume and LinkedIn Optimization
-
Mock Coding Interviews (2 Rounds)
-
Final Submission and Certification
Final Project Options
-
GitHub-like Repository Management System using Linked Lists and Trees
-
Text Editor with Undo/Redo Functionality using Stack and Queue
-
Social Graph Friend Suggestion System using Graph BFS
-
Pathfinding Visualizer using DFS, BFS, and Dijkstra’s Algorithm
Deliverables
-
Daily Coding Logs (Problem Links + Code Snippets)
-
Final Project Hosted on GitHub
-
Evaluation Sheet with Progress Checkpoints
-
Internship Completion Certificate
-
Official Offer Letter
-
Letter of Recommendation from Mentor and CTO
-
Resume Building and LinkedIn Optimization Support
Prerequisites
-
Basic knowledge of C++ syntax
-
Understanding of loops, conditionals, and functions
-
Familiarity with arrays and strings
-
Basic knowledge of OOP concepts (optional but beneficial)
Registration and Payment
-
Registration Fee: ₹500 (Seat Booking)
-
Remaining Fee: ₹4,500 (Payable before or during the internship)
-
Total Fee: ₹5,000
UPI ID for Payment: groot.software@ybl
Forms
-
Registration: https://forms.gle/qcV62DSFFuUPsS5D7
-
Intern Onboarding: https://forms.gle/RaYtk8Fun2TdKitt6
Contact Information
-
Phone: +91-9610967825
-
Email: info@grootsoftware.com
-
Website: www.grootsoftware.com
Get industry-ready with structured DSA training, practical projects, GitHub contributions, and expert mentorship – all in just 45 days.