About The Program:
With the belief to build a healthy ecosystem as per the Industry Standards REGEX Software brings a Skill Development Program (SDP) on “Data Structures with Python”. We organize Skill Development Program for improving the knowledge and skills of the Students/Professionals, so that they can become expert in Data Structure 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 course will introduce you to data structures and algorithms in Python(from Beginner to Advance). If you are preparing for a coding interview, REGex introduce this course for you.
What you will learn:
Study Material:
24*7 Mentorship Support
S. No. | Topic |
---|---|
1 | Section 1 |
-> 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 | |
2 | Section 2 |
-> What is an array data structure -> Arrays related interview questions -> Linked list data structure and its implementation -> Stacks and queues -> Related interview questions | |
3 | Section 3 |
-> Algorithmic Thinking, Peak Finding -> Models of Computation, Python Cost Model, Document Distance -> What are binary search trees -> Practical applications of binary search trees | |
4 | Section 4 |
-> Problems with binary trees -> Binary Search Trees -> BST Sort -> Balanced trees: AVL trees and red-black trees -> AVL Trees, AVL Sort | |
5 | Section 5 |
-> Insertion Sort, Merge Sort -> Heaps and Heap Sort -> Counting Sort -> Radix Sort -> Lower Bounds for Sorting and Searching | |
6 | Section 6 |
-> 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 | |
S. No. | Topic |
---|---|
7 | Section 7 |
-> Numerics a) Integer Arithmetic b) Karatsuba Multiplication c) Square Roots d) Newton’s Method | |
8 | Section 8 |
-> Shortest path algorithms -> Dijkstra’s algorithm -> Speeding up Dijkstra -> Bellman-Ford algorithm | |
9 | Section 9 |
-> What are spanning trees -> Kruskal algorithm | |
10 | Section 10 |
-> Sorting algorithms -> Bubble sort, selection sort and insertion sort -> Quicksort and merge sort -> Non-comparison based sorting algorithms -> Counting sort and radix sort | |
11 | Section 11 |
-> Memoization, Subproblems, Guessing, Bottom-up; Fibonacci, Shortest Paths -> Parent Pointers; Text Justification, Perfect-Information Blackjack -> String Subproblems, Pseudo Polynomial Time. -> Parenthesization, Edit Distance, Knapsack | |
12 | Section 12 |
-> Computational Complexity -> Algorithms Research Topics -> String Subproblems, Pseudo Polynomial Time. -> Parenthesization, Edit Distance, Knapsack |
Benefits of attending this Program :
Output:
Highest Package: 31 Lakh CTC
Average Package: 8.4 Lakh CTC
Note: More than 70% Students have got package more than 8 LPA
Indian Fee: ₹1999/- (Flat 75% off) => ₹499/-
International Fee: 60 USD (Flat 75% off) => 15 USD
For detailed Competitive Programming course curriculum press following pdf button
WhatsApp us