Cantitate/Preț
Produs

Algorithms and Programming: Problems and Solutions: Springer Undergraduate Texts in Mathematics and Technology

Autor Alexander Shen
en Limba Engleză Paperback – 17 dec 2009
Algorithms and Programming is primarily intended for use in a first-year undergraduate course in programming. It is structured in a problem-solution format that requires the student to think through the programming process, thus developing an understanding of the underlying theory. The book is easily readable by a student taking a basic introductory course in computer science as well as useful for a graduate-level course in the analysis of algorithms and/or compiler construction.
Each self-contained chapter presents classical and well-known problems supplemented by clear and in-depth explanations. The material covered includes such topics as combinatorics, sorting, searching, queues, grammar and parsing, selected well-known algorithms and much more. Students and teachers will find this both an excellent text for learning programming and a source of problems for a variety of courses.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 38064 lei  6-8 săpt.
  Springer – 17 dec 2009 38064 lei  6-8 săpt.
Hardback (1) 48281 lei  6-8 săpt.
  Springer – 17 dec 2009 48281 lei  6-8 săpt.

Din seria Springer Undergraduate Texts in Mathematics and Technology

Preț: 38064 lei

Nou

Puncte Express: 571

Preț estimativ în valută:
7285 7593$ 6065£

Carte tipărită la comandă

Livrare economică 07-21 ianuarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9781493937004
ISBN-10: 1493937006
Pagini: 272
Ilustrații: XII, 272 p.
Dimensiuni: 178 x 254 x 15 mm
Greutate: 0.5 kg
Ediția:2nd ed. 2010
Editura: Springer
Colecția Springer
Seria Springer Undergraduate Texts in Mathematics and Technology

Locul publicării:New York, NY, United States

Cuprins

Variables, 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).

Recenzii

From the reviews:
"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
From the reviews of the second edition:
“An excellent source of material for college students … and for their teachers. … it contains a lot of great information for the computer science student. Ideally, students would acquire this book in their freshman year and begin using it as soon as they learn the basics of procedural programming. They will then find this book an excellent companion, as they develop their analytical and programming skills throughout the curriculum. … This book is a delight to read and work with. I highly recommend it.” (Edgar R. Chavez, ACM Computing Reviews, December, 2010)

Textul de pe ultima copertă

"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

Caracteristici

This second edition contains problems from new topics including suffix trees, games and strategies, and Huffman coding Good undergraduate introduction to programming course, especially one which is mathematically motivated May also be used as a textbook in a graduate course on the analysis of algorithms and/or compiler construction The "problem and solution" style makes the reader think through the programming process, making the book ideal for students in the classroom setting or for self study