CSCI 1040U Study Guide - Final Guide: Binary Search Algorithm, Linear Search, Opcode
Document Summary
Bits: 0 and 1; true and false. Boolean operations: work with true or false values, and (only true if both inputs are true, or (true if at least one of its inputs is true, not (converts true to false, xor. Gates perform these operations: special symbols for each operation. Flip-flop: more complex gate, main memory structure, stores 1 bit of information, 8 flip flops needed to store a byte. Main memory: dynamic random access memory (dram, very fast, problem is its expensive, and loses information when the computer is turned off speed is close to speed of processor. Better memory sources -> mass storage devices: dvd, hard disk. Ascii: uses 8 bits of information, only qualifies 256 characters. Unicode: uses 16 bits, around 6500 possible characters. Integers represented using a binary format: uses just 2 digits -> 0 and 1, 2x.
