0
Your cart

Your cart is empty

Books > Computing & IT > General theory of computing > Data structures

Buy Now

Learning Functional Data Structures and Algorithms (Paperback) Loot Price: R1,166
Discovery Miles 11 660
Learning Functional Data Structures and Algorithms (Paperback): Atul S. Khot, Raju Kumar Mishra

Learning Functional Data Structures and Algorithms (Paperback)

Atul S. Khot, Raju Kumar Mishra

 (sign in to rate)
Loot Price R1,166 Discovery Miles 11 660 | Repayment Terms: R109 pm x 12*

Bookmark and Share

Expected to ship within 18 - 22 working days

Learn functional data structures and algorithms for your applications and bring their benefits to your work now About This Book * Moving from object-oriented programming to functional programming? This book will help you get started with functional programming. * Easy-to-understand explanations of practical topics will help you get started with functional data structures. * Illustrative diagrams to explain the algorithms in detail. * Get hands-on practice of Scala to get the most out of functional programming. Who This Book Is For This book is for those who have some experience in functional programming languages. The data structures in this book are primarily written in Scala, however implementing the algorithms in other functional languages should be straight forward. What You Will Learn * Learn to think in the functional paradigm * Understand common data structures and the associated algorithms, as well as the context in which they are commonly used * Take a look at the runtime and space complexities with the O notation * See how ADTs are implemented in a functional setting * Explore the basic theme of immutability and persistent data structures * Find out how the internal algorithms are redesigned to exploit structural sharing, so that the persistent data structures perform well, avoiding needless copying. * Get to know functional features like lazy evaluation and recursion used to implement efficient algorithms * Gain Scala best practices and idioms In Detail Functional data structures have the power to improve the codebase of an application and improve efficiency. With the advent of functional programming and with powerful functional languages such as Scala, Clojure and Elixir becoming part of important enterprise applications, functional data structures have gained an important place in the developer toolkit. Immutability is a cornerstone of functional programming. Immutable and persistent data structures are thread safe by definition and hence very appealing for writing robust concurrent programs. How do we express traditional algorithms in functional setting? Won't we end up copying too much? Do we trade performance for versioned data structures? This book attempts to answer these questions by looking at functional implementations of traditional algorithms. It begins with a refresher and consolidation of what functional programming is all about. Next, you'll get to know about Lists, the work horse data type for most functional languages. We show what structural sharing means and how it helps to make immutable data structures efficient and practical. Scala is the primary implementation languages for most of the examples. At times, we also present Clojure snippets to illustrate the underlying fundamental theme. While writing code, we use ADTs (abstract data types). Stacks, Queues, Trees and Graphs are all familiar ADTs. You will see how these ADTs are implemented in a functional setting. We look at implementation techniques like amortization and lazy evaluation to ensure efficiency. By the end of the book, you will be able to write efficient functional data structures and algorithms for your applications. Style and approach Step-by-step topics will help you get started with functional programming. Learn by doing with hands-on code snippets that give you practical experience of the subject.

General

Imprint: Packt Publishing Limited
Country of origin: United Kingdom
Release date: February 2017
Authors: Atul S. Khot • Raju Kumar Mishra
Dimensions: 235 x 191 x 17mm (L x W x T)
Format: Paperback
Pages: 318
ISBN-13: 978-1-78588-873-1
Categories: Books > Computing & IT > General theory of computing > Data structures
Books > Computing & IT > Computer programming > Algorithms & procedures
Promotions
LSN: 1-78588-873-0
Barcode: 9781785888731

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

You might also like..

Reachable Sets of Dynamic Systems…
Stanislaw Raczynski Paperback R3,927 Discovery Miles 39 270
Comprehensive Metaheuristics…
S. Ali Mirjalili, Amir Hossein Gandomi Paperback R3,956 Discovery Miles 39 560
A Textbook of Data Structures and…
Vijayalakshmi P Hardcover R3,522 Discovery Miles 35 220
MATLAB Applications in Engineering
Constantin Volosencu Hardcover R3,055 Discovery Miles 30 550
The Application of Ant Colony…
Ali Soofastaei Hardcover R2,553 Discovery Miles 25 530
Introduction to Chemical Engineering…
Henry C. Foley Paperback R3,120 Discovery Miles 31 200
A Textbook of Data Structures and…
Vijayalakshmi P Hardcover R3,522 Discovery Miles 35 220
Algorithms in Bioinformatics - Theory…
PA Gagniuc Hardcover R3,174 Discovery Miles 31 740
Coding for Kids in Python - Python…
Bob Mather Hardcover R851 Discovery Miles 8 510
Gamma Solution - An Application of…
James R Warren Hardcover R1,232 R1,048 Discovery Miles 10 480
GPU-based Parallel Implementation of…
Ying Tan Paperback R2,065 Discovery Miles 20 650
C Programming - C Programming Language…
Adam Dodson Hardcover R551 R505 Discovery Miles 5 050

See more

Partners