Course module
Unit 4 | Algorithms — Bihar STET 2026 Paper II Computer Science
- Lessons
- 159
- Duration
- 25 hr 33 min
- PYQs
- 17
- Practice
- 730
6% of this course's PYQ weight is covered in this module.
Syllabus index
Lessons in this module
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
- Basics of Time ComplexityDrm 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
Comparisons & Searching
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
Previous-year questions
PYQ collectionPYQ Questions2 questionsPYQ collectionPYQ Questions2 questionsPYQ collectionPYQ Questions4 questionsPYQ collectionPYQ Questions1 questionsPYQ collectionPYQ Questions4 questionsPYQ collectionPYQ Questions5 questionsPYQ collectionPYQ Questions1 questionsPYQ collectionPYQ Questions1 questionsPYQ collectionPYQ Questions1 questionsPYQ collectionPYQ Questions3 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 Questions17 questions
Explore the course
- Unit 1 | Digital Electronics
- Unit 2 | COA
- Unit 3 | C Programming
- Unit 3 | Data Structures
- Unit 5 | Operating System
- Unit 6 | Database Management System
- Unit 7 | Computer Networks
- Unit 8 | Software Engineering
- Unit 9 | Object Oriented Programming
- Unit 10 | Web Development
- Unit 11 | Theory Of Computation
- Unit 12 | IoT
- Unit 13 | Artificial Intelligence
- Unit 14 | E-Commerce
Loading lesson…