The challenges of problems from international programming competitions are an effective way to improve your algorithmic and coding skills and understanding. This volume uses international programming competition-type problems to motivate the study of algorithms, programming, and other topics in computer science. The book includes more than 100 programming challenges, as well as the theory and key concepts necessary for approaching them. Problems are organized by topic, and supplemented by complete tutorial material. Readers gain a concrete understanding of both algorithmic techniques and advanced coding topics. Unique Features: * Offers a wealth of rich programming problems suitable for self-study -- all with on-line judging at www.programming-challenges.com * Presents practice training for all major programming contests -- ACM International Collegiate Programming Contest (ACM ICPC), International Olympiad in Informatics (IOI), and Topcoder Challenge * Serves as a convenient, web-based means of adding a programming component to any algorithms or software engineering course * Contains complete working code for fundamental data structures and graph, string, numerical and geometric algorithms * Provides a brief-yet-thorough treatment of key elements in number theory, geometry, dynamic programming, and graph algorithms * Supports all popular programming languages (C, C++, Pascal, Java) Steven S. Skiena is a member of the faculty of computer science at SUNY Stony Brook and is author of many widely used books, including The Algorithm Design Manual. He received the 2001 IEEE Computer Society Undergraduate Teaching Award. Miguel Revilla is a member of the faculty of computer science at the University of Valladolid, Spain. He is official website archivist of the ACM ICPC and creator/maintainer of the primary robot-judge, contest-hosting website.
Programming Challenges
und über 1,5 Millionen weitere Bücher verfügbar für Amazon Kindle. Erfahren Sie mehr
| |||||||||||||||
Kurzbeschreibung
Produktinformation
Möchten Sie die Produktinformationen aktualisieren oder Feedback zu den Produktabbildungen geben?
Ist der Verkauf dieses Produkts für Sie nicht akzeptabel? |
Mehr über die Autoren
Entdecken Sie Bücher, lesen Sie über Autoren und mehr
Produktbeschreibungen
Pressestimmen
"Skiena and Revilla's new book 'Programming Challenges: The Programming Contest Training Manual' is just the ticket for those interested in a jumpstart to the world of contest programming. With special emphasis on the international ACM collegiate contests, the book's best feature is each chapter's pithy introduction that demystifies a particular scheme or algorithmic approach. The ensemble of these explications coupled with the contest strategy guidelines in the appendix can enable a novice to enhance contest results dramatically in a short time simply by solving the suggested exercises in each chapter. Even contest veterans are likely to be able to find a nugget or two in the explanations and strategies. "Presented in a logical order (contest programming has over a dozen different primary attacks), the book guides readers not only through the techniques and algorithms required but also through a huge set of problems that can be used for training. Solutions can be submitted to Valladolid University's online trainer for quick feedback and reinforcement. "If you're the sort who likes to have a single volume that covers the vast majority of a field, you'll love Skiena and Revilla's new tome." --Rob Kolstad, Ph.D., Head Coach, USA Computing Olympiad
Synopsis
The challenges of problems from international programming competitions are an effective way to improve your algorithmic and coding skills and understanding. This volume uses international programming competition-type problems to motivate the study of algorithms, programming, and other topics in computer science. The book includes more than 100 programming challenges, as well as the theory and key concepts necessary for approaching them. Problems are organized by topic, and supplemented by complete tutorial material. Readers gain a concrete understanding of both algorithmic techniques and advanced coding topics. Unique Features:- Offers a wealth of rich programming problems suitable for self-study - all with on-line judging at www programming-challenges.com- Presents practice training for all major programming contests - ACM International Collegiate Programming Contest (ACM ICPC), International Olympiad in Informatics (IOI), and Topcoder Challenge- Serves as a convenient, web-based means of adding a programming component to any algorithms or software engineering course - Contains complete working code for fundamental data structures and graph, string, numerical and geometric algorithms- Provides a brief-yet-thorough treatment of key elements in number theory, geometry, dynamic programming, and graph algorithms - Supports all popular programming languages (C, C++, Pascal, Java)Steven S.Skiena is a member of the faculty of computer science at SUNY Stony Brook and is author of many widely used books, including The Algorithm Design Manual. He received the 2001 IEEE Computer Society Undergraduate Teaching Award. Miguel Revilla is a member of the faculty of computer science at the University of Valladolid, Spain. He is official website archivist of the ACM ICPC and creator/maintainer of the primary robot-judge, contest-hosting website.
Welche anderen Artikel kaufen Kunden, nachdem sie diesen Artikel angesehen haben?
In diesem Buch
(Mehr dazu)
Einleitungssatz
This book is designed to be used in tandem with one (or bath) of two robot judging websites. Lesen Sie die erste Seite
Buchdeckel | Copyright | Inhaltsverzeichnis | Auszug | Stichwortverzeichnis | Rückseite
This book is designed to be used in tandem with one (or bath) of two robot judging websites. Lesen Sie die erste Seite
Mehr entdecken
Wortanzeiger
Ausgewählte Seiten ansehenWortanzeiger
Buchdeckel | Copyright | Inhaltsverzeichnis | Auszug | Stichwortverzeichnis | Rückseite
Kundenrezensionen
Die hilfreichsten Kundenrezensionen
Von Bücherkeule
Format:Taschenbuch|Von Amazon bestätigter Kauf
'Programming Challenges' is a must-have book for those who either intend to enter programming competitions or who, in their own lives as programmers, have discovered a deficit in algorithmic thinking. In fourteen chapters the willing student is introduced to the basic algorithmic principles of various problem classes (such as dynamic programming, algorithms on graphs or geometric problems) which are at the foundation of computing. These principles include the general strategies for solving particular problem domains along with the basic algorithms and data structures suitable for the problem domain.
Each chapter opens with an introduction to a particular algorithmic domain. This domain is explained informally through extensive worked examples, so that the student is prepared for the main body of the chapter: a collection of problems taken from various competitions. These problems are classified according to popularity, average success rate and difficulty. This classification is an indispensable aid for anybody with a view towards competition. It helps to roughly gauge one's own abilities with respect to (anonymous) others. Unfortunately, the book does not provide solutions (but it does contain a very few hints for selected problems). If you wish to get your solution checked you can submit it online to the authors.
I have taken much pleasure in reading the examples and solving some of the problems. It is a book, I find, I wished more people in the field of computing would read. It is a wonderful antidote to all those books about processes, standards, and global architectures. It reminds us that computing, at its very root, is about (mathematical) reasoning and efficient programming.
Each chapter opens with an introduction to a particular algorithmic domain. This domain is explained informally through extensive worked examples, so that the student is prepared for the main body of the chapter: a collection of problems taken from various competitions. These problems are classified according to popularity, average success rate and difficulty. This classification is an indispensable aid for anybody with a view towards competition. It helps to roughly gauge one's own abilities with respect to (anonymous) others. Unfortunately, the book does not provide solutions (but it does contain a very few hints for selected problems). If you wish to get your solution checked you can submit it online to the authors.
I have taken much pleasure in reading the examples and solving some of the problems. It is a book, I find, I wished more people in the field of computing would read. It is a wonderful antidote to all those books about processes, standards, and global architectures. It reminds us that computing, at its very root, is about (mathematical) reasoning and efficient programming.
Die hilfreichsten Kundenrezensionen auf Amazon.com (beta)
Amazon.com:
3.4 von 5 Sternen
20 Rezensionen
12 von 13 Kunden fanden die folgende Rezension hilfreich
4.0 von 5 Sternen
Excellent problems for programming challenges
15. Dezember 2003
Von Charles Ashbacher
- Veröffentlicht auf Amazon.com
Format:Taschenbuch
By far, the hardest part of teaching programming classes is evaluating the programs. Unless you have the students do only simplistic programs, they are difficult to read and running the executables does not always give an accurate appraisal of what was done. One possible solution to this educational conundrum is to take advantage of the robot judge maintained at the book's companion web site.
The book contains many problems to be solved via a program that must accept inputs having a specific, albeit general format and then produce the appropriate output. The robot judge is capable of evaluating programs written in Pascal, C, C++ and Java and it will return one of eleven different results, all of which are two letter acronyms. If the program is not given a passing grade, then the message will not be of much benefit.
The problems are placed in several categories, including sorting, combinatorics, number theory, graph traversal, grid operations and geometry. I identified several that I can and most likely will use as assignments the next time I teach basic programming. While some problems require significant background information, in general it is not so great that it is beyond the bounds of what can be done in a basic computing class. The problems were originally created to prepare students for programming contests, so the level of difficulty is such that they could not be used until later in a beginning course. However, the book would be an excellent text for any advanced programming class where the students are split into teams. Each chapter begins with primer material for the problems given in that chapter and I included it in my best books of the year 2003 column for the online "Journal of Object Technology".
The book contains many problems to be solved via a program that must accept inputs having a specific, albeit general format and then produce the appropriate output. The robot judge is capable of evaluating programs written in Pascal, C, C++ and Java and it will return one of eleven different results, all of which are two letter acronyms. If the program is not given a passing grade, then the message will not be of much benefit.
The problems are placed in several categories, including sorting, combinatorics, number theory, graph traversal, grid operations and geometry. I identified several that I can and most likely will use as assignments the next time I teach basic programming. While some problems require significant background information, in general it is not so great that it is beyond the bounds of what can be done in a basic computing class. The problems were originally created to prepare students for programming contests, so the level of difficulty is such that they could not be used until later in a beginning course. However, the book would be an excellent text for any advanced programming class where the students are split into teams. Each chapter begins with primer material for the problems given in that chapter and I included it in my best books of the year 2003 column for the online "Journal of Object Technology".
14 von 16 Kunden fanden die folgende Rezension hilfreich
2.0 von 5 Sternen
As a teacher, this book fails me.
16. März 2011
Von Jason Cordes
- Veröffentlicht auf Amazon.com
Format:Taschenbuch
I teach computer science at the high school level. Many of my students are hired for professional software development before they even graduate. One of the areas my students tell me they wish they could do better is contest coding. I've been doing quite a lot of research in that area, and I've read and digested several very good algorithms books (Data Structures and Algorithms in Java by Peter Drake is among the best I've read so far). Unfortunately, I have yet to find a book that adequately explains how to generate rapid solutions to contest problems. A skill that is interestingly useful in the professional environment in the role of prototyping.
WHAT I THINK ABOUT THIS BOOK:
The book falls very short of what it promises. It does contain a few selected programming problems (several of which I encountered when I competed in the ACM contests myself!), but it merely gives hints on things to think about and nothing about how to select appropriate solution algorithms. Also example code is only given for the simplest of situations. I would have preferred examples of more complex scenarios with a discussion of how to scale it back for simpler situations. Also, the book purports to be language neutral, and in their defense, although all the code is in C, there are discussions of how to use libraries from other languages. The only real use I got out of it was how to categorize problems into subsets and what those subsets look like. Essentially, the book is written to an audience who likely doesn't need the book in the first place...which is a shame.
If you are a master programmer and you just need some "nudges" in the right direction, this will be an excellent book for you.
If you are a novice, this book is all levels of wrong for you...consider getting a good data structures book (that includes graph algorithms...many of them don't!).
If you are an average to good programmer, just go to one of the contest sites and practice problems. It might also be useful to download the FREE guide to the ACM International Contests at acmsolver dot org. Also, the problems presented in this book are mostly covered in the collection of problems published as "From Baylor to Baylor".
WHAT I THINK ABOUT THIS BOOK:
The book falls very short of what it promises. It does contain a few selected programming problems (several of which I encountered when I competed in the ACM contests myself!), but it merely gives hints on things to think about and nothing about how to select appropriate solution algorithms. Also example code is only given for the simplest of situations. I would have preferred examples of more complex scenarios with a discussion of how to scale it back for simpler situations. Also, the book purports to be language neutral, and in their defense, although all the code is in C, there are discussions of how to use libraries from other languages. The only real use I got out of it was how to categorize problems into subsets and what those subsets look like. Essentially, the book is written to an audience who likely doesn't need the book in the first place...which is a shame.
If you are a master programmer and you just need some "nudges" in the right direction, this will be an excellent book for you.
If you are a novice, this book is all levels of wrong for you...consider getting a good data structures book (that includes graph algorithms...many of them don't!).
If you are an average to good programmer, just go to one of the contest sites and practice problems. It might also be useful to download the FREE guide to the ACM International Contests at acmsolver dot org. Also, the problems presented in this book are mostly covered in the collection of problems published as "From Baylor to Baylor".
23 von 29 Kunden fanden die folgende Rezension hilfreich
4.0 von 5 Sternen
Excellent book - several caveats
19. September 2004
Von David Bock
- Veröffentlicht auf Amazon.com
Format:Taschenbuch|Von Amazon bestätigter Kauf
First, let me get the caveats out of the way:
1) 'Contest' code like this does not teach nor encourage many of the concepts desirable for large system development. The point is not to have code that is extensible, maintainable, well designed, etc... although there are some good points (see below).
2) This book does not try to 'teach' concepts. That is not the point either (see below).
While the book is not 'teaching', it does set a bunch of interesting playing fields in which people can explore, discover, and learn on their own. In this regard, this book is excellent. I am considering using it to lead a study group at work for this reason.
While it is not promoting the development of many of the desirable skills I think develops generally need more of, it is promoting the use of requirements, detailed design, and acceptance tests... this is how the projects are specified and graded.
Yes, I said graded. This is a really cool feature of the book - there is a website where your solutions can be submitted, and a 'robot' will run and test them, letting you know the results. The way they pull that off is pretty cool. You create an account, and it ranks how well you are doing.
If you are interesting in contest coding, if you are looking for some platform on which to lead a study group on algorithms/problem solving, or if you are the kind of person who picks up Games Magazine looking for little problems to solve, this book is for you.
1) 'Contest' code like this does not teach nor encourage many of the concepts desirable for large system development. The point is not to have code that is extensible, maintainable, well designed, etc... although there are some good points (see below).
2) This book does not try to 'teach' concepts. That is not the point either (see below).
While the book is not 'teaching', it does set a bunch of interesting playing fields in which people can explore, discover, and learn on their own. In this regard, this book is excellent. I am considering using it to lead a study group at work for this reason.
While it is not promoting the development of many of the desirable skills I think develops generally need more of, it is promoting the use of requirements, detailed design, and acceptance tests... this is how the projects are specified and graded.
Yes, I said graded. This is a really cool feature of the book - there is a website where your solutions can be submitted, and a 'robot' will run and test them, letting you know the results. The way they pull that off is pretty cool. You create an account, and it ranks how well you are doing.
If you are interesting in contest coding, if you are looking for some platform on which to lead a study group on algorithms/problem solving, or if you are the kind of person who picks up Games Magazine looking for little problems to solve, this book is for you.
›
Gehen Sie zu Amazon.com, um alle 20 Rezensionen zu sehen
3.4 von 5 Sternen
Waren diese Rezensionen hilfreich?
Wir wollen von Ihnen hören.
Kunden diskutieren
|
Das Forum zu diesem Produkt
Fragen stellen, Meinungen austauschen, Einblicke gewinnen Aktive Diskussionen in ähnlichen Foren
Kundendiskussionen durchsuchen
|
Ähnliche Foren
|
||||||||||||||||||||||||||||||||||
Lieblingslisten
Ähnliche Artikel finden
Ihr Kommentar
Möchten Sie die Produktinformationen aktualisieren oder Feedback zu den Produktabbildungen geben?
|
