|
Wednesday, January 10
Marks for A4, A5,
and the final exam have been posted, as well
as updated marks for A3 and the second
term test. A composite of all the marks
has also been posted, which also includes the raw final mark
as calculated from the individual marks. This composite does not include
any end-of-term adjustments (overall or individual), and therefore should
not be considered official.
A partial solution for A5 and a full solution
for the final exam (PostScript |
PDF) have been posted, as well as
the marking scheme for the final
exam.
Your marked A4 and A5 should be available for pickup in the Eng. Sci.
Common Room later this week.
The Connect Four tournament page
has been updated to include the results of the scintiillating games
that were played. (Winners can expect to receive their prizes this week.)
As you may have heard, I landed a job in California and fly out tomorrow.
My DGP e-mail should still function when I'm gone (or at least forward
to me), but in case it doesn't, you can try to reach me at rayo@philosopherswalk.net.
It's been a pleasure to teach this course and I wish you the best of
luck in the future. Take care of yourselves and remember, it's all good.
Wednesday, January 3
I hope you enjoyed the holidays.
In case you were wondering, the unofficial marks list will not be ready
until early next week.
A reminder for those of you taking CSC191, there is no lecture tomorrow
(Thursday).
Archives
|
|
Week
|
Topics Covered |
|
1
|
Course administration, introduction to C |
|
2
|
Introduction to C (continued), basic datatypes, operators, expressions |
|
3
|
Selection: if, switch, iteration: for,
while, do...while, assert,
arrays, const, table lookup, functions |
|
4
|
Functions (continued), structures and unions, pointers |
|
5
|
Pointers (continued), memory management using malloc
and free |
|
6
|
Memory management using realloc and calloc,
insertion sort algorithm, review for first term test
|
|
7
|
Algorithms: selection sort and binary search, linked data structures:
lists, binary search trees
Questions of the week |
|
8
|
Linked data structures (continued), recursion, merge sort algorithm,
big-O notation, hash table data structure |
|
9
|
Testing, code inspection, string processing, minimax algorithm |
|
10
|
Minimax (continued), modules |
|
11
|
Introduction to C++, classes, methods, private vs. public, friends,
review for second term test |
|
12
|
Constructors, destructors, memory management using new
and delete, this pointer, operator overloading,
inheritance, virtual functions |
|
13
|
Review for final exam |
|
|
Click on the links below to obtain the slides in PostScript or PDF. To
view the slides at home, you can use Ghostview,
a free PostScript viewer, or Adobe
Acrobat Reader, a free PDF viewer.
Lecture Slides
Supplementary Notes
The notes on minimax are publicly available from the
Web site for Artificial Intelligence: A Modern Approach, an
AI text authored by Russell and Norvig.
|
|
Neither the instructor nor the TAs will provide technical support for
software linked below.
- Cygwin - RedHat's
port of GNU's development tools (including
gcc and g++,
the GNU C and C++ compilers) for Windows 95/98/NT
- Emacs
- A powerful text editor for Windows NT (also works on Windows 95/98)
- WS_FTP LE - Educational use version
of WS_FTP, an FTP client for Windows
If you have a link you would like to see added, e-mail
the instructor.
|