Competitive Programming with Java
( Java, DSA, 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, Java, 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.

Weekly Duration

20 Hours Per week


Physical (Jaipur)
Online (Google Meet)


45 or 75 Days


30 per Batch

What People Tell About Us

What you will Learn

Core Java

Duration: 30 Hours


Duration: 40 Hours


Duration: 10 - 15 Hours

Operating System

Duration: 10 - 15 Hours

Computer Networks

Duration: 10 - 15 Hours


  • 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


  • 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


REGex provides Internship / Job opportunities to the best Students in different Companies.

Our Students Placed // Partnership


Placed Students

Course Content

Java with DSA

o Introduction to Java o Features of Java o Evolution in Java o Developing software in Java
o Installation and Setting up Eclipseo Introduction to Eclipse IDE o Creating and Managing Java Projects o Use of Java docs o Miscellaneous Options
o Keywords o Primitive Data Types o Operators and Assignments o Variables and Literals o Flow Control: Java’s Control Statements o Best Practices
o Classes and Objects o Packages o Access Specifiers o Constructors – Default and Parameterized o this reference o using static keyword o Best Practices
o The Object Class o Wrapper Classes o Type casting o Using Scanner Class o String Handling o Date and Time API o Best Practices
o Identifiers & JavaBeans o Legal Identifiers o Sun’s Java Code Conventions o JavaBeans Standards o Declare Classes o Source File Declaration Rules o Class Declarations and Modifiers o Concrete Subclass o Declaring an Interface o Declaring Interface Constants o Declare Class Members o Access Modifiers o Nonaccess Member Modifiers o Constructor Declarations o Variable Declarations o Declaring Enums
o Encapsulation o Inheritance, Is-A, Has-A o Polymorphism o Overridden Methods o Overloaded Methods o Reference Variable Casting o Implementing an Interface o Legal Return Types o Return Type Declarations o Returning a Value o Constructors and Instantiation o Default Constructor o Overloaded Constructors o Statics o Static Variables and Methods o Coupling and Cohesion
o Stack and Heap—Quick Review o Literals, Assignments, and Variables o Literal Values for All Primitive Types o Assignment Operators o Casting Primitives o Using a Variable or Array Element That Is Uninitialized and Unassigned o Local (Stack, Automatic) Primitives and Objects o Passing Variables into Methods o Passing Object Reference Variables o Does Java Use Pass-By-Value Semantics? o Passing Primitive Variables o Array Declaration, Construction, and Initialization o Declaring an Array o Constructing an Array o Initializing an Array o Initialization Blocks o Using Wrapper Classes and Boxing o An Overview of the Wrapper Classes o Creating Wrapper Objects o Using Wrapper Conversion Utilities o Autoboxing o Overloading o Garbage Collection o Overview of Memory Management and Garbage Collection o Overview of Java’s Garbage Collector o Writing Code That Explicitly Makes Objects Eligible for Garbage Collection
o Java Operators o Assignment Operators o Relational Operators o instanceof Comparison o Arithmetic Operators o Conditional Operator o Logical Operators
o if and switch Statements o if-else Branching o switch Statements o Loops and Iterators o Using while Loops o Using do Loops o Using for Loops o Using break and continue o Unlabeled Statements o Labeled Statements o Handling Exceptions o Catching an Exception Using try and catch o Using finally o Propagating Uncaught Exceptions o Defining Exceptions o Exception Hierarchy o Handling an Entire Class Hierarchy of Exceptions o Exception Matching o Exception Declaration and the Public Interface o Rethrowing the Same Exception o Common Exceptions and Errors
  • ● 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


  • 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 (Physical)

Price: ₹59,999/- (Flat 75% off) => ₹14,999/-  
(Limited Period Summer Special Offer)

Indian Fee (Online)

Price: ₹59,999/- (Flat 75% off) => ₹14,999/-  
₹9,999/- => ₹6,000/- 
(Limited Period Summer Special Offer)

International Fee

Price: $1200 (Flat 75% off) => $300
(Limited Period Summer Special Offer)

Fee can be paid in 2 Installments of 6k & 5k for Physical Students.

Cashback Policy

  • You will get your Unique Referral Code after successful paid registration.
  • You will get upto ₹1000 Cashback directly in your account for each paid registration from your Unique Referral Code on monthly basis.
  • For Example:- If we received 10 paid registration from your Unique Referral Code then you will receive upto ₹1000*10 = ₹10,000.

Get In Touch With Us

If you’re interested in our Training Services, please contact us today to schedule a consultation.