Data Structure Practice: for Collegiate Programming Contests and Education

✍ Scribed by Yonghui Wu, Jiande Wang

• Publisher: CRC Press
• Year: 2016
• Tongue: English
• Leaves: 508
• Category: Library

✦ Synopsis

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

Front Cover......Page 1
Contents......Page 6
Preface......Page 14
Authors......Page 16
Section I: Fundamental Programming Skills......Page 18
Chapter 1: Practice for Simple Computing......Page 20
Chapter 2: Simple Simulation......Page 46
Chapter 3: Simple Recursion......Page 62
Summary of Section I......Page 78
Section II: Experiments for Linear Lists......Page 80
Chapter 4: Linear Lists Accessed Directly......Page 82
Chapter 5: Applications of Linear Lists for Sequential Access......Page 158
Chapter 6: Generalized List Using Indexes......Page 188
Chapter 7: Sort of Linear Lists......Page 208
Summary of Section II......Page 244
Section III: Experiments for Trees......Page 246
Chapter 8: Programming by Tree Structure......Page 248
Chapter 9: Applications of Binary Trees......Page 298
Chapter 10: Applications of Classical Trees......Page 312
Summary of Section III......Page 350
Section IV: Experiments for Graphs......Page 352
Chapter 11: Applications of Graph Traversal......Page 354
Chapter 12: Algorithms of Minimum Spanning Trees......Page 422
Chapter 13: Algorithms of Best Paths......Page 440
Chapter 14: Algorithms of Bipartite Graphs and Flow Networks......Page 474
Summary of Section IV......Page 504
Bibliography......Page 506
Back Cover......Page 508