blah.

stuff

Thursday, July 27, 2006

BLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAH
BLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAH
BLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAH
BLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAH
BLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAH
BLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAH
BLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAH
BLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAH
BLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAH
BLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAH
BLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAH
BLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAH
BLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAH
BLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAH
BLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAH
BLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAH
BLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAH
BLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAH
BLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAH
BLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAH
BLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAH
BLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAH
BLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAH
BLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAH
BLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAH
BLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAH
BLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAH
BLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAH
BLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAH
BLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAH
BLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAH
BLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAH
BLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAH
BLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAH
BLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAH
BLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAH
BLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAH
BLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAH
BLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAH
BLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAH
BLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAH
BLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAH
BLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAH
BLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAH
BLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAH
BLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAH
BLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAH
BLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAH
BLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAH
BLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAH
BLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAH
BLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAH
BLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAH
BLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAH
BLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAH
BLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAH
BLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAH
BLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAH
BLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAH
BLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAH
BLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAH
BLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAH
BLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAH
BLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAH
BLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHvBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAH
BLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHvBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAH
BLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHvBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAH
BLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHvBLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAH
BLAHBLAHBLAHBLAHBLAHBLAHBLAHBLAHv

Tuesday, June 13, 2006

me 64, 72, 68
sy 60, 59
jt 57, 60
ringo 70, 65, 93

Monday, June 12, 2006

http://www.calvin.edu/academic/cas/gpa/posters/1933ba.jpg

This poster is from the March 1933 Reichstag election, the last one in which Germans had a choice. The poster shows President Hindenburg and Chancellor Hitler. The caption: "The Reich will never be destroyed if you are united and loyal." Courtesy of Dr. Robert D. Brooks.

http://kriegsende.ard.de/container/ndr_style_images_default/0,2299,OID1061244,00.jpg

The ship Wilhelm Gustloff, who's final voyage was evacuating civilians and wounded German soldiers and sailors from Gdynia (known by Germans as Gotenhafen or Gdingen) near Danzig (Gdańsk) to Kiel. The Gustloff was torpedoed 30 kilometres offshore and somewhere between Władysławowo ( Neustadt in Westprussia) and Łeba. According to the ship's records, the total number of passengers who died was 6,050 people. Including the unregistered, the death toll was almost certainly higher

Tuesday, June 06, 2006

1 The simplest control structure is the sequence. The direction of flow passes through all steps in this structure. In pseudocode, a sequence will always be indented the same amount. As a flowchart, the sequence is identified as a number of steps flowing down the flowchart.

2 The three structures are sequence, selection and repetition.

3 A sequence consists of a number of steps that are to be performed one after the other, each step being performed once in the pass.

4 An algorithm in pseudocode starts with BEGIN and finishes with END.

5 Indentation allows the structure of the algorithm to be clearly seen.

6 A flowchart starts and finishes with terminal symbols containing the keywords BEGIN and END respectively.

7 The process symbol represents an action that is to be carried out.

8 The flow direction is from top to bottom since that is the natural direction for us to read.

9

get steak and oil

heat oil in frying pan

put steak into frying pan

turn steak as required

remove steak when cooked

10

get pencil and sharpener

put pencil into sharpener

turn pencil

remove pencil from sharpener

11

    a

    BEGIN sharpen pencil

    get pencil and sharpener

    put pencil into sharpener

    turn pencil

    remove pencil from sharpener

    END

    b


12

get bowl, cornflakes, milk and sugar

fill bowl with cornflakes

pour milk over cornflakes as required

pour sugar over cornflakes as required

Thursday, June 01, 2006

1
a pseudocode
b word processor
c keywords
d indentation
e flowchart
f flowlines
g algorithm
h terminal
i decision
2 Some of the methods of algorithm description used today are:

flowcharts, pseudocode, structured English, Nassi-Schneiderman diagrams and English prose. The two methods approved for this course are flowcharts and pseudocode. The graphical method is the flowchart. The method that uses English-like language is called pseudocode. When using flowcharts, we read them from top to bottom and left to right, moving from step to step along flowlines. Pseudocode is popular because its keywords are close to those in programming languages.

3 Pseudocode is a text-based algorithm description method.

5 Flow of control is from top to down

13
a
BEGIN
phonecall
pick up the phone
dial number
deliver message
hang up phone
END

