This document provides instructions for a quiz on LISP data structures that will be completed in teams of 1 to 3 students. It describes 7 problems to solve involving LISP functions for finding minimum/average values in lists, generating Fibonacci sequences, finding even/zero elements in lists, retrieving elements by position, and checking for membership in lists. Students are instructed to include comments, definitions, and examples for each function they provide. The document also provides contact information for the professor, Javier Gonzalez-Sanchez, and a disclaimer regarding use of the slides.