Algorithm Design and Applications

Regular price €192.14
Quantity:
In stock with our UK publisher. 14-28 days
Delivery/Collection within 10-20 working days
14 days return policy Shipping & Delivery
A01=Michael T. Goodrich
A01=Roberto Tamassia
Age Group_Uncategorized
Age Group_Uncategorized
algorithm
algorithms
applications
Author_Michael T. Goodrich
Author_Roberto Tamassia
automatic-update
basicdatastructures
bound
case
Category1=Non-Fiction
Category=UMB
comparisonbased sorting
COP=United States
Delivery_Delivery within 10-20 working days
eq_bestseller
eq_computing
eq_isMigrated=2
eq_nobargain
eq_non-fiction
exercises
fundamental
implementation
Language_English
lower
mergesortandquicksort
PA=Available
part
Price_€100 and above
priority
PS=Active
softlaunch
sort
structures
study

Product details

  • ISBN 9781118335918
  • Weight: 1565g
  • Dimensions: 211 x 254mm
  • Publication Date: 19 Dec 2014
  • Publisher: John Wiley & Sons Inc
  • Publication City/Country: US
  • Product Form: Hardback
  • Language: English
Secure checkout Fast Shipping Easy returns

Introducing a NEW addition to our growing library of computer science titles, Algorithm Design and Applications, by Michael T. Goodrich & Roberto Tamassia! Algorithms is a course required for all computer science majors, with a strong focus on theoretical topics. Students enter the course after gaining hands-on experience with computers, and are expected to learn how algorithms can be applied to a variety of contexts. This new book integrates application with theory.

Goodrich & Tamassia believe that the best way to teach algorithmic topics is to present them in a context that is motivated from applications to uses in society, computer games, computing industry, science, engineering, and the internet. The text teaches students about designing and using algorithms, illustrating connections between topics being taught and their potential applications, increasing engagement. 

Michael T. Goodrich received his B.A. in Mathematics and Computer Science from Calvin College in 1983 and his PhD in Computer Sciences from Purdue University in 1987. Dr. Goodrich's research is directed at the design of high performance algorithms and data structures for solving large-scale problems motivated from information assurance and security, the Internet, Bioinformatics, and geometric computing. He has pioneered and led research on efficient solutions to a number of fundamental problems, including sorting, convex hull construction, linear programming, privacy-preserving data access, network traceback, and data authentication.

More from this author