14
BEGIN
frypan heat
crack egg
egg in pan
wait 3 minutes
take egg out
clean pan, turn off element
END

15
Begin
drive car out
get hose
clean off dirt
get bubbles/washing liquid
clean in detail
get hose
wash off
dry with cloth
drive car back in garage
clean up stuff
END
Algorithm

Decision tree
Pseudocode

Important that algorithm is in a specific order, and can be full understood.
Should be fully tested and chekd against the desired outpu, if required, s hould be modified.
One start, one ending.
Input/Output structure

Pseudocode:


Popular
Easily written, in english.
Flow from top to down
Group in paris, if begin, there is end. If if, endif.

Wednesday, May 31, 2006

1
a An algorithm is a series of instructions or steps which when performed correctly will solve a problem in a finite time.
b Algorithms can be used to describe simple tasks or actions that you do each day.
c Algorithm description is commonly used in recipes, do-it-yourself manuals, and knitting manuals.
d Each step in the algorithm must be simple enough so that it can be easily carried out.
e For the algorithm to work in all situations, the steps must be performed in a particular sequence or order.
f Before an algorithm can be written, the problem must be fully understood.
g How you arrive at a solution depends very much on past experience.
h After the algorithm has been written it needs to be tested or checked.
i If the results are wrong it is modified or discarded.
j There is usually more than one correct algorithm.
2 An algorithm consists of a finite number of steps which, when followed, will solve a problem. An algorithm must have a definite start or beginning and a single end. The steps of an algorithm must be performed in a particular order for it to work.
3 Algorithms are created to solve problems. Algorithms provide a ‘recipe’ for solving the problem.
4 Algorithms can be used to solve most types of problem.
5 Algorithms are commonly found in recipe books, knitting patterns, do-it-yourself instructions, instruction books and instructions that come with systems such as automatic telephone systems.
6 The problem needs to be analysed and understood before an algorithm can be written to solve it.
7 The inputs and outputs affect how you arrive at a solution.
8 The algorithm needs to be tested after it has been written to make sure that it works properly. If it doesn’t work properly it will need to be changed and tested until it does work.
9
a get book
open to first page
read book
close book
b get bread
get butter
put bread in toaster
remove toast from toaster
butter toast
10 The algorithms will vary from student to student, but should include these basic steps:
get two slices of bread
get butter
get cheese
butter one side of each slice of bread
put cheese on buttered side of one slice of bread
put other slice of bread butter side down on cheese
cut sandwich
11
choose CD
take CD out of case
turn CD player on
put CD in CD player
press start button
listen to CD
when CD is finished, remove it from CD player
put CD back in case
turn off CD player
12
get bicycle pump
screw pump onto tyre valve
pump tyre up
unscrew pump from tyre valve
put pump away
Begin
Cut a slice of bread from the loaf
Place in the toaster
Turn on the toaster
Wait three minutes
Remove the toast
Butter it
Add a slice of cheese
End

Turning on the toaster can be placed in any of three places.

Begin

Set the total to zero
Sort coins by size
Count the 5c coins, call the result N
Add 5 x N to the total
Count the 10c coins, call the result "whatever you like"
Add 10 x "whatever" to the total
Count the 20c coins, call the result X
Add 20 x X to the total
Count the 50c coins, call the result Y
Add 50 x Y to the total
Divide by 100
Display the total

End

Tuesday, May 30, 2006

Intro: My aim is to find out the relationship between the speed of someone's typing and the speed of their handwriting

Hypothesis: Typing does affect handwriting speed.
As you learn to type faster, your brain adjusts to accepting more information at once, and processing it, so you learn to memorise more, and write it down faster as a result.

Background research:

Method:
Materials - Paper, pen, computer + keyboard, stop watch
Investigation set up?

Procedure:
Tiaan heard a sharp intake of breath, a door banged and the voices were cut off. She headed in the other direction, out behind the skeet houses. Ten thousand gold tells was the worth of a town.

Timed kb at 30 sec.

3 tries at keyboard, then one with handwriting.

+1 sec for each mistake on keyboard.

Handwriting has to be legible.

Reliability - redo if results are skewy
Controlling variables - use same pen/paper, same type of keyboard/screen and passage of writing

risk assessment- maybe rsi, but a short burst of activity, not long prolonged activity

results:

at home

discussion/analysis:

conclusion: i am right. or wrong.

Bibliography: Google, wiki, books.