CSE 1310 - Summer 2012 - Lectures

• Lecture 1: Tue 07/10
  • Book reading: Chapter 1.
  • Slides: Introduction. PDF, PPT.
  • Slides: What is a computer (author: Gian Luca Mariottini). PDF.
  • Slides: A first program. PDF, PPT.
    • Code: circles.py. A program computing the circumference and area of a circle.
    • Code: circles_bad_style.py. An alternative version of circles.py, that runs exactly the same way, but uses poor programming style.

• Lecture 2: Wed 07/11
  • Book reading: Chapter 1.
  • Slides: Expressions, statements, variables, assignments, types. PDF, PPT.
    • Code: ex20120123a.py (author: Darin Brezeale). Creating int, float, and string variables.
    • Code: ex20120123b.py (author: Darin Brezeale). An example of type conversions.

• Lecture 3: Thu 07/12
  • Book reading: Chapter 2.
  • Slides: The boolean type, boolean expressions, logical operators. PDF, PPT.
  • Slides: Conditionals. PDF (author: Darin Brezeale).
    • Code: ex20120123c.py (author: Darin Brezeale). An example of using if-else.
    • Code: ex20120123d.py (author: Darin Brezeale). An example of using if-elif statements.
    • Code: example-leapyear.py, example-leapyear-shorter.py (author: Darin Brezeale). Calculating if a year is a leap year. First example uses nested if statements. Second example uses a logical operator to combine cases.
    • Code: ex20120125a.py (author: Darin Brezeale). Categorizing the age of a person. Uses if-elif-else
    • Code: ex20120125b.py (author: Darin Brezeale). Guessing what animal you are, by asking two questions. Uses nested if-else statements
    • Code: if-indentation.py. An example showing the importance of indentation in if statements.
  • Slides: Loops. PDF (author: Darin Brezeale).
    • Code: summing_to_N_for_loop.py Computing the sum of all numbers 0 and N. Uses a for loop.
    • Code: summing_to_N_while_loop.py Computing the sum of all numbers 0 and N. Uses a while loop.
    • Code: summing_to_N_bad_indent.py Computing the sum of all numbers 0 and N. Uses a while loop. Deliberately uses bad indentation at last line, to show the difference that indentation makes.
    • Code: ex20120125c.py (author: Darin Brezeale). Computing the sum of all even numbers between 0 and 10. Uses a while loop.
    • Code: ex20120125d.py (author: Darin Brezeale). Counts integers in range of 20 to 100 that are divisible by 13 or 22. Uses a while loop.
    • Code: ex20120125e.py (author: Darin Brezeale). Prints integers in range of 20 to 1000 that are divisible by 13 or 22. Uses a while loop.
    • Code: number_guessing.py (author: Darin Brezeale). The computer picks a number, you try to guess it. Uses a while loop.
    • Code: number_guessing2.py (author: Darin Brezeale, modified by Vassilis Athitsos). Variation of previous program, the computer picks a number, you try to guess it. Uses a while True loop with a break statement.
    • Code: ex20120130b.py (author: Darin Brezeale). Finds and prints out divisors of an integer. Uses a while loop.
    • Code: ex20120130c.py (author: Darin Brezeale). Printing a multiplication table. An example of a nested while loop.
    • Code: square_root.py. Finding out the square root of a number. (Note: in python, a quick way to get square roots is to type number ** 0.5.) Uses a while loop

• Lecture 4: Mon 07/16
  • Book reading: Chapter 6.
  • Slides: The need for containers, and an example of lists. PDF, PPT.
  • Slides: More on lists. PDF (author: Darin Brezeale).
    • Code: months_no_lists.py A program showing the 12 months and their lengths, without using containers.
    • Code: months_lists1.py. A program showing the 12 months and their lengths, using lists.
    • Code: sort_n_numbers.py. A program asking the user to enter some numbers (the user specifies how many numbers), and then prints those numbers in ascending order.
    • Code: list_methods.py (author: Dr. Darin Brezeale). A program illustrating examples of various methods operating on lists.

• Lecture 5: Tue 07/17
  • Topic: containers and lists, continued.
    • Code: phone_numbers_1.py A program that first asks a user to enter some names and phone numbers, and then enters a loop, where the user enters a name and the program looks up and prints out the corresponding phone number.
    • Code: phone_numbers_2.py This is an improved version of phone_numbers_1.py. The two improvements are: 1). The program allows the user to enter "q" to exit the program. 2). If the name is not found, the program prints out a message stating that the name was not found.
    • Code: phone_numbers_3.py This is an variation of phone_numbers_2.py, that behaves the same way. The difference is that here the information is stored in a single list, as opposed to two lists.

• Lecture 6: Wed 07/18
  • First midterm.

• Lecture 7: Thu 07/19
  • Book reading: Chapter 4.
  • Slides: Strings. PDF (author: Darin Brezeale).
  • Slides: More on strings. PDF, PPT.
    • Code: change_third_letter.py This program gets a string from the user, and prints out a modified version, where the third letter of the original string is replaced with "A".
    • Code: change_third_letter_2.py Compared to change_third_letter.py, this is a different (but equivalent) implementation. The behavior is the same, but the code is much shorter.
    • Code: finding_substrings.py This program asks the user to enter two strings. Then, it finds all positions of the first string where the second string occurs, and it prints out those positions and the total number of such positions.

