- Lower than 255
- Greater than 255
- Negative
- Positive
- ARM
- RISC
- GPU
- CISC
- By using pipeline
- By using cache memory
- By transferring more data
- By performing the same operation more frequently
- LOAD, STORE, PUSH, PULL
- A memory, a control unit and an arithmetic unit
- An infinite tape, a reading/writing tape, a table of instruction
- A list of states, with for each state an entry action and an exit action
- The mantissa
- The sum
- The opcode
- The comma
- ARM
- RISC
- GPU
- CISC
- Capacitors
- Wires
- Resistors
- Transistors
- One's complement
- Flip Bits
- Divide and conquer
- Two's complement
- 0 and 1
- AND, OR, NOT
- ADD, SUB, MUL
- LOAD, STORE
- Tea time
- Link Time
- Compile time
- Runtime
- Turing machine
- Gothic
- Vom Neumann
- Finite state machine
- SISD
- MIMD
- SIMD
- MISD
- Bigger and faster
- Faster and smaller
- Smaller and slower
- Bigger and slower
- George boole
- Charles Babbage
- Edsger Dijkstra
- Alan Turing
- LOAD/ADD
- LOAD/STORE
- ADD/SUB
- ADD/AND
- ROM
- DRAM
- SRAM
- EPROM
- ROM
- DRAM
- SRAM
- EPROM
- It’s cheaper
- It’s faster
- Better bandwidth
- Lower latency
- Optimizes the number of instructions per program
- Widely available for personal computers
- Has a larger range of instructions
- Faster instructions
- Two’s complements
- Classic notation
- HTML
- Scientific notation
- 2 times
- 0.25
- 0.5
- 4 times
- Perform and print
- Add, transfert and save
- Loop, execute, and jump
- Fetch, decode and execute
- Into the CPU
- In the BUS
- Into the RAM memory
- In the BIOS
- Caches
- TLB
- Pipelining
- ALU
- By having a hight frequency than CPUs
- By using cache memory
- By having a lot of simple cores performing the same operation at the same time
- By having an extended set of instructions
- Amdahl’s law
- Murphy’s law
- Bell’s law
- Moore’s law
- The address of the next instruction
- The number of programs
- The number of cycles
- The return address
- Holes
- Bubbies
- Segmentation faults
- Core dump
- By doing memory
- By reusing data
- By unrolling loops
- By spacing data in the memory
- An IDE
- A Hex editor
- A compiler
- A parser
- 3 XOR gates
- 2 NOR gates
- 1 AND gate
- 2 AND gates
- Statically
- First in, first out
- Dynamically
- Round robin
- A list of bits
- A hight level programming language
- A symbolic representation of machine instructions
- An object oriented programming language
- 1 instructions every 2 cycles
- 1 instructions per cycles
- 2 instructions per cycles
- Over 9000 instructions per cycle
- Instructions
- DATA and instructions
- Cache
- DATA
- 1
- 2
- 3
- 4
- AND
- NOT
- XOR
- OR