Algorithms and Programming: Problems and Solutions | SpringerLink
Skip to main content

Algorithms and Programming

Problems and Solutions

  • Textbook
  • © 2010
  • Latest edition

Overview

  • 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

This is a preview of subscription content, log in via an institution to check access.

Access this book

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

eBook JPY 5376
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book JPY 6720
Price includes VAT (Japan)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book JPY 9294
Price includes VAT (Japan)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

About this book

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.

Similar content being viewed by others

Keywords

Table of contents (16 chapters)

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)

Authors and Affiliations

  • de Marseille (LIF) CNRS, Université de la Méditerranée, Laboratoire d’Informatique Fondamentale, Marseille CX 13, France

    Alexander Shen

Bibliographic Information

Publish with us