PRE-LAB RUBRIC #6:

1.) A series of elements of the same type.
Any figure showing consecutive elements of the same types will work.

3 pts - They say there are a series of elements of the same type (use your best judgement as for the wording)
2 pts - either through the figure or through the wording it is clear the elements are consecutive (use your best judgement for the wording)
1 pt - any relevant figure is provided (doesn't need to be correct)

2.) An element of the array has a value, and its subscript refers to the element's position in the array.

2 pts - It is explained what an element of an array is (use your best judgement as for the wording)
2 pts - It is explained what an array subscript is (use your best judgement as for the wording)

3.a) double x[ 100 ];

1 pt - array type is correct
1 pt - number of elements is correct
1 pt - syntax is correct (do not take off if semi-colon is missing)

3.b.) x[ 0 ] = NUM;

1 pt - subscript 0 is used
1 pt - assignment is used (i.e. something = NUM)
1 pt - syntax is correct (do not take off if semi-colon is missing)

3.c.) 

int y;
for( y = 1; y < 100; y++ ) {
  x[ y ] = x[ y - 1 ] + 0.1;
}

1 pt - a new variable is declared that isn't `x`
1 pt - initialized to 1 (y = 1)
1 pt - condition is `y < 100` or equivalent
1 pt - increment is `y++` or equivalent
1 pt - x[ y ] is assigned to
1 pt - the expression that is on the right hand side is x[ y - 1 ] + 0.1 or equivalent

3.d)

printf( "%i", x[ 99 ] );

2 pts - the subscript used is 99
1 pt - everything else is correct (do not take off if semi-colon is missing)

4.a-i) For each one, give 1 point if its correct or 0 if it isn't
4.a) 4
4.b) 5
4.c) 6
4.d) 0
4.e) 0
4.f) undefined
4.g) undefined
4.h) undefined
4.i) undefined

5.) 

void printReverse( double* d int n ) {
  int x;
  for( x = n - 1; x >= 0; x-- ) {
    printf( "%lf\n", d[ x ] );
  }
}

1 pt - return type is `void`
1 pt - one of the parameters is named `d`, either `double* d` or `double d[]`
1 pt - the other parameter is `int n`
2 pt - the upper bound of what is printed is d[ n - 1 ]
2 pt - the lower bound of what is printed is d[ 0 ]
1 pt - we start at the end of the array and go back to the front
1 pt - all elements of the array are printed
1 pt - setup for printf is entirely correct