Update it as you develop your knowledge & skills
Khan Academy & Code.org "How Computers Work"
Create a Infographic / Diagram of "Input / Output / CPU / Storage & User" with images of the Hardware devices
Easy
Funny
More detailed
Q. How many Bits is this 00000 ?
Q. What's the pattern, from 1, 10, 100, 1000? Clue have you played 2048
Q. What's the quick way to work out 0001 1111 ?
Q. What is the highest number you can count on your hands' ten digits?
Copy these Questions into a Google Doc,
Represent 7 with 3 bits
Represent 18 with 4 bits
Represent 101 with 7 bits
Represent 28 with 10 bits
Represent 28232 with 16 bits
Make a new Google Doc and title it 'Binary'.
Insert a table with 14 rows and 6 columns like in this Binary Alphabet sheet. Fill in Alphabet A-Z, e.g. 1 = A, Z=26.
Encode your age into Binary, e.g. 42 (32+8+2) 0010 1010
Encode the letters of your name into Binary, e.g.
Encode a short message, Swap these with a class mate to decode. (if you want to make it easier - swap letters for decimals, e.g. A,B,C for 1, 2, 3 )
- Q. can you decode them accurately? What problems did you encounter? What errors occurred?
OVD HYL FVB
ZNK WAOIQ HXUCT LUD PASVY UBKX ZNK RGFE JUM
Try the Frequency Analyser to solve:
F QTSL RJXXFLJ HTSYFNSX QTYX TK
XYFYNXYNHFQ HQZJX YMFY HFS GJ
ZXJI YT FSFQDXJ BMFY YMJ RTXY
KWJVZJSY QJYYJWX FWJ, FSI JAJS
YMJ RTXY HTRRTS UFNWX TW YWNUQJX
TK QJYYJWX HFS MJQU YT GWJFP
YMJ HTIJ
Encryption on Code.org: https://studio.code.org/s/hoc-encryption/stage/1/puzzle/1
http://csfieldguide.org.nz/en/interactives/parity/index.html
Can you describe the purpose of a sorting algorithm and compare the efficiency of different sorting algorithms?
Questions:
Which scale well? E.g. still work well for big groups of data
Can you use Binary Search on unsorted data? If not, why not?
There are a variety of different ways to sort things. Some seem trivial with a small group but become very slow and 'expensive' at scale with a large group.
Binary Sort
Bozo Sort
Linear Search
Quick Sort vs Selection Sort
Click the link (right).
How to use: Press "Play all", or choose the button for the individual row/column to animate.
Try out and compare different problem sizes for the Quicksort & Selection sorting algorithms.
Make a copy of this spreadsheet. Compare how many tries/comparisons they take with different amounts, e.g. 10, 20, 30, 40, 50, 100, 1000
Q1) What do they graphs tell you about how they work? e.g. well or badly with big problem sets of data?
Q2) are there any patterns to the data that you notice?