Carleton University

Department of Systems and Computer Engineering

________________________________________________

 

ECOR 1606 (Formally 91.166)  

Structured Problem Solving and Computers                               Fall 2002

 

COURSE OBJECTIVE:

 The course is intended to leave students capable of using a computer to solve simple problems.

LECTURER:

  John Bryant
  Office  4246ME
  Telephone:  520-2600,  extension 1375
  email: bryant@sce.carleton.ca

OFFICE HOURS:

  Monday:  14:30-15:30
  Tuesday: 10:00-12:00
  Wednesday: 14:30-15:30
  Thursday: 10:00-12:00, 13:00-14:30
  Friday: 14:30-15:30

INSTRUCTIONAL RESOURCES:

Web Site: http://www.sce.carleton.ca/courses/91166/f02
Text (**Optional**): Understanding Programming – An Introduction Using C++ by Scott Cannon 
Notes: Lecture notes will be posted on the course web site.
            Sets of notes should be available from the IEEE office for a modest amount.
Consulting Service: TA's will offer a consulting service in room 4390ME.
                                  The hours will be posted on the web site once they are determined

EXAMINATIONS:

There will be three “in-term” tests.  These will be held during class times on October 2nd, October 23rd, and November 13th.  Students who have a valid reason for missing a test will be given an opportunity to write a (slightly harder) replacement test sometime during the following week.  Students who do not have a valid reason for missing a test, or who do not show up for the replacement test, will be awarded a zero for that test.

In order to pass the course, students must get at least 5/10 on at least one of the three “in term” tests.

A final examination will be held during the University’s examination period.

Both the “in term” tests and the final will be closed book with no calculators allowed.  Students will, however, be supplied with standard “crib sheets” containing basic information.   Copies of these will be posted on the web in advance of each test.

The final examination is for evaluation purposes only and will not be returned to students.

If a deferred examination is necessary, it will be held in a computer lab, and, in order to pass the course, students will be required to produce a 100% correct solution to a simple problem (i.e. students will be required to demonstrate that they have in fact met the course objective).

EXERCISES:

A total of at 11 exercises (one every week) will be posted on the web site as the course progresses.  All exercises except the last one are due Tuesdays. The first must be submitted by midnight September 24th, the second by midnight October 1st and so on.    The last assignment is due by midnight Monday December 2nd. . Exercise solutions are to be submitted electronically, using either your own machine or one of those in the lab.

Each exercise will be marked on a scale of 0 (hopeless) to 4 (excellent).  Exercises are worth 10 “final” marks, calculated as follows:

exercise mark = (total marks for best 9 exercises) * (10.0 / 36.0)

Only the best nine exercises count. You can miss two exercises completely and still earn the maximum possible exercise marks. Please do not ask for exemptions and/or extensions because of illness and so on - you have, in effect, two "sick days" to play with, and it is up to you to use them wisely.

Exercise marks are conditional upon students being able to explain their work if asked to do so.  Students who are strangely unfamiliar with what is supposedly their own work will have their marks adjusted accordingly.

Do not conclude that, because the exercises are "only" worth 10% of your final mark, they are not worth doing. For one thing, the real reward for doing the exercises comes on the tests and the final, where the skills you have learned in doing the exercises will let you earn many more marks.  Also you must get at least 3/4 on at least five of the exercises to pass the course.

GRADING SCHEME

exercises 10%, in-term tests 3x10%,  final 60%  OR final 100%  (whichever gives the higher mark)

Whichever grading scheme is used, students will awarded an FND if they have not
    1/. Received at least 5/10 on at least one of the “in-term” tests AND
    2/. Received at least 3/4 on at least five of the exercises

WEEK BY WEEK OUTLINE::

This outline is intended only a general guide to what will be covered and is subject to change.

           Week                              Material

1&2     Introduction:  algorithms, while loop’s and if-then-else’s, a first look at C++ programs
3&4     The rules of the game: basic C++ syntax, operators, expressions 
5&6     Modular design: functions
7          Bisection Search
            File handling (how to read from and write to files)
8          Simulation as a problem solving tool
9          Arrays
10         "C" strings
11         Structures
12         Linear Regression & Correlation
             Multi-dimensional Arrays

STUDENTS WITH DISABILITIES:

 

Students with a disability requiring academic accommodations in this course are encouraged to contact a coordinator at the Paul Menton Centre for Students with Disabilities to complete the necessary letters of accommodation. After registering with the PMC, make an appointment to meet with your course professor at least two weeks prior to the mid-term test to discuss your needs. This is necessary to ensure sufficient time to make the necessary arrangements. Please note that the deadline for submitting completed forms to the PMC in this course is November 1.