Scribd
Upload
47 views7 pages

CP Full Syllabus

This document outlines topics in mathematics, graphs, data structures, searching and sorting algorithms, greedy algorithms, dynamic programming, divide and conquer techniques, and pattern matching. Some key areas covered include number theory, probability, counting, linear algebra, graph representations, graph algorithms like DFS and BFS, minimum spanning trees, single and all pairs shortest paths, data structures like tries and segment trees, sorting algorithms, classical greedy problems, dynamic programming problems on strings, arrays, and graphs, and divide and conquer algorithms like merge sort.

Uploaded by

Narayan Chakraborty
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
47 views7 pages

CP Full Syllabus

This document outlines topics in mathematics, graphs, data structures, searching and sorting algorithms, greedy algorithms, dynamic programming, divide and conquer techniques, and pattern matching. Some key areas covered include number theory, probability, counting, linear algebra, graph representations, graph algorithms like DFS and BFS, minimum spanning trees, single and all pairs shortest paths, data structures like tries and segment trees, sorting algorithms, classical greedy problems, dynamic programming problems on strings, arrays, and graphs, and divide and conquer algorithms like merge sort.

Uploaded by

Narayan Chakraborty
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

Mathematics:

(a)Number Theory
A. Prime Number Generation (Sieve, Segmented Sieve)
B. Euler Totient Theorem
C. Fermat’s Theorem
D. HCF & LCM (Euclid)
E. Linear Diophantine Equations (Extended Euclid)
F. Modulus Arithmetic (addition,multiplication,subtraction,modular Inverse)
G. Cycle Finding (Floyd Algo and Brent Algo)
H. Integer Factorization (Trial Division , Pollard Rho method)
I. Lucas Theorem (Simple & Advance)
J. Chinese Remainder Theorem
K. Wilson Theorem
L. Miller - Rabin Primality Testing
M. Perfect Numbers
N. Goldbach Conjecture

(b)Probability
A. Basic Probability and Conditional Probability
B. Random Variables
C. Probability Generating Functions
D. Expectation
E. Probability Distribution [Binomial, Poisson, Normal,Bernoulli]

(c)Counting
A. Pigeonhole principle
B. Inclusion Exclusion
C. Special Numbers [Stirling,Fibonacci,Catalan, Eulerian, Harmonic, Bernoulli]
D. Polya Counting
E. Burnside lemma

(d)Permutation Cycles

(e)Linear Algebra
A. Addition And Subtraction Of Matrices
B. Multiplication ( Strassen's algorithm ), Logarithmic exponentiation
C. Matrix Transformations [ Transpose, Rotation Of Matrix, Representing Linear
Transformations Using Matrix ]
D. Determinant , Rank and Inverse Of Matrix [ Gaussian Elimination , Gauss Jordan
Elimination]
E. Solving System Of Linear Equations

1
F. Matrix Exponentiation To Solve Recurrences
G. Eigenvalues And Eigen vector
H. Roots of a polynomial [ Prime factorization of a polynomial, Integer roots of a polynomial]
I. Lagrange Interpolation

(e)Game Theory
A. Basic Concepts & Nim Game [Grundy Theorem , Grundy Number]
B. Hackenbush

(f)Group Theory
A. Burnside Lemma
B. Polya's Theorem

2
Graphs:
(a)Graph Representation
A. Adjacency Matrix
B. Adjacency List
C. Incidence Matrix
D. Edge List

(b)Graph Types
A. Directed
B. Undirected
C. Weighted
D. Unweighted
E. Planar
F. Hamilton
G. Euler
H. Special Graphs

(c)DFS & It’s Application


A. Cycle Detection
B. Articulation Points
C. Bridges
D. Strongly Connected Component
E. Connected Component
F. Path Finding
G. Solving Maze
H. Biconnectivity in Graph
I. Topological Sorting
J. Bipartite Checking
K. Planarity Testing
L. Flood-fill algorithm

(d)BFS & It’s Application


A. Shortest Path (No. Of Edges)
B. Bipartite Checking
C. Connected Components

(d)Minimum Spanning Tree


A. Prim’s Algorithm
B. Kruskal Algorithm

3
(d)Single Source Shortest-Path
A. Dijkstra
B. Bellman Ford

(e)All pair Shortest Path


A. Floyd Warshall’s Algorithm

(f)Euler Tour

(g)Flow
A. Ford-Fulkerson [PFS,DFS,BFS]
B. Dinic's Algorithm
C. Min Cost - Max Flow [Successive Shortest Path Algo,Cycle Cancelling Algorithm]
D. Max Weighted BPM [Kuhn Munkres algorithm/Hungarian Method]
E. Stoer Wagner Min-Cut Algo
F. Hop-Kraft BPM
G. Edmond Blossom Shrinking Algorithm

(h)Other Important Topics On Graphs


A. 2-SAT,
B. LCA
C. Maximum Cardinality Matching
D. Application Flow
E. Min Path Cover Over Dag
F. Independent Edge Disjoint Path
G. Minimum Vertex Cover
H. Maximum Independent Set

4
Data Structures:
A. Disjoint-Set Data Structures
B. Trie
C. Segment Tree
D. Binary Index Tree
E. Heavy Light Decomposition
F. Suffix Array

Searching And Sorting:


A. Linear Search
B. BInary Search
C. Ternary Search
D. Selection Sort
E. Bubble Sort
F. Insertion Sort
G. Merge Sort
H. Quick Sort
I. Quick Select
J. Heap Sort
K. Radix Sort
L. Counting Sort

5
Greedy:
A. Classical Problems of Greedy & Concept
1. Fractional Knapsack

Dynamic Programming:
A. Classical Problems
1. LIS
2. LCS
3. Knapsack
4. Edit Distance
5. LPS
6. Optimal Binary Search Tree
B. DP + DS
C. DP + Tree
D. DP + Bit Masking
E. DP + Binary Search
F. DP + Graph
G. DP + Matrix Exponentiation
H. DP + Probability Space
I. DP + Counting
J. DP + Crack Recurrence

Divide & Conquer:


A. Classical Problems & Concepts
1. Merge Sort
2. Closest Pair Points

Other Algorithm Design Techniques :


A. BackTracking
B. Man In Middle
C. Newton-Raphson to reach the fixed point
D. Brute Force
E. Constructive Algo
F. Sliding Window
G. Pancake Sorting

6
Pattern Matching:
A. KMP

You might also like