Year 13 SQL Support

Iterations - Groundhog Day Lesson Notes - Yr10

LESSON NOTES CAN BE FOUND HERE

Storage and ROM/RAM

Is optical storage becoming obsolete?

Read the article above and create your own blog post outlining the future of data memory.

Post the links to your blogs in the comments below.

ROM v RAM

Watch the very old video here, and then research recent developments/changes in ROM/RAM. Details of task to follow...

Input/Output

Read through the Quizlet cards here

and then complete the scatter challenge.

GPUs

The slides for today's lesson can be found here .

Research Task:

• Compare and contrast two GPU specifications; these can be obtained from a reseller or a manufacturer’s website.
• Analyse the suitability of the GPU for a range of tasks other than playing video games.
• Explain how the GPU is used.
• Identify the benefits.
• Evaluate the impact on the overall performance of the computer system.

AS/A Level Crossover

See the official OCR document HERE to see what's unique to AS and A-Level and which topics crossover the two.

Year 10 Lesson 1/2 Notes - Algorithms

The notes from the first few lessons can be found here .

Mary's Viennese Whirls

On The Great British Bake Off on Wednesday evening the bakers had to make 12 Viennese Whirls.

The full recipe can be found here but we're just going to focus on the first part of the recipe which is making the jam.

For the jam, put the raspberries in a small, deep-sided saucepan and crush them using a potato masher. Add the sugar and bring to the boil over a low heat. When the sugar is melted, increase the heat and boil for a further 4 minutes. Remove from the heat and carefully pour into a shallow container (pass it through a sieve if you'd rather not have seeds in your jam). Leave to cool and set.

1. Create an algorithm that will solve the problem of making the jam.

2. Label each section as either Sequence, Iteration or Selection.

3. Read through your algorithm:
(i) Does it always make jam? (Is it correct?)
(ii) Is it as quick as it could possibly be? (Is it efficient?)

Extension:
4. Create a flow chart of your algorithm.

Socks Algorithm

From BBC news:

People often end up pulling out a sock, one at a time, and searching for its partner. But sorting socks this way can be a slow process.

If you only owned one pair of socks it would be fine - apart from the personal hygiene implications.

But each new pair added to the mix makes things harder in two different ways - first, you've got to pair up more socks, and second, each sock that you're trying to pair up is swimming in a larger pile of unmatched socks.

Two pairs will take four times longer to match, on average, than one pair. Five pairs will take 25 times longer and 100 pairs will take 10,000 times longer, according to computer scientist and co-author of Algorithms to Live By, Prof Brian Christian.

Question for thought:

In your new OneNote notebook, create a page for algorithms, give it a title and suggest an idea of speeding up the sorting of socks.

Little Man Computer

The Little Man Computer (LMC) is an instructional model of a computer, created by Dr. Stuart Madnick in 1965. It models a simple von Neumann architecture computer - which has all of the basic features of a modern computer. It can be programmed in machine code (albeit in decimal rather than binary) or assembly code. (according to Wikipedia).

A (hopefully) functioning simulator can be found at http://peterhigginson.co.uk/LMC/

Find some tutorials online (some good ones can be found at http://www.yorku.ca/sychen/research/LMC/ ) and test them on the Little Man Computer.

How a CPU works!

A very brief introduction into the makings and machinations of a basic CPU.