Algorithms and Programming

Problems and Solutions

  • Alexander Shen

Table of contents

  1. Front Matter
    Pages -
  2. Alexander Shen
    Pages 1-31
  3. Alexander Shen
    Pages 33-48
  4. Alexander Shen
    Pages 49-59
  5. Alexander Shen
    Pages 61-76
  6. Alexander Shen
    Pages 77-82
  7. Alexander Shen
    Pages 83-101
  8. Alexander Shen
    Pages 103-118
  9. Alexander Shen
    Pages 119-128
  10. Alexander Shen
    Pages 129-137
  11. Alexander Shen
    Pages 139-165
  12. Alexander Shen
    Pages 167-183
  13. Alexander Shen
    Pages 185-193
  14. Alexander Shen
    Pages 195-202
  15. Alexander Shen
    Pages 203-220
  16. Alexander Shen
    Pages 221-242
  17. Alexander Shen
    Pages 243-256
  18. Back Matter
    Pages -

About this book

Introduction

"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

Keywords

Computation Computer Science Context Free Grammars Finite-State Automata Graph Huffman Matching Mathematical Programming Problem Solving Processing Programming Solutions algorithms recursion sorting

Authors and affiliations

  • Alexander Shen
    • 1
  1. 1.de Marseille (LIF) CNRS, Université de la MéditerranéeLaboratoire d’Informatique FondamentaleMarseille CX 13France

Bibliographic information

  • DOI https://doi.org/10.1007/978-1-4419-1748-5
  • Copyright Information Springer Science+Business Media, LLC 2010
  • Publisher Name Springer, New York, NY
  • eBook Packages Mathematics and Statistics
  • Print ISBN 978-1-4419-1747-8
  • Online ISBN 978-1-4419-1748-5
  • Series Print ISSN 1867-5506
  • Series Online ISSN 1867-5514
  • About this book