COMPETITIVE PROGRAMMING

CSE 313 CREDITS:3

INSTRUCTION: 2 Periods & 1 Tutorial/Week SESSIONAL MARKS: 40
FINAL EXAM: 3Hrs FINAL EXAM MARKS: 60

Pre requisites: C and Data Structures

Course Objectives:
The focus of the course is to
 Development and implementation of advanced algorithms
 Develop the skills required for programming competitions.
 Learn to select appropriate algorithms for a given problem, integrate multiple
algorithms
 Solving a complex problem, designing new algorithms, and implementing them .
 Solving problems in teams and working under time pressure.

Course Outcomes:
By the end of the course Students will be able to
1. Judge time complexity rules and Apply sorting, searching techniques to solve problems.
2. Select the best way for finding path using flows and cuts, string algorithms and greedy
algorithms.
3. Analyze and develop backtracking algorithms
4. Examine bit manipulation operations and work with number theory.
5. Solve given problems using dynamic programming.

CO-PO Mapping
PO PSO
CO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
1 2 3 1 3 - - - - - - - 3 2 -
2 3 2 1 3 - - - - - - - 3 3 -
3 3 3 2 3 - - - - - - - 3 3 -
4 3 3 3 3 - - - - - - - 3 2 -
5 3 2 1 2 - - - - - - - 3 1 -

Page 23 of 106
 SYLLABUS
UNIT-I 10 Hours
Time complexity: Calculation rules, Complexity classes, Estimating efficiency, Maximum
subarray sum, Sorting: Sorting Theory, Counting Sort, Radix Sort, Heap Sort, Bucket Sort,
Ternary Search, Case Studies Examples: The 3n + 1 Problem (UVa IDs: 100), Minesweeper
(UVa ID: 10189),
Learning Outcomes: At the end of this unit the Students will be able to
 Compare various sorting and searching algorithms
 Apply the algorithms to solve a problem.

UNIT- II 14 Hours
Flows and Cuts: Ford-Fulkerson algorithm, Path Covers, Directed graphs: Topological
sorting , Strings: Trie, String Hashing, Z-algorithm, Greedy Algorithms : coin problem,
tasks and deadlines, Minimizing sums, Data compression
Case Studies: Jolly Jumpers(UVa ID: 10038)
Learning Outcomes: At the end of this unit the Students will be able to
 Evaluate various flows and cut, directed graphs and string algorithms.
 Finding best path greedy approach.

UNIT-III 12 Hours
Backtracking: Backtracking, Constructing All Subsets, Constructing All Permutations,
Program Design Example: The Eight-Queens Problem, Pruning Search.
Case studies: 15-Puzzle Problem , Tug of War
Learning Outcomes: At the end of this unit the Students will be able to
 construct all sub sets and permutations using back tracking
 Solve given problems using back tracking.

UNIT-IV 14 Hours
Bit Manipulation: Bit representation, bit operations, representing sets
Number theory: Primes and factors, Modular arithmetic, solving equations.
Learning Outcomes: At the end of this unit the Students will be able to
 Examine bit manipulation operations and representing sets
 Work with Primes and factors and Modular arithmetic.

UNIT-V 10 Hours
Dynamic Programming: Coin problem, Longest increasing subsequence, Paths in a grid,
Edit distance, Counting tilings
Case Studies: Is Bigger Smarter? (UVa Ids:10131), Distinct Subsequences (UVa Ids:10069)
Learning Outcomes: At the end of this unit the Students will be able to
 Examine the different dynamic programs.
 Apply the dynamic programs to solve any scenarios

Text Books:
1. Felix Halim and Steven Halim Competitive Programming 3: The New Lower Bound
of Programming Contests.
2. Steven S. Skiena Miguel A. Revilla PROGRAMMING CHALLENGES, The
Programming Contest Training Manual.

Reference Books:
1. ART OF PROGRAMMING CONTEST C Programming Tutorials | Data Structures |

Page 24 of 106
 Algorithms by Ahmed Shamsul Arefin.

Online Resources:
Books:
1. https://jadi.net/wp-content/uploads/2017/07/competetive-programmers-handbook.pdf
2. http://acm.cs.buap.mx/downloads/Programming_Challenges.pdf
3. https://www.comp.nus.edu.sg/~stevenha/myteaching/competitive_programming/cp1.p
df
4. https://www.comp.nus.edu.sg/~stevenha/database/Art_of_Programming_Contest_SE_
for_uva.pdf

Problem reading & Practice:

 https://uva.onlinejudge.org/index.php

Page 25 of 106