• Lecture 8: Mon 07/23
  • Book reading: Chapter 5.
  • Slides: Functions. PDF, PPT.
    • Code: verify_integer1.py This program asks the user to enter a string, and checks whether that string represents an integer or not.
    • Code: verify_integer2.py Simplified version of verify_integer1.py, using predefined string methods to strip leading and trailing whitespace.
    • Code: summing_to_N_no_functions.py This program asks the user to enter a number N, and prints out the sum of integers from 0 to N. This is a revised version of summing_to_N_for_loop.py posted for a previous lecture, that uses the code from verify_integer2.py to ensure that the user enters a valid integer. However, no functions are used, and the resulting code is ugly.
    • Code: summing_to_N_with_functions_1.py A rewrite of summing_to_N_no_functions.py, that defines a function for checking if a string represents an integer or not.
    • Code: number_check.py A separate file that defines a function for checking if a string represents an integer or not. This function can now be imported and used by any piece of Python code.
    • Code: summing_to_N_with_functions_2.py A rewrite of summing_to_N_with_functions_1.py summing_to_N_no_functions.py, that uses the check_integer function from number_check.py to check if a string represents an integer or not. At this point, the code here is easy to read and accomplishes what we wanted, namely to print out the sum of integers from 0 to N, and to not crash in any situation.

• Lecture 9: Tue 07/24
  • Topic: Functions, continued (see slides from previous lecture).
    • Code: divisors.py and divisors_main.py. A function computing a list of divisors for an integer.
    • Code: list_to_string.py and list_to_string_main.py. A function concatenating a list of characters into a string.
    • Code: var1_var2.py. An exercise in separating variables with the same name appearing at different namespaces, and determining which namespace and which variable are visible at each moment.
    • Code: find_substrings.py. An example of a function returning multiple arguments. It takes as inputs two strings, and it returns the number and list of positions of occurrences of the second string in the first string.
  • Slides: Code design. PDF, PPT.

• Lecture 10: Wed 07/25
  • Book reading: Chapters 7.1, 7.2.
  • Slides: Program State and Program Execution. PDF, PPT.
  • Topic: code design, continued (see slides from Lecture 9).
    • Code: mastermind_07_25_2012.py. The beginning of our Master Mind implementation. Just contains an incomplete top-level function at this point.

• Lecture 11: Thu 07/26
  • Topic: code design, continued (see slides from Lecture 9, which have been updated).
    • Code: mastermind_07_26_2012.py. Version 2 of our Master Mind implementation. Some functions have been implemented. Only pick_number has been tested. Function is_valid_guess is wrong at this point, will be fixed next week.

• Lecture 12: Mon 07/30
  • Second midterm.

• Lecture 13: Tue 07/31
  • Topic: code design, Master Mind example, continued.
    • Code: mastermind_functions.py. Version 3 of our Master Mind implementation. Untested, but seems to be complete and correct so far.

• Lecture 14: Wed 08/01
  • Topic: code design, Master Mind example, continued.
    • Code: mastermind_08_01_2012.py. Version 4 of our Master Mind implementation. Started implementation of the second variation, where the human picks a number and the computer guesses.

• Lecture 15: Thu 08/02
  • Book reading: Chapters 8, 9
  • Slides: File input/output. PDF (author: Darin Brezeale).
  • Slides: Dictionaries. PDF (author: Darin Brezeale).
  • Slides: More on dictionaries. PDF, PPT (author: Chris Conly).
    • Code: phone_book_functions.py and phone_book_functions.py. Code allowing users to store, browse, and edit entries in a phone book. The code uses file input/output and Python dictionaries.

• Lecture 16: Mon 08/06
  • Topic: code design, Master Mind example, continued.
    • Code: mastermind_08_06_2012.py. Version 5 of our Master Mind implementation. More progress on implementing the functionality where the human picks a number and the computer guesses.

• Lecture 17: Tue 08/07
  • Topic: code design, Master Mind example, continued.
    • Code: mastermind_08_07_2012.py. Final version of our Master Mind implementation. Now we can play both the mode where the computer picks a number and the human guesses, and the mode where the human picks a number and the computer guesses.
    • Code: task_6_4.py. Three different implementation of a function that flattens a list. Two recursive implementations, one non-recursive implementation.

• Lecture 18: Wed 08/08
  • Topic: code design, Sudoku example, part 1.
    • Code: sudoku_08_08_2012.py. First version of the sudoku implementation.
    • Code: utilities.py. Some useful functions used in the sudoku implementation.

• Lecture 19: Thu 08/09
  • Topic: code design, Sudoku example, part 2.
    • Code: sudoku_08_09_2012.py. Second version of the sudoku implementation. The key improvement over the first version is that now function sudoku_block_values works, and can be used to identify the legal values at a specific position.
    • Code: utilities.py. Some useful functions used in the sudoku implementation.

• Final exam: Mon 08/13, 10:30am-12:30pm.