MARC details
| 000 -LEADER |
|---|
| fixed length control field |
04792nam a2200553Mi 4500 |
| 001 - CONTROL NUMBER |
|---|
| control field |
36843 |
| 003 - CONTROL NUMBER IDENTIFIER |
|---|
| control field |
BD-DhAAL |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20200101154620.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
200101t2017 gw o 000 0 eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
9783319725468 |
|
|---|
| International Standard Book Number |
9783319725475 |
|
|---|
| International Standard Book Number |
3319725475 |
| 035 ## - SYSTEM CONTROL NUMBER |
|---|
| System control number |
(OCoLC)1021187473 |
|
|---|
| System control number |
(OCoLC)1019708993 |
| 040 ## - CATALOGING SOURCE |
|---|
| Original cataloging agency |
AZU |
| Language of cataloging |
eng |
| Transcribing agency |
AZU |
| Modifying agency |
OCLCO |
| -- |
GW5XE |
| -- |
OCLCF |
| -- |
BD-DhAAL |
| 049 ## - LOCAL HOLDINGS (OCLC) |
|---|
| Holding library |
MYGG |
| 050 #4 - LIBRARY OF CONGRESS CALL NUMBER |
|---|
| Classification number |
QA76.6-76.66 |
| 082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER |
|---|
| Classification number |
005.1 |
| Edition number |
23 |
| 100 1# - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Laaksonen, Antti |
| 9 (RLIN) |
38774 |
| 245 10 - TITLE STATEMENT |
|---|
| Title |
Guide to Competitive Programming : |
| Remainder of title |
learning and improving algorithms through contests / |
| Statement of responsibility, etc |
Antti Laaksonen. |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) |
|---|
| Place of publication, distribution, etc |
Cham : |
| Name of publisher, distributor, etc |
Springer : |
| -- |
c2017 |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
xii, 283 pages : |
| Other physical details |
illustrations ; |
| 490 1# - SERIES STATEMENT |
|---|
| Series statement |
Undergraduate Topics in Computer Science, |
| International Standard Serial Number |
1863-7310 |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE |
|---|
| Bibliography, etc |
Includes bibliographical references and index. |
| 505 0# - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
Introduction -- Programming Techniques -- Efficiency -- Sorting and Searching -- Data Structures -- Dynamic Programming -- Graph Algorithms -- Algorithm Design Topics -- Range Queries -- Tree Algorithms -- Mathematics -- Advanced Graph Algorithms -- Geometry -- String Algorithms -- Additional Topics -- Appendix A: Mathematical Background. |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc |
This invaluable textbook presents a comprehensive introduction to modern competitive programming. The text highlights how competitive programming has proven to be an excellent way to learn algorithms, by encouraging the design of algorithms that actually work, stimulating the improvement of programming and debugging skills, and reinforcing the type of thinking required to solve problems in a competitive setting. The book contains many "folklore" algorithm design tricks that are known by experienced competitive programmers, yet which have previously only been formally discussed in online forums and blog posts. Topics and features: Reviews the features of the C++ programming language, and describes how to create efficient algorithms that can quickly process large data sets Discusses sorting algorithms and binary search, and examines a selection of data structures of the C++ standard library Introduces the algorithm design technique of dynamic programming, and investigates elementary graph algorithms Covers such advanced algorithm design topics as bit-parallelism and amortized analysis, and presents a focus on efficiently processing array range queries Surveys specialized algorithms for trees, and discusses the mathematical topics that are relevant in competitive programming Examines advanced graph techniques, geometric algorithms, and string techniques Describes a selection of more advanced topics, including square root algorithms and dynamic programming optimization This easy-to-follow guide is an ideal reference for all students wishing to learn algorithms, and practice for programming contests. Knowledge of the basics of programming is assumed, but previous background in algorithm design or programming contests is not necessary. Due to the broad range of topics covered at various levels of difficulty, this book is suitable for both beginners and more experienced readers. Dr. Antti Laaksonen has worked as a teacher and researcher at the University of Helsinki and Aalto University, Finland. He has served as one of the organizers of the Finnish Olympiad in Informatics since 2008, and as the Scientific Chair of the Baltic Olympiad in Informatics in 2016. He has also coached and led the Finnish team at several international programming contests, including the International Olympiad in Informatics 2009?2016, and has established experience in teaching programming and algorithms. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Computer science. |
| 9 (RLIN) |
38775 |
|
|---|
| Topical term or geographic name as entry element |
Computer programming. |
| 9 (RLIN) |
38776 |
|
|---|
| Topical term or geographic name as entry element |
Algorithms. |
| 9 (RLIN) |
38777 |
|
|---|
| Topical term or geographic name as entry element |
Education |
| General subdivision |
Data processing. |
| 9 (RLIN) |
38778 |
| 655 #4 - INDEX TERM--GENRE/FORM |
|---|
| Genre/form data or focus term |
Electronic books. |
| -- |
38779 |
| 830 ## - SERIES ADDED ENTRY--UNIFORM TITLE |
|---|
| Uniform title |
Undergraduate Topics in Computer Science |
| 9 (RLIN) |
38780 |
| 852 ## - LOCATION/CALL NUMBER |
|---|
| Location |
Ayesha Abed Library |
| Shelving location |
General Stacks |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) |
|---|
| Source of classification or shelving scheme |
Dewey Decimal Classification |
| Item type |
Book |
