1. Introduction

• is-prime-900.cpp, is-prime-separate-files.zip and is-prime-three-files.zip
  First C++ code example; tests whether a given number is a prime number. Three different ways of splitting the source code into files: One single code file, two separate code files, and two code files plus one header file.

2. C/C++ programming language

• conditions-assert.cpp and conditions-gsl.cpp
  Checking runtime conditions (e.g., preconditions and postconditions), following traditional style (conditions-assert.cpp) and modern style (conditions-gsl.cpp) of C++ programming.
• const-array.cpp
  Example illustrating the "const" and "constexpr" keywords.
• convert-to-bmp.zip
  Code that uses the ImageMagick library to write out a BMP file.
• is-prime-memory-leak.zip
  This code has a bug - it causes a memory leak. We discuss during the lecture how it could be fixed.
• memleak.zip
  Code evaluating a random walk process, with a bug that causes a major memory leak.
• namespaces-overloading.zip
  Use of multiple namespaces in combination with overloading of a function.
• problems-10-to-14.pdf
  Remarks on tutorial problems 10 to 14 from the second worksheet.
• string-argument-passing.cpp
  Compare argument passing when using a C string (a pointer, char*) as opposed to a C++ string (an object, std::string).
• ring-elongation.zip
  Fixed version of memleak.zip.
• three-functions.cpp
  Compact code with three functions that we can look at, using gdb, and follow how the stack frames are allocated and deallocated.
• wildptr.cpp and wildptr-fixed.cpp
  Code that can produce a wild pointer, and a version where that bug has been fixed.

3. Data structures

• book-index.zip
  Intro example on a class definition in C++. In the lecture we compare it to the Python code from book-index-python.ipynb.
• book-index-python.ipynb
  Jupyter notebook with a simple object-oriented code in Python (roughly corresponding to the C++ implementation in book-index.zip).
• chowlk.zip
  Test of the Chowlk E-R diagram tool (working on draw.io) allowing export of the diagrams as an OWL ontology in TTL format
• city-country.zip
  Defines two classes, City and Country, with a two-way relation between them expressing that the city is in a country (or, that the country contains the city). In the lecture this is discussed jointly with the corresponding entity-relationship diagram.
• copying-and-moving.zip
  Extended version of sequences-int.zip (singly and doubly linked lists and dynamic arrays). This version contains all the elements from the rule of five: Destructor, copy constructor, copy assignment operator, move constructor, move assignment operator.
• incidence-list-graph.zip
  Graph data structure implemented through incidence lists; includes computation of shortest paths by Dijkstra's algorithm.
• io-operator-overloading.zip
  Overloading the stream read and write operators and using a string stream.
• list-template.zip
  Singly-linked list implementation (from sequences-int.zip), but changed to a template and used for lists of integers and of strings.
• literature-indices.zip
  Class hierarchy with one superclass and to subclasses (child classes).
• problem-18.zip
  Example solution to tutorial problem 18 from the third worksheet.
• queens-count-threats.zip
  Example solution to tutorial problems 21 and 22 from the third worksheet.
• repulsive-spheres.zip
  Evaluate a configuration of spheres in a box, counting the number of overlaps between spheres.
• sequences-int.zip
  Data structures for sequences of integer numbers: Singly and doubly linked lists and dynamic arrays. (Basic version; compare copying-and-moving.zip which extends this by copy/move constructors and assignment operators.)

4. Concurrency

• collective-communication.zip
  Code illustrating MPI collective-communication operations: Broadcast (MPI_Bcast), scatter (MPI_Scatter), gather (MPI_Gather), reduce (MPI_Reduce), all-gather (MPI_Allgather), and all-reduce (MPI_Allreduce).
• graph-stream.zip
  Example showing how stream-based serialization can be used to prepare data for message passing with MPI.
• mpi-primes.zip
  Use MPI for processes to count concurrently how many prime numbers there are below a specified limit.
• petri-net-slide-27.xml
  Petri net XML file for use with PIPE; this net is the one shown on slide 27 of the third lecture on concurrency.
• pingpong.zip
  Alternating send and receive between two ranks, 0 and 1, incrementing a counter until a limit is reached.
• protocol-orion_compile-and-run.txt
  Step-by-step guidance on how to compile and run a code on Orion.
• protocol-orion_ssh.txt
  How to access your Orion account through an authorized key (no need to type your password).
• queens-average-threats.zip
  Variant of queens-count-threats.zip that computes the average number of threats for a given number of queens distributed uniformly at random over a chess board of a given dimension.
• ros-nodes-howto.zip
  Summary of the ROS 2 tutorial on how to create client and server nodes using the ROS 2 C++ API
• sphere-config-par.zip
  Counts overlaps between spheres in parallel, using spatial domain decomposition.
• sphere-test-job.qsub
  Example bash script that can be submitted to the Slurm queue on Orion to run a job, using the command "qstat".
• unit-vector-incomplete.cpp
  Parallel code meant to create a random unit vector; but the code normalizing the vector to a length of 1.0 is missing.

5. Production

• backtracking-vs-metropolis.zip
  Code implementing both DFT with backtracking and the Metropolis algorithm for an example black-box minimization problem.
• charmap-output-mpiio.zip
  Code that creates a pixel-based (bitmap-like) image showing a stack of superimposed circular disks. This version of the code uses MPI/IO to parallelize the file output. See also: MPI standard version 4.1, Chapter 14.
• cmake-dirgraph.zip
  CMake use example mentioned in the final lecture.

Index