Code: 04093317
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. Sol ... more
English
Enter your e-mail address and once book will be available,
we will send you a message. It's that simple.
You get 136 loyalty points
Book synopsis
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.
Book details
Book category Books in English Computing & information technology Computer science Mathematical theory of computation
56 €
English
Collection points Bratislava a 12833 dalších
Copyright ©2008-26 najlacnejsie-knihy.sk All rights reservedPrivacyCookies
25670 collection points
Delivery 2.99 €
02/210 210 99 (8-15.30h)Shopping cart ( Empty )