Notesale: Turn your study into money

Document Preview

Extracts from the notes are below, to see the PDF you'll receive please use the links above

---

Outline
Tuesday, 4 October 2016

6:41 PM

Topic 4—Computational thinking, problem-solving and programming (45
hours)
4
...
2 Connecting computational thinking and program design (22 hours)
4
...
Return yes/true because we know v is in S
...

Then, repeat this trick on those remaining elements
...
Binary Search
Array of int or string
Input of int or string
2
...
Bubblesort
Inputs
- Unsorted array
Outputs
- Sorted Array
4
...
An algorithm deciding what next chess move to make
Inputs
- Your positions
- The opponents' positions
- What possible moves there are and the consequences
Outputs
- A move
6
...
An algorithm which calculates the sum of the first 107 prime nuumbers
Inputs
- nothing
Output
- Sum
Example precondition: array input is not null
Binary Search
Pre: array is sored
...
Cleaning your teeth
Precondition
- Teeth exist
Post-condition
- Teeth are clean
3
...

Precondition
- They exist and are available
Post-condition
- Meal is edible
5
...

Precondition
- N is an integer greater than 1
Post-condition
- The output is actually the output

21/02/17
Wake up at 10:00 am
Run washing machine at 10:10 am
Stack dishwasher at 10:15 am
Run dishwasher at 10:20 am
Watch Maths lecture and do tutorial questions sheet at 10:25 am
Hang out clothes at 10:50 am
Unstack dishwasher at 11:00 am
Wash wooden spoons and cutting boards at 11:05 am
SUMOFSQUARES=0
Loop INDEX from 1 to 100:
Topic 4 Page 3

Loop INDEX from 1 to 100:
Output INDEX^2
SUMOFSQUARES = SUMOFSQUARES + INDEX^2
End loop
Output SUMOFSQUARES
Cached algorithm
SUM = 0
Loop index from 1 to 100
SQUARE = INDEX^2
Output SQUARE
SUM = SUM + SQUARE
End loop
Output sum

23/02/17
Write as many details about yourself as you can
...
I store all my notes on my computer
...

I have moved house 3 times
...
Write which of the above details would probably be
recorded if you enrol at that university
...

Went to QASMT
...

check = false
loop i from 0 to n-2 <- worse case n-1 times
loop j from i+1 to n-1 <- worst case n-1 times
if NAMES[i] = NAMES[j] <- this gets done <=(n-1)2 times (n2-2n+1)
check = true;
end if
end loop
end loop
output check
Given a sorted array S of integers, find whether a value v, in in S
i=0
loop while i < S
...
length
if v

---