1) Read about Middle-square method (https://en.wikipedia.org/wiki/Middle-square_method)
a) draw a flowchart of the algoritm (for more information see: https://en.wikipedia.org/wiki/Flowchart)
b) write the pseudocode
c) implement the algorthm in C for n=4
d) calculate some statistics out of the generator (e.g. max number of loops before stop, average number of loops before stop, etc.)

If time allows:
2) Random generators (discussion)
3) Describe the main pros and cons of *.csv (*.tsv), *.json, *.xml
4) Sorting one more time. The algorithms for which you need to be able to write pseudocode, C code: 
- merge sort
- bubble sort
- heapsort
- insertion sort
- quicksort