Lecture Quiz 17                            

Select the correct answer
 
 1. accumulator (acc)       2. address (numerical)    3. applications software
 4. as                      5. assembler              6. assembly language
 7. assembly directive      8. cc1                    9. CISC
10. collect2               11. compiler              12. cpp
13. DRAM                   14. file                  15. gcc
16. hardware               17. high level language   18. instruction pointer (IP)
19. linker                 20. level 1 cache         21. level 2 cache
22. loader                 23. location counter      24. machine language
25. machine language inst. 26. memory (main memory)  27. memory fetch
28. memory store           29. nano                  30. Operating system
31. numberic op code       32. position independent  33. processor (CPU)
34. processor register     35. queue                 36. RAM
37. relocation             38. RISC                  39. ROM
40. software               41. SRAM                  42. stack
43. stack pointer          44. Storage hierarchy     45. symbolic address
46. symbolic op code       47. virtual memory
 

____  1. Processor register containing the results of arithmetic operations.

____  2. Numerical identifier that uniquely identifies a memory byte or word.

____  3. Microsoft Word, nano, cc1, as, and collect2 (but not Linux or Vista) are
         examples.

____  4. Our assembler (name of the Linux program). Inputs .s files and outputs .o files.

____  5. Translates assembly language programs into machine language.

____  6. Programming language that uses symbolic operation codes and addresses. Each  
         instruction in this type of program language usually generates a single machine 
         language instruction. One-to-one with machine language.

____  7. Examples include .end, .word, and .=100.

____  8. Our C compiler. Inputs .c or .i files and outputs .s files

____  9. Name for a processor design that uses many different operation codes (hundreds).

____ 10. Our linker. Inputs one or more .o files and outputs a machine language program
         ready to run.

____ 11. Translates a high level language program into assembly language.

____ 12. Our C preprocessor. Inputs .c files and outputs .i files.

____ 13. Memory technology using a transistor and a capacitor for each bit. Slower but 
         less expensive alternative. Used for main memory.

____ 14. Name for a sequence of bytes.

____ 15. Our C compiler driver. Calls the preprocessor, the compiler, the assembler, and 
         the linker.

____ 16. The physical parts of a computer system (processor, memory, I/O devices, etc.).


____ 17. Each instruction in this type of programming language may generate many machine
         language instructions.

____ 18. Processor register that contains the address of the next instruction to be 
         executed.

____ 19. Inputs one or more object (*.o) files and outputs an executable file.

____ 20. The faster but smaller cache. Contents can be accesses almost as quickly as the 
         contents of processor registers.

____ 21. The larger but slower cache. Still much faster than main memory.

____ 22. Reads an executable file from disk into memory and starts execution of the 
         program.

____ 23. Variable in an assembler that keeps track of the memory address where the next
         word is to be placed.

____ 24. The language that a computer processor "understands" (the language a processor 
         is designed to execute).

____ 25. Consists of a numerical operation code and one or more numerical operands.

____ 26. A modern computer would have several gigabytes of this with an access time of 
         perhaps 50 nanoseconds.

____ 27. Memory operation (one of two). The processor sends memory an address and memory
         responds with the contents.

____ 28. Memory operation (one of two). The processor sends memory and address and a new 
         contents, and memory replaces the old contents with the new.

____ 29. A very simple editor available on cis-linux2.temple.edu.

____ 30. Vista, Unix, and Linux are examples (but not gcc or Microsoft Word)..

____ 31. The part of the machine language instruction that specifies the function to be 
         preformed (in SIM1, 1 for load, 2 for store, etc).

____ 32. Name for machine language programs that can be loaded anywhere in memory without
         modification.
____ 33. The hardware component that controls the other hardware components (memory, I/O 
         devices, etc). The programmer controls this device with a machine language 
         computer program.
____ 34. General name for a storage location inside the processor.

____ 35. Area of memory used to implement LIFO storage.

____ 36. Type of memory that should be called Read Write Memory, but RWM is hard to 
         pronounce.

____ 37. Name for the movement of a program from one area of memory to another.

____ 38. Name for a processor design that uses fewer instruction codes (an typically 
         more, numbered, registers).

____ 39. Type of memory where the contents are set at the factory and cannot be (easily)  
         changed.

____ 40. General name to referring to any type of computer program written in any 
         language.

____ 41. Memory technology using 4 to 6 transistors for each bit. Faster but more 
         expensive alternative. Used for cache.

____ 42. Area of memory used to implement FIFO storage.

____ 43. Processor register pointing to the most recently added item in a FIFO storage 
         area.

____ 44. Processor registers, L1 Cache, L2 Cache, main memory, secondary storage, in that 
         order.

____ 45. A name (symbol or variable) used to refer to an address in memory.

____ 46. A name used to refer to a machine language operation code.

____ 47. The allusion of a very large main memory provided by computer hardware and
         operating system software