Merge pull request #89 from MonashDeepNeuron/dev

Dev

Author: linton2000

src/SUMMARY.md

@@ -3,6 +3,7 @@
 [Welcome](home.md)
 
 - [Installation & Set-up](./chapter1/getting-started.md)
+
   - [GitHub](./chapter1/github.md)
   - [Windows](./chapter1/windows.md)
   - [Mac](./chapter1/mac.md)
@@ -13,6 +14,7 @@
   - [Challenges](./chapter1/challenges.md)
 
 - [Intro to C](./chapter2/intro-to-c.md)
+
   - [Hello World](./chapter2/helloworld.md)
   - [Compilation](./chapter2/compilation.md)
   - [Types & Variables](./chapter2/vars.md)
@@ -25,52 +27,47 @@
   - [Challenges](./chapter2/challenges.md)
 
 - [Operating Systems](./chapter3/chapter3.md)
+
   - [Computer Architecture](./chapter3/computer-architecture.md)
-  - [Pointers & Memory](./chapter3/memory-pointers.md)
+  - [Pointers](./chapter3/memory-pointers.md)
+  - [Dynamic Memory](./chapter3/dynamic-memory.md)
+  - [Structures & Macros](./chapter3/structs-macros.md)
   - [Intro to Linux](./chapter3/linux-intro.md)
-  - [Threading & Concurrency](./chapter3/threads-concurrency.md)
-  - [Processes](./chapter3/processes.md)
-  - [Scheduling Algorithms](./chapter3/scheduling.md)
+  - [VMs & Containers](./chapter3/vms-containers.md)
   - [Challenges](./chapter3/challenges.md)
 
-- [More C](./chapter4/chapter4.md)
-  - [Dynamic Memory](./chapter4/memory.md)
-  - [Structures](./chapter4/structs.md)
-  - [Macros & The Preprocessor](./chapter4/macros.md)
-  - [System Calls](./chapter4/syscalls.md)
-  - [Spawning Processes & Threads](./chapter4/spawn-procs.md)
+- [M3 & SLURM](./chapter4/chapter4.md)
+
+  - [Batch Processing vs. Cloud Computing](./chapter4/batch-cloud.md)
+  - [Parallel & Distributed Computing](./chapter4/parallel-distributed.md)
+  - [M3 Login - SSH & Strudel](./chapter4/login.md)
+  - [Intro to SLURM](./chapter4/slurm_intro.md)
+  - [M3 Interface & Usage](./chapter4/m3-interface.md)
+  - [Software & Tooling](./chapter4/software-tooling.md)
   - [Challenges](./chapter4/challenges.md)
 
-- [M3 & SLURM](./chapter5/chapter5.md)
+- [Introduction to Parallel Computing](./chapter5/chapter5.md)
 
-  - [Batch Processing vs. Cloud Computing](./chapter5/batch-cloud.md)
-  - [Parallel & Distributed Computing](./chapter5/parallel-distributed.md)
-  - [M3 Login - SSH & Strudel](./chapter5/login.md)
-  - [Intro to SLURM](./chapter5/slurm_intro.md)
-  - [M3 Interface & Usage](./chapter5/m3-interface.md)
-  - [Software & Tooling](./chapter5/software-tooling.md)
+  - [Multithreading](./chapter5/multithreading.md)
+  - [Synchronisation](./chapter5/synchronisation.md)
+  - [Locks](./chapter5/locks.md)
+  - [Message Passing](./chapter5/message-passing.md)
   - [Challenges](./chapter5/challenges.md)
 
-- [Introduction to Parallel Computing](./chapter6/chapter6.md)
-  - [Multithreading](./chapter6/multithreading.md)
-  - [Synchronisation](./chapter6/synchronisation.md)
-  - [Locks](./chapter6/locks.md)
-  - [Message Passing](./chapter6/message-passing.md)
+- [Parallellisation of Algorithms](./chapter6/chapter6.md)
+
+  - [Parallel Search](./chapter6/parallel-search.md)
+  - [Parallel Sort](./chapter6/parallel-sort.md)
+  - [Other Parallel Algorithms](./chapter6/other-parallel-algos.md)
+  - [Machine Learning & HPC](./chapter6/machine-learning-and-hpc.md)
+  - [Optimisation Algorithms](./chapter6/optim-algos.md)
   - [Challenges](./chapter6/challenges.md)
 
-- [Parallellisation of Algorithms](./chapter7/chapter7.md)
-  - [Parallel Search](./chapter7/parallel-search.md)
-  - [Parallel Sort](./chapter7/parallel-sort.md)
-  - [Other Parallel Algorithms](./chapter7/other-parallel-algos.md)
-  - [Machine Learning & HPC](./chapter7/machine-learning-and-hpc.md)
-  - [Optimisation Algorithms](./chapter7/optim-algos.md)
+- [Apache Spark](./chapter7/chapter7.md)
+  - [Installation & Cluster Set-up](./chapter7/set-up.md)
+  - [Internal Architecture](./chapter7/internals.md)
+  - [Data Processing](./chapter7/data-processing.md)
+  - [Job Batching](./chapter7/job-batching.md)
   - [Challenges](./chapter7/challenges.md)
 
-- [Apache Spark](./chapter8/chapter8.md)
-  - [Installation & Cluster Set-up](./chapter8/set-up.md)
-  - [Internal Architecture](./chapter8/internals.md)
-  - [Data Processing](./chapter8/data-processing.md)
-  - [Job Batching](./chapter8/job-batching.md)
-  - [Challenges](./chapter8/challenges.md)
-
 [Acknowledgements](./acknowledgements.md)

src/chapter3/challenges.md

@@ -1,3 +1,19 @@
 # Challenges
 
-![under-const](../imgs/under-const.gif)
+## Challenge 1 - Sum and Product Algorithms
+
+This challenge involves implementing the sum and product reductions on an array or memory block of integers. As a bonus challenge, try and make the algorithms more generic and work with any binary operator.
+
+## Challenge 2 - Array Concatenation
+
+In this challenge you have to implement an array concatenation function. This should join two arrays of the same type into a single array, similar to `strcat()`. You will need to allocate a new block of memory and in order to store the concatenated arrays which will requires the sizes of the two input arrays to be known by the function. This function should return a pointer to the resulting array.
+
+> Note: The type of the array this function concatenates can be any type except `char`.
+
+## Challenge 3 - Doing it in Docker
+
+Pull an Ubuntu image from the Docker registry, install any required dependencies and execute the same C code that you wrote for challenge 2 within that running container instance. You will have to consult the Docker documentation and be resourceful in learning and completing this task.
+
+## Challenge 4 - Launch a VM instance on Nectar Cloud
+
+This is an extension challenge in which you will have to go through the [ARDC's cloud starter tutorial series](https://tutorials.rc.nectar.org.au/cloud-starter/01-overview) in order to launch a VM instance and connect to it.

src/chapter4/memory.md src/chapter3/dynamic-memory.mdsrc/chapter4/memory.md renamed to src/chapter3/dynamic-memory.md

@@ -48,6 +48,8 @@ int main()
 }
 ```
 
+> If you recall the previous subchapter, `calloc()` allocates memory in the BSS segment instead of the heap/stack.
+
 ## Reallocated Memory
 
 We can also reallocate data to fit a larger or smaller amount. The elements from the old block will be copied to the new location until the new array is full or there are no more elements to copy. `realloc()` my not actual allocate memory in a new locating if there is free space next to the existing array. `realloc()` also works like `malloc()` where the new memory is left uninitialised. `realloc()` takes two parameters, the old pointer address and the new size.