MyPage is a personalized page based on your interests.The page is customized to help you to find content that matters you the most.


I'm not curious

F# Functional Data Structures

Course Summary

F# and .NET provide you with a wealth of data structures and collections for storing and manipulating data. This course identifies these structures and the functions which F# provides to work with them, including arrays, lists, and sequences. By the end o


  • +

    Course Syllabus

    ● Introduction
        ◦ Why Functional Data Structures Matter
        ◦ What Is a Functional Data Structure?
        ◦ Prerequisites: F# Interactive (FSI)
        ◦ Prerequisites: The let Keyword
        ◦ Prerequisites: The Forward Pipe Operator |>
        ◦ Prerequisites: Tuples
        ◦ Prerequisites: Records
        ◦ Summary
    ● Arrays
        ◦ Introduction
        ◦ Creating an Array
        ◦ Accessing Array Elements
        ◦ The Array Module
        ◦ Array.map
        ◦ Array.mapi
        ◦ Array.iter and Array.filter
        ◦ Option Data Type and Array.choose
        ◦ Array.sum, Array.sumBy, Array.sort, and Array.sortBy
        ◦ Array.reduce
        ◦ Array.fold
        ◦ Array.zip
        ◦ Multi-Dimensional and Jagged Arrays
        ◦ Summary
    ● Sequences
        ◦ Introduction
        ◦ Creating Sequences
        ◦ Using Seq.unfold
        ◦ Collections as Sequences
        ◦ More on Sequence Expressions
        ◦ Accessing Sequence Elements
        ◦ Searching Within Sequences
        ◦ Grouping Sequences
        ◦ Seq.pairwise, Seq.windowed and Seq.collect
        ◦ Sequences: The Tradeoffs
        ◦ Summary
    ● Lists
        ◦ Introduction
        ◦ Creating Lists
        ◦ Accessing List Elements
        ◦ The List Module
        ◦ List Mutability
        ◦ Combining Lists
        ◦ Performance of List Operations
        ◦ Summary
    ● Lists, Pattern Matching, and Recursion
        ◦ Introduction
        ◦ Pattern Matching
        ◦ Recursive List Traversal
        ◦ Summary
    ● Dictionaries
        ◦ Introduction
        ◦ Dictionary Basics
        ◦ Using dict for Immutable Style
        ◦ In-Depth Demo - Mutable Style
        ◦ In-Depth Demo - Immutable Style
        ◦ Dictionary and Concurrency
        ◦ Summary
    ● Sets and Maps
        ◦ Introduction
        ◦ Creating Sets
        ◦ The Set Module and Set Operations
        ◦ Hidden Mutability
        ◦ Maps
        ◦ Choosing Which Lookup to Use
        ◦ Summary
    ● Trees
        ◦ Introduction
        ◦ Trees Using Recursive OO Types
        ◦ Discriminated Unions
        ◦ Trees and Discriminated Unions
        ◦ Choosing a Tree Representation
        ◦ Summary
    ● Choosing a Data Structure
        ◦ Introduction
        ◦ Choosing a Data Structure for Productivity
        ◦ Type Providers
        ◦ Choosing a Data Structure for Reliability
        ◦ Making Illegal States Unrepresentable
        ◦ Choosing a Data Structure for Maintainability
        ◦ Choosing a Data Structure for Performance
        ◦ The Array.parallel Module
        ◦ Principles of Performance
        ◦ Summary

     


Course Fee:
USD 29

Course Type:

Self-Study

Course Status:

Active

Workload:

1 - 4 hours / week

This course is listed under Development & Implementations and Data & Information Management Community

Attended this course?

Back to Top

Awards & Accolades for MyTechLogy
Winner of
REDHERRING
Top 100 Asia
Finalist at SiTF Awards 2014 under the category Best Social & Community Product
Finalist at HR Vendor of the Year 2015 Awards under the category Best Learning Management System
Finalist at HR Vendor of the Year 2015 Awards under the category Best Talent Management Software
Hidden Image Url

Back to Top