Added Lec4 home work

Author: tampler

python/lec4/home/Advanced.py

@@ -0,0 +1,17 @@
+
+Task 1: Implement higher order functions map(), flatMap() and withFiler() for Option(Int).
+It wraps Int in a class. Each value may be either Int or Null
+
+flatMap() differs from map(), since it provides data flattening. For example, if you apply map() twice to your data structure, your result should be map(map(Option(Int))) -> Option(Option(Int)), whereas flatMap(flatMap(Option[Int])) -> Option(Int)
+
+withFiler() is a Higher Order Function, which takes a function on input and applies it as a filter to every element
+
+Task 2: Given an implementation from Task1, build a 1000 element
+
+A. Unsorted binary tree.
+B. Red-black tree
+
+and calculate the sum of all nodes for Option(Int). Your filtering functions should be:
+
+A. a % 2 == 0 (even numbers)
+B. (a % 3 == 0) && (a % 5 == 0) (divisible by 3 and 5)

python/lec4/home/Simple.py

@@ -0,0 +1,9 @@
+
+Task 1: Write a simple Higher Order Function map(data, f), where f() is some arith function and data is a List, Dictionary and Numpy array.
+map(data, f) applies function f() to every element of the data structure and returns a resulting data structure.
+
+Can you make a single implementation, Overloaded for all those 3 data structures? Assume datatype is Int.
+Which algorithmic complexity O(n) should it be? Will it depend on the underlying data structure?
+
+
+Task 2: Implement a speed optimized function for Task 1, the fastest you can. What algorithmic complexity O(n) should it be ?