CS 1MD3 T2 2003
Slides and reference material
Many slides are in PDF format. You'll need the free
Acrobat Reader
from Adobe to read them.
Other slides are in PowerPoint. You can get a
free powerpoint slide viewer from Microsoft.
Sections indicated below are those applicable sections of the textbook(s).
B4.2 refers to Brookshear, "Computer Science: an overview" Chapter 4
section 2. A8.6 refers to Kelley & Pohl, "A Book on C", Chatper 8,
section 6.
The instructor reserves the right to change the future; in other words,
the topic of lectures that have not yet happened might change
without notice. However, within a reasonable amount of time, the
slides and topics for past lectures will be made to reflect reality.
Two lectures are left 'empty' since items like reviewing midterm
results, and reviewing of other material that may have been poorly
understood is likely to take about 2 lectures' worth of time.
You can get all of the slides from Brookshear as a
zip file of PowerPoint files. You
can also get each chapter seperately - see bottom of this page.
- Jan. 6 - Outline
- Jan. 8 - Algorithms.
B4.1, B4.2.
scanned slides
- Jan. 9 - Topics: History of Programming Languages. B5.1.
See also diagrams shown in class, as
well as the extra diagram (not used,
unfortunately). Both of the previous pages contain considerable extra material
on the topic, much of it very interesting.
Example code was from Appendix D of Brookshear.
scanned slides
- Jan. 13 - Algorithms. B4.3, B4.4.
scanned slides
- Jan. 15 - Algorithms.
scanned slides
- Jan. 16 - Topics: Compilers.
scanned slides
- Jan. 20 - Algorithms.
scanned slides
- Jan. 22 - Programming Languages - imperative. B5.2.
scanned slides
- Jan. 23 - Topics: XML
scanned slides
- Jan. 27 - Programming Languages - imperative. B5.3.
scanned slides
- Jan. 29 - Programming Languages - OO. B5.5.
scanned slides
- Jan. 30 - Topics: Complexity. B4.6.
scanned slides
- Feb. 3 - Programming Languages - functional. Examples
are all in Maple. Maple worksheet
is available, as well as the
scanned slides.
- Feb. 5 - Midterm 1
[covers lectures to Jan. 30, inclusive]
- Feb. 6 - Topics - automated testing.
scanned slides.
- Feb. 10 - Data structures. B7.1, B7.2, B7.3.
(Abstraction, Arrays, lists)
See bottom of page for slides.
- Feb. 12 - Data structures. B7.4, B7.5, B7.6.
Linked-lists, stacks, queues.
See bottom of page for slides.
- Feb. 13 - Topics -
review midterm1. Skip lists -
see this C code
for an implementation.
- Feb. 24 - Data structures. B7.6. Trees.
Also available is the C source code
used in the lecture.
- Feb. 26 - Data structures. Hashing (B8.6) powerpoint slides
- Feb. 27 - Topics - Databases. B9.1, B9.2, B9.3. See bottom of page for slides
- Mar. 3 - Data structures. Hashing (B8.6).
first and
second set of slides.
first and
second set of slides as Word documents.
- Mar. 5 - Operating systems concepts. B3.1, B3.2, B3.3.
This lecture was given by J. Nakamura and he used
these slides
- Mar. 6 - Topics - Numerical Analysis. Topic was presented
using a Maple worksheet
as a sort of interactive presentation. Only the material
until (and including) Taylor Approximation were covered.
Here is a
Microsoft Word version
of the Maple worksheet (kindly provided by a student).
- Mar. 10 - Operating systems concepts. B3.3 (cont), B3.4, B3.5.
actual slides used which
are a variation of the book slides. Note that those slides
contain more material than was covered in class.
- Mar. 12 - Propositional Logic. See the powerpoint slides used.
Word version.
See these pdf slides for worked out version of what was done on the blackboard.
- Mar. 13 - Midterm 2.
with answers
- Mar. 17 - Predicate logic.
Word version.
- Mar. 19 - Cancelled
- Mar. 20 - Finite State Machines.
Word version.
- Mar. 24 - Finite State Machines II.
Word version.
- Mar. 26 - Complexity I
- Mar. 27 - Topics - GUIs. Almost
all of the material for this class was either given on the blackboard
or "interactively". I will attempt to augment these slides
before the final.
- Mar. 31 - Complexity II (first half). Also see the countsort C code used.
Word version.
- Apr. 2 - Complexity II (second half).
Word version.
The textbook Discrete Mathematics and its applications (3rd edition)
by Kennet H. Rosen contains valuable information on
recurrence relations.
The first 3 pages of
this handout from a math course are good. For the
mathematically inclined, I recommend
this handout. For the divide-and-conquer part, a slight
variant (more general!) of what I did is well explained near the
end of
these lecture notes.
- Apr. 3 - Topics Review.
Word version.
Open questions and answer
- Apr. 7 - Review. Open question and answer.
Brookshear ppt by chapter:
Back to main page