------------------------------------------------------ Test 4 (Dec 13) Final Exam Review Topics and Questions ------------------------------------------------------ -Ian! D. Allen - idallen@idallen.ca - www.idallen.com Bring two good, soft pencils and a very good eraser to the test. Test format: Short answers, calculations, multiple choice. These review topics do not cover all the material. No aids - no calculators. Course Home Page: http://teaching.idallen.com/cst8214/07f/ - see "The Big Picture" in the test2topics.txt file under Class Notes. - see the week05notes.txt file under Class Notes. - see the week08notes.txt file under Class Notes. - see the week09notes.txt file under Class Notes. - see the week11notes.txt file under Class Notes. - see the week12notes.txt file under Class Notes. - see the week13notes.txt file under Class Notes. - see the week14notes.txt file under Class Notes. - see the lab03notes.txt file under Class Notes. - see the lab04notes.txt file under Class Notes. - see the lab05notes.txt file under Class Notes. - see the lab07notes.txt file under Class Notes. - see the lab08notes.txt file under Class Notes. - see the lab09notes.txt file under Class Notes. - see the lab10notes.txt file under Class Notes. Topics for Test 4 - the final exam: The final exam covers all material, including lab material. - see the file test3topics.txt for the lab material topics - this file covers only the text/lecture/slide topics Chapter 1 * Table 1.1 page 5: know the names and decimal and power-of-two values of all prefixes from Pico (10**-12, 2**-40) up to Tera (10**12, 2**40) * Know what is meant by "orders of magnitude" (powers of 10) * Exercises p.37: 2, 3 Chapter 2 * Conversion among all of decimal, binary, octal, hexadecimal * Integers: unsigned, one's complement, two's complement, sign-magnitude * What causes integer carry, overflow flags to be set * What flag indicates that an unsigned integer addition is wrong? * What flag indicates that a two's complement integer addition is wrong? * Conversions to/from decimal and IEEE 754 SP floating-point * Differentiate between range, accuracy and precision * What causes floating-point overflow, underflow * Approximate range (in decimal) of IEEE 754 SP floating-point * Basic layout of the ASCII character set (but not specific letters) * Conversion between ASCII ctrl chars, upper-case letters, lower-case letters * Questions p.93: 1-9, 12, 13, 15-19, 22-24 * Exercises p.94: 1-9, 23, 25, 28a, 29a, 29b, 30, 31, 46 Chapter 3 * Sections 3.2.0, 3.2.1, 3.2.2 * simplification of simple Boolean expressions (some of 3.2.3) * simple Boolean expression complements (some of 3.2.4) * Table 3.5, 3.6 * Boolean identities and deMorgan (most importantly deMorgan) * bitwise operations (see p.122 and Class Notes file bit_operations.txt) * Questions p.154: 1-6 * Exercises p.155: 1-4, 8, 11, 12b, 13, 15 Chapter 4 * Sections 4.1, 4.2, 4.4, 4.5, 4.6 (omit interleaving), 4.8 * Sections 4.9.0, 4.9.1, 4.9.3, 4.10, 4.11 * the functions of the seven MARIE registers * the function and meaning of the first nine MARIE opcodes (Table 4.2) * the RTN for each of the first nine MARIE opcodes (4.8.4) * describe in detail the fetch/increment/execute cycle see the text_errata.txt file and wee11notes.txt * trace a simple program, showing how the MARIE registers change * hand-assemble a simple program into hexadecimal * Questions p.236: 1, 3, 4, 5, 9, 14, 17-20, 24-29, 32 * Exercises p.237: 1, 3-5, 8, 9, 11-14, 15a Added topics for Chapter 4 * Section 4.14, Chapter Summary * Questions p.236: 34, 39, 40 * Exercises p.237: 25 * True/False p.241: 2, 3, 4, 5, 6, 7 Chapter 5 * 5.1, 5.2 intro, 5.2.1, 5.2.2, 5.2.3, 5.2.4 (fixed vs. variable) * 5.3 intro only (the list of types of instructions) * 5.4 intro, 5.4.1, 5.4.2 (only immediate, direct, indirect, indexed) * Table 5.1 p.260 * 5.5 (the concept, not the math) * Pipeline conflicts: resource conflict, data dependency, branching * 5.6 intro, 5.6.1, 5.6.2, 5.6.3, Chapter Summary * Questions p.274: 4, 7, 9, 15 (only immediate, direct, indirect, indexed) * Questions p.275: 17, 18, 20, 23 * Exercises p.275: 1, 2, 3, 4, 5, 12, 13, 14, 18, 19 Chapter 6 * 6.1, 6.2, 6.3, 6.3.1, 6.4 intro only, 6.4.4 * 6.5 intro only, 6.6 (Fig. 6.21), Chapter Summary * the key idea of cache is? (p.284) * describe: ROM, PROM, EPROM, EEPROM, flash (p.282) * describe: temporal locality, spatial locality, sequential locality (p.285) * describe: paging terminology (list p.302-303) * describe: the goal of virtual memory * Questions p.319: 1, 2, 3, 4, 5, 6, 7, 8, 22, 30, 31, 32, 33, 37 * Exercises p.325: 20 Chapter 7 * 7.1, 7.2, 7.3, 7.4 (intro only), 7.4.1 (early parts, no channel), 7.4.2 * 7.5 intro, 7.5.1 (overview), 7.5.2 * 7.6 intro, 7.6.1, 7.6.2 (overview, not FAT), 7.7 (overview) * 7.8 (overview), 7.9 (RAID 0 and RAID 1 only), 7.9.1, 7.9.2 * Chapter 7 Summary * Amdahl's Law * Two ways I/O is done: polled/programmed vs. interrupt-driven * Two places I/O is done: via CPU or via DMA/channel controller(s) * describe: parallel vs. serial * describe: cylinder, head, sector, platter, parking heads, disk pack * describe: head crash, seek time, rotational latency, access time * describe: transfer time, disk directory (C/H/S map) * Which way are the "tracks" on a compact disks written? (p.354) * describe: RAID-0, RAID-1 * Questions p.379: 1, 4, 5, 6, 8, 10, 17, 18, 19, 21, 22, 24, 33, 34, 38 * Exercises p.381: 1, 2, 3, 11, 12, 14, 18, 19, 31a Chapter 12 * see Class Notes file week14notes.txt