Название: Algorithm and Design Complexity
Автор: Anli Sherine, Mary Jasmine, Geno Peter, S. Albert Alexander
Издательство: CRC Press
Год: 2023
Страниц: 196
Язык: английский
Формат: pdf (true)
Размер: 10.2 MB

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.

Both the science and the practice of computers are centered on algorithms. Since this truth has been acknowledged, numerous textbooks on the topic have come to be. Generally speaking, they present algorithms in one of two ways. One categorizes algorithms based on a certain problem category. The three main objectives of this book are to raise awareness of the impact that algorithms can have on the effectiveness of a program, enhance algorithm design skills, and develop the abilities required to analyze any algorithms that are utilized in programs. Today’s commercial goods give the impression that some software developers don’t give space and time efficiency any thought. They anticipate that if a program uses too much memory, the user will purchase additional memory. They anticipate that if an application takes too long, the customer will get a faster machine.

The emphasis on algorithm design techniques is due to three main factors. First off, using these strategies gives a pupil the means to create algorithms for brand-new issues. As a result, studying algorithm design approaches is a highly beneficial activity. Second, they attempt to categorize numerous existing algorithms in accordance with a fundamental design principle. One of the main objectives of Computer Science education should be to teach students to recognize such similarities among algorithms from various application domains. After all, every science views the classification of its main topic as a major, if not the discipline’s focal point. Third, we believe that techniques for designing algorithms are useful as generic approaches to solving issues that transcend beyond those related to computing. There are a number of significant issues, both theoretically and educationally. This book is intended as a manual on algorithm design, providing access to combinatorial algorithm technology for both student and computer professionals.

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 (IT), and electrical engineering.