How to Think About Algorithms

Saved in:
Bibliographic Details
Title: How to Think About Algorithms
Description: 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.
Authors: Jeff Edmonds
Resource Type: eBook.
Subjects: Invariants--Study and teaching, Recursion theory--Study and teaching, Algorithms--Study and teaching, Loops (Group theory)--Study and teaching
Categories: MATHEMATICS / Numerical Analysis
Database: eBook Collection (EBSCOhost)
FullText Links:
  – Type: ebook-pdf
Text:
  Availability: 0
Header DbId: nlebk
DbLabel: eBook Collection (EBSCOhost)
An: 304647
RelevancyScore: 1018
AccessLevel: 6
PubType: eBook
PubTypeId: ebook
PreciseRelevancyScore: 1018.08020019531
IllustrationInfo
ImageInfo – Size: thumb
  Target: https://rps2images.ebscohost.com/rpsweb/othumb?id=NL$304647$PDF&s=r
– Size: medium
  Target: https://rps2images.ebscohost.com/rpsweb/othumb?id=NL$304647$PDF&s=d
Items – Name: Title
  Label: Title
  Group: Ti
  Data: How to Think About Algorithms
– Name: Abstract
  Label: Description
  Group: Ab
  Data: 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.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Jeff+Edmonds%22">Jeff Edmonds</searchLink>
– Name: TypePub
  Label: Resource Type
  Group: TypPub
  Data: eBook.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Invariants--Study+and+teaching%22">Invariants--Study and teaching</searchLink><br /><searchLink fieldCode="DE" term="%22Recursion+theory--Study+and+teaching%22">Recursion theory--Study and teaching</searchLink><br /><searchLink fieldCode="DE" term="%22Algorithms--Study+and+teaching%22">Algorithms--Study and teaching</searchLink><br /><searchLink fieldCode="DE" term="%22Loops+%28Group+theory%29--Study+and+teaching%22">Loops (Group theory)--Study and teaching</searchLink>
– Name: SubjectBISAC
  Label: Categories
  Group: Su
  Data: <searchLink fieldCode="ZK" term="%22MATHEMATICS+%2F+Numerical+Analysis%22">MATHEMATICS / Numerical Analysis</searchLink>
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=nlebk&AN=304647
RecordInfo BibRecord:
  BibEntity:
    Classifications:
      – Code: 518.1
        Scheme: ddc
        Type: prePub
    Languages:
      – Code: eng
        Text: English
    Subjects:
      – SubjectFull: Invariants--Study and teaching
        Type: general
      – SubjectFull: Recursion theory--Study and teaching
        Type: general
      – SubjectFull: Algorithms--Study and teaching
        Type: general
      – SubjectFull: Loops (Group theory)--Study and teaching
        Type: general
    Titles:
      – TitleFull: How to Think About Algorithms
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Jeff Edmonds
      – PersonEntity:
          Name:
            NameFull: Jeff Edmonds
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 01
              Type: published
              Y: 2008
            – D: 04
              M: 02
              Type: profile
              Y: 2014
          Identifiers:
            – Type: isbn-print
              Value: 9780521849319
            – Type: isbn-print
              Value: 9780521614108
            – Type: isbn-electronic
              Value: 9780511649882
          Titles:
            – TitleFull: How to Think About Algorithms
              Type: main
ResultId 1