Turing Ch. 7 - see Pickup Folder

The Pickup Folder has the following files:

* Ch07_xtraExers.doc
--- Extra exercises to give you more practice

* Ch07_CharacterGraphics_textExers_ANSW_Q01-06.pdf
--- Answers to the extra exercises)

* Ch07_CharacterGraphics_exercises_hints.doc
--- Hints for some of the trickier points in the exercises at the end of the chapter

Turing, Ch. 7 - in-class assignment

Create a new Turing program named after yourself (e.g. BackO_Ch7_assignment.t).

You may use your notes, the textbook or any programs you have saved on your home drive

Using the some of the sample programs in Chapter 7 (pp. 118-129), create a program that
1. begins by colouring the entire screen blue

2. simulates the bouncing of a rectangle, using the characters [], starting near the bottom left of the screen at location 25,2 and moving diagonally upward to the right

3. the rectangle consists of red characters, and the background of the characters is yellow

4. the speed of the "movement" is slow enough that the movement can be easily seen

Test Mon., Jan. 11 -- Norton, Lessons 9 and 10

There will be a test on Norton, Lessons 9-10 next Monday, Jan. 11.

Welcome back! - week of Jan. 4, 2010

Let's hope everyone had a nice holiday and feels refreshed.


Is it really 2010?

Norton, Lesson 9 - assignment

Look at p. 180 of the Norton textbook (lesson 9)

Hand in a printout with your name on and -

A. Definitions
any six of the following definitions:
polarized, formatting, track, sector, master boot record, FAT, fragmented, storage device, storage media
See p. 180 to see where the definitions are in the textbook

B. Key Terms
Copy the ten sentences, filling in the blanks in bold with the appropriate term.

Wed., Dec. 13 - bring Norton textbook

Test on Turing, Ch. 6 next Monday, Dec. 7

There will be a test on Turing, Ch. 6 next Friday, Dec. 19.

It is not intended to be challenging. There will be plenty of simple, straightforward
questions to be answered on paper, enough of them so that anyone who has studied the notes can earn a good overall mark on the test. Some of the questions will even be True or False! How easy is that?

Whether you find writing programs in Turing easy or hard, you do of course have to learn what is in your notes. That's obvious, right? It's not many pages to study. Check your answers against the .pdf file in the Pickup Folder.




Also on the test, in addition to the questions answered on paper, will be a few questions requiring you to write short programs in Turing. At least two of them are meant to be easy. They will simply ask you to write something like the programs in
-- the content of the chapter, or
-- the "Practice Exercises" in the Pickup Folder, or
-- the easier questions at the back of the chapter.

By the way, we will look at the questions at the end of the chapter in class next week and you will be give model solutions for all of them.

There will probably be one programming question a little more challenging, just so some people don't get completely bored.