000 03717nam a22005175i 4500
001 978-1-4419-1748-5
003 DE-He213
005 20140220084507.0
007 cr nn 008mamaa
008 100803s2010 xxu| s |||| 0|eng d
020 _a9781441917485
_9978-1-4419-1748-5
024 7 _a10.1007/978-1-4419-1748-5
_2doi
050 4 _aQA76.9.A43
072 7 _aPBKS
_2bicssc
072 7 _aCOM051300
_2bisacsh
082 0 4 _a518.1
_223
100 1 _aShen, Alexander.
_eauthor.
245 1 0 _aAlgorithms and Programming
_h[electronic resource] :
_bProblems and Solutions /
_cby Alexander Shen.
250 _a2.
264 1 _aNew York, NY :
_bSpringer New York :
_bImprint: Springer,
_c2010.
300 _aXII, 272 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aSpringer Undergraduate Texts in Mathematics and Technology,
_x1867-5506
505 0 _aVariables, expressions, assignments -- Generation of combinatorial objects -- Tree traversal (backtracking) -- Sorting -- Finite-state algorithms in text processing -- Data types -- Recursion -- Recursive and non-recursive programs -- Graph algorithms -- Pattern matching -- Games analysis -- Optimal coding -- Set representation. Hashing -- Sets, trees, and balanced trees -- Context-free grammars -- Left-to-right parsing (LR).
520 _a"Algorithms and Programming" is primarily intended for a first year undergraduate course in programming. Structured in a problem-solution format, the text motivates the student to think through the programming process, thus developing a firm understanding of the underlying theory. Although a moderate familiarity with programming is assumed, the book is easily utilized by students new to computer science. The more advanced chapters make the book useful for a graduate course in the analysis of algorithms and/or compiler construction. New to the second edition are added chapters on suffix trees, games and strategies, and Huffman coding as well as an appendix illustrating the ease of conversion from Pascal to C. The material covers such topics as combinatorics, sorting, searching, queues, grammar and parsing, selected well-known algorithms, and much more. Reviews of the 1st Edition: "The book is addressed both to ambitious students and instructors looking for interesting problems [and] fulfills this task perfectly, especially if the reader has a good mathematical background." — Zentralblatt MATH "This book is intended for students, engineers, and other people who want to improve their computer skills.... The chapters can be read independently. Throughout the book, useful exercises give readers a feeling for how to apply the theory." — Computing Reviews "Overall...the book is well done. I recommend it to teachers and those wishing to sharpen their data structure and compiler skills." — SIGACT News
650 0 _aMathematics.
650 0 _aComputer science.
650 0 _aComputer software.
650 0 _aComputer science
_xMathematics.
650 0 _aAlgorithms.
650 1 4 _aMathematics.
650 2 4 _aAlgorithms.
650 2 4 _aProgramming Techniques.
650 2 4 _aComputational Mathematics and Numerical Analysis.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9781441917478
830 0 _aSpringer Undergraduate Texts in Mathematics and Technology,
_x1867-5506
856 4 0 _uhttp://dx.doi.org/10.1007/978-1-4419-1748-5
912 _aZDB-2-SMA
999 _c110462
_d110462