Course module
Paper 2 | Unit 7 | Data Structures and Algorithms — MP SET Computer Science (Paper 1 + Paper 2)
Explore the module outline and lessons below. Enroll free to begin studying here.
Return to /learn/MP-SET-COMPUTER-SCIENCE/unit-7-data-structures-and-algorithms after enrolling
- Lessons
- 398
- Duration
- 50 hr
- PYQs
- 9
- Practice
- 635
Syllabus index
Lessons in this module
Introduction to DS
DS Basics & Types
- DS Basics & TypesPdf
- Why we study data structure and algorithmDrm Video
- What is data structureDrm Video
- Effects of Data StructureDrm Video
- Primitive Vs Non-Primitive Data StructureDrm Video
- Linear Vs Non-Linear Data StructureDrm Video
- Demo: Why we study data structure and algorithmStandard Video
- Demo: What is data structureStandard Video
Array
Array Basics & Ops
1D & 2D Addressing
3D & Multi-dim Arrays
Stack
Stack Basics & Ops
Infix Postfix Prefix
Eval of Expressions
Recursion & Stack
- Recursion & StackPdf
- Introduction to RecursionDrm Video
- Recursion Practice QuestionDrm Video
- FunctionsDrm Video
- Recursive FunctionsDrm Video
- recursive functionsDrm Video
- Stack Practice questionsDrm Video
- Stack Practice questionsDrm Video
- Stack recursion Practice questionsDrm Video
- Stack recursion Practice questionDrm Video
- Stack recursion Practice questionsDrm Video
- Recursion Practice questionsDrm Video
- Stack Practice questionsDrm Video
- Stack Practice questionsDrm Video
Queue
Basics & Stack Mix
Circular Queue
Priority Queues & Variants
Linked List
SLL Basics & Standard Operations
- SLL Basics & Standard OperationsPdf
- Introduction To Link ListDrm Video
- Analysis Of Link ListDrm Video
- Link List Traversal Using LoopDrm Video
- Link List Traversal Using RecusrionDrm Video
- Searching An Element In Link List Using LoopDrm Video
- Searching An Element In LL Using RecursionDrm Video
- Insertion in Link ListDrm Video
- Deletion From Link ListDrm Video
Structure Modification & Pointer Logic
Tree
Binary Tree Basics & Props
Traversals & Construction
- Traversal & ConstructionPdf
- Preorder Treversal of Binary TreeDrm Video
- Inorder Traversal Of Binary TreeDrm Video
- Post Order Traversal Of Binary TreeDrm Video
- Tree traversal Practice QuestionDrm Video
- Tree traversal Practice QuestionDrm Video
- Tree traversal Practice QuestionDrm Video
- Tree Practice QuestionDrm Video
- Tree Traversal Pseudocode (Pre-order)Drm Video
- Tree traversal Pseudocode (Inorder)Drm Video
- Tree Traversal Pseudocode (Post-Order )Drm Video
- Tree Traversal Pseudocode PQDrm Video
- Tree Traversal Pseudocode PQDrm Video
BST Basics & Operations
AVL Trees & Balancing
Complete Binary Trees
Advanced & k-ary Trees
- Advanced & k-ary Trees - NotesPdf
- Threaded Binary TreeDrm Video
- K-ary TreeDrm Video
- K-ary Tree Practice Question 1Drm Video
- K-ary Tree Practice Question 2Drm Video
- K-ary Tree Practice Question 3Drm Video
- K-ary Tree Practice Question 4Drm Video
- K-ary Tree Practice Question 6Drm Video
- K-ary Tree Practice Question 7Drm Video
- K-ary Tree Practice Question 8Drm Video
- Practice QuestionDrm Video
Heaps & Priority Queues
Advanced Heap
Graphs
Graph Reps & Basics
DFS & Applications
BFS & Applications
Hashing
Hashing Basics & Functions
Open Addressing (Probing)
Chaining & Perf Analysis
Algorithm Analysis
Algo Basics & Analysis
Asymptotic Notations
Growth Rate Comparisons
- Growth Rate Comparisons NotesPdf
- Practice Question 1Drm Video
- Practice Question 2Drm Video
- Log Basic PropertiesDrm Video
- Demo: Types of FunctionsStandard Video
- Decreasing FunctionsDrm Video
- Constant FunctionsDrm Video
- Logarithmic FunctionsDrm Video
- Ignore Logarithm BasesDrm Video
- Polynomial FunctionsDrm Video
- Exponential FunctionsDrm Video
- Logarithm Method - Asymptotic ComparisonDrm Video
- Practice QuestionsDrm Video
Time Complexity Analysis
Iterative Loops & Code
- Iterative Loops & Code NotesPdf
- Demo: Basics of Time ComplexityStandard Video
- Space ComplexityDrm Video
- Loops Time Complexity - 1Drm Video
- Loops Time Complexity - 2Drm Video
- Loops Time Complexity - 3Drm Video
- Loops Time Complexity - 4Drm Video
- Loops Time Complexity - 5Drm Video
- Loops Time Complexity - 6Drm Video
- Loops Time Complexity - 7Drm Video
- Loops Time Complexity - 8Drm Video
- Loops Time Complexity - 9Drm Video
- Loops Time Complexity - 10Drm Video
Advance Iterative Loops & Code
Substitution Method
- Substitution Method - NotesPdf
- AP and GP SeriesDrm Video
- Recurrence Relation - 1Drm Video
- Recurrence Relation - 2Drm Video
- Recurrence Relation - 3Drm Video
- Recurrence Relation - 4Drm Video
- Recurrence Relation - 5Drm Video
- Recurrence Relation - 6Drm Video
- Recurrence Relation - 7Drm Video
- Recurrence Relation - 8Drm Video
- Recurrence Relation - 9Drm Video
- Recurrence Relation - 10Drm Video
- Recurrence Relation - 11Drm Video
- Recurrence Relation - 12Drm Video
- Recurrence Relation - 13Drm Video
- Recurrence Relation - 14Drm Video
Recursion Tree Method
Master Theorem
Sorting Algorithms
Introduction to Sorting
Bubble Sort
Insertion Sort
Merge Sort
Quick Sort
Radix & Counting Sort
Comparisons & Searching
Greedy Algorithms
Greedy Basics & Huffman
Optimal Merge Pattern
Fractional Knapsack
Job & Activity Selection
Dynamic Programming
Introduction to DP
LCS & Subsequences
Matrix Chain Order
Minimum Spanning Trees
Shortest Path Algos
Dijkstra’s Algorithm
Bellman-Ford Algo
- Bellman-Ford Algo NotesPdf
- Bellman- Ford Algorithm Part-1Drm Video
- Bellman- Ford Algorithm Part-2Drm Video
- Dijakstra and bellaman ford algorithimDrm Video
- DIjakstra algorithim and bellaman ford Practice questionsDrm Video
- single source shortest path practice questionDrm Video
- Practice QuestionDrm Video
- Greedy alogrithimsDrm Video
Advanced Algorithms
Backtracking Technique
Branch and Bound
String Matching Algorithms – Pattern Searching and Text Processing Techniques
Theory of NP-Completeness
Approximation Algorithms
Randomized Algorithms
Module lessons
Previous-year questions
PYQ collectionPYQ Questions1 questionsPYQ collectionPYQ Questions1 questionsPYQ collectionPYQ Questions1 questionsPYQ collectionPYQ Questions1 questionsPYQ collectionPYQ Questions1 questionsPYQ collectionPYQ Questions1 questionsPYQ collectionPYQ Questions1 questionsPYQ collectionPYQ Questions1 questionsPYQ collectionPYQ Questions2 questionsPYQ collectionPYQ Questions1 questionsPYQ collectionPYQ Questions1 questionsPYQ collectionPYQ Questions1 questionsPYQ collectionPYQ Questions1 questionsPYQ collectionPYQ Questions1 questionsPYQ collectionPYQ Questions1 questionsPYQ collectionPYQ Questions1 questionsPYQ collectionPYQ Questions1 questionsPYQ collectionPYQ Questions9 questions
Explore the course
Previous modulePaper 2 | Unit 6 | Software EngineeringNext modulePaper 2 | Unit 8 | Theory of Computation and Compilers
- Paper - 1 | Unit - 1 | Teaching Aptitude
- Paper - 1 | Unit - 2 | Research Aptitude
- Paper - 1 | Unit - 3 | Comprehension
- Paper - 1 | Unit - 4 | Communication
- Paper - 1 | Unit - 5 | Mathematical Reasoning and Aptitude
- Paper - 1 | Unit - 6 | Logical Reasoning
- Paper - 1 | Unit - 7 | Data Interpretation
- Paper - 1 | Unit - 8 | Information and Communication Technology
- Paper - 1 | Unit - 9 | People Development and Environment
- Paper - 1 | Unit - 10 | Higher Education System
- Paper 2 | Unit 1 | Discrete Structures and Optimization
- Paper 2 | Unit 2 | Computer System Architecture
- Paper 2 | Unit 3 | Programming Languages and Computer Graphics
- Paper 2 | Unit 4 | Database Management Systems
- Paper 2 | Unit 5 | System Software and Operating System
- Paper 2 | Unit 6 | Software Engineering
- Paper 2 | Unit 8 | Theory of Computation and Compilers
- Paper 2 | Unit 9 | Data Communication and Computer Networks
- Paper 2 | Unit 10 | Artificial Intelligence
- Full Notes
- Paper 1 | Full Mock Tests
- Paper 2 | Full Mock Tests
- Paper 1 | Previous Year Papers
- Paper 2 | Previous Year Papers