Difference between revisions of "CS111 Syllabus 2011"
(→Schedule) |
(→Prof) |
||
| (10 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
| − | <center>[[CSC111 2011 | Main Page]] | [[CS111_Syllabus_2011 | Syllabus ]] | [[CSC111_Class_Page_2011 | Weekly Schedule ]] | [[CSC111_Class_Page_2011#Links_and_Resources | Links & Resources ]]</center> | + | --[[User:Thiebaut|D. Thiebaut]] ([[User talk:Thiebaut|talk]]) 09:32, 7 January 2014 (EST) |
| + | ---- | ||
| + | <center>[[CSC111 2011 | Main Page]] | [[CS111_Syllabus_2011 | Syllabus ]] | [[CSC111_Class_Page_2011 | Weekly Schedule ]] | [[CSC111_Class_Page_2011#Links_and_Resources | Links & Resources ]] |[http://piazza.com/smith/spring2014/csc111/home Piazza]</center> | ||
<br /> | <br /> | ||
---- | ---- | ||
| Line 10: | Line 12: | ||
Ford Hall, 356.<br /> | Ford Hall, 356.<br /> | ||
Telephone: 3854<br /> | Telephone: 3854<br /> | ||
| − | Office hours | + | '''Office hours''': Monday, 2-4 p.m., Tuesday 1-3 p.m., and by appointment |
=Introduction= | =Introduction= | ||
| Line 48: | Line 50: | ||
* Control structures | * Control structures | ||
* Loops | * Loops | ||
| − | * Classes | + | * Classes and objects |
| − | * Advanced Topics | + | * Advanced Topics, including recursion, sorting, searching. |
=Class and Lab Times = | =Class and Lab Times = | ||
| Line 69: | Line 71: | ||
=Lateness Policy= | =Lateness Policy= | ||
| − | No late assignments will be accepted (except in case of ''documented'' illness or personal difficulties). The assignments are tentatively scheduled to be due every | + | No late assignments will be accepted (except in case of ''documented'' illness or personal difficulties). The assignments are tentatively scheduled to be due every Tuesday evening at midnight. |
'''You are, however, allowed to drop any one assignment without penalty.''' If you turn in all the assignment this semester, the one with the lowest grade will be dropped for you automatically. | '''You are, however, allowed to drop any one assignment without penalty.''' If you turn in all the assignment this semester, the one with the lowest grade will be dropped for you automatically. | ||
| + | |||
| + | '''4 missing assignments will result in failing the class'''. | ||
=Grading= | =Grading= | ||
| Line 77: | Line 81: | ||
You have two options for completing each homework assignment. You can either work individually (sharing ideas with classmates and getting input from the TAs and instructors as needed), or you may work in pairs. If you work in pairs, you need to follow the protocol for 'pair programming' as discussed in [http://maven.smith.edu/~jfrankli/111s08/pairProgramming2000.pdf this article]. If you select pair programming, be sure that each partner understands the concepts and final recipe fully, since exams will, of course, be individual. | You have two options for completing each homework assignment. You can either work individually (sharing ideas with classmates and getting input from the TAs and instructors as needed), or you may work in pairs. If you work in pairs, you need to follow the protocol for 'pair programming' as discussed in [http://maven.smith.edu/~jfrankli/111s08/pairProgramming2000.pdf this article]. If you select pair programming, be sure that each partner understands the concepts and final recipe fully, since exams will, of course, be individual. | ||
| − | Homework assignments | + | Homework assignments 40%, class participation 5%, quizzes 10%, midterm 20%, final 25%. |
=Teaching Assistants= | =Teaching Assistants= | ||
| Line 87: | Line 91: | ||
!width="150"|Email | !width="150"|Email | ||
|- | |- | ||
| − | | | + | | Lindsey Gregor |
| − | | [mailto: | + | | [mailto:lgregor@smith.edu lgregor@smith.edu] |
| + | |- | ||
| + | | Julia Burns | ||
| + | | [mailto:jburns@smith.edu jburns@smith.edu] | ||
| + | |- | ||
| + | | Aigerim Karabekova | ||
| + | | [mailto:akarabek@smith.edu akarabek@smith.edu] | ||
| + | |- | ||
|} | |} | ||
| − | To see when and where they are available this week, click [http://cs.smith.edu/classwiki/index.php/ | + | To see when and where they are available this week, click [http://cs.smith.edu/classwiki/index.php/Computer_Science_TA_hours here]. |
<br> | <br> | ||
<br> | <br> | ||
Latest revision as of 15:06, 19 January 2015
--D. Thiebaut (talk) 09:32, 7 January 2014 (EST)
CSC111 Fall 2011 -- Syllabus
Contents
Prof
Dominique Thiébaut email
Dept. Computer Science
Ford Hall, 356.
Telephone: 3854
Office hours: Monday, 2-4 p.m., Tuesday 1-3 p.m., and by appointment
Introduction
Course Overview: This course is an introduction to computers, computer science and computer programming. The programming language Python is used to introduce basic programming skills and techniques.
This is the first course in the Computer Science major, and no previous experience with computers or programming is assumed.
Objectives: The objectives for this course are for each student to become familiar with
- Basic programming constructs such as if-then statements, loop control, functions, arrays, simple input-output, searching, and recursion.
- Good programming techniques including top-down design, program documentation, modular design, all resulting in code that can be readily understood and used by other programmers.
- The Python programming language
- The basic internal operation of a computer, including the central processing unit, simple memory management, and the file system.
Prerequisites
No prerequisites!
Schedule
The class meets twice a week, TuTh, in McConnell 103, 10:30-11:50 a.m., and for two two-hour lab sessions Thursday, in Ford Hall 241, 1:00-2:50 p.m. for Section 1, and 3:00-4:50 p.m. for Section 2.
Programming assignments are given every week. Approximately 12 homework assignments can be expected this semester. There will be an in-class midterm exam and a final take-home exam.
The due date for the homework assignments is tentatively set for Tuesday evening, at midnight.
Topics
The course covers the following topics (this list is tentative):
- Windows and Unix tools
- Computers and programs
- Computing with numbers
- Strings
- Objects and Object-Oriented programming (OOP)
- Functions
- Control structures
- Loops
- Classes and objects
- Advanced Topics, including recursion, sorting, searching.
Class and Lab Times
- Lectures TuTh: 10:30-11:50 a.m.
- Lab 1 Th 1:00-2:50 p.m.
- Lab 2 Th 3:00-4:50 p.m.
There will be TA sessions. Their location and time is available here.
Textbook
Python Programming: an Introduction to Computer Science. Version 3 by John Zelle, Franklin, Beedle & Associate. It is available at the campus-center bookstore, an also on Amazon.com
Other Sources of Material
Check the class homepage for additional links to Python-related sources.
Lateness Policy
No late assignments will be accepted (except in case of documented illness or personal difficulties). The assignments are tentatively scheduled to be due every Tuesday evening at midnight.
You are, however, allowed to drop any one assignment without penalty. If you turn in all the assignment this semester, the one with the lowest grade will be dropped for you automatically.
4 missing assignments will result in failing the class.
Grading
You have two options for completing each homework assignment. You can either work individually (sharing ideas with classmates and getting input from the TAs and instructors as needed), or you may work in pairs. If you work in pairs, you need to follow the protocol for 'pair programming' as discussed in this article. If you select pair programming, be sure that each partner understands the concepts and final recipe fully, since exams will, of course, be individual.
Homework assignments 40%, class participation 5%, quizzes 10%, midterm 20%, final 25%.
Teaching Assistants
The teaching assistants are:
| Name | |
|---|---|
| Lindsey Gregor | lgregor@smith.edu |
| Julia Burns | jburns@smith.edu |
| Aigerim Karabekova | akarabek@smith.edu |
To see when and where they are available this week, click here.
