東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

The art of algorithm design

Mohanty, Sachi Nandan.

Linked to FindBook

Google Book

Amazon

博客來

The art of algorithm design

Record Type:	Electronic resources : Monograph/item
Title/Author:	The art of algorithm design/ Sachi Nandan Mohanty, Pabitra Kumar Tripathy, Suneeta Satpathy.
Author:	Mohanty, Sachi Nandan.
other author:	Tripathy, Pabitra Kumar.
Published:	Boca Raton, FL :Chapman & Hall/CRC Press, : 2022.,
Description:	1 online resource (xix, 298 p.) :ill.
[NT 15003449]:	Chapter 1, Fundamental Concepts of Data Structure -- Chapter 2, Concepts of Algorithms and Recurrences -- Chapter 3, Divide-and-Conquer Techniques -- Chapter 4, Dynamic Programming -- Chapter 5, Greedy Algorithms -- Chapter 6, Graph -- Chapter 7, Approximation Algorithms -- Chapter 8, Matrix Operations, Linear Programming, Polynomial and FFT -- Chapter 9, Number Theoretic Algorithms -- Chapter 10, Programming Implementations of the Algorithms.
Subject:	Computer algorithms. -
Online resource:	https://www.taylorfrancis.com/books/9781003093886
ISBN:	9781003093886

The art of algorithm design
Mohanty, Sachi Nandan.

The art of algorithm design[electronic resource] /Sachi Nandan Mohanty, Pabitra Kumar Tripathy, Suneeta Satpathy. - 1st ed. - Boca Raton, FL :Chapman & Hall/CRC Press,2022. - 1 online resource (xix, 298 p.) :ill.

Includes bibliographical references and index.

Chapter 1, Fundamental Concepts of Data Structure -- Chapter 2, Concepts of Algorithms and Recurrences -- Chapter 3, Divide-and-Conquer Techniques -- Chapter 4, Dynamic Programming -- Chapter 5, Greedy Algorithms -- Chapter 6, Graph -- Chapter 7, Approximation Algorithms -- Chapter 8, Matrix Operations, Linear Programming, Polynomial and FFT -- Chapter 9, Number Theoretic Algorithms -- Chapter 10, Programming Implementations of the Algorithms.

The Art of Algorithm Design is a complementary perception of all books on algorithm design and is a roadmap for all levels of learners as well as professionals dealing with algorithmic problems. Further, the book provides a comprehensive introduction to algorithms and covers them in considerable depth, yet makes their design and analysis accessible to all levels of readers. All algorithms are described and designed with a "pseudo-code" to be readable by anyone with little knowledge of programming. This book comprises of acomprehensive set of problems and their solutions against each algorithm to demonstrate its executional assessment and complexity, with an objective to: Understand the introductory concepts and design principles of algorithms and their complexities Demonstrate the programming implementations of all the algorithms using C-Language Be an excellent handbook on algorithms with self-explanatory chapters enriched with problems and solutions While other books may also cover some of the same topics, this book is designed to be both versatile and complete as it traverses through step-by-step concepts and methods for analyzing each algorithmic complexity with pseudo-code examples. Moreover, the book provides an enjoyable primer to the field of algorithms. This book is designed for undergraduates and postgraduates studying algorithm design. Sachi Nandan Mohanty is an Associate Professor in the Department of Computer Engineering, College of Engineering Pune, India, with 11 years of teaching and research experience in Algorithm Design, Computer Graphics, and Machine Learning. Pabitra Kumar Tripathy is the Head of the Department of Computer Science & Engineering, Kalam Institute of Technology, Berhampur, India, with 15 years of teaching experience in Programming Languages, Algorithms, and Theory of Computation. Suneeta Satpathy is an Associate Professor in the Department of Computer Science at Sri Sri University, Cuttack, Odisha, India, with 13 years of teaching experience in Computer Programming, Problem-Solving Techniques, and Decision Mining.

ISBN: 9781003093886Subjects--Topical Terms:

523872
Computer algorithms.

LC Class. No.: QA76.9.A43 / M64 2022

