Algorithm Design Practice for Collegiate Programming Contests and Education

Regular price €117.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 programming contests
advanced data structures
Age Group_Uncategorized
Age Group_Uncategorized
algorithm design courses
algorithmic problem sets
Author_Jiande Wang
Author_Yonghui Wu
automatic-update
Biconnected Components
Category1=Non-Fiction
Category=UMB
Category=UMX
collegiate programming contest preparation
combinatorial optimization
Computation Geometry
computational techniques
computer science education
Congruence Equation
contest mathematics
COP=United States
Cut Vertex
Delivery_Delivery within 10-20 working days
Dynamic Programming
eq_bestseller
eq_computing
eq_isMigrated=2
eq_nobargain
eq_non-fiction
Euler Circuit
Euler Path
Euler Phi Function
Extended Euclidean Algorithm
Greedy Algorithms
Greedy Choices
Hamiltonian Path
Independent Set
Language_English
Left Subtree
Longest Common Prefix
Longest Common Subsequence
Maximum Clique
Maximum Independent Set
Namespace Std
National Agricultural Statistics Service
Number Theory
PA=Available
Poured Water
Price_€100 and above
Priority Queue
Problem solving strategy
problem-solving skills
problem-solving strategies
Programming contests
PS=Active
Segment Tree
Slowest Person
softlaunch
State Space Search
Suffix Array
Tian Ji

Product details

  • ISBN 9781498776639
  • Weight: 1054g
  • Dimensions: 156 x 234mm
  • Publication Date: 20 Nov 2018
  • Publisher: Taylor & Francis Inc
  • Publication City/Country: US
  • Product Form: Paperback
  • Language: English
Secure checkout Fast Shipping Easy returns

This book can be used as an experiment and reference book for algorithm design courses, as well as a training manual for programming contests. It contains 247 problems selected from ACM-ICPC programming contests and other programming contests. There's detailed analysis for each problem. All problems, and test datum for most of problems will be provided online. The content will follow usual algorithms syllabus, and problem-solving strategies will be introduced in analyses and solutions to problem cases. For students in computer-related majors, contestants and programmers, this book can polish their programming and problem-solving skills with familarity of algorithms and mathematics.

Dr. Yonghui Wu serves as Associate Professor at teh school of computer science in Fudan University, China. He acted the coach of Fudan University Programming Contest teams from 2001 to 2011. Under his guidance Fudan University was qualified for ACM ICPC World Finals every year and won three medals (bronze medal in 2002, silver medal in 2005, and bronze medal in 2010) in ACM ICPC World Finals. Since 2012, he has published a series of books for programming contest and education in China covering datastructures, algorithms and strategies, which are walmly welcomed not only in Mainland China, but also in Taiwan, Hongkong, Singapore, and other Chinese speaking areas. He just published his first book’s English version:Data Structure Practice : for Collegiate Programming Contests and Education with CRC Press. Since 2013, he has been giving lectures in Oman, Taiwan and the United States for programming contest training. He is currently the chair of the ICPC Asia Programming Contest 1st Training Committee.

More from this author