Algorithms / Panos Louridas.
By: Louridas, Panos [author.].
Series: The MIT Press essential knowledge series.Publisher: Cambridge, Massachusetts : The MIT Press, ©2020Description: 280 p: illustrations ; 18 cm.Content type: text Media type: unmediated Carrier type: volumeISBN: 9780262539029.Subject(s): Algorithms -- Popular works | Computer algorithms -- Popular worksGenre/Form: Print books.Summary: "This book is an introduction to algorithms targeting an audience with little to no computer science background. In this book, algorithms from a wide area are presented: from music to searching and sorting, to deep learning, to graphs. The author shows how algorithms are used in practice. A unique feature of the book is that it focuses on showing how algorithms really work; not just what algorithms can do. There are many books discussing that and delving in technological applications and their implications. The book aims to show not just what algorithms can do, but how they do it. Louridas covers a wide range of algorithms. He does not shy away from classic algorithms such as searching and sorting, as they are the workhorses of most applications; at the same time, he also covers a wide expanse, such as algorithms in music, non-traditional searching (like the secretary problem), graphs, and the PageRank algorithm. He introduces deep learning, showing how it works in practice, and gives an overview of the limits of computability. He finishes up the text with an eclectic discussion of implications. Most books on algorithms are either too technical, or not technical at all - showing what the algorithms do, without showing how. This book aims at striking a balance between the two methods. Algorithms should be, and can be explained, in simple terms. To repeat, an algorithm should be explained so that a human can execute it with a pen and paper"--Current location | Call number | Status | Date due | Barcode | Item holds |
---|---|---|---|---|---|
On Shelf | QA76.9.A43 L668 2020 (Browse shelf) | Available | AU00000000017621 |
Browsing Alfaisal University Shelves , Shelving location: On Shelf Close shelf browser
QA76.9 .A43 2024 Absolute beginner's guide to algorithms : a practical introduction to data structures and algorithms in javascript / | QA76.9.A43 C685 2013 Algorithms unlocked / | QA76.9.A43 E78 2017 Once upon an algorithm : how stories explain computing / | QA76.9.A43 L668 2020 Algorithms / | QA76.9.A43 L67 2017 Real-world algorithms : a beginner's guide / | QA76.9.A94 C74 2019 Creating augmented and virtual realities : theory and practice for next-generation spatial computing / | QA76.9.A94 P37 2017 Augmented human : how technology is shaping the new reality / |
Includes bibliographical references (pages [269]-274) and index.
"This book is an introduction to algorithms targeting an audience with little to no computer science background. In this book, algorithms from a wide area are presented: from music to searching and sorting, to deep learning, to graphs. The author shows how algorithms are used in practice. A unique feature of the book is that it focuses on showing how algorithms really work; not just what algorithms can do. There are many books discussing that and delving in technological applications and their implications. The book aims to show not just what algorithms can do, but how they do it. Louridas covers a wide range of algorithms. He does not shy away from classic algorithms such as searching and sorting, as they are the workhorses of most applications; at the same time, he also covers a wide expanse, such as algorithms in music, non-traditional searching (like the secretary problem), graphs, and the PageRank algorithm. He introduces deep learning, showing how it works in practice, and gives an overview of the limits of computability. He finishes up the text with an eclectic discussion of implications. Most books on algorithms are either too technical, or not technical at all - showing what the algorithms do, without showing how. This book aims at striking a balance between the two methods. Algorithms should be, and can be explained, in simple terms. To repeat, an algorithm should be explained so that a human can execute it with a pen and paper"--