COMP 202 Lecture Notes - Lecture 11: Aqua Teen Hunger Force (Season 2)

• School: McGill University
• Department: Computer Science (Sci)
• Course: COMP 202
• Professor: Daniel Kirshbaum

Document Summary

Comp 202 lecture 11 intro to arrays. October 18th 18:00 to 21:00. Not allowed to enter after 19:00. Multiple choice (winter 2017 midterm) Short answer (no partial points) Long answer - multiple parts. Crib sheet is permitted - legal sized, single or double sided, handwritten or typed. No other tools or devices are allowed (no calculators) Documentation of arrays, string, print, and math methods is provided. Binary numbers - decimal to binary etc. Variables and primitive data types. Input arguments (args) conditional statements. Do warm up questions on assignments, Practice writing code by hand. Practice reading code without compiling or running. Test your knowledge of errors by making mistakes on purpose. Look at mycourses for midterm review sessions. An array is like a container that holds a fixed number of values of the same type. These values can be accessed using the same variable name. The values in the array are called elements.