The document outlines a basic level workshop presented by Asish Pal at the University of Chittagong. It thanks Forhad Ahmed and provides a 17 point agenda for topics to be covered including ad hoc programming, string simulation, number theory, graph algorithms, dynamic programming, and more advanced subjects like matrix exponential and game theory.

1. University of Chittagong(Basic Level Workshop)
Presented by: Asish Pal(Formal Contestent)
Special Thanks: Forhad Ahmed(WF & Formal Contestent)
1. Ad hoc(7 days)
UVA Online Judge(At least 150 problem solved)
Light Oj(At least 50 problem solved)
http://www.acmsolver.org/?p=748
http://forum.daffodilvarsity.edu.bd/index.php?topic=421.0
2. Bruteforce
3. String simulation/Parsing(4 days)
UVA Online Judge(At least 50 problem solved)
4. STL(Very important)
Vector
Map
Set
Pair
Queue
Stack
Priority queue
5. Basic Recursion
6. Number Theory(10 days) loj(1090,1138)
Prime Number Generate (Using Seive Method)
Primality Test
Prime Factorization
Euler Totient Function
Number of Divisors

2. Relative Prime
Sum Of Divisors(Sigma Function)
Logarithmic Exponentiation
Extended GCD Algorithm
Modular Arithmetic
Fermat’s Little Theorem
Chinese Remainder Theorem(Advance Topics)
7. Problem solving paradigms()
Complete Search + bractracking(5) – UVA
725,750,11085,167
Divide and Conquer(10)
Greedy(50)
Dynamic Programming(50)
8. Conbinatories
9. Bitmask : TSP
10. Graph Representation
BFS
DFS
Kruskal + Prims
Single source shortest path(Dijkstra)
All possible shortest path(Floyd warshall)
Bellman Ford’s
Topological sort
Strongly Connected Component
Articulation Point
Bipartic matching(Advance)
MaxFlow(Advance)

3. 11. String Pattern Matching(KMP)
12. Data Structure
Union find
Segment tree
Binary Index tree
13. Some Special Problem Solve using Multi Algorithm
Bitmask + DP
Dijkstra’s + DP
Graph + DP etc.
14. Geometry
15. Probability
16. Matrix Exponential
17. Game Theory