Competitive Programming with Python
( Python, DSA, Database, OS, CN)

(Batches Start from 17th , 24th  & 31st March 2023)

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: 01:00 PM – 03:00 PM //
04:00 PM – 06:00 PM
Online: 09:00 PM – 11:00 PM (IST)

Location

Physical (Jaipur)
or 
Online (Google Meet)

Duration

10 – 12 Weeks

Participants

30 per Batch

What People Tell About Us

What you will Learn

Python

Duration: 30 Hours

DSA

Duration: 40 Hours

Database

Duration: 10 - 15 Hours

Operating System

Duration: 10 - 15 Hours

Computer Networks

Duration: 10 - 15 Hours

Features

  • 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
  • 150+ 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
  • 100+ hours on demand Live Video Lectures
  • 500+ 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 Python, Data Structures & Algorithms, Problem Solving, Database, OS, CN 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.

Our Students Placed \\ Partnership

Previous
Next

Course Content

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

Fee Structure

Indian Fee

Price: ₹39,999/- (Flat 75% off) => ₹9,999/- 

International Fee

Price: $800 (Flat 75% off) => $200 

Fee can be paid in 2 Installments of 6k & 5k

Cashback Policy

  • You will get your Unique Referral Code after successful paid registration.
  • You will get ₹1000 Cashback directly in your account for each paid registration from your Unique Referral Code on 30th March, 2023(After Closing Registrations of this program) .
  • For Example:- If we received 10 paid registration from your Unique Referral Code then you will receive ₹1000*10 = ₹10,000 on 30th March, 2023.
For Frequent Course Updates and Information, Join our Telegram Group
For Webinar Videos and Demo Session, Join our Youtube Channel
Explore Other Internship/Training Program – March 2023

Enroll Now

(Batches Start from 17th , 24th & 31st March 2023)

*It will help us to reach more
*Seats can be filled or Price can be increased at any time. Refund policy is not available*