Class Notes (837,182)
Canada (510,153)
Computing (443)
CISC 121 (27)
Lecture

3.1.pdf

1 Page
123 Views
Unlock Document

Department
Computing
Course
CISC 121
Professor
Robin W Dawes
Semester
Winter

Description
3.1 Tuesday, January 22, 2013 9:44 AM Data structures - List type: [……….] ○ Zero or greater elements (can be empty) ○ indexed from position 0 to length-1  my_list = [4, 6, 3, 9]  print mylist[2]-> output = 3 ○ List elementsdon't have to be the same type ○ Can have a list inside a list ○ Dynamicallysized  my_list.append("dog") □ Adds "dog" to end of list, making it 1 item larger. Top-down programming: Play a number guessing game with the user-> 1. choose a secret number a. choose a random number
More Less

Related notes for CISC 121

Log In


OR

Join OneClass

Access over 10 million pages of study
documents for 1.3 million courses.

Sign up

Join to view


OR

By registering, I agree to the Terms and Privacy Policies
Already have an account?
Just a few more details

So we can recommend you notes for your school.

Reset Password

Please enter below the email address you registered with and we will send you a link to reset your password.

Add your courses

Get notes from the top students in your class.


Submit