Functional Data Structures and Algorithms
0.0 (0 ratings)
Instead of using a simple lifetime average, Udemy calculates a course's star rating by considering a number of different factors such as the number of ratings, the age of ratings, and the likelihood of fraudulent ratings.
3 students enrolled
Wishlisted Wishlist

Please confirm that you want to add Functional Data Structures and Algorithms to your Wishlist.

Add to Wishlist

Functional Data Structures and Algorithms

Learn functional data structures and algorithms for your applications and bring their benefits to your work now
0.0 (0 ratings)
Instead of using a simple lifetime average, Udemy calculates a course's star rating by considering a number of different factors such as the number of ratings, the age of ratings, and the likelihood of fraudulent ratings.
3 students enrolled
Created by Packt Publishing
Last updated 7/2017
Current price: $10 Original price: $125 Discount: 92% off
5 hours left at this price!
30-Day Money-Back Guarantee
  • 2 hours on-demand video
  • Full lifetime access
  • Access on mobile and TV
  • Certificate of Completion
What Will I Learn?
  • Learn to think in the functional paradigm
  • Learn about the O notation
  • Take a look at runtime and space complexities
  • Explore the basic themes of immutability and persistent data structures
  • Learn to drop and concatenate lists
  • Learn to append and prepend lists
  • Take a look at building trees
  • Learn about the backtracking algorithm.
View Curriculum
  • This video course assumes you have some experience in functional programming languages.

Functional data structures have the power to improve the code base 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 a functional setting? Won’t we end up copying too much? Do we trade performance for versioned data structures? This course attempts to answer these questions by looking at functional implementations of traditional algorithms.

It begins with a refresher and consolidates 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. Moving on, you will learn about binary trees, where we will be building complete trees, greedy algorithms, and back tracking.

About the Author

Atul S. Khot grew up in Marathwada, a region of the state of Maharashtra, India. A self-taught programmer, he started writing software in C and C++. A Linux aficionado and a command-line guy at heart, Atul has always been a polyglot programmer. Having extensively programmed in Java and dabbled in multiple languages, these days he is getting increasingly hooked on Scala, Clojure, and Erlang. Atul is a frequent speaker at software conferences, and a past Dr. Dobb's product award judge. In his spare time, he loves to read classic British detective fiction. He is a foodie at heart and a pretty good cook. Atul someday dreams of working as a master chef, serving people with lip-smacking dishes.

He was the author of Scala Functional Programming Patterns published by Packt Publishing in December 2015. The book looks at traditional object-oriented design patterns and shows how we can use Scala's functional features instead.

Raju Kumar Mishra is a consultant and corporate trainer for big data and programming. After completing his B.Tech from Indian Institute of Technology (ISM) Dhanbad, he worked for Tata Steel. His deep passion for mathematics, data science, and programming took him to Indian Institute of Science (IISc). After graduating from IISc in computational science, he worked for Oracle as a performance engineer and software developer. He is an Oraclecertified associate for Java 7. He is a Hortonworks-certified Apache Hadoop Java developer, and holds a Developer Certification for Apache Spark (O'Reilly School of Technology and Databriks), and Revolution R Enterprise-certified Specialist Certifications. Apart from this, he has also cleared Financial Risk Manager (FRM I) exam. His interest in mathematics helped him in clearing the CT3 (Actuarial Science) exam.

Who is the target audience?
  • The data structures in this book are primarily written in Scala; however, implementing the algorithms in other functional languages should be straightforward.
Students Who Viewed This Course Also Viewed
Curriculum For This Course
27 Lectures
Why Functional Programming?
7 Lectures 28:42

This video gives an overview of the entire course.

Preview 04:20

In this video, we will print all the elements of an array and then apply higher level programming abstractions. Finally, you will learn about ABT.

The Imperative Way and a Higher Level of Abstraction

In this video, we will first count even elements from the input list to show that functional programming is declarative and then show that there is no boiler plate in functional programming.

Functional Programming and Boilerplate

Higher order functions help us succinctly express logic. In this video, you will learn about higher order functions.

Higher Order Functions

Instead of writing a loop using a mutable loop variable, functional languages advocate recursion as an alternative. In this video, we will see how recursion aids immutability.

Recursion Aids Immutability

In this video, you will first learn about copy-on-write, then to deal with excessive copying, we can resort to a feature called deferred processing.

Copy-On-Write, Laziness, and Deferred Execution

In this video, you will learn to compose functions.

Composing Functions
Building Blocks
5 Lectures 27:41

The big O notation is used to describe how fast an algorithm will run. In this video, we will describe the growth of the algorithm's running time versus the size of input data in Scala.

Preview 03:14

In this video, we will see how trading off some space by caching known results saves time and avoids needless computations.

Space/Time Trade-Off

In this video, we will show you that mathematical functions are not referentially transparent. 

Referential Transparency

In this video, you will learn about the advantage of vectors over list. Also, you will learn to update elements in an array of elements.

Vectors Versus Lists

In this video, we will look at collections and see how complexity helps us to see how they will perform in different situations. Also, we will look at commonly used collections and idioms with examples.

Complexities and Collections
8 Lectures 26:19

This video introduces you to the basics of list.

Preview 06:43

In this video, you will learn about the head and tail method.

List Head and Tail

This video shows us how to drop elements from the list.

Drop Elements

This video deals with joining of two lists into a single list.

Concatenating Lists

The main objective of this video is to teach you about persistent data structures and tail call optimization.

Persistent Data Structures and Tail Call Optimization

This video deals with appending and prepending of lists.

List Append and Prepend

We cannot do random indexing on a linked list. So here in this video, we will get the value at index.

Getting the Value at Index

In this video, we will take a look at how to modify a list value.

Modifying a List Value
Binary Trees
5 Lectures 23:54

This video deals with the basics of node.

Preview 01:53

This video shows us how to build a binary tree.

Building the Tree

This video deals with comparing trees. Here we will also flip trees.

Comparing Trees

The Accumulator Idiom

This video deals with implementation of dictionaries using binary search trees.

Binary Search Trees
More List Algorithms
2 Lectures 13:30

This video deals with various operations which can be performed using binary numbers.

Preview 07:26

This video teaches us about the algorithm that matches the longest possible part and also teaches us to find alternate possibilities in case of failure.

Greedy Algorithms and Backtracking
About the Instructor
Packt Publishing
3.9 Average rating
7,282 Reviews
51,860 Students
616 Courses
Tech Knowledge in Motion

Packt has been committed to developer learning since 2004. A lot has changed in software since then - but Packt has remained responsive to these changes, continuing to look forward at the trends and tools defining the way we work and live. And how to put them to work.

With an extensive library of content - more than 4000 books and video courses -Packt's mission is to help developers stay relevant in a rapidly changing world. From new web frameworks and programming languages, to cutting edge data analytics, and DevOps, Packt takes software professionals in every field to what's important to them now.

From skills that will help you to develop and future proof your career to immediate solutions to every day tech challenges, Packt is a go-to resource to make you a better, smarter developer.

Packt Udemy courses continue this tradition, bringing you comprehensive yet concise video courses straight from the experts.