Which of the following scheduling algorithms is non-preemptive?

Consider the following declaration of a two-dimensional array in C:

char a[100][100];

Assuming that the main memory is byte-addressable and that the array is stored starting from memory address 0, the address of a[40][50] is

The results returned by function under value-result and reference parameter passing conventions

In the C language