COMPETITIVE PROGRAMMING 4 - BOOK 1*

Rp352.000

Description

ISBN 9879811474767

COMPETITIVE PROGRAMING 4 BOOK 1 Chapter 1-4 The Lower Bound of Programming Contest in the 2020s

Handbook for DrCT,NOI,IOI, and ICPC Contestants as well as for Programming Interviews

299 Pages
Full English

Content:
1. Introduction
– Competitive Programming
– The Comptetitions
– Tips to be Competitive
– Getting Started: The Easy Problems
– Basic String Processing Skills
– The Ad Hoc Problem
– Solution to Non-Starred Exercises
– Chapter Notes
2. Data Structures and Libraries
– Overview and Motivation
– Linear DS with Built-in Libraries
– Non Linear DS with Built-in Libraries
– DS with Built-in Libraries
– Solution to Non-Starred Exercises
– Chapter Notes
3. Problem Solving Paradigms
– Overview and Motivation
– Complete Search
– Divide and Conquer
– Greedy
– Dynamic Programming
– Solution to Non-Starred Exercises
– Chapter Notes
4. Graph
– Overview and Motivation
– Graph Traversal
– Minimum Spanning Tree (MST)
– Single-Source Shorted Paths (SSSP)
– All – Pairs Shortest Paths (APSP)
– Special Graphs

SKU 9879811474767 Category

10 in stock

Share on facebook
share

COMPETITIVE PROGRAMMING 4 - BOOK 1*

Rp352.000

10 in stock

Share on facebook
share
Description

ISBN 9879811474767

COMPETITIVE PROGRAMING 4 BOOK 1 Chapter 1-4 The Lower Bound of Programming Contest in the 2020s

Handbook for DrCT,NOI,IOI, and ICPC Contestants as well as for Programming Interviews

299 Pages
Full English

Content:
1. Introduction
– Competitive Programming
– The Comptetitions
– Tips to be Competitive
– Getting Started: The Easy Problems
– Basic String Processing Skills
– The Ad Hoc Problem
– Solution to Non-Starred Exercises
– Chapter Notes
2. Data Structures and Libraries
– Overview and Motivation
– Linear DS with Built-in Libraries
– Non Linear DS with Built-in Libraries
– DS with Built-in Libraries
– Solution to Non-Starred Exercises
– Chapter Notes
3. Problem Solving Paradigms
– Overview and Motivation
– Complete Search
– Divide and Conquer
– Greedy
– Dynamic Programming
– Solution to Non-Starred Exercises
– Chapter Notes
4. Graph
– Overview and Motivation
– Graph Traversal
– Minimum Spanning Tree (MST)
– Single-Source Shorted Paths (SSSP)
– All – Pairs Shortest Paths (APSP)
– Special Graphs