Home » Data Structure Practice
Product Image

Data Structure Practice

Yonghui Wu | Jiande Wang
€127.99
Quantity:
In stock with our UK publisher. 14-28 days
Delivery/Collection within 10-20 working days
14 days return policy Shipping & Delivery
A01=Jiande Wang
A01=Yonghui Wu
ACM-ICPC
Adjacency List
Adjacency Matrix
advanced data structures
algorithmic problem solving
Author_Jiande Wang
Author_Yonghui Wu
binary
Binary Search Tree
Binary Trees
Bipartite Graphs
Category=UMA
Category=UMB
Category=UMX
Category=UNA
Complete Binary Tree
computational complexity
Computing
contest programming training
Data structure
Dijkstra's Algorithm
Dijkstra’s Algorithm
eq_bestseller
eq_computing
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
eq_non-fiction
graph theory applications
Graph Traversal
Hash Table
Huffman Tree
Import Java
Inorder Traversal
input
judge
Kruskal Algorithm
Left Child
Left Subtree
linear
Linear List
list
Min Heap
namespace
Namespace Std
online
Online Judge
output
Postorder Traversal
Preorder Traversal
Preprocessor Directive
Prim Algorithm
Priority Queue
programming contest problem analysis
Programming contests
recursive algorithms
sample
Sample Input Sample Output
std

Product details

  • ISBN 9781482215397
  • Weight: 1065g
  • Dimensions: 178 x 254mm
  • Publication Date: 04 Feb 2016
  • Publisher: Taylor & Francis Inc
  • Publication City/Country: US
  • Product Form: Hardback
Secure checkout Fast Shipping Easy returns
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.
About Jiande Wang | Yonghui Wu

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.

More from this author