Back close
Navigation

Amrita International Programming Bootcamp 2020

Amrita International Programming Bootcamp 2020
When:
2020-05-18 @ 9:00 AM – 2020-05-25 @ 4:00 PM
2020-05-18T09:00:00+05:30
2020-05-25T16:00:00+05:30

Amrita Vishwa Vidyapeetham, Amritapuri campus in Kerala, South India is organizing an international bootcamp for the school students (preferably from 9 to 12th standard) to promote competitive programming. The camp is planned during the summer vacation, in the month of May [third week], for students to dedicate time to learn problem solving. The camp is for 7 [Sunday to Sunday] days, fully dedicated to teach and learn problem solving techniques, contests followed by problem discussion.

Tracks

There are two tracks in the camp – Beginner Track & Intermediate Track. Beginner’s track is for those who are interested in competitive programming and problem solving while the Intermediate track is for those who have already started with competitive programming.

Fees

Fees shall be paid online at the time of registration. Fees include stay and food on all these days. Amrita may reimburse travel expenses depending on the sponsorship availability.

Seats

  • Beginners Track: 50
  • Intermediate Track: 40

Selection

Selection to both the tracks is based on the rank secured in the contest hosted by Amrita. Contest will be held in the last week of March/First week of April. Contest will be open to all students. There will be no registration fee to participate in the contest.

Contest Platform

DOMjudge is the contest platform. Practice contest will be hosted in advance to ensure that the participants get familiar with the contest platform.

Intermediate Track Curriculum

Pre-requisites

  1. Fluent in C/C++ programming – loops, branching, arrays, strings
  2. Comfortable with writing recursive code
  3. Have solved at least 20 problems from online judges
  4. Have solved A and B problems in 3 Div-2 contests in Codeforces

Day 1

  • Data Structures from STL: string, vector, stack, queue, set, map
  • Trees: BT, BST, AVL – implement 1 tree (say BST)

Day 2

  • Graph: DFS, BFS, Path & connectivity, topological sort
  • Problems on graphs

Day 3

  • Optimal substructure, greedy choice properties
  • Greedy on arrays/strings
  • Greedy on graphs

Day 4

  • Overlapping subproblems property
  • DP on arrays/strings
  • DP on graphs/trees

Day 5-6

  • Number Theory
  • Combinatorics

Day 7

  • Computational geometry: Convex hull, intersection, polygon triangulation, Voronoi diagram, Delunay triangulation

Day 8

  • Recap and review
  • Gym Contest

Schedule [everyday]

Time Program
09:00 AM – 11:00 AM Instruction session + Discussion of previous day contest
11:00 AM – 0100 PM Practice session
02:00 PM – 03:00 PM Instruction session
03:00 PM – 05:00 PM Practice session
06:00 PM – 08:00 PM Contest

Share this story

Admissions Apply Now