Examples from week 1 lecture "Parallelism on the JVM I" and II missing

I got the following error:
Exception in thread "main" java.lang.ExceptionInInitializerError
at lectures.algorithms.MergeSort.main(MergeSort.scala)
Caused by: java.lang.NoSuchMethodException: scala.util.Sorting$.sort1([I, int, int)
at java.lang.Class.getDeclaredMethod(Unknown Source)
at lectures.algorithms.MergeSort$.(MergeSort.scala:10)
at lectures.algorithms.MergeSort$.(MergeSort.scala)
... 1 more

I found the following compilation issues in dataparallelism/Mandelbrot.scala.

not found: value Scheduler line 146
not found: value Scheduler line 147
object par is not a member of package collection line 9
value toPar is not a member of scala.collection.immutable.Range Mandelbrot.scala line 149

With 'foldASegSeq' and 'foldASegPar' it seems that 'a0' is folded into each sub segment of array A.
By definition array.fold(a0) should only fold a0 once initially.

Test: (set threshold = 10 and recompile)

scala> val a = (1 until 101).toList.toArray
a: Array[Int] = Array(1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100)

scala> foldASegPar(a, 10000, 0, a.length, (a:Int, b:Int) => a + b)
res0: Int = 165050 //should be 10000 + sum(1 to 100) == 15050