# computer science

## 243/Computer Architecture/Learning Resources

### Interesting and helpful learning resources (short videos, demostrations, animations, magic tricks and etc. )

Some of the learning resources are shown in lectures, which are mainly used to encourage the students' interests and help to understand the related lectures' content. This has no relationship with the examination. So, feel relaxed to take the trip of computer Architecture! It would be much appreciated if you can let me know any suggestions or problems.

### Lecture 1

• Ones and Zeros
• From text to binary and back again
• Binary ASCII code Crop Circle
• Unicode
• Top 10 Valentine’s Day Cards for Silicon Valley Techies (One of the card is using ASCII code)
• Binary Magic Trick
• ### Lecture 2 -3

• Decimal, Binary, Octal and Hexadecimal
• Binary Arithmetic
• Binary to Decimal to Hexadecimal Converter
• Convert Decimal to Floating point number [IEEE 754]
• Online Binary-Decimal Converter
• Why 0.1 Does Not Exist In Floating-Point
• ### Lecture 4

• Logics in computers
• Logic Gates Introduction
• Animations of the Basic Gates
• Logic Gates by toys
• Logic Labs
• ### Lecture 5

• 7-Segment Decimal Decoder Example
• S-R Latch Demostrations
• S-R Latch Animation
• Flip Flops Experiment
• 3-bit Counter
• Logic Labs (construct an online circut by yourself?)
• ### Lecture 6

• Inside Computers!
• Registers Animation
• CPU components explianed
• Von Neumann Architecture
• ### Lecture 7-8

• CPU Cycle Animation
• Machine code
• Why study assembly language
• Easy 6250: first program
• 6502 Instructions
• Assembler
• ### Lecture 9

This lecture is a bit advanced level. I am thinking of the examination questions no to be so complicated. Some of the students are confused about assembly language codes with regards to the examination. After some discussion, we think that the requirement for examination related the assembly language will be focused on developing the ability of "reading the codes" instead of "writing the code". So, you need to understand the assembly language. With regards to the codes, the final exam will not possible to require you to write codes, but will possibly require you to read codes. We hope this will release your confusion in studying this part and give you some guidance in preparing your exam. Please feel free to let me know if any problems.

• Examples for interests:
• JSR (Note: address-1 of next instruction in this link = pc+2 on slide 40 of lecture notes 7-8, ask me to explain if you do not know why)
• RTS
• calling-convention
• Fibonacci/Golden Ratio 1.618
• Fibonacci Recursion
• ### Lecture 10

• Memory Hierarchy from wiki
• Rom and Ram nicely explianed
• PROM / EPROM / EEPROM
• Cache
• Magnetic disk from Physical view
• Hard disk organization
• How CD works 1
• How CD works 2
• RAID explianed
• RAID levels
• ### Lecture 11-12

• Input devices
• Polling examples in tutorial
• How CPU works in one lesson
• Fetch cycle (other cycles demostrations on the left)
• Look at the figures in tutorial
• Pinplining
• ### Lecture 13

• Moore Law
• Moore Law Wiki
• RISC vs CISC
• SISD SIMD MIMD
• Interesting Computer Energy-Saving Facts
• Dual Core