01:198:170 Study Guide - Midterm Guide: Program Counter, System For Information On Grey Literature In Europe, Hertz

• School: Rutgers University
• Department: Computer Science
• Course: 01:198:170
• Professor: Stoll

Document Summary

Instruction decode: figuring out what to do. Data fetch: data needed to do it. Result return: saving result and repeating. Memory- stores both the program while it is running and the data on which the program operates. Discrete locations- memory org like apartment building mailboxes, byte=8bits. Addresses- every memory location n has an address ,whole numb start from 0. Values- memory location record/store value, mailbox hold letter. Finite capacity: memory capacity have finite size, data might not fit. :discrete locations of byte-size memory, each with and address and each containing a value. Byte size memory location : each memory location of 1 byte can store one ascii character or a whole number less than 256. Use a sequence of memory locations, treat address as it were the address of the whole block of memory ( memory words) Ram: random access: can refer to memory locations in any order. (megabytes or giga)