Home » Techniques for Designing and Analyzing Algorithms
Product Image

Techniques for Designing and Analyzing Algorithms

Douglas R. Stinson
€72.99
Quantity:
In stock with our UK publisher. 14-28 days
Delivery/Collection within 10-20 working days
14 days return policy Shipping & Delivery
A01=Douglas R. Stinson
advanced algorithm design strategies
Age Group_Uncategorized
Age Group_Uncategorized
Algorithm Alg
Algorithm design
approximation methods
Author_Douglas R. Stinson
automatic-update
AVL Tree
Backtracking Algorithm
Binary Search Tree
Bounding Function
Category1=Non-Fiction
Category=UB
Category=UMB
Category=UY
COP=United Kingdom
Delivery_Delivery within 10-20 working days
Divide and conquer algorithms
Dynamic Programming Algorithm
Dynamic programming algorithms
eq_bestseller
eq_computing
eq_isMigrated=2
eq_nobargain
eq_non-fiction
Fibonacci Numbers
graph algorithms
graph traversal algorithms
Greedy Algorithm
Greedy algorithms
Greedy Schedule
Greedy Solution
Hamiltonian Cycle
Hamiltonian Path
Hash Table
Knapsack Problem
Language_English
memoisation techniques
Np Complete Problem
NP-hardness
PA=Available
polynomial time complexity
Polynomial Transformation
Price_€50 to €100
Priority Queue
Problem Instance
PS=Active
Recurrence Relation
recurrence relations
Recursion Tree
Recursive Calls
softlaunch
Stable Matching
Unit Cost Model
Vertex Cover
Wireless Access Points

Product details

  • ISBN 9781032024103
  • Weight: 920g
  • Dimensions: 178 x 254mm
  • Publication Date: 26 Aug 2024
  • Publisher: Taylor & Francis Ltd
  • Publication City/Country: GB
  • Product Form: Paperback
  • Language: English
Secure checkout Fast Shipping Easy returns
Description

Techniques for Designing and Analyzing Algorithms

Design and analysis of algorithms can be a difficult subject for students due to its sometimes-abstract nature and its use of a wide variety of mathematical tools. Here the author, an experienced and successful textbook writer, makes the subject as straightforward as possible in an up-to-date textbook incorporating various new developments appropriate for an introductory course.

This text presents the main techniques of algorithm design, namely, divide-and-conquer algorithms, greedy algorithms, dynamic programming algorithms, and backtracking. Graph algorithms are studied in detail, and a careful treatment of the theory of NP-completeness is presented.

In addition, the text includes useful introductory material on mathematical background including order notation, algorithm analysis and reductions, and basic data structures. This will serve as a useful review and reference for students who have covered this material in a previous course.

Features

  • The first three chapters provide a mathematical review, basic algorithm analysis, and data structures

  • Detailed pseudocode descriptions of the algorithms along with illustrative algorithms are included

  • Proofs of correctness of algorithms are included when appropriate

  • The book presents a suitable amount of mathematical rigor

After reading and understanding the material in this book, students will be able to apply the basic design principles to various real-world problems that they may encounter in their future professional careers.
About Douglas R. Stinson

Douglas R. Stinson obtained his PhD in Combinatorics and Optimization from the University of Waterloo in 1981. He held academic positions at the University of Manitoba and the University of Nebraska-Lincoln before returning to Waterloo in 1998. In 2019, Dr. Stinson retired from the David R. Cheriton School of Computer Science at the University of Waterloo and he now holds the title Professor Emeritus. His research interests include cryptography and computer security, combinatorics and coding theory, and applications of discrete mathematics in computer science. He was elected as a Fellow of the Royal Society of Canada in 2011. He has published almost 400 papers and several books, including Cryptography: Theory and Practice, Fourth Edition, also published by CRC Press.

More from this author