(Batches Start from April, May & June 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, 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.
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: 40 Hours
Duration: 10 - 15 Hours
Duration: 10 - 15 Hours
Duration: 10 - 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.
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
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
Fee can be paid in 2 Installments of 6k & 5k
WhatsApp us