ALGORITHMS AND PROGRAMMING PROBLEMS AND SOLUTIONS 2ED (PB 2010)

SHEN A.

ISBN 10: 1493937006 / ISBN 13: 9781493937004

Published by SPRINGER, 2010

About this Item

Brand New ! Fast Delivery "International Edition " and ship within 24-48 hours. Deliver by FedEx and Dhl, & Aramex, UPS, & USPS and we do accept APO and PO BOX Addresses. Order can be delivered worldwide within 4-6 Working days .and we do have flat rate for up to 2LB. Extra shipping charges will be requested This Item May be shipped from India, United states & United Kingdom. Depending on your location and availability.

Seller Inventory # CVS 9781493937004

Bibliographic Details

• Title: ALGORITHMS AND PROGRAMMING PROBLEMS AND SOLUTIONS 2ED (PB 2010)
• Publisher: SPRINGER
• Publication Date: 2010
• Language: English
• ISBN 10: 1493937006
• ISBN 13: 9781493937004
• Binding: Soft cover
• Edition: 2nd Edition, International Edition
• Condition: New

About this title

Synopsis

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.

From the Back Cover

"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