C programming. You should be able to read a short C program, trace
its execution, decide what it prints, answer questions about how it works
or what it does. In particular, know how pointers are used as parameters,
the & and * operators, the meaning of types like "int *" in parameter
lists, arrays, structures (struct) and typedefs to define struct types,
and the use of structures and arrays as parameters. Be sure to understand
the difference between array variable names used as parameters vs. variable
names of other types. You will not be expected to write any C code. You
also don't need to understand the format codes ("%d %.1f%", etc.) found
in printf statements, but you do need to know that printf prints the value(s)
of its parameter(s).
Internet. You should understand the basic concepts covered in lecture
24 and know the basic vocabulary. Concepts:
-
packet switching
-
WANs and LANs; how they are connected to form the Internet
-
client-server computing
-
the rolls of TCP and IP; how they interact with each other, applications,
and hardware
-
internet addresses and computer names; the role of domain name servers
(DNS)
You do not need to memorize lists of acronyms like nntp/smtp/http, nor
do you have to know what they mean.
Prelim3 Results:
-
Average: 76.59
-
Median: 81
-
Std_Dev: 15.62
-
Max: 100
-
Min: 22
Prelim 3:
-
Date & Time: Tuesday Nov. 18th, 7:30-9:00pm.
-
Location: Depends on the last name.
-
A - L Phillips 101
-
M - Z Hollister B14
-
Review Session: Sunday, Nov. 16th, 3pm, Olin 155. Enter via double
doors facing Gannett. Rest of the building will be locked, and doors will
be locked shortly after 3pm.
-
Prelim Topics: Everything on Prelim 1 plus:
-
2-D arrays (declaring, allocating, arrays of objects, searching & modifying)
-
Modulo arithmetic (mod(a,m) vs a%m; use of mod in magic square example,
crypto program)
-
Basic Matlab (but don't memorize help files)
-
Searching and sorting (know invariants for linear and binary search, insertion
sort, selection sort)
-
Know for loops; don't need to know ++, --, but ok to use them on the exam.
-
Tutoring and Office Hours: (Held in Upson 334)
Note: Consultants will also be available in Carpenter Lab.
Prelim2 Results:
Prelim 2:
-
Date & Time: Tuesday Oct. 21th, 7:30-9:00pm.
-
Location: Depends on the last name.
-
A - L Phillips 101
-
M - Z Hollister B14
-
Review Questions.
-
Review Session: Sunday, Oct. 19th, 3pm, Olin 155. Enter via double
doors facing Gannett. Rest of the building will be locked, and doors will
be locked shortly after 3pm.
-
Prelim Topics: Everything on Prelim 1 plus while loops (including
loop invariants), input and arrays (i.e. everything covered in lecture
before fall break, including assignment 5).
Assignment 5 has been graded and will be available in Carpenter over
the weekend. You can also pick it up at the Review Session on Sunday. Solutions
are available both in Carpenter and online via links from each question
on the Assignment 5 Handout.
New policy on graded work: No questions on grading will be entertained
until after you have had a chance to review your work and compare to sample
solutions.
-
Tutoring and Office Hours: (Held in Upson 334)
Note: Consultants will also be available in Carpenter Lab.
Prelim1 Results:
Prelim 1:
-
Date & Time: Monday Sept. 29th, 7:30-9:00pm.
-
Location: Depends on the last name.
-
A - L Phillips 101
-
M - Z Hollister B14
-
Review Session: Sunday, Sept. 28, 3pm, Olin 155. Enter via double
doors facing Gannett. Rest of the building will be locked, and doors will
be locked shortly after 3pm.
Note: Assignment 3 is due at the beginning of the review session.
It may be handed in earlier in the Carpenter lab as usual.
-
Prelim Topics: Everything up to, but not including, while loops
(i.e. everything prior to lecture on Tuesday, Sept. 23).
-
Integer and Boolean expressions
-
Declaration, initialization, and assignment to variables
-
Execution of conditional statements
-
Blocks: use of { } to group statements
-
Field access; dot notation; method calls
-
Basic graphics methods: drawLine, drawOval, drawRect, etc.
-
Class definitions and instance (object) creation and assignment
-
Constructors
-
Method definitions; return statement
-
Scope rules: fields vs local variables vs parameters
-
Derived classes: extends
-
Access modifiers: public, protected, private
-
String constants, concatenation (+), toString methods
-
System.out methods: print, println, flush
-
Static methods (but not static data)
Most questions will be quite similar to homework problems (trace a sequence
of statements, write a method, extend a class). There will also be questions
asking for definitions of basic concepts: class, access modifier, procedure
vs function vs constructor methods, and so forth. See Lecture
6 notes for review.
-
Tutoring and Office Hours: (Held in Upson 334)
-
Extra tutoring for this week (need to sign up at Upson 303 as usual):
-
Friday 9/26, 1-2pm with Linda Lee.
-
Friday 9/26, 2-3pm with Thomas Yan.
-
Extra open office hours for this week:
-
Saturday 9/27, 1:30-2:30 with Linda Lee.
-
Regular tutoring and office hours.
Note: Consultants will also be available in Carpenter Lab.
Return to CS100 Homepage
If you have any questions or comments about this page, please contact
me: Linda Lee
Latest update: September 23rd, 1997