Algorithm and Data Structures
(Competitive Programming)
About The Program:
With the belief to build a healthy ecosystem as per the Industry Standards REGex Software brings a Winter Training/Internship Program on “Competitive Programming”. We organize Winter Training/Internship Program for improving the knowledge and skills of the Students/Professionals, so that they can become expert in the field of Competitive Programming and get their Dream Job in Software Development Field in Big MNCs.
REGex Software Services’s Competitive Programming course is a valuable resource for beginners and experts. This course will introduce you to C++, Data Structures and Interview Based Questions of Product Based Companies from Basics to Advance. If you are preparing for a coding interview, REGex introduce this course for you.
Batch 1
Batch 2
Batch 3
What People Tell About Us
What you will Learn
- C++ (Basics to Advance)
- Data Structures & Algorithms
- Problem Solving Approach
- How to Crack Interview Questions in Product Based Companies
- Learn how to use Data Structures & Algorithms in Problem Solving
Study Material
- E-Notes
- Assignments per day
- Poll test per day
- Weekly Tests
- 60+ hours on demand Live Video Lectures
- Offline Access of Lecture Videos & Notes
24*7 Mentorship Support
- Working on Live Projects
Output
- Good Programmer.
- Able to think out of the box.
- Expertise in different Domain like C++, Data Structures & Algorithms, Problem Solving
- Able to solve many Interview Questions of Top MNCs
- Create your own personal portfolio site to showcase your projects to potential employers
- Package of Software Developer in Big MNCs starts from 10LPA
Live Sessions
Live Sessions by Expertise Trainers and Access of Recorded Session is also available
Live Projects
Get a chance to work on Industry Oriented Projects to implement your learning
24*7 Support
24*7 Mentorship Support available for all Students to clear all of your doubts
Opportunities
REGex provides Internship / Job opportunities to the best Students in different Companies.
Our Students Placed In
Course Content
S. No. | Topic |
|---|---|
1 | Section 1 |
● Flow charts ● Getting started ● Operators, Conditions and Loops ● Functions, Variables and their scope | |
2 | Section 2
|
● Patterns 1 & Patterns 2 ● Arrays, Searching and Sorting ● Strings and 2D Arrays | |
3 | Section 3
|
● Pointers ● Dynamic Allocation ● Recursion ● Time Complexity | |
Mock Test 1 | |
4 | Section 4 |
● OOPS 1 & OOPS 2 ● Linked list -1 & Linked list-2 ● Stacks and Queues | |
5 | Section 5 |
● STL ● Sorting algorithms ● Bubble sort, Selection sort and Insertion sort ● Quicksort and Merge sort ● Non-comparison based sorting algorithms ● Counting sort and Radix sort | |
Mock Test 2 |
S. No. | Topic |
|---|---|
6 | Section 6 |
● what are spanning trees ● Kruskal algorithm ● Trees & Problems with binary trees ● Binary Search Trees, BST Sort ● Balanced trees: AVL trees and red-black trees ● AVL Trees, AVL Sort ● Hashmaps | |
7 | Secton 7 |
● Tries and Huffman Coding ● Dynamic programming ● Graphs ● Programs based on it | |
Mock Test 3 | |
8 | Section 8 |
● Shortest path algorithms ● Dijkstra’s algorithm, Speeding up Dijkstra ● Bellman-Ford algorithm | |
9 | Section 9 |
● Memoization, Subproblems, Guessing, Bottom-up; Fibonacci ● Parent Pointers; Text Justification, Perfect-Information Blackjack ● String Subproblems, Pseudo Polynomial Time ● Parenthesization, Edit Distance, Knapsack | |
10 | Section 10 |
● Computational Complexity ● Algorithms Research Topics | |
Mock Test 4 |