Computer Science II
COMP SCI 1MD3, Term II 2003/04
Lectures and Tutorials
Tuesday, Wednesday, Friday 12:30-13:20 in ABB/165 [was in T29/101 for January6-7 classes]
- T01: Monday 16:30-17:20 in BSB/245
- T02: Wednesday 14:30-15:20 in BSB/245
- T03: Wednesday 11:30-12:20 in BSB/245
- T04: Monday 11:30-12:20 in BSB/245
- T05: Wednesday 08:30-09:20 in BSB/245 [will be cancelled]
- T06: Thursday 16:30-17:20 in BSB/245 [slated for cancelation]
Dr. J. Carette, ITB-168 , ext 26869
Office hours: by appointment only.
For all course related questions,
a class forum will also be set up on WebCT so that
questions and their answers can be posted centrally. The
instructor will, regretably, not answer emails sent to him directly,
but will answer questions posted on the discussion forum(s)
Computer Science: an overview Edition 7, J. Glenn Brookshear, Addison Wesley.
Slides (as PowerPoint files) from this book are available online. (Required)
Applied C: An Introduction and More, Fisher, Eggert and Ross, McGraw Hill. This was the book most recently used in CS 1MC3.
Also useful is
A Book on C Al Kelley and Ira Pohl. The second author maintains
a web page for
this book. From there one can download all the code from this book,
as well as review errata, etc.
This course is for people who have had an introduction to programming.
From the undergraduate calendar, the topics of the course are:
abstract data models and data structures; virtual memory and memory allocation;
advanced programming paradigms: recursion, functional programming,
communication protocols; logic, finite-state machines and complexity
More broadly, the objectives of this course will be to continue to
teach programming basics, as well as introduce a number of more
advanced computer science topics that will be covered more in depth in
Broadly, the course will have 2/3 of the lectures on topics such as
data structures, algorithms, programming languages, complexity, and 1/3
of the lectures will be spent on (quick) overviews of advanced topics
such as XML, OCaml, Haskell, compilers, interpreters, scientific computation,
symbolic computation, templates and the STL, genericity, Open Source,
automated testing, garbage collection, web technologies, IDEs, etc. The
exact list of topics will be finalized partway through the term; as well,
the class will have input on the final list of topics.
Course Information on Web, and Slides
The latest version of this outline and the most "up-to date"
information as well as hand-outs can be found on the course web page.
(Or go to my home page and then to the course page).
The slides and
assignments can be found there as well.
Mid-terms, Exams, and Grading
- There will be two mid-terms. They are scheduled for
February 4th and March 10th, during the regular class hour, both
- The final examination will be
scheduled by the Registrars office in the usual way. It will be
three hours in duration and cover the material of the course,
handouts and assignments.
- It is essential that you fulfill the deadlines for the
assigments, there is no credit for documents handed
in after the deadline. This is manly due to the fact that
solutions will be avaiable after the due date.
- You must pass the final examination to pass the course.
Assuming you pass it, the final grade will be computed
| Final Examination
| Mid-Term Test 1
| Mid-Term Test 2
Additionally, many exercises will be posted. Some of these
exercises will be worth bonus points, to be added to the
final mark of those who have passed the final.
- The instructor does not accept
late doctor's notices, if you write a mid-term then the mark is
yours. If you do not write an exam or an assignment and do not provide
an acceptable doctors notice then it is marked with 0. The
instructor reserves the right to conduct any deferred exams orally.
Outline of the course lectures
The following outline is approximate and is likely to change. It is
expected that, generally, Monday and Wednesday lectures of each week
will be on basic material, and Thursday lectures will be on advanced
topics. The order of the list below is only approximate; the number
in parentheses is the estimate of the number of lectures devoted to
Chapters 4, 5 and 7 of Brookshear will be completely covered. Most of chapter
3 will be covered, as well as parts of chapters 2, 6, 8, and 11. Most of
chapter 1 and 2 should be known from a previous course, as well as parts of
- Introduction (1)
- Programming Languages (4)
- Data Structures (4)
- Algorithms (4)
- Operating Systems concepts (2)
- Complexity (2)
- Logic (2)
- Finite State Machines (2)
- Advanced Topics (11)
- Review (1)
Slides will be made available online after the lectures.
"The Faculty of Science is concerned with ensuring an
environment that is free of all adverse discrimination. If there is a
problem that cannot be resolved by discussion among the persons
concerned individuals are reminded that they should contact their
Chair, the Sexual Harassment Office or the Human Rights Consultant,
as soon as possible."
- Academic dishonesty consists of misrepresentation by deception or by other
fraudulent means and can result in serious consequences, e.g. the grade of
zero on an assignment, loss of credit with a notation on the transcript
(notation reads: "Grade of F assigned for academic dishonesty"), and/or
suspension or expulsion from the university.
It is your responsibility to understand what constitutes academic
dishonesty. For information on the various kinds of academic dishonesty
please refer to the Academic Integrity Policy, specifically
The following illustrates only three forms of academic dishonesty:
- Plagiarism, e.g. the submission of work that is not one's own or for
which other credit has been obtained.
- Improper collaboration in group work. (Note that all assignments in
SE 3M04 are to be done individually unless explicitly mentionned otherwise).
- Copying or using unauthorized aids in tests and examinations.
In this course we will be using a software package designed
to reveal plagiarism. Students will be required to submit their work
electronically so that it can be checked for academic
- There is zero tolerance for academic dishonesty .
All assignments have to be solved by one person only,
any outside source, this includes asking other people,
or using any books or information found on the web has to
be documented. In complience with the senate regulations
on academic integrity I remind you that:
People who let other people copy are as guilty as the ones who copy.
You are allowed to consult outside sources, meaning textbooks
or the web, but any use of an outside source
must be documented.
- In the case the instructor or a TA
has the impression that an assignment is copied, the instructor can
ask the corresponding students to explain exactly how the assignment
was prepared and take appropriate actions.