• Title: Problems on Algorithms, 2nd Edition
• Author(s) Ian Parberry and William Gasarch
• Publisher: Prentice Hall; 1st edition (1995), eBook (2nd Edition, 2002)
• Hardcover/Paperback: 180 pages
• eBook: PDF (268 pages, 1.4 MB)
• Language: English
• ISBN-10/ASIN: 0134335589
• ISBN-13: 978-0134335582
• Share This:  

Book Description

An algorithm is nothing more than a step-by-step procedure for solving a problem. The algorithms you'll use most often as a programmer have already been discovered, tested, and proven.

Too often the problem sets in standard algorithm texts are composed of small, idiosyncratic units of busy-work and irrelevant questions - forcing instructors into the time-consuming task of finding or composing additional problems. Designed to fill that gap, this supplement provides an extensive and varied collection of useful, practical problems on the design, analysis, and verification of algorithms.

• Ian Parberry a Professor Emeritus in the Department of Computer Science & Engineering at the University of North Texas, and is internationally recognized as one of the top academics teaching computer game programming with DirectX.

• Amazon

• Algorithms and Data Structures
• Computational Complexity
• Combinatorics and Game Theory
• Discrete and Finite Mathematics
• Operations Research and Optimization

• Problems on Algorithms, 2nd Edition (Ian Parberry, et al.)
• The Mirror Site (1) - PDF
• The Mirror Site (1) - PDF

• Algorithm Design (Jon Kleinberg, et al)

  This book introduces algorithms by looking at the real-world problems that motivate them. The book teaches a range of design and analysis techniques for problems that arise in computing applications.

• Lecture Notes for the Algorithms (Jeff Erickson)

  This lecture notes uniquely combines rigor and comprehensiveness. It covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study.

• The Little Book of Algorithms (William Lau)

  This workbook is designed to help those learning and teaching Computer Science at secondary school level. The aim of the book is to help students build fluency in their Python programming.

• Algorithms: Fundamental Techniques (Macneil Shonle, et al)

  The goal of the book is to show you how you can methodically apply different techniques to your own algorithms to make them more efficient. While this book mostly highlights general techniques, some well-known algorithms are also looked at in depth.

• Elementary Algorithms (Xinyu Liu)

  This book doesn't only focus on an imperative (or procedural) approach, but also includes purely functional algorithms and data structures. It teaches you how to think like a programmer - find the practical efficiency algorithms to solve your problems.

• Algorithms, 4th Edition, by Robert Sedgewick and Kevin Wayne

  It surveys the most important algorithms and data structures in use today. Applications to science, engineering, and industry are a key feature of the book. We motivate each algorithm that we address by examining its impact on specific applications.

• Algorithms (Sanjoy Dasgupta, et al)

  This book, extensively class-tested over a decade at UC Berkeley and UC San Diego, explains the fundamentals of algorithms in a story line that makes the material enjoyable and easy to digest.

• The Algorithm Design Manual (Steven S. Skiena)

  This book serves as the primary textbook for any algorithm design course while maintaining its status as the premier practical reference guide to algorithms, intended as a manual on algorithm design for both students and computer professionals.