Course module

Algorithms (Basic) — INFYTQ Superset

Explore the module outline and lessons below. Enroll free to begin studying here.

Lessons: 178
Duration: 30 hr 19 min
PYQs: 0
Practice: 95

Syllabus index

Lessons in this module

178 linked lessons

Explore the course

Lessons in this module

Algorithm Analysis

Algo Basics & Analysis

Asymptotic Notations

Growth Rate Comparisons

Sorting Algorithms

Introduction to Sorting

Selection Sort

Bubble Sort

Insertion Sort

Merge Sort

Heap 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

Floyd & Subset Sum

Minimum Spanning Trees

MST & Kruskal's Algo

MST & Prim's Algo

Shortest Path Algos

Dijkstra’s Algorithm

Bellman-Ford Algo

Advanced Algorithms

Backtracking Technique

Branch and Bound

String Matching Algorithms – Pattern Searching and Text Processing Techniques

Approximation Algorithms

Randomized Algorithms

Algebraic Computation

Time Complexity Analysis

Iterative Loops & Code

Substitution Method

Recursion Tree Method

Master Theorem

Explore the course