𝔖 Scriptorium
✦   LIBER   ✦

πŸ“

Data Structures and Algorithms with Scala: A Practitioner's Approach with Emphasis on Functional Programming

✍ Scribed by Bhim P. Upadhyaya


Publisher
Springer International Publishing
Year
2019
Tongue
English
Leaves
164
Series
Undergraduate Topics in Computer Science
Edition
1st ed.
Category
Library

⬇  Acquire This Volume

No coin nor oath required. For personal study only.

✦ Synopsis


This practically-focused textbook presents a concise tutorial on data structures and algorithms using the object-functional language Scala. The material builds upon the foundation established in the title Programming with Scala: Language Exploration by the same author, which can be treated as a companion text for those less familiar with Scala.

Topics and features: discusses data structures and algorithms in the form of design patterns; covers key topics on arrays, lists, stacks, queues, hash tables, binary trees, sorting, searching, and graphs; describes examples of complete and running applications for each topic; presents a functional approach to implementations for data structures and algorithms (excepting arrays); provides numerous challenge exercises (with solutions), encouraging the reader to take existing solutions and improve upon them; offers insights from the author’s extensive industrial experience; includes a glossary, and an appendix supplying an overview of discrete mathematics.

Highlighting the techniques and skills necessary to quickly derive solutions to applied problems, this accessible text will prove invaluable to time-pressured students and professional software engineers.

✦ Table of Contents


Front Matter ....Pages i-xvii
Foundational Components (Bhim P. Upadhyaya)....Pages 1-18
Fundamental Algorithms (Bhim P. Upadhyaya)....Pages 19-26
Arrays (Bhim P. Upadhyaya)....Pages 27-34
Lists (Bhim P. Upadhyaya)....Pages 35-43
Stacks (Bhim P. Upadhyaya)....Pages 45-50
Queues (Bhim P. Upadhyaya)....Pages 51-56
Hash Tables (Bhim P. Upadhyaya)....Pages 57-66
Binary Trees (Bhim P. Upadhyaya)....Pages 67-75
Sorting (Bhim P. Upadhyaya)....Pages 77-90
Searching (Bhim P. Upadhyaya)....Pages 91-100
Graphs (Bhim P. Upadhyaya)....Pages 101-120
Back Matter ....Pages 121-154

✦ Subjects


Computer Science; Programming Languages, Compilers, Interpreters; Data Structures; Algorithm Analysis and Problem Complexity; Professional Computing


πŸ“œ SIMILAR VOLUMES


Learning F# Functional Data Structures a
✍ Masood A. πŸ“‚ Library 🌐 English

Packt Publishing, 2015. β€” 274 p. β€” ISBN: 9781783558476<div class="bb-sep"></div>F# is a multi-paradigm programming language that encompasses object-oriented, imperative, and functional programming language properties. The F# functional programming language enables developers to write simple code to

Hands-On Data Structures and Algorithms
✍ Claus Matzinger πŸ“‚ Library πŸ“… 2019 πŸ› Packt Publishing Ltd. 🌐 English

Rust has come a long way and is now utilized in several contexts. Its key strengths are its software infrastructure and resource-constrained applications, including desktop applications, servers, and performance-critical applications, not forgetting its importance in systems' programming. This book