Difference between revisions of "CSC111 Class Page 2010"

From dftwiki3
Jump to: navigation, search
(→‎Spring Break)
(→‎Weekly Schedule)
 
(12 intermediate revisions by the same user not shown)
Line 167: Line 167:
 
* '''Monday'''
 
* '''Monday'''
 
** Random poems, revisited: A look at the work of Eitan Mendelowitz on an interactive setup where random poems are generated. [http://www.aiaesthetic.com/DraftingPoems/1.mpg Eitan Mendelowitz's installation, Drafting Poems]<br />
 
** Random poems, revisited: A look at the work of Eitan Mendelowitz on an interactive setup where random poems are generated. [http://www.aiaesthetic.com/DraftingPoems/1.mpg Eitan Mendelowitz's installation, Drafting Poems]<br />
−
** In this video, play close attention to the digital horses, and how, in the preliminary movie, we see how the horses are just collections of fixed size blocks (cylinders) attached to each other. <videoflash>x2FimkptxIk</videoflash><br />
+
** In this video, play close attention to the digital horses, and how, in the preliminary movie, we see how the horses are just collections of fixed size blocks (cylinders) attached to each other. <videoflash>4GxPrESfdnM</videoflash><br />
 
** In the next video, the scarabs are objects (''particles'') that move on their own, in a given direction, avoiding collision with objects. <videoflash>xTf3KiHx3h0</videoflash>
 
** In the next video, the scarabs are objects (''particles'') that move on their own, in a given direction, avoiding collision with objects. <videoflash>xTf3KiHx3h0</videoflash>
 
** What happens if  you connect basic shapes together ''at random'', connect them with articulation points, give them energy to move one block around the other, and iterate hundred of thousands of times and keep the best solutions to generate new ones?<videoflash>_f-LORZ2EFU</videoflash><br /> (and  more videos on this [[Genetic_Programming_and_Music|page]]). <br />
 
** What happens if  you connect basic shapes together ''at random'', connect them with articulation points, give them energy to move one block around the other, and iterate hundred of thousands of times and keep the best solutions to generate new ones?<videoflash>_f-LORZ2EFU</videoflash><br /> (and  more videos on this [[Genetic_Programming_and_Music|page]]). <br />
Line 281: Line 281:
 
** Accessing data on the Web
 
** Accessing data on the Web
 
----
 
----
−
* [[CSC111_Lab_9 | Lab #9 ]]
+
* [[CSC111_Lab_9 | Lab #9 ]] and [[CSC111 Lab 9 Solution Programs | solution programs]]
 
* [[CSC111_Homework_9 | Homework #9]] and [[CSC111 Homework 9 Solutions | solution programs]]
 
* [[CSC111_Homework_9 | Homework #9]] and [[CSC111 Homework 9 Solutions | solution programs]]
 
||
 
||
Line 324: Line 324:
 
----
 
----
 
* [[CSC111_Lab_11 | Lab #11 ]] and [[CSC111 Lab 11 Solution Program | Solution]]
 
* [[CSC111_Lab_11 | Lab #11 ]] and [[CSC111 Lab 11 Solution Program | Solution]]
−
* [[CSC111_Homework_11 | Homework #11]]
+
* [[CSC111_Homework_11 | Homework #11]] and its [[CSC111 Homework 11 solution program]]
 
||
 
||
 
* We're still in Chapter 10.
 
* We're still in Chapter 10.
Line 353: Line 353:
 
----
 
----
 
* [[CSC111_Lab_12 | Lab #12 ]] and [[CSC111 Lab 12 Solution | Solution program]]
 
* [[CSC111_Lab_12 | Lab #12 ]] and [[CSC111 Lab 12 Solution | Solution program]]
−
* [[CSC111_Homework_12 | Homework #12]]
+
* [[CSC111_Homework_12 | Homework #12]] and its [[CSC111 Homework 12 Solutions | solution programs]]
 
||
 
||
 
* Dictionaries are covered in Chapter 11  
 
* Dictionaries are covered in Chapter 11  
Line 363: Line 363:
 
||
 
||
 
* '''Monday'''
 
* '''Monday'''
 +
** [[CSC111 Experiment: Designing a new language| Designing a new language]]
 +
::<videoflash>5X8cM2JiqzI</videoflash>
 
** Introduction to Recursion
 
** Introduction to Recursion
 +
***[[CSC111 RecursiveFactorial.py | factorial.py]]
 +
***[[CSC111 BinarySearch.py | binarySearch.py ]]
 +
[[Image:SuperMan.jpg|100px|right]]
 
* '''Wednesday'''
 
* '''Wednesday'''
−
* '''Friday''': <font color="orange">Last Class</font>: Final take home exam
+
***[[CSC111 RecursiveFactorial.py | factorial.py]]
 +
***[[CSC111 BinarySearch.py | binarySearch.py ]]
 +
**[[CSC111 maze.py | maze.py]]
 +
* '''Friday''': <font color="orange">Last Class</font>
 +
** Presentation of the Final take home exam
 
----
 
----
−
* [[CSC111_Lab_13 | Lab #13 ]]
+
* [[CSC111_Lab_13 | Lab #13 ]] and [[CSC111 Lab 13 Solutions | solution programs]]
 
* [[CSC111_Final_Exam | Final Exam]]
 
* [[CSC111_Final_Exam | Final Exam]]
 
||
 
||
−
&nbsp;
+
* Recursion is covered in Chapter 13.  Read Sections 13.1 and 13.2.
−
 
 
 
|}
 
|}
  

Latest revision as of 10:17, 2 April 2015

Main Page | Syllabus | Weekly Schedule | Links & Resources



Prof and TAs

Dominique Thiébaut email
Dept. Computer Science
Ford Hall, 356.
Telephone: 3854
Office hours TBA, and by appointments

 



Click here for TA hours this week.

Weekly Schedule

Week Topics Reading
Week 1
1/25
  • Monday
    • Review syllabus
    • Introduction to computer programming

  • Wednesday
    • keywords: and del for is raise assert elif from lambda return break else global not try class except if or while continue exec import pass yield def finally in print
    • Variables
    • Data types
    • Functions
    • Parameter passing
  • Friday
  • Read Chapter 1 in Zelle.
  • Read the article on pair programming. We will discuss it in class on Monday 2/1.
Week 2
2/1


Week 3
2/8
  • Chapter 3 in Zelle.
    • The math library (I will not cover it in class, but you should read it)
    • Type conversion (important!)
Week 4
2/15
  • Monday
    • Types, operators
    • Working with indexes and strings
    • Slicing up strings
  • Wednesday No class, Rally Day
  • Friday
Week 5
2/22
TaxiCabCSC111.png

 

  • Read Section 6.2 in Zelle
  • Grahics programming is covered in Chapter 5
  • Functions and functions returning values are covered in Zelle, Chapter 6, Section 6.5
Week 6
3/1
  • Monday
    • Random poems, revisited: A look at the work of Eitan Mendelowitz on an interactive setup where random poems are generated. Eitan Mendelowitz's installation, Drafting Poems
    • In this video, play close attention to the digital horses, and how, in the preliminary movie, we see how the horses are just collections of fixed size blocks (cylinders) attached to each other.
    • In the next video, the scarabs are objects (particles) that move on their own, in a given direction, avoiding collision with objects.
    • What happens if you connect basic shapes together at random, connect them with articulation points, give them energy to move one block around the other, and iterate hundred of thousands of times and keep the best solutions to generate new ones?
      (and more videos on this page).
    • Information about Homework assignment
      • Current assignment: work on style!
      • Use listmyprogram utility on Beowulf to spot long lines
  • Wednesday
  • Friday
  • Review of missed lab
  • Working with Files
  • Read Chapter 5 in Zelle
  • Read Chapter 6.
Week 7
3/8
  • Monday
    • Decision structures with if/else statements.
    • True/False
    • The syntax of an if statement
    • Using if-statements
    • Logic operators: ==, <, >, <=, >=, !=
    • Exercises
  • Wednesday
  • Thursday: Midterm Exam. A list of typical problems given in past midterms can be found here. Solution programs for the midterm can be found here. Grade Distribution.
  • Sections 7.1 and 7.2 on Simple Decisions and Two-Way decisions in Zelle.


Spring Break

Week Topics Reading
Week 9
3/22
  • Monday
    • Variations on a scheme: Graphics and if/else statements
    • clickMe.py
  • We're still in Chapter 7 of Zelle.
  • And we are done at the end of the week!
Week 10
3/29
  • Chapter 8
Week 11
4/5

Read Chapter 10!

Week 12  
4/12
  • Friday: No Class
  • We're still in Chapter 10.
  • Default argument (parameter) values are covered in Python.org
Week 13
4/19
  • Monday
    • Review last lab ( lab11.py)
    • Creating a module with newCar.py, containing an inherited class.
    • A view of Programming Languages
  • Dictionaries are covered in Chapter 11
  • List comprehension is presented in Python.org, Section 5.1.4 in [1]
Week 14
4/26
SuperMan.jpg
  • Recursion is covered in Chapter 13. Read Sections 13.1 and 13.2.

...


Links and Resources

Python keywords

The list of all the reserved words of the Python language
and del for is raise assert elif from lambda return break else global not try class except if or while continue exec import pass yield def finally in print

Linux

Misc

  • If you decide to work in pairs for the homework assignments, you need to follow the protocol for 'pair programming' as discussed in this article.
  • All the programs of Zelle's Python textbook

Software

  • Using SSH on Windows, Linux, or on a Mac with OS X

Math








Back To Main Page

Retrieved from "http://dominiquethiebaut.com/dftwiki3/index.php?title=CSC111_Class_Page_2010&oldid=26017"