IUBAT ACM SESSIONS

ACM SESSIONS

Date	Time	Topic(s)
08.10.2018 [MON]	5 PM - 7 PM	1. Basic Introduction 2. C++ Overview 3. Basic Time and Memory Complexity Analysis
10.10.2018 [WED]	4 PM - 7 PM	1. Sorting 2. Binary search
13.10.2018 [SAT]	No Session [GUB IUPC]
15.10.2018 [MON]	5 PM - 7 PM	Basic Mathematical Approaches (Episode 0) 1. FInding solution using Binary Search/Bisection Method2. Maximizing or Minimizing using Ternary Search
17.10.2018 [WED]	4 PM - 7 PM	Basic Mathematical Approaches (Episode 1) 1. MOD2. BigMOD / Binary Exponentiation3. Inverse MOD for Prime Modulo4. Efficient calculation of nCr for Prime Modulo
20.10.2018 [SAT] [ADVANCED TOPICS]	10 AM - 3 PM	Basic Data Structures (Episode 0) 1. Segment Tree with Lazy Propagation 2. Fenwick Tree / Binary Indexed Tree / BIT
22.10.2018 [MON][ADVANCED TOPICS]	5 PM - 7 PM	Basic Mathematical Approaches (Episode 1)Matrix Exponentiation
24.10.2018 [WED]	4 PM - 7 PM	Graph Traversal:1. DFS 2. BFS
27.10.2018 [SAT][ADVANCED TOPICS]	3 PM - 7:30 PM	Dynamic Programming (Episode 0)1. Counting Problems 2. Digit DP
31.10.2018 [WED][CONTEST SOLUTION]	4 PM - 7 PM	Solution and Discussion on Binary search + MOD + Segment tree Long Contest-1
01.11.2018 [THU][CONTEST SOLUTION]	5 PM - 7:30 PM	Solution and Discussion on Binary search + MOD + Segment tree Long Contest-1 [Continuation]
03.11.2018 [SAT]	3 PM - 7:30 PM	Basic Mathematical Approaches (Episode 2)Prime Numbers and Divisibility
07.11.2018 [WED]	4 PM - 7 PM	Basic Mathematical Approaches (Episode 3)Combinatorial tricks and Probability

Online Judge links for practice:

1. A2 OJ
2. LIght OJ
3. Codechef
4. Codeforces
5. UVA
6. Spoj

Online Contest Calendar: Clist

Resources:

1. Complexity analysis : shafayet's blog : time complexity
2. C++ STL:  cppreference

Primary Target for Beginners :

1. LIgh OJ Beginners Section
2. Codeforces  Division 2: A,B problems
3. A2 OJ beginners Ladder

2.

Sorting :

• STL Sort [ O( N logN) ]
• Merge Sort [ O( N log N) ]
• Counting Sort [ O ( MAX ELEMENT ) ]

Binary Search :

• Binary Search Tutorial
• Upper Bound
• Lower Bound

Problems: [Memory Limit : 512MB for the first 3 problems]

• https://paste.ubuntu.com/p/vxJBnqH95n/
• https://paste.ubuntu.com/p/Kv2Ntt6f9N/
• https://paste.ubuntu.com/p/3kwrpFfgst/

3.

Tutorials :

• Ternary Search

Implementations :

• Double valued Binary Search for solving equations
• Ternary Search for Maximizing Function

Problems :

• Expanding Rods [ Solution ]
• Closest Distance

4.