Yonghui Wu, Jiande Wang

Data Structure Practice

For Collegiate Programming Contests and Education

• Gebundenes Buch

Produktbeschreibung

Combining knowledge with strategies, this is the first comprehensive book on data structure in programming contests. It is designed for training collegiate programming contest teams in the nuances of data structure and for helping college students in computer-related majors improve understanding of data structure. Based on successful experiences in many world-level contests, it includes 204 typical problems and detailed analyses selected from the ACM International Collegiate Programming Contest and other major programming contests since 1990.

---

Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.

Produktdetails

• Verlag: Apple Academic Press Inc.
• Seitenzahl: 496
• Erscheinungstermin: 4. Februar 2016
• Englisch
• Abmessung: 257mm x 183mm x 33mm
• Gewicht: 1120g
• ISBN-13: 9781482215397
• ISBN-10: 148221539X
• Artikelnr.: 43778951

Autorenporträt

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.

Inhaltsangabe

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.