Dewey Class. No.: 005.13

The art of algorithm design
LDR:03776cmm a2200361 a 4500 001 2416455
005 20251017072503.0
006 m o d
007 cr cnu---unuuu
008 260303s2022 flua ob 001 0 eng d
020 $a 9781003093886 $q (electronic bk.)
020 $a 1003093884 $q (electronic bk.)
020 $a 9781000463781 $q (electronic bk.)
020 $a 1000463788 $q (electronic bk.)
020 $a 9781000463798 $q (electronic bk. ; $q EPUB)
020 $a 1000463796 $q (electronic bk. ; $q EPUB)
020 $z 9780367555269 $q (paperback)
020 $z 9780367555115 $q (hardcover)
035 $a (OCoLC)1273727467
035 $a (OCoLC-P)1273727467
035 $a 9781003093886
040 $a OCoLC-P $b eng $c OCoLC-P
041 0 $a eng
050 4 $a QA76.9.A43 $b M64 2022
082 0 4 $a 005.13 $2 23
100 1 $a Mohanty, Sachi Nandan. $3 3512959
245 1 4 $a The art of algorithm design $h [electronic resource] / $c Sachi Nandan Mohanty, Pabitra Kumar Tripathy, Suneeta Satpathy.
250 $a 1st ed.
260 $a Boca Raton, FL : $b Chapman & Hall/CRC Press, $c 2022.
300 $a 1 online resource (xix, 298 p.) : $b ill.
504 $a Includes bibliographical references and index.
505 0 $a Chapter 1, Fundamental Concepts of Data Structure -- Chapter 2, Concepts of Algorithms and Recurrences -- Chapter 3, Divide-and-Conquer Techniques -- Chapter 4, Dynamic Programming -- Chapter 5, Greedy Algorithms -- Chapter 6, Graph -- Chapter 7, Approximation Algorithms -- Chapter 8, Matrix Operations, Linear Programming, Polynomial and FFT -- Chapter 9, Number Theoretic Algorithms -- Chapter 10, Programming Implementations of the Algorithms.
520 $a The Art of Algorithm Design is a complementary perception of all books on algorithm design and is a roadmap for all levels of learners as well as professionals dealing with algorithmic problems. Further, the book provides a comprehensive introduction to algorithms and covers them in considerable depth, yet makes their design and analysis accessible to all levels of readers. All algorithms are described and designed with a "pseudo-code" to be readable by anyone with little knowledge of programming. This book comprises of acomprehensive set of problems and their solutions against each algorithm to demonstrate its executional assessment and complexity, with an objective to: Understand the introductory concepts and design principles of algorithms and their complexities Demonstrate the programming implementations of all the algorithms using C-Language Be an excellent handbook on algorithms with self-explanatory chapters enriched with problems and solutions While other books may also cover some of the same topics, this book is designed to be both versatile and complete as it traverses through step-by-step concepts and methods for analyzing each algorithmic complexity with pseudo-code examples. Moreover, the book provides an enjoyable primer to the field of algorithms. This book is designed for undergraduates and postgraduates studying algorithm design. Sachi Nandan Mohanty is an Associate Professor in the Department of Computer Engineering, College of Engineering Pune, India, with 11 years of teaching and research experience in Algorithm Design, Computer Graphics, and Machine Learning. Pabitra Kumar Tripathy is the Head of the Department of Computer Science & Engineering, Kalam Institute of Technology, Berhampur, India, with 15 years of teaching experience in Programming Languages, Algorithms, and Theory of Computation. Suneeta Satpathy is an Associate Professor in the Department of Computer Science at Sri Sri University, Cuttack, Odisha, India, with 13 years of teaching experience in Computer Programming, Problem-Solving Techniques, and Decision Mining.
588 $a OCLC-licensed vendor bibliographic record.
650 0 $a Computer algorithms. $3 523872
700 1 $a Tripathy, Pabitra Kumar. $3 3795159
700 1 $a Satpathy, Suneeta. $3 3590416
856 4 0 $u https://www.taylorfrancis.com/books/9781003093886