|
|
Recent Announcements:
-
30 Apr. I just put an implemention of the
fixed size block storage manager that I talked about
during the last week of lectures into the Zoo
directory demos_24/storage. The
code for myalloc.c
is worth studying to check your understanding of
pointers, pointer arithmetic, and casts. Please let
me know if you find any bugs in it (not at all
unlikely) or have questions about how it works. The
test program main.c
is a simple command interpreter that exercises the
storage allocator and maintains a log of its
actions.
-
26 Apr. Notes for lecture 24 and lecture 25 are now
available in the Zoo directory /c/cs223/course/lectures. I also put
working code for LZW compression in the Zoo directory
demos_24/lzw.
That code uses a version of the string store storage
allocator that was discussed in class. See the header
file sstore.h
and implementation file sstore.c
for details.
-
14 Apr. Three brief announcements:
-
Notes for lecture 22 and
lecture 23
are now available in the Zoo directory /c/cs223/course/lectures.
-
Old announcements have been moved to the
announcement archive
page.
-
The final exam will be held in room SCL, 19
(Sterling Chemistry Laboratory, 225 Prospect
St.). The time is 2 pm on Wednesday, May 3 as
previously announced. This information comes from
the official Yale
College Final Examinations 2005-2006 web
page.
-
13 Apr. I posted two word list files
(dictionaries) for use with your solution to Problem Set 9. The shorter
file, 2of12inf.txt,
has 81520 words of varying lengths. The longer file,
scowl80,
has 294304 words. See the README file
for information about what these files are and where
they came from. As usual, these files are also
available in the Zoo in directory /c/cs223/course/assignments/ps9/.
The wordlists
subdirectory contains the distribution files from
which these lists were obtained.
Your program should be able to work with either
file. Of course, the word ladders it finds depend on
the word list, so you may get different word ladders
depending which dictionary you use.
When initially testing your program, you should
create and use a very small test dictionary. For
example, you might prepare a dictionary containing
just the seven words from the example word ladder in
the problem assignment. If your program is correct,
it should be able to discover that these words do
indeed form a word ladder from "tears" to
"smile". If it fails, it will be much easier
to track down the bug using the small dictionary
since the graph and related data structures will all
be small enough to print out and check by hand. Only
when your program has been thoroughly tested on small
data sets does it make sense to move on to large
ones.
-
13 Apr. Problem
Set 9 is ready. It is due by noon on Monday,
April 24.
-
11 Apr. I put the C and C++ versions of the
precedence parser and evaluator in the Zoo directory
demos_22.
-
-
8 Jan. A final examination will be given at
the officially scheduled time, Wednesday, May
3, 2:00 pm, in room SCL, 19 (Sterling
Chemistry Laboratory, 225 Prospect St.). Please take this into account when
making your end-of-term travel plans. I do
not plan to give an early exam for the
convenience of those who want to leave campus
early.
-
[Old Announcements]
|
|
|
Teaching Assistants |
| Name: |
Haiyong Xie |
Jinqiang Han |
| Email: |
yong@cs.yale.edu |
jinqiang.han@yale.edu |
| Office: |
AKW 302 |
AKW 410 |
| Phone: |
432-6493 |
432-1239 |
| Hours: |
— |
MW 3:30-5:00 pm |
|
— |
TTh 7:30-9:00 pm |
|
|
