Linkedin Instagram Telegram Facebook

Placement Oriented Competitive Programming Program
( C++, Python, Database, OS, CN)

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.

Timing

Offline: 03:00 PM – 05:00 PM //
04:00 PM – 06:00 PM 
Online: 09:00 PM – 11:00 PM (IST)

Location

Physical (Jaipur)
or 
Online (Google Meet)

Duration

18 – 20 Weeks

Participants

50 per Batch

What People Tell About Us

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.

Shubham Katkar Ex-Student, Django Batch

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

Yaman Singh Ex-Student, CP Batch

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

Josh Well Ex-Student, BigData Batch

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

Salman Khan Ex-Student, Django Batch

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!!

Jack Ryan Ex-Student, CP Batch

What you will Learn

C++

Duration: 30 Hours

DSA

Duration: 60 Hours

Python

Duration: 30 Hours

Database

Duration: 10 - 15 Hours

Operating System

Duration: 10 - 15 Hours

Computer Networks

Duration: 10 - 15 Hours

Features

  • Learn C++ (Basics to Advance)
  • Learn Python (Basics to Advance)
  • Specialize in Data Structures & Algorithms
  • Learn Database (SQL Server, MySql)
  • Learn about Operating System 
  • Learn about Computer Networks
  • Learn about Problem Solving Approach
  • How to Crack Interview Questions in Product Based Companies
  • 250+ Interview Based Questions in Live Session (Last 5 Years)
  • Live Doubt Solving Sessions
  • Learn how to use Data Structures & Algorithms in Problem Solving
  • Learn from Instructors of IBM, AMAZON, DELL, FRACTAL ANALYTICS, Car Dekho with 10+ years of experience

Study Material

  • E-Notes
  • Assignments per day
  • Poll test per day
  • Weekly Tests
  • 180+ hours on demand Live Video Lectures
  • 1000+ Interview Based Questions for Practice 
  • Access of Lecture Recordings & Notes
  • Interview Questions of Product Based Companies

  • 24*7 Mentorship Support

Output

  • Good Programmer.
  • Able to think out of the box.
  • Expertise in different Domain like C++, Python, Data Structures & Algorithms, Problem Solving, Database, OS etc.
  • Able to solve many Interview Questions of Top MNCs
  • Create your own personal portfolio site to showcase your projects to potential employers
  • Get Prepare for Technical Interview Questions of Amazon, IBM, Paypal, Cisco Infosys, TCS, HCL, Dell, Wipro, HP, Honeywell, Intel, Capgemini and many more
  • Get Package of Software Developer Role in Product Based Companies.

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.

Placement Opportunities in Companies

You can get Internship/Training Opportunities to get placed in HP, DELL, Honeywell, Rightpoint, Frontdoor, Fractal and many more according to your performance

Package Offered So Far

Minimum Package

5 LPA

Average Package

8 – 10 LPA

Highest Package

32 LPA

Placement Process

  • 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 4th – 4.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.

Our Students Placed In

Previous
Next

Course Content

C++ with DSA

● 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

● Pointers
● Dynamic Allocation
● Recursion
● Time Complexity

● OOPS 
● Linked list 
● Stacks
● Queues

● STL
● 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
● Hashmaps

● Tries and Huffman Coding
● Dynamic programming
● Graphs
● 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

Python with DSA

  • Setting up the environment
  • Jupyter NoteBook
  • Know about Importance of Competitive Programming
  • Key to get a JOB in Product Based Company, Start preparing for it
  • Data structures and abstract data types
  • OOPs Concepts
  • What is an array data structure
  • Arrays related interview questions
  • Linked list data structure and its implementation
  • Stacks and queues
  • Related interview questions
  • Algorithmic Thinking, Peak Finding
  • Models of Computation, Python Cost Model, Document Distance
  • What are binary search trees
  • Practical applications of binary search trees
  • Problems with binary trees
  • Binary Search Trees
  • BST Sort
  • Balanced trees: AVL trees and red-black trees
  • AVL Trees, AVL Sort
  • Insertion Sort, Merge Sort
  • Heaps and Heap Sort
  • Counting Sort
  • Radix Sort
  • Lower Bounds for Sorting and Searching
  • Associative arrays and dictionaries
  • How to achieve O(1) constant running time with hashing
  • Ternary search trees as associative arrays
  • Hashing with Chaining
  • Simulation Algorithms
  • Table Doubling, DNA Sequence Matching
  • Integer Arithmetic
  • Karatsuba Multiplication
  • Square Roots
  • Newton’s Method
  • Shortest path algorithms
  • Dijkstra’s algorithm
  • Speeding up Dijkstra
  • Bellman-Ford algorithm
  • What are spanning trees
  • Kruskal Algorithm
  • Sorting algorithms
  • Bubble sort, selection sort and insertion sort
  • Quicksort and merge sort
  • Non-comparison based sorting algorithms
  • Counting sort and radix sort
  • Memoization, Subproblems, Guessing, Bottom-up; Fibonacci, Shortest Paths
  • Parent Pointers; Text Justification, Perfect-Information Blackjack
  • String Subproblems, Pseudo Polynomial Time.
  • Parenthesization, Edit Distance, Knapsack
  • Computational Complexity
  • Algorithms Research Topics
  • String Subproblems, Pseudo Polynomial Time.
  • Parenthesization, Edit Distance, Knapsack

Database

  • Introduction to DBMS
  • Types of Data models, levels of abstraction
  • Relational DBMS v/s non relational DBMS
  • Data Warehouse v/s data mining
  • Proprietary DBMS software v/s open source DBMS
  • ACID property
  • Introduction to SQL and structure of SQL
  • Types of keys and constraints 
  • Normalization, types of dependencies and anomalies
  • 1 NF, 2NF, 3NF and BCNF
  • Conversion from 1 NF to 2NF, 3NF and BCNF
  • DDL – Create, Drop Alter Queries
  • DML – Delete, Insert, Merge, Select, Insert Queries
  • DCL – Grant, Revoke Queries
  • TCL – Commit, Rollback, Savepoint
  • Data retrieval 
  • Table creation- at row level, at column level
  • Types of functions – single row and multiple row
  • Types of joins-inner, outer, self and theta
  • Pattern matching using like operator
  • Union, Intersection, Union all
  • Arithmetic, comparison, and logical operators using SQL
  • Order by clause
  • Group/Aggregate functions – SUM, AVG, MIN, MAX, COUNT, STDDEV
  • Group by clause – where v/s having
  • Group by clause with having
  • Nested Queries

Operating System

  • What are OS Component ?
  • File Management
  • Process Management
  • I/O Device Management
  • Network Management
  • Deadlock
  • Main Memory Management
  • Secondary Storage Management
  • Security Management
  • Other Important Activities

Computer Networks

  • OSI Model

  • TCP/IP Model

  • Network topologies and Ethernet

  • Internet Protocol v4 and v6

  • Media Access Control and Address Resolution Protocols

  • Access points, routers, modems

  • Firewalls, TCP ports, UDP ports

  • Routing protocols
For Frequent Course Updates and Information, Join our Telegram Group
Join Telegram
For Webinar Videos and Demo Session, Join our Youtube Channel
Join Youtube
Explore Our Industrial Internship/Training Programs
More Info & Register