In the tables which follow, we have given for each prime power pn < 1050 with p < 97, a primitive polynomial of degree n over Fp. Moreover,each polynomial has minimal weight, i.e., the minimal number of nonzero coefficients, among all primitives of that degree over Fp. Only the nonzero terms are representedso that for example over F7, the polynomial x4 + 2x5 + 3 is represented as 14: 1, 5: 2, 0: 3. Copies of the tables and/or programs, either in electronic or hardcopy form, are available upon request from the authors. For further details, we refer to the paper of the same title by the authors in this issue of Mathematics of Computation.