Algorithms and Programming: Problems and Solutions / Edition 2

by Alexander Shen

Overview

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.

Product Details

ISBN-13:	9781441917478
Publisher:	Springer New York
Publication date:	12/17/2009
Series:	Springer Undergraduate Texts in Mathematics and Technology
Edition description:	2nd ed. 2010
Pages:	272
Product dimensions:	7.20(w) x 9.30(h) x 0.80(d)

Table of Contents

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

Editorial Reviews

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)

From the Publisher

Intended for the first-year undergraduate course in programming, this text covers such topics as combinatorics, sorting, searching, queues, grammar and parsing, and selected well-known algorithms. Programs are written in Pascal, but any other procedural language (e.g., Modula, Oberon, C) may be used instead. Annotation c. by Book News, Inc., Portland, Or.

Booknews