Final TIK2O1 marks

Have a great summer!


Final marks may be viewed either in Google Docs at
http://tinyurl.com/nazcet

          or here     ↓

Try these questions from old test

1. Write a program named target.t that does the following:
• in an Execution window of 500x500 pixels, creates a brightred and white target exactly fitting in the window, as illustrated, with each ring 50 pixels wide


2. Write a program named flower.t that does the following:
• creates a flower with four petals as illustrated, the outlines of the petals in blue, the centre circle of radius 25 pixels and coloured green. The tips of the petals exactly touch the corners of the screen
• the flower should fill the Execution window as shown, no matter what size the screen is set to


3. Create a simple shape that represents a spaceship. Animate it so that it appears to be launching from the bottom left of the screen to beyond the top right of the screen. Then make the spaceship accelerate as it moves up and across the screen. Then re-design your spaceship to make it look a little more realistic.


4. Write a program that makes a balloon float from the bottom of the screen to disappear off the top of the screen. When it disaapear, another ballon does the same thing, starting froma different position.

4. Write a program that drops a rectangle from a random point along the top of the screen, like the game Tetris. When it reaches the bottom, it disappears and another rectangle drops from a different random points along the top of the screen./

Ch 7 Test Postponed (again).Now on Tue., Feb. 24

Thurs. Feb. 12 - Finish Turing Ch. 7 in class
Fri. Feb. 13 - P.D. Day
Tue., Feb. 17 - Begin Turing, Ch. 8 (Pixel Graphics)
Thurs., Feb. 19 - Class canceled (Parent Interviews)
Fri., Feb. 20 - Computer lab unavailable (new computers being installed). Meet in Rm. 231. Bring seat work (e.g. study for Turing test on Ch.7 )
Tue., Feb. 24 - Test on Turing Ch. 7 (Character Graphics)

Schedule for coming two weeks

Tue.     (Jan. 13) - Norton 27
Thur.  (Jan. 15) - Norton 27
Fri.      (Jan. 16) - Turing 7
Tue.    (Jan. 20) - Turing 7
            (No test allowed because of Civics test)
Thur. (Jan. 22) - TEST on Norton 27
Fri.      (Jan 23) - Turing 7

Test on Turing, Ch. 6 next Friday, Dec. 19

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.



DO NOT BE ABSENT. Yes, Friday is the last day before the holidays, but the class did not want the test on Wednesday, so it was postponed until Friday.

Turing, Ch. 6 - repetition (loops)

In Chapter 6 you learn how to create repetition in a Turing program.

Remember the repetition you created in Scratch using the "forever block"? In more traditional programming languages, such as Turing, a similar structure is known as an infinite loop. That is, it continues without stopping. We use infinite loops in later chapters with graphics to create endless patterns and colours on the screen.

More often you will want some sort of loop you can control not to go on forever. We will look at two:

-- the conditional loop, which ends when some variable meets a certain condition, such as a number becoming more than 100

-- the counted loop, which continues only the number of times you want it to.

Fri., Nov. 21 -- Turing again

You should have your Scratch project completed by the end of class on Thursday. Be sure it is named after yourself and ends with the .sb extension. (If your name is Barack Obama, your file would be named BarackO.sb). Leave a copy in the Dropoff Folder (Schreiber / TIK201)




On Friday bring your Turing textbook. We will do a quick review of Chapters 4-5, then begin Chapter 6: Repetition (Loops).