Normal view MARC view ISBD view

Algorithm design practice for collegiate programming contests and education / by Yonghui Wi and Jiande Wang.

By: Wu, Yonghui.
Contributor(s): Wang, Jiande.
Publisher: Boca Raton, FL : CRC Press, [2019]Description: 1 online resource (xiv, 692 pages).ISBN: 9781498776639; 0429687079; 9780429687082; 0429687087.Subject(s): Computer programming | Computer algorithms | Algorithms | Programmation (Informatique) | Algorithmes | computer programming | algorithms | MATHEMATICS -- Arithmetic | MATHEMATICS -- General | COMPUTERS -- Programming Languages -- General | Computer algorithms | Computer programmingDDC classification: 005.1 Online resources: eBook Single File
Contents:
Practice for Ad Hoc Problems. Practice for Simulation Problems. Practice for Number Theory. Practice for Combinatorics. Practices for Greedy Algorithms. Dynamic Programming. Practice for Advanced Data Structure. Practice for Computation Geometry.
Summary: 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
    average rating: 0.0 (0 votes)

Includes bibliographical references and index.

Practice for Ad Hoc Problems. Practice for Simulation Problems. Practice for Number Theory. Practice for Combinatorics. Practices for Greedy Algorithms. Dynamic Programming. Practice for Advanced Data Structure. Practice for Computation Geometry.

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.

Online resource; title from PDF title page (Taylor & Francis, viewed December 12, 2018).

There are no comments for this item.

Log in to your account to post a comment.
© University of Jaffna