Quiz Information
CSci 127: Introduction to Computer Science
Hunter College, City University of New York
Spring 2019

At every recitation, there will be an in-class quiz on the lecture notes, reading, submitted programs, and laboratory exercises.

• As the semester progresses, quizzes will include review questions as well as short programming exercises based on the homework.
• All quizzes must be taken during class time, and there are no make-up quizzes. Instead, your score on the final exam will replace missing quiz grades (the final exam will also replace a quiz grade when you take the quiz but do better on the final exam).
• The quizzes are on paper, and you may not use any notes, books, or any computer device (laptop, phone, calculator, smart watch, etc.).
• If you miss your assigned recitation, you may take a quiz during another section before the deadline, subject to availability and instructor's permission.

Calendar

As the name suggests, in-class quizzes must be taken in-class. If you miss your assigned recitation, you may take a quiz during another section before the deadline, subject to availability and instructor's permission. As the semester progresses, quizzes focus on the topics below and include one or two review questions.

Quiz:	Deadline:	Topics:
#1	Friday, 1 February	Academic Integrity Policy (certify that you have read and understood it) and a short survey (reasons for taking course, etc.).
#2	Friday, 8 February	Turtles and Loops: Focuses on the turtle and for-loops covered in notes from Lecture 1 and Lab 1.
#3	Tuesday, 19 February	Strings and loops: this quiz asks questions that are variations on Programs 1-7.
#4	Tuesday, 26 February	Loops and Unix: The focus on loops for this quiz is looping through strings and using range() (Programs 8-12 and notes from Lectures 2 and 3). The Unix topics are from the end of Lab 2 and Lab 3. For the style of question, see Question #1b of previous final exams. Those questions contain additional Unix commands (covered in later labs); this quiz will only have those we have covered thus far: ls, ls -l, pwd, cd, mkdir, cp, and mv.
#5	Tuesday, 5 March	Decisions and Color: This quiz has questions about if statements and various ways to represent color (e.g. by name, by percentage, and by hexcode). See the short answer parts of Question #2 of previous final exams for examples for the colors. For the if-statement questions: a good way to study is to review the examples from Lab 4.
#6	Tuesday, 12 March	Truth tables, logical expressions and circuits: See Question #3 on old finals for examples.
#7	Tuesday, 19 March	Unix and Pandas: The Unix part covers through Lab 5: relative and absolute paths and ls, ls -l, pwd, cd, mkdir, cp, and mv. See the examples from Lecture 6 and Lab 6 to study for the Pandas questions.
#8	Tuesday, 26 March	Accessing formatted data and Functions: Review the function and pandas examples from Lecture 7.
#9	Tuesday, 2 April	Parameters & Functions: For sample questions, see Question #4 on old finals.
#10	Tuesday, 9 April	Folium & Top-down Design: The top-down design question comes from the example covered in Lab 8. For the Folium question, see Lab 9 and the notes from Lecture 9.
#11	Tuesday, 16 April	Indefinite Loops & Simulations: See the notes from Lectures 9 & 10 and Lab 10 for examples of indefinite loops and the random library.
#12	Friday, 3 May	Simplified Machine Language & More Unix: For sample questions, see Question #1b (Unix) and #8 (simplified machine language) on old finals.
#13	Friday, 10 May	Simple C++ Programs: For sample questions, see Question #9 on old finals.
#14	Tuesday, 14 May	End-of-semester survey: a quick survey of what you liked about the course and your future plans (full credit given for filling out the survey).