Table of Contents

Curriculum Vitae (PDF)

Research Interests

CyberEthics Distance Education
[Requires Password]

CyberEthics On-Campus
[Requires Password]

Key Concepts in
Computer Science

ATARAXIS: Discussion Forum for
1. Key Concepts in CS
2. Problem Solving and Info on the Net

Problem Solving and
Info on the Net

Link to CS homepage

Ethics in the Professions
[Requires Password]

Modes and Methods of Inquiry

Need Adobe Acrobat?

School of Computer Science

University of Windsor
Lambton Tower 8115
401 Sunset Avenue Windsor, Ontario Canada N9B 3P4
Phone: (519) 253-3000 ext:3767 Course Related:

Dr. Pierre J. Boulos

Office Hours

Key Concepts in Computer Science

line.gif (1057 bytes)

Dr. Pierre Boulos

Office Hours:

Fall 2004: Tuesday, Thursday 1:00-2:00 pm OR BY APPOINTMENT

Lab Instructors:

line.gif (1057 bytes)

About the Course
Evaluation Scheme
Lecture Notes
Labs and Solutions
Tests and Exams from 2002-2003
Test Results

line.gif (1057 bytes)


    FALL 2004 Class: Exam viewing will take place Monday January 10th, 11-3 in LT 8118.
  • Welcome! You will find (hopefully) useful and important information regarding 60-100 (all sections on this page).
  • Make sure your computer account is activated. Your university-wide ARC1 account needs to be activated prior to having your CS (davinci) account activated. Go to the Computer Centre (located behind the CAW Student Centre) to activate your ARC1 account (or email If you wish to have your CS specific account activated as well, send an email request to (remember this can only be accomodated after your SGI account is validated).
  • NOTE: not all links are functional. Solutions to the weekly labs will be available only after the lab has been completed.

  • To participate in the Discussion Forum, click on the link at left. You will need to login to the forum using your University of Windsor username and password. You will need to request a subscription to the forum before being able to particpate in it.

  • Exam: Saturday December 18th, 7 pm (3 hours) St.Denis Centre. Section 1, rows 41-44, Section 30, rows 46-47.
  • Final Grades (which include Test 2 appeals) are posted below.Go back to the top
    About the Course 

This course introduces a number of key concepts in Computer Science. These concepts are the foundations of most of computer science and will form the basis of any further studies in fields such as software engineering, distributed computing, artificial intelligence, computer graphics, database management systems, etc.

The following subjects are covered in this course: 
  • Programming
  • Recursion
  • Data, Information and Knowledge Representation
  • Sets and Relations
  • Types of Data and Programs
  • Relational Algebra
  • Languages (Syntax)
  • Languages (Semantics)
  • Complexity Analysis
  • Induction
  • Logic

Below, you will find Lecture Notes, Lab Assignments and their solutions, Individual Assignments, Mid-term tests and soltions, test, exam, and final results, and other goodies. You will need a PDF reader to view the notes, assignments, and tests.
Go back to the top
Evaluation Scheme

Assessment of students taking 60-100 consists of various components. They will be weighted as follows in the calculation of the final grade. Note that class tests are held on Saturdays. The location of the tests and final exam will be announced later.

Group presentation & assignments10% (marked by the professor or assistant supervising the lab)
Individual assignments2 x 5% (10%)
Week 6 & week 12
Class Test #120 %Saturday 16th October
Time: 2-4pm Location: Toldo Centre 100
Class Test #220 %Saturday 20th November
Time: 2-4pm Location: Toldo Centre 100
Final Exam (slot 19)40% Saturday 18th December 7:00 pm – 10:00 pm

Students who wish to appeal a class-test, exam, or assignment mark should wait until they have received their final grade at the end of the semester and then follow the procedure outlined in the University Calendar for the appeal of that grade. No remarking of class tests or the final exam will be undertaken unless a formal grade appeal is submitted at the end of the semester after the student has received the final grade for the course. Numerical errors in adding marks on class tests and the final exam will be corrected when identified. There are no make-up tests or final exam in this course.
Go back to the top

Lecture Notes  

  • [PDF]  Introduction
  • [PDF]  Introduction to Recursive Programs
  • [PDF]  Recursive Programs, Basic Data Types, Program Types
  • [PDF]  Some Exercises in Recursive Programming 
  • [PDF] List Comprehension
  • [PDF]  Induction & Structural Induction (pp 58-69 of text)
  • [PDF]  Miranda Manual (make sure you click on "Show/Hide Navigation Pane" in Acrobat)
  • [PDF] Review material for test 1 -- lengthy
  • [PDF]  Introduction to Logic (Logic notes, Ch. 12 Text)
  • [PDF] Sets and Relations
  • [PDF] A tutorial on natural language
  • [PDF] Language Processing I: Syntax (Chapters 6&7 Text)
  • [PDF] Language Processing II: Semantics (Chapter 8)
  • [PDF] Language Processing III: Semantics (Chapter 8)
  • [PDF] An Example Database and Relational Algebra Program
  • [PDF] An Example of Constructing a Syntax Grammar
  • [PDF] Complexity
Go back to the top


  • Lab1 Solutions [PDF]
  • Lab2 Solutions [PDF]
  • Lab3 Solutions [PDF]
  • Lab4 Solutions [PDF]
  • Lab5 Solutions [PDF]
  • Lab6 Solutions [PDF] No Solutions, Test Viewing
  • Lab7 Solutions [PDF]
  • Lab8 Solutions [PDF]
  • Lab9 Solutions [PDF]
  • Lab10 Solutions [PDF]
  • Go back to the top

Go back to the top

Tests (Not Available)

  • Midterm Test1 [PDF]
  • Midterm Test2  [PDF]
Go back to the top

Tests and Exams from 2002-2003 Academic Year

  • Midterm Test1 Fall 2002 [PDF] Not Available
  • Midterm Test2 Fall 2002 [PDF]
  • Final Exam Fall 2002 [PDF] Not Available
  • Midterm Test1 Winter 2003 [PDF]
  • Midterm Test2 Winter 2003 [PDF]
  • Final Exam Winter 2003 [PDF]
    Go back to the top
  • Miranda error guide is here
  • A new version of Haskell: You need to download this and this .
  • The Haskell web page is located here.
  • comp.lang.functional (a newsgroup for those interested in pure functional programming)
    Go back to the top

Test Results and Grades

The final letter grade will be calculated from the raw scores using the following table:

93<100A+ 63<67C
86< 93A 60< 63C-
80< 86A- 57< 60D+
77< 80B+ 53< 57D
73< 77B 50< 53D-
70< 73B- 35< 50F
67< 70C +<35F-

  • All grades, includingTest 2 (with appeals), Final Exam, and Final grade (NOTE: these grades are unofficial and subject to change when warranted): click here.
Go back to the top

line.gif (1057 bytes)

In the news...
  • March break camps offer price break

  • DailyNews moves to Drupal-based system

  • DailyNews moves to Drupal-based system

  • DailyNews moves to Drupal-based system

  • DailyNews moves to Drupal-based system
  • Lancers Sport News

    Lancer News Archive
    Campus Events

  • Comments about our web pages? Send e-mail to: Web Administrator, University of Windsor. Last modified on 05/01/2005 by CN=Pierre Boulos/O=University of Windsor. Copyright 2005, University of Windsor. Although care has been taken in preparing the information in this site the University of Windsor cannot guarantee its accuracy.