(Batches Start from 17th June & 4th July 2022)
About The Program:
With the belief to build a healthy ecosystem as per the Industry Standards REGex Software brings Placement Oriented Program on “Competitive Programming”. We organize Placement Oriented 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 program will introduce you to Data Structures, C++, Python, Database, Operating System and Interview Based Questions of Product Based Companies from Basics to Advance. If you are preparing for a coding interview, REGex introduce this program for you.
Best affordable Python + Django program with live classes and doubt solving. You can also access to recordings of the classes. Teachers and mentor are very good. All syllabus covered in given time. With multiple live examples. Best part of training is friendly environment. Don't hesitate to enroll if you've never heard the name of this company before. You will not be disappointed.
Competitive Programming is the best course they have - i am part of both python and C++ course. Cracked several interviews with their course, poll test & assignment are always new and beneficial. Best CP course you will find here, i hope this will be beneficial for you
Tushar sir is best in delivery. His approach is mind blowing. I have not found any gap although I am from U.S Lots of Big Data tools I have learnt like Hadoop, Hive, Spark, Sqoop & most amazingly Talend ETL Tools which was the most lovely part of training. every component is told in very simple terms with great practical approach
I recently joined Python Django(Web Development - Full Stack)Course About Course: - I must say instructor makes every concept simple to understand - No Copy Paste,Every line of code is explained - Even given Assignments to work on - Even given Projects to work on If you looking to learn Python Django I highly recommend to go for this course
I am from UK & loved the teaching. Competitive Programming was the best experience I had in coding. I can truly say the money I spend is worth it. Go for it guys!!
Duration: 30 Hours
Duration: 60 Hours
Duration: 30 Hours
Duration: 15 Hours
Duration: 15 Hours
24*7 Mentorship Support
Live Sessions by Expertise Trainers and Access of Recorded Session is also available
Get a chance to work on Industry Oriented Projects to implement your learning
24*7 Mentorship Support available for all Students to clear all of your doubts
REGex provides Internship / Job opportunities to the best Students in different Companies.
You can get Internship/Training Opportunities to get placed in HP, DELL, Honeywell, Rightpoint, Frontdoor, Fractal and many more according to your performance
We’ll train you from first week and TEAM will analyze your performance according to your Assignments & tests.
You will be tested by different type of tests and assessments.
After Completion of 3th – 3.5th month, TEAM will guide you about resume making and Team will take your resumes and analyze it accordingly.
After this process you will get direct calls and in house placement calls directly or for the further process of exam after looking minimum Qualification of particular company.
You will get Opportunities back to back from REGex End via a mail according to your performance.
● Flow charts
● Getting started
● Operators, Conditions and Loops
● Functions, Variables and their scope
● Patterns 1 & Patterns 2
● Arrays, Searching and Sorting
● Strings and 2D Arrays
● Dynamic Allocation
● Time Complexity
● Linked list
● Sorting algorithms
● Bubble sort, Selection sort and Insertion sort
● Quicksort and Merge sort
● Non-comparison based sorting algorithms
● Counting sort and Radix sort
● 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
● Tries and Huffman Coding
● Dynamic programming
● Programs based on it
● Shortest path algorithms
● Dijkstra’s algorithm, Speeding up Dijkstra
● Bellman-Ford algorithm
● Memoization, Subproblems, Guessing, Bottom-up; Fibonacci
● Parent Pointers; Text Justification, Perfect-Information Blackjack
● String Subproblems, Pseudo Polynomial Time
● Parenthesization, Edit Distance, Knapsack
● Computational Complexity
● Algorithms Research Topics