Decode DSA with C++ by PW Skills Hindi
- 50%
₹2,750.00
|
The “Decode DSA with C++” course is designed by PW Skills. This course has been designed to help you become proficient in Data Structures and Algorithms (DSA) in C++ language to get prepare for your placements. After completing this course, you will thoroughly understand the basics of programming, coding, DSA and most importantly Problem-Solving which will further enhance your career as a developer/programmer. This course will be taught in the Hinglish medium.
You will get: C++ with DSA Certification In-Depth Coverage of Concepts Class Notes Materials Assignments in every module Quizzes in every module Video Solutions 500+ Questions Classes in Hybrid mode Weekly LIVE Doubt Sessions Career Guidance Comprehensive Lectures with proper Dry Run Self Paced learning Resume Building 150+ hours classes 2 Year Dashboard access Doubt clearing through mail Discord Community 80% Scheduled Classes & 20% Live Classes PWLabs Access Experience Portal Access
Decode DSA with C++ Course overview:-
“Decode DSA with C++” course is designed by PW Skills. This course has been designed to help you become proficient in Data Structures and Algorithms (DSA) in C++ language to get prepare for your placements. After completing this course, you will thoroughly understand the basics of programming, coding, DSA and most importantly Problem-Solving which will further enhance your career as a developer/programmer. course will be taught in the Hinglish medium.
Key Outcomes of this Course:-
-
- C++
- Analysis of Algorithms
- Searching
- Recursion
- Advanced Sorting
- Object Oriented Programming
- Linked List
- Stack
- Queue
- Binary Search Trees
- Priority Queues
- Hashmaps and Sets
- Backtracking
- Ad-hoc and Greedy
- Dynamic Programming and Bit Manipulation
- Graphs
This Course is Designed For:-
-
- Students
Requirements
- Requirements
- System With Minimum I3 Processor Or Better
- At Least 4 Gb Of Ram
- 6 Months Of Dedication
What do you get
Here is the list of what you can get with this course!
| No. | Duration | |
|---|---|---|
| Videos | – | 150+ Hour |
| Quiz | – | In every Module |
| Reading Material | – | After every module |
| Live Sessions | – | 20% of the course |
| “Decode DSA with C++“ Course by PW Skills is Explained in Hindi | ||
Course Content
Introduction to C++
- Introduction to C++ as programming language
- Installation of VS Code and making it ready to get started
- Number Systems
- Basic Printing
- Variables and Data types
- Arithmetic Operations
- Importance of inclusion of header file
- Compilation Process
- Taking input from the user
- Other operators
- Operator Precedence
- Data Typecasting
Fundamentals of Programming - 1
- If, Else if and else
- Combining multiple conditions
- Ternary and switch statement
- Problems on conditions
- For, while and do-while loops
- Problems on loops
Fundamentals of Programming - 2
- Break and continue
- Problems on loops using operators
- Pattern Printing Basic Problems
- Pattern Printing Advanced Problems
Diving more into C++ Programming
- Need and importance of functions
- Function declaration and definition
- Global and local variables
- What is int main()
- Various inbuilt functions
- Incorrect swap function
- What is a variable in terms of memory?
- Address of a variable
- Introduction to Pointers
- Pointer Arithmetic
- Pass by reference and pass by value
- Functions and pointers (Correct swap function)
- Double pointers
Milestone 1 :- Fundamentals of C++ Programming
- Milestone 1 Test
One Dimensional Arrays
- Array declaration
- Array elements accessing and modification
- Linear Search
- Arrays as argument to functions
- Arrays and pointers
- Problems on Arrays
- Dynamic Allocation
- Implementation of Dynamic Array class
- Introduction to C++ STL and Vectors
- Problems on one dimensional arrays
Two Dimensional Arrays
- Two dimensional Array declaration
- 2D array elements accessing and modification
- Problems on 2D arrays
- Problems on 2D arrays
- Matrix Multiplication
- Problems on 2D arrays
Strings
- Character Arrays
- C++ STL string class
- Problems on Strings
Milestone 2 Headstart to Data Structures: Arrays and Strings
- Milestone 2 Test
Analysis of Algorithms
- Why asymptotic analysis
- Time Complexity
- Space Complexity
- Problems to calculate time complexity
Basic Sorting Algorithms
- Bubble Sort
- Time and space complexity
- Selection Sort
- Insertion Sort
- Problems on Basic Sorting
Searching
- Analysis of linear search
- Binary Search
- Implementation of C++ lower_bound
- Search Space of Binary Search
- Problems on Binary Search
Recursion
- Recursion
- Principle of Mathematical Induction
- Problems on Recursion 1
- Calculating time complexity of Recursive codes
- Greatest Common Divisor
- Problems on Recursion 2
- Efficient Power function
- Problems on Recursion 3
- Problems on Recursion 4
Advanced Sorting
- Merge Sort
- Time and space complexity analysis of divide and conquer
- Inversion Count
- Problems on Merge sort
- Quick Sort
- Randomised Quick Sort
- Inbuilt sort functions
- Custom Comparators
- Cyclic Sort
- Problems on Cyclic Sort
Diving into Mathematics
- Sieve of Eratosthenes
- Questions on Prefix Sum
- Sliding Window
- Basic bitwise operations: AND, OR, NOT, XOR
- Basic problems on XOR operator
- Modulo Operation
- Basic Modulo Properties
- Some basic problems using Modulo Arithmetic
Milestone 3 Basic Algorithms
- Milestone 3 Test
Object Oriented Programming
- Importance of OOPS paradigm
- Class declaration and definition
- Data members and methods
- Creating objects
- Constructors
- Destructors
- Friend Function
- Operator Overloading
- Pillars of OOPS
Linked List
- Implementation of Linked List class
- Two pointers (or multiple pointers) approach
- Problems on Linked List
- Problems on Linked List
- Implementation of Doubly Linked List
- Other kinds of Linked List (Just introduction and uses
Stack
- Inbuilt stack class
- Problems on stack 1
- Problems on Stack 2
- Problems on Stack 3
- Implementation of Stacks
Queue
- Inbuilt queue class
- Problems on Queues 1
- Problems on Queues 2
Milestone 4 Linear Data Structures
- Milestone 4 Test
Introduction to Trees and Binary Trees
- Linear vs Non-linear data structures
- Implementation of Binary Trees
- Tree traversals
- Height and diameter of binary tree
- Some Mathematical observations and formulas for binary trees
- Problems on Binary Trees
- Introduction to Trees
- Implementation of Tree class (Input and printing)
Binary Search Trees
- Use of Binary Search Tree
- Implementation of BST (including searching)
- Deletion of Nodes in BST
- Problems on BST
- Time complexity analysis and need for balanced BSTs
- Implementation of AVL Trees
Priority Queues
- Introduction to Complete Binary Trees
- Introduction to Priority Queues
- Inbuilt Priority Queue
- Implementation of Heap Data Structure
- Heap Sort
- Problems on Priority Queue
Hashmaps and Sets
- Need of hashmaps
- Introduction to hashmaps
- Use of inbuilt hashmaps
- Problems on hashmaps
- Problems on hashmaps
- Hash functions
- Collision Handling
- Implementation of Hashmaps
- Load Factor
- Use of inbuilt sets
- Problems on Sets
Milestone 5 Non Linear Data Structures
- Milestone 5 Test
Ad-hoc and Greedy
- Various problems requiring simple observations
- Problems using Greedy Approach
Backtracking
- Backtracking
- Problems of Backtracking 1
- Problems of Backtracking 2
Dynamic Programming and Bit Manipulation
- Dynamic Programming
- Bottom Up Thinking
- Top Down Approach
- Problems on Dynamic Programming
- Problems on Dynamic Programming
- Setting and unsetting of bits
- Problems on Bit Manipulation and Dynamic Programming
Milestone 6 Backtracking and Dynamic Programming
- Milestone 6 Test
Graphs
- Importance of understanding graphs
- Graph Terminology
- Various implementations
- Breadth-First Search
- Depth First Search
- Weighted Graphs
- Directed Graphs
- Bellman Ford Algorithm
- Floyd Warshall Algorithm
- Dijkstra’s Algorithm
- Minimum Spanning Trees
- Prim’s Algorithm
- Union Set implementation
- Problems on Union Set
- Kruskal's Algorithm
- Topological Sort and implementation
- Problems on Graph
- Strongly Connected Components
- Kosaraju’s Algorithm
Tries
- Implementation of Tries
- Huffman Encoding Algorithm
- Problems on Tries (Maximum XOR and related questions)
Milestone 7 Graphs and Miscellaneous
- Milestone 7 Test
Instructor of This Course
- Mr. Raghav Garg (Upcoming Software Developer in a leading FinTech company. Having 2.5+ years of teaching experience and helping students to get the best possible results. Solved more than 300+ questions in online coding platforms. )
- Mr. Sanket Singh (Currently working with Google Pay | Ex – Software Engineer at LinkedIn |Former Google Summer Of Code Developer for Harvard University | 5 years of teaching experience)
About PW Skills
PW Skills offers High Quality industry ready courses at affordable price range. PW Skills courses are officered in Hindi & English with relevant project to implement knowledge. PW Skills aims to empower professionals and students alike to either jumpstart their careers or leverage existing skills with new, future-driven upgrades..
More Courses From PW Skills
. User Reviews
Be the first to review “Decode DSA with C++ by PW Skills Hindi”
You must be logged in to post a review.
There are no reviews yet.