Algorithm and Design Complexity

— —

Anli Sherine (University of Technology Sarawak, Malaysia) Mary Jasmine (Infant Jesus College of Engineering, India)

Algorithm and Design Complexity

Anli Sherine (University of Technology Sarawak, Malaysia), Mary Jasmine (Infant Jesus College of Engineering, India), Geno Peter (University of Technology Sarawak, Malaysia) , S. Albert Alexander (Vellore Institute of Technology, India)

$96.99

Paperback

Not in-store but you can order this
How long will it take?

Availability Information

We source books from suppliers in Australia and overseas. For books we don't currently have in stock, the time it takes to get them from our suppliers can vary widely - from a few days to a few months - so we check each book with each supplier to determine the expected time it will take to be supplied to us.

We then advise you accordingly. If the time taken to get any book is too long for you, you can let us know and we will cancel or adjust your order, and refund as required.

To find out the anticipated arrival time for specific items prior to ordering, please contact us by phone or email:

Phone +61 2 9264 3111, or 1800 4 BOOKS (1800 4 26657) if outside Sydney:
option 1 Abbey's Bookshop (Crime, History, Science, Kids & more) • info@abbeys.com.au
option 2 Language Book Centre (ESL & Foreign Languages) • language@abbeys.com.au
option 3 Galaxy Bookshop (Sci-fi, Fantasy, Romance, Graphic Novels) • sf@galaxybooks.com.au

QTY:

English

CRC Press
19 December 2024

Computing: general; Algorithms & data structures; Computer science

Computational complexity is critical in analysis of algorithms and is important to be able to select algorithms for efficiency and solvability. Algorithm and Design Complexity initiates with discussion of algorithm analysis, time-space trade-off, symptotic notations, and so forth. It further includes algorithms that are definite and effective, known as computational procedures. Further topics explored include divide-and-conquer, dynamic programming, and backtracking.

Features:

Includes complete coverage of basics and design of algorithms

Discusses algorithm analysis techniques like divide-and-conquer, dynamic programming, and greedy heuristics

Provides time and space complexity tutorials

Reviews combinatorial optimization of Knapsack problem

Simplifies recurrence relation for time complexity

This book is aimed at graduate students and researchers in computers science, information technology, and electrical engineering.

By: Anli Sherine (University of Technology Sarawak Malaysia), Mary Jasmine (Infant Jesus College of Engineering, India), Geno Peter (University of Technology Sarawak, Malaysia), S. Albert Alexander (Vellore Institute of Technology, India)
Imprint: CRC Press
Country of Publication: United Kingdom
Dimensions: Height: 234mm, Width: 156mm,
Weight: 360g
ISBN: 9781032409351
ISBN 10: 1032409355
Pages: 182
Publication Date: 19 December 2024
Audience: College/higher education , Professional and scholarly , Primary , Undergraduate
Format: Paperback
Publisher's Status: Active

1. Algorithm Analysis. 2. Divide and Conquer. 3. Dynamic programming. 4. Backtracking. 5. Graph.

Anli Sherine, S. Albert Alexander