CSC108H: Introduction to Computer Programming
Department of Computer Science, University of Toronto
St. George Campus - Section L0101, Summer 2000

This page contains information relevant only to section L0101 of CSC108H, Summer 2000. For all other course-related information, please see the main course webpage.

General Information - Section L0101

Instructor: Ray Ortigas

• E-mail: rayo@cs.toronto.edu
• Phone: (416) 978-1977
• Fax: (416) 978-1931
• Office: SF 4308
• Office Hours:
  • Wednesday 1-2, 4-5 p.m., Thursday 1-2 p.m. (CSC108 students are given priority)
  • Tuesday 1-2, 4-5 p.m., (CSC148 students are given priority)

Lectures: Wednesday 2-4 p.m., Thursday 2-3 p.m. in WB 116
Tutorials: Thursday 3-4 p.m.
Tutorial Assignments:

In case you need it, visit this interactive map of the campus.

Announcements

Monday, August 28

The (unofficial) marks used to calculate your final grade have been posted. Check out the main announcements Web page.

I will be in my office (SF4308) on Tuesday and Wednesday, 1-2 p.m. You can pick up unclaimed course projects and assignments then.

Saturday, August 12

I'm having six office hours before the final exam on the following days:

• Monday: 2:30-5:30 p.m.
• Wednesday: 2:30-5:30 p.m.

First-come, first-serve!

Monday, August 7

The marks for A5 and A6 have been posted. A6 will be returned in lecture on Wednesday; unclaimed A5's can also be picked up on Wednesday.

Re-marking requests for A0-A3 and the midterm have been fully processed. If you are unsure whether your re-marking request has been processed, let me know.

Saturday, July 22

Some people have told me they are still unsure about what good Java style is. Sun's Java Web site has a set of style guidelines that is very helpful.

Saturday, July 15

The marks for A0-A4 and the midterm have been posted. You can find them linked below. Note that many remarking requests have not been processed.

If you have any questions, feel free to e-mail me or talk to me in person at any of my office hours next week.

Monday, July 10

The solution to the midterm has been posted. You can find it linked below. I'm still trying to get the marks together and hope to have these compiled by the end of this week.

Saturday, June 24

As announced in last week's lectures, the midterm will be held on Wednesday, June 28 in lecture (NOT in tutorial, as it says on the course information sheet), and will be written in our lecture hall, WB 116.

The midterm will be two hours long, and you will be allowed to bring only the following aids:

• The Arnow and Weiss textbook
• The API reference
• Any handouts given in class (e.g. the memory model handout)

You may write in your textbook if you wish, and you may put bookmarks in it. On the bookmarks, you may write labels, but not notes or program text.

You are not allowed to bring:

• Your notes (including solutions to tutorial exercises)
• Any book other than your textbook and the API reference
• A calculator

Wednesday, June 21

Links to previous midterms can be found below. The code examples we covered last week have also been posted.

Friday, June 9

Marks for A0 and A1 are now up. You can find them below.

Tuesday, May 30

Marks for A0 are now up. You can find them below. Please also read the general announcements for information on the A0 results.

Thursday, May 25

The tutorial assignments have been finalized. They are posted above. Tutorials start today.

Monday, May 22

You can find lecture slides at this link, which have been generously provided by Andria Hunter, Jim Clarke and Richard Pancer, instructors of CSC108 in previous semesters. The linked material is not exactly the same as what we cover in lecture, but I hope it will be close enough to help.

Friday, May 19

Lecture notes should be posted on this Web page sometime this weekend.

Marks

Unofficial final marks

Tests and Exams

Midterm solution
Past midterms and useful advice (from J. Clarke's 108 page)

Examples

Below you can find links to some of the code examples we have covered in class:

• Week 12
  • SortingExample.java - an example of how the insertion sort algorithm can be applied to an int array
• Week 11
  • Shape.java - the root class of the Shape hierarchy
  • Circle.java - the Circle class
  • Rectangle.java - the Rectangle class
  • Square.java - the Square class
  • ShapeDriver.java - driver for testing the classes in the Shape hierarchy
• Week 10
  • FileReadingExample.java - an example of reading a file
  • foo.txt - a sample text file
• Week 9
  • Course.java - the Course class (driver included)
  • ArrayUtilities.java - contains the unfinished thirdHighest method
• Week 8
  • Student.java - the Student class
  • Driver.java - for testing the Student class
• Week 6
  • ShoppingBag.java - the ShoppingBag class
  • Driver.java - for testing the ShoppingBag class
• Week 5
  • Student.java - the Student class
  • Driver.java - for testing the Student class

Useful Links

There are more useful links on the main CSC108 Web site, but at the very least, you should know about the ones below:

Java API Documentation
Java Style Guidelines

Last updated on 2000-08-28 by Ray Ortigas.