Difference between revisions of "CSC111 Class Page 2010"
(→Spring Break) |
(→Weekly Schedule) |
||
| (7 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> | + | ** 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 368: | Line 368: | ||
***[[CSC111 RecursiveFactorial.py | factorial.py]] | ***[[CSC111 RecursiveFactorial.py | factorial.py]] | ||
***[[CSC111 BinarySearch.py | binarySearch.py ]] | ***[[CSC111 BinarySearch.py | binarySearch.py ]] | ||
| + | [[Image:SuperMan.jpg|100px|right]] | ||
* '''Wednesday''' | * '''Wednesday''' | ||
| + | ***[[CSC111 RecursiveFactorial.py | factorial.py]] | ||
| + | ***[[CSC111 BinarySearch.py | binarySearch.py ]] | ||
**[[CSC111 maze.py | maze.py]] | **[[CSC111 maze.py | maze.py]] | ||
| − | * '''Friday''': <font color="orange">Last Class</font> | + | * '''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]] | ||
|| | || | ||
Latest revision as of 10:17, 2 April 2015
Contents
Prof and TAs
|
Dominique Thiébaut email |
|
Click here for TA hours this week.
Weekly Schedule
| Week | Topics | Reading |
| Week 1 1/25 |
|
|
| Week 2 2/1 |
|
|
| Week 3 2/8 |
|
|
| Week 4 2/15 |
|
|
| Week 5 2/22 |
|
|
| Week 6 3/1 |
|
|
| Week 7 3/8 |
|
|
Spring Break
| Week | Topics | Reading |
| Week 9 3/22 |
|
|
| Week 10 3/29 |
|
|
| Week 11 4/5 |
|
Read Chapter 10! |
| Week 12 4/12 |
|
|
| Week 13 4/19 |
|
|
| Week 14 4/26 |
|
|
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
- Getting Started with Linux (from U. North Carolina, Chapel Hill)
- Intermediate Linux (from U. North Carolina, Chapel Hill)
- A good Emacs tutorial
- Emacs Quick Reference
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.
- Video talks on Python:
- All the programs of Zelle's Python textbook
- a video of digital horses: what we can do with lists of objects!
Software
- Installing and using the Secure Shell Client on a Windows PC.
- Using SSH on Windows, Linux, or on a Mac with OS X
Math
Back To Main Page
