Welcome to P K Kelkar Library, Online Public Access Catalogue (OPAC)

Normal view MARC view ISBD view

How to think about algorithms

By: Edmonds, Jeff.
Publisher: New Delhi Cambridge University Press 2008Description: xiii, 448p.ISBN: 9781107439887.Subject(s): Algorithms-study and teachingDDC classification: 518.1 | Ed56h Summary: This textbook, for second- or third-year students of computer science, presents insights, notations, and analogies to help them describe and think about algorithms like an expert, without grinding through lots of formal proof. Solutions to many problems are provided to let students check their progress, while class-tested PowerPoint slides are on the web for anyone running the course. By looking at both the big picture and easy step-by-step methods for developing algorithms, the author guides students around the common pitfalls. He stresses paradigms such as loop invariants and recursion to unify a huge range of algorithms into a few meta-algorithms. The book fosters a deeper understanding of how and why each algorithm works. These insights are presented in a careful and clear way, helping students to think abstractly and preparing them for creating their own innovative ways to solve problems.
List(s) this item appears in: New arrival January 7-13, 2019
    average rating: 0.0 (0 votes)
Item type Current location Collection Call number Status Date due Barcode Item holds
Books Books PK Kelkar Library, IIT Kanpur
General Stacks 518.1 Ed56h (Browse shelf) Available A184165
Total holds: 0

This textbook, for second- or third-year students of computer science, presents insights, notations, and analogies to help them describe and think about algorithms like an expert, without grinding through lots of formal proof. Solutions to many problems are provided to let students check their progress, while class-tested PowerPoint slides are on the web for anyone running the course. By looking at both the big picture and easy step-by-step methods for developing algorithms, the author guides students around the common pitfalls. He stresses paradigms such as loop invariants and recursion to unify a huge range of algorithms into a few meta-algorithms. The book fosters a deeper understanding of how and why each algorithm works. These insights are presented in a careful and clear way, helping students to think abstractly and preparing them for creating their own innovative ways to solve problems.

There are no comments for this item.

Log in to your account to post a comment.

Powered by Koha