Data Structure Practice : for Collegiate Programming Contests and Education book cover
1st Edition

Data Structure Practice
for Collegiate Programming Contests and Education

ISBN 9781482215397
Published February 4, 2016 by CRC Press
512 Pages 77 B/W Illustrations

SAVE ~ $26.00
was $130.00
USD $104.00

Prices & shipping based on shipping country


Book Description

Combining knowledge with strategies, Data Structure Practice for Collegiate Programming Contests and Education presents the first comprehensive book on data structure in programming contests. This book is designed for training collegiate programming contest teams in the nuances of data structure and for helping college students in computer-related majors to gain deeper understanding of data structure.

Based on successful experiences in many world-level contests, the book includes 204 typical problems and detailed analyses selected from the ACM International Collegiate Programming Contest and other major programming contests since 1990. It is divided into four sections that focus on:

  • Fundamental programming skills

  • Experiments for linear lists

  • Experiments for trees

  • Experiments for graphs

Each chapter contains a set of problems and includes hints. The book also provides test data for most problems as well as sources and IDs for online judgments that help with improving programming skills.

Introducing a multi-options model and considerations of context, Data Structure Practice for Collegiate Programming Contests and Education encourages students to think creatively in solving programming problems. By taking readers through practical contest problems from analysis to implementation, it provides a complete source for enhancing understanding and polishing skills in programming.

Table of Contents

FUNDAMENTAL PROGRAMMING SKILLS. Practice for Simple Computing. Simple Simulation. Simple Recursion. EXPERIMENTS FOR LINEAR LISTS. Linear Lists Accessed Directly. Applications of Linear Lists for Sequential Access. Generalized List Using Indexes. Sort of Linear Lists. EXPERIMENTS FOR TREES. Programming by Tree Structure. Applications of Binary Trees. Applications of Classical Trees. EXPERIMENTS FOR GRAPHS. Applications of Graph Traversal. Algorithms of Minimum Spanning Trees. Algorithms of Best Paths. Algorithms of Bipartite Graphs and Flow Networks.

View More



Yonghui Wu was the coach of Fudan University programming contest teams from 2001 to 2011. Under his guidance, Fudan University qualified for the Association for Computing Machinery International Collegiate Programming Contest (ACM-ICPC) World Finals every year, winning three medals during that span: the bronze medal in 2002, silver medal in 2005, and bronze medal in 2010. Since 2012, he has published a series of books for programming contests and education. He is now the chair of the ICPC Asia Programming Contest 1st Training Committee.

Jian-De Wang is a famous coach for the Olympiad in Informatics in China. Under his guidance, his students have won seven gold medals, three silver medals, and two bronze medals for China in the International Olympiad in Informatics. He has published 24 books for programming contests.