Syllabify LogoSyllabify
HomeBrowse ExamsDownload App
Syllabify LogoSyllabify
HomeBrowse Exams
Download App
Theme
Syllabify LogoSyllabify
HomeBrowse ExamsDownload App
Syllabify LogoSyllabify
HomeBrowse Exams
Download App
Theme
Syllabify LogoSyllabify

Your companion for professional and national entrance exam preparation. Detailed syllabus, tracking, and more.

Top Exams

  • IIT JEE
  • NEET
  • UPSC Civil Services
  • SSC CGL
  • GATE

Legal & Support

  • Privacy Policy
  • Terms & Conditions
  • Contact Us

Get the App

GET IT ONGoogle Play
© 2026 Syllabify. All rights reserved.
Made with by Unitech Studio
Syllabify LogoSyllabify
HomeBrowse ExamsDownload App
Syllabify LogoSyllabify
HomeBrowse Exams
Download App
Theme
Syllabify LogoSyllabify
HomeBrowse ExamsDownload App
Syllabify LogoSyllabify
HomeBrowse Exams
Download App
Theme
  2. Exams
  3. Campus Placement
  4. Computer Science Fundamentals
  5. Algorithms
hard15 marks

Algorithms

Comprehensive modules for Algorithms relevant to campus recruitment.

77 Topics
45h prep
15% subject weight
77 Topics
1

Asymptotic Analysis

Mastering Asymptotic Analysis for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for Asymptotic Analysis.
2

Worst Average and Best

Mastering Worst Average and Best for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for Worst Average and Best.
3

AsymptoticNotations

Mastering AsymptoticNotations for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for AsymptoticNotations.
4

Little o and little omega notations

Mastering Little o and little omega notations for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for Little o and little omega notations.
5

Lower and Upper Bound Theory

Mastering Lower and Upper Bound Theory for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for Lower and Upper Bound Theory.
6

Analysis of Loops

Mastering Analysis of Loops for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for Analysis of Loops.
7

Solving Recurrences

Mastering Solving Recurrences for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for Solving Recurrences.
8

Linear Search

Mastering Linear Search for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for Linear Search.
9

Binary Search

Mastering Binary Search for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for Binary Search.
10

Jump Search

Mastering Jump Search for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for Jump Search.
11

Interpolation Search

Mastering Interpolation Search for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for Interpolation Search.
12

Exponential Search

Mastering Exponential Search for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for Exponential Search.
13

Ternary Search

Mastering Ternary Search for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for Ternary Search.
14

Selection Sort

Mastering Selection Sort for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for Selection Sort.
15

Bubble Sort

Mastering Bubble Sort for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for Bubble Sort.
16

Insertion Sort

Mastering Insertion Sort for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for Insertion Sort.
17

Merge Sort

Mastering Merge Sort for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for Merge Sort.
18

Heap Sort

Mastering Heap Sort for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for Heap Sort.
19

QuickSort

Mastering QuickSort for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for QuickSort.
20

Radix Sort

Mastering Radix Sort for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for Radix Sort.
21

Counting Sort

Mastering Counting Sort for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for Counting Sort.
22

Bucket Sort

Mastering Bucket Sort for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for Bucket Sort.
23

ShellSort

Mastering ShellSort for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for ShellSort.
24

Comb Sort

Mastering Comb Sort for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for Comb Sort.
25

Pigeonhole Sort

Mastering Pigeonhole Sort for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for Pigeonhole Sort.
26

Cycle Sort

Mastering Cycle Sort for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for Cycle Sort.
27

Activity Selection Problem

Mastering Activity Selection Problem for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for Activity Selection Problem.
28

Kruskal’s Minimum Spanning Tree Algorithm

Mastering Kruskal’s Minimum Spanning Tree Algorithm for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for Kruskal’s Minimum Spanning Tree Algorithm.
29

Huffman Coding

Mastering Huffman Coding for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for Huffman Coding.
30

Efficient Huffman Coding for Sorted Input

Mastering Efficient Huffman Coding for Sorted Input for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for Efficient Huffman Coding for Sorted Input.
31

Prim’s Minimum Spanning Tree Algorithm

Mastering Prim’s Minimum Spanning Tree Algorithm for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for Prim’s Minimum Spanning Tree Algorithm.
32

Prim’s MST for Adjacency List Representation

Mastering Prim’s MST for Adjacency List Representation for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for Prim’s MST for Adjacency List Representation.
33

Dijkstra’s shortest path algorithm

Mastering Dijkstra’s shortest path algorithm for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for Dijkstra’s shortest path algorithm.
34

Dijkstra’s Algorithm for Adjacency List Representation

Mastering Dijkstra’s Algorithm for Adjacency List Representation for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for Dijkstra’s Algorithm for Adjacency List Representation.
35

Job Sequencing Problem

Mastering Job Sequencing Problem for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for Job Sequencing Problem.
36

Greedy Algorithm to find Minimum number of Coins

Mastering Greedy Algorithm to find Minimum number of Coins for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for Greedy Algorithm to find Minimum number of Coins.
37

K Centers Problem

Mastering K Centers Problem for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for K Centers Problem.
38

Minimum Number of Platforms Required for a Railway/Bus Station

Mastering Minimum Number of Platforms Required for a Railway/Bus Station for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for Minimum Number of Platforms Required for a Railway/Bus Station.
39

Longest Common Subsequence

Mastering Longest Common Subsequence for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for Longest Common Subsequence.
40

Edit Distance

Mastering Edit Distance for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for Edit Distance.
41

Min Cost Path

Mastering Min Cost Path for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for Min Cost Path.
42

Coin Change

Mastering Coin Change for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for Coin Change.
43

0-1 Knapsack Problem

Mastering 0-1 Knapsack Problem for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for 0-1 Knapsack Problem.
44

Egg Dropping Puzzle

Mastering Egg Dropping Puzzle for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for Egg Dropping Puzzle.
45

Longest Palindromic Subsequence

Mastering Longest Palindromic Subsequence for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for Longest Palindromic Subsequence.
46

Cutting a Rod

Mastering Cutting a Rod for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for Cutting a Rod.
47

Palindrome Partitioning

Mastering Palindrome Partitioning for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for Palindrome Partitioning.
48

Optimal Binary Search Tree

Mastering Optimal Binary Search Tree for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for Optimal Binary Search Tree.
49

Tiling Problem

Mastering Tiling Problem for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for Tiling Problem.
50

Floyd Warshall Algorithm

Mastering Floyd Warshall Algorithm for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for Floyd Warshall Algorithm.
51

Print all permutations of a given string

Mastering Print all permutations of a given string for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for Print all permutations of a given string.
52

The Knight’s tour problem

Mastering The Knight’s tour problem for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for The Knight’s tour problem.
53

Rat in a Maze

Mastering Rat in a Maze for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for Rat in a Maze.
54

N Queen Problem

Mastering N Queen Problem for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for N Queen Problem.
55

Subset Sum

Mastering Subset Sum for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for Subset Sum.
56

m Coloring Problem

Mastering m Coloring Problem for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for m Coloring Problem.
57

Hamiltonian Cycle

Mastering Hamiltonian Cycle for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for Hamiltonian Cycle.
58

Sudoku

Mastering Sudoku for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for Sudoku.
59

Tug of War

Mastering Tug of War for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for Tug of War.
60

Median of two sorted arrays

Mastering Median of two sorted arrays for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for Median of two sorted arrays.
61

Count Inversions

Mastering Count Inversions for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for Count Inversions.
62

Closest Pair of Points

Mastering Closest Pair of Points for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for Closest Pair of Points.
63

Strassen’s Matrix Multiplication

Mastering Strassen’s Matrix Multiplication for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for Strassen’s Matrix Multiplication.
64

Quick Sort vs Merge Sort

Mastering Quick Sort vs Merge Sort for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for Quick Sort vs Merge Sort.
65

Breadth First Traversal for a Graph

Mastering Breadth First Traversal for a Graph for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for Breadth First Traversal for a Graph.
66

Depth First Traversal for a Graph

Mastering Depth First Traversal for a Graph for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for Depth First Traversal for a Graph.
67

Detect Cycle in a Directed Graph Detect Cycle in a an Undirected Graph

Mastering Detect Cycle in a Directed Graph Detect Cycle in a an Undirected Graph for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for Detect Cycle in a Directed Graph Detect Cycle in a an Undirected Graph.
68

Topological Sorting

Mastering Topological Sorting for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for Topological Sorting.
69

Check if a given graph is tree or not

Mastering Check if a given graph is tree or not for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for Check if a given graph is tree or not.
70

Prim’s Minimum Spanning Tree (MST))

Mastering Prim’s Minimum Spanning Tree (MST)) for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for Prim’s Minimum Spanning Tree (MST)).
71

Applications of Minimum Spanning Tree Problem

Mastering Applications of Minimum Spanning Tree Problem for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for Applications of Minimum Spanning Tree Problem.
72

Boruvka’s algorithm for Minimum Spanning Tree

Mastering Boruvka’s algorithm for Minimum Spanning Tree for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for Boruvka’s algorithm for Minimum Spanning Tree.
73

Snake and Ladder Problem

Mastering Snake and Ladder Problem for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for Snake and Ladder Problem.
74

Bellman–Ford Algorithm

Mastering Bellman–Ford Algorithm for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for Bellman–Ford Algorithm.
75

Johnson’s algorithm for All-pairs shortest paths

Mastering Johnson’s algorithm for All-pairs shortest paths for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for Johnson’s algorithm for All-pairs shortest paths.
76

Shortest Path in Directed Acyclic Graph

Mastering Shortest Path in Directed Acyclic Graph for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for Shortest Path in Directed Acyclic Graph.
77

Shortest path with exactly k edges in a directed and weighted graph

Mastering Shortest path with exactly k edges in a directed and weighted graph for IT company recruitment drives.

2m3/10
📌 Key FormulaKey properties and rules for Shortest path with exactly k edges in a directed and weighted graph.