Week 1:
1. Introduction and GHCi demo.
2. Defining functions - pattern matching, multiline definitions
Week 2:
3. Defining functions - guards, case
4. Multiple arguments and currying
5. Recursive functions
Week 3:
6. Lists, recursive definitions on lists
7. Lists -- built-in functions, list comprehension
Week 4:
8. Data types -- Char, String, tuples, Maybe, Either, etc.
9. Higher-order functions on lists -- map, filter, fold etc.
Week 5:
10. Polymorphism and type classes.
11. User-defined data types.
Week 6:
12. User-defined data types -- more examples
13. Rewriting, laziness, infinite lists
14. BFS, DFS and laziness in graph search problems
Week 7:
15. IO basics -- do notation, basic IO actions
16. More IO -- looping, etc.
Week 8:
17. Measuring efficiency of programs, complexity
18. Sorting
Week 9:
19. Abstract data types via modules -- stacks
20. The Queue ADT
Week 10:
21. Binary search trees
22. AVL trees
Week 11:
23. Heaps
24. Red-black trees
Week 12: 25: Introduction to Monads - Maybe, List, State
26: Imperative programming - ST, STRef, STArray etc.
DOWNLOAD APP
FOLLOW US