Become a Readings Member to make your shopping experience even easier. Sign in or sign up for free!

Become a Readings Member. Sign in or sign up for free!

Hello Readings Member! Go to the member centre to view your orders, change your details, or view your lists, or sign out.

Hello Readings Member! Go to the member centre or sign out.

 
Hardback

Algorithms for Functional Programming

$198.99
Sign in or become a Readings Member to add this title to your wishlist.

High Algorithms is a text geared to a junior level course in algorithms using Scheme as the programming language. Using the high- level language Scheme allows the author to make extensive use of concise yet highly readable source code or psuedocode for the implementation of all the algorithms covered in the book. This avoids a major weakness of other books currently used as texts for a course in algorithms. The resulting book covers all the traditional algorithms and introduces students to abstractions in a gradual and sensible manner. It is a light and lively presentation including prose descriptions, mathematical presntations and psuedocode for a comprehensive list of the major algorithms. The book lends itself to an accompanying lab on the topic and much supporting material both for teachers and readers or students is available at the accompanying website for the book.

Read More
In Shop
Out of stock
Shipping & Delivery

$9.00 standard shipping within Australia
FREE standard shipping within Australia for orders over $100.00
Express & International shipping calculated at checkout

MORE INFO
Format
Hardback
Publisher
Springer-Verlag New York Inc.
Country
United States
Date
1 November 2004
Pages
265
ISBN
9780387955704

High Algorithms is a text geared to a junior level course in algorithms using Scheme as the programming language. Using the high- level language Scheme allows the author to make extensive use of concise yet highly readable source code or psuedocode for the implementation of all the algorithms covered in the book. This avoids a major weakness of other books currently used as texts for a course in algorithms. The resulting book covers all the traditional algorithms and introduces students to abstractions in a gradual and sensible manner. It is a light and lively presentation including prose descriptions, mathematical presntations and psuedocode for a comprehensive list of the major algorithms. The book lends itself to an accompanying lab on the topic and much supporting material both for teachers and readers or students is available at the accompanying website for the book.

Read More
Format
Hardback
Publisher
Springer-Verlag New York Inc.
Country
United States
Date
1 November 2004
Pages
265
ISBN
9780387955704