ࡱ> TVSmpg ZbjbjVV *r<r<R4*8oqqqqqq$(!#+++o+o+++zZ;q+[0+$C$+$+0++$ : Test BankChapter Eight (Data Abstractions) Multiple Choice Questions 1. Which of the following is a LIFO structure? A. Array B. Stack C. Queue D. Tree ANSWER: B 2. Which of the following is a FIFO structure? A. Array B. Stack C. Queue D. Tree ANSWER: C 3. Which of the following is static in the sense that it does not change size or shape as information is stored and retrieved? A. Array B. Stack C. Queue D. Tree ANSWER: A 4. Suppose you were going to retrieve items of data that you would later need to process in the opposite order from that in which they were retrieved. Which of the following would be the best structure in which to store the items? A. Traditional linked list B. Stack C. Queue D. Tree ANSWER: B 5. Suppose a binary tree contained the nodes W, X, Y, and Z. If W and X were children of Y, and Z had no children, which node would be the root? A. W B. X C. Y D. Z ANSWER: C 6. Suppose a binary tree contained the nodes W, X, Y, and Z, and each node had at most one child. How many terminal nodes would be in the tree? A. One B. Two C. Three D. Undetermined ANSWER: A 7. If the two-dimensional array X were stored in row-major order, then in the block of main memory containing X, which of the following would be true? A. The entry X[1,2] would appear before X[2,1]. B. The entry X[1,2] would appear after X[2,1]. C. The entry X[1,2] would be in the same location as X[2,1]. D. None of the above ANSWER: A 8. Which of the following is not used when determining the location of an entry in a two-dimensional homogeneous array stored in row-major order? A. Indices B. Number of rows in the array C. Address polynomial D. Number of columns in the array ANSWER: B 9. Which of the following is not a means of locating an entry in a linked storage structure? A. Head pointer B. Child pointer C. Root pointer D. NIL pointer ANSWER: D 10. If a stack contained the entries w, x, y, z (from top to bottom), which of the following would be the contents after two entries were removed and the entry r was inserted? A. w, x, r B. y, z, r C. r, y, z D. r, w, x ANSWER: C 11. If a queue contained the entries w, x, y, z (from head to tail), which of the following would be the contents after two entries were removed and the entry r was inserted? A. w, x, r B. y, z, r C. r, y, z D. r, w, x ANSWER: B 12. If the number of nodes in a binary tree is 2n (where n is a positive integer), then the entire tree would contain at least A. 2n + 1 nodes B. 22n nodes C. 2n + 1 - 1 nodes D. 2n + 2 nodes ANSWER: C 13. If the longest path in a binary tree contained exactly four nodes, what is the maximum number of nodes that could be in the entire tree? A. 4 B. 7 C. 15 D. 31 ANSWER: C 14. The nodes in which of the trees below will be printed in alphabetical order by the following recursive procedure? procedure printTree (Tree) if (Tree is not empty) then (print the root node; apply the procedure printTree to the right subtree of Tree; apply the procedure printTree to the left subtree of Tree) A. B. C.  EMBED PBrush   EMBED PBrush   EMBED PBrush  ANSWER: C 15. The nodes in which of the trees below will be printed in alphabetical order by the following recursive procedure? procedure printTree (Tree) if (Tree is not empty) then (apply the procedure printTree to the left subtree of Tree; apply the procedure printTree to the right subtree of Tree; print the root node) A. B. C.  EMBED PBrush   EMBED PBrush   EMBED PBrush  ANSWER: B 16. The table below represents a portion of a computers main memory containing a binary tree. Each node consists of three cells, the first being data, the second being a pointer to the nodes left child, and the third being a pointer to the nodes right child. If the nil pointer is represented by 00 and the trees root pointer contains 50, which of the following is a picture of the tree? Address Contents 50 A 51 56 52 53 53 B 54 00 55 00 56 C 57 00 58 00 A. B. C.  EMBED PBrush   EMBED PBrush   EMBED PBrush  ANSWER: C 17. Suppose a binary tree is implemented as a linked structure in which each node contains both a left child pointer and a right child pointer. Which of the following statements is false? A. The number of nodes in the tree is always at least the number of nodes on the longest path in the tree. B. The number of NIL pointers in the tree is always greater than the number of nodes in the tree. C. Each terminal node in the tree is always at the end of a path that is as least as long as any other path in the tree. D. Both the left child and right child pointers of every terminal node are NIL. ANSWER: C 18. The table below represents a portion of a computers main memory containing a binary tree stored row by row in a contiguous block as described in the chapter. What is the left child of the node V? Address Contents 50 T 51 U 52 V 53 W 54 X 55 Y 56 Z A. W B. X C. Y D. Z ANSWER: C 19. The table below represents a portion of a computers main memory containing a binary tree stored row by row in a contiguous block as described in the chapter. What is the parent of the node Z? Address Contents 50 T 51 U 52 V 53 W 54 X 55 Y 56 Z A. T B. U C. V D. Y ANSWER: C 20. In a machine language, the technique in which the data to be manipulated by an instruction is included within the instruction itself is called A. Immediate addressing B. Direct addressing C. Indirect addressing ANSWER: A 21. In a machine language, the technique in which an instruction contains the location of a pointer to the data to be manipulated is called A. Immediate addressing B. Direct addressing C. Indirect addressing ANSWER: C Fill-in-the-blank/Short-answer Questions 1. Answer the following questions in terms of the tree below.  EMBED PBrush  A. The root node is ________ . B. Three nodes that are siblings are _______ , ________, and ________ . C. The terminal nodes are _________________________________________ . D. The node with only one child is _________ . ANSWER: A. A B. B, C, and D C. E, F, G, and D D. B 2. Two special forms of lists are the LIFO structures known as _______________ , in which entries are inserted and removed from the ______________ , and FIFO structures known as ________________ , in which entries are removed from the ________________ and inserted at the ________________ . ANSWER: stacks, top, queues, head, tail 3. Suppose the expression X[1, 1] referred to the first-row, first-column entry in a two-dimensional array with 5 rows and 7 columns. If the array is stored in row-major order beginning at memory address x and each entry in the array requires n memory cells, what address polynomial would be used to compute the address of the beginning of the entry X[I, J]? ________________ ANSWER: x + n(7(I - 1) + J - 1) 4. Suppose the expression X[0, 0] referred to the first-row, first-column entry in a two-dimensional array with 5 rows and 7 columns. If the array is stored in column-major order beginning at memory address x and each entry in the array requires n memory cells, what address polynomial would be used to compute the address of the beginning of the entry X[I, J]? ________________ ANSWER: x + n(5J + I) 5. If a queue contained the entries B, C, D (from head to tail), what would be the contents of the queue (again from head to tail) after one entry was removed and the entry A was inserted? ANSWER: C, D, A 6. Suppose a queue contained the entries A, B, C, D (from head to tail) and suppose that the entries were removed and pushed on a stack one at a time until the queue was empty. What would be the contents of the queue (again from head to tail) if the entries were then popped from the stack and inserted back in the queue one at a time. ________________ ANSWER: D, C, B, A 7. In which direction does an unchecked queue crawl through memory (in the direction of its head or in the direction of its tail)? ________________ ANSWER: In the direction of its tail 8. The table below represents a portion of a computers main memory containing a linked list. Each list entry consists of two cells, the first being data and the second being a pointer to the next list entry. If the nil pointer is represented by 00 and the lists head pointer contains 56, what are the data entries in the list? (List the entries in the order they occur in the list.) Address Contents 50 AA 51 00 52 BB 53 58 54 CC 55 50 56 DD 57 54 58 EE 59 00 _________________ ANSWER: DD, CC, AA 9. What sequence of nodes from the tree  EMBED PBrush  would be printed if the following recursive procedure were applied to it? procedure printTree (Tree) if (Tree is not empty) then (print the root of Tree; apply the procedure printTree to the right subtree of Tree) ________________ ANSWER: A, C, G 10. What sequence of nodes from the tree  EMBED PBrush  would be printed if the following recursive procedure were applied to it? (The procedure uses a global stack called Stack that is assumed to begin empty.) procedure printTree (Tree) if (Tree is not empty) then (push the current node on Stack; apply the procedure printTree to the right subtree of Tree) if (Stack is not empty) then (pop an entry from Stack and print that node) ________________ ANSWER: G, C, A 11. What sequence of nodes from the tree  EMBED PBrush  would be printed if the following recursive procedure were applied to it? (The procedure uses a global stack called Stack that is assumed to begin empty.) procedure printTree (Tree) push the left child of the root node on Stack; if (right branch of Tree is not empty) then (apply the procedure printTree to the right subtree of Tree) pop an entry from Stack and print that node. ________________ ANSWER: D, C 12. The table below represents a portion of a computers main memory containing a binary tree. Each node consists of three cells, the first being data, the second being a pointer to the nodes left child, and the third being a pointer to the nodes right child. If the nil pointer is represented by 00 and the trees root pointer contains 56, what data is in the left child of the root node? Address Contents 50 AA 51 53 52 00 53 BB 54 00 55 00 56 CC 57 50 58 00 _________________ ANSWER: AA 13. The table below represents a portion of a computers main memory containing a binary tree. Each node consists of three cells, the first being data, the second being a pointer to the nodes left child, and the third being a pointer to the nodes right child. If the nil pointer is represented by 00 and the trees root pointer contains 53, how many terminal nodes are in the tree? Address Contents 50 AA 51 00 52 00 53 BB 54 00 55 56 56 CC 57 00 58 00 _________________ ANSWER: One 14. The table below represents a portion of a computers main memory containing a binary tree. Each node consists of three cells, the first being data, the second being a pointer to the nodes left child, and the third being a pointer to the nodes right child. If the nil pointer is represented by 00 and the trees root pointer contains 53, how many nodes are on the longest path in the tree? Address Contents 50 AA 51 56 52 00 53 BB 54 00 55 50 56 CC 57 00 58 00 _________________ ANSWER: Three 15. The table below represents a portion of a computers main memory containing a binary tree stored row by row in a contiguous block as described in the chapter. What are the children of the node B? Address Contents 50 A 51 B 52 C 53 D 54 E 55 F 56 G ANSWER: D and E 16. If the longest path in a binary tree contains five nodes, what is the maximum number of terminal nodes that could be in the tree? _________________ ANSWER: 16 17. If the variable named Box had the user-defined type RectangleType defined by Define type RectangleType to be {real length; real width; real height } What expression would be used to reference the length of Box? _________________ ANSWER: Box.length 18. If the type BananaSplit was defined by a statement such as define type BananaSplit to be {int Banana; int IceCream; int Chocolate; int WhippedCream; int Nuts; int Cherry } what statement would probably be used to declare the variable Desert to be an instance of that type? _________________ ANSWER: BananaSplit Desert; (The declaration of Desert would use the same syntax as the declarations using the primitive type int.) 19. Suppose the abstract data type StackType was defined as follows: define type StackType to be {int StackEntries[20]; int StackPointer = 0; procedure push(Value) {StackEntries[StackPointer] ( Value; StackPointer ( StackPointer + 1; } } A. What would be the value of the variable StackPointer associated with Stack after executing the statement StackType Stack; _______________ B. Then, what would be the value of StackPointer associated with Stack after executing the statement Stack.push(5); _______________ ANSWER: A. 0 B. 1 20. Suppose the abstract data type StackType was defined as follows: define type StackType to be {int StackEntries[20]; int StackPointer = 0; procedure push(Value) {StackEntries[StackPointer] ( Value; StackPointer ( StackPointer + 1; } } A. What would be the value of the variable StackPointer associated with Stack2 after executing the statements StackType Stack1, Stack2; Stack1.push(5); Stack2.push(6); Stack2.push(7); _______________ B. What would be the value of StackEntries[0] associated with Stack1 after executing the statements in part A? _______________ C. What would be the value of StackEntries[0] associated with Stack2 after executing the statements in part A? _______________ ANSWER: A. 2 B. 5 C. 6 21. The following represents a portion of a computers main memory. Address Contents 50 51 51 56 52 53 53 57 54 58 55 50 56 57 57 52 58 53 A. What would be stored at address 50 after executing the instruction Copy the contents of the memory cell at address 54 to address 50? ________________ B. What would be stored at address 50 after executing the instruction Copy the contents of the memory cell pointed to by the cell at address 54 to address 50? ________________ ANSWER: A. 58 B. 53 Vocabulary (Matching) Questions The following is a list of terms from the chapter along with descriptive phrases that can be used to produce questions (depending on the topics covered in your course) in which the students are ask to match phrases and terms. An example would be a question of the form, In the blank next to each phrase, write the term from the following list that is best described by the phrase. Term Descriptive Phrase pointer Contains the address at which an entity is stored address polynomial Used to find entries in a homogeneous array abstraction The separation of internal implementation from external functionality list A general sequential storage structure stack A LIFO storage structure queue A FIFO storage structure array A rectangular storage structure that does not change in size or shape tree A storage structure that may contain siblings. user-defined data type A storage structure template built by combining primitive types abstract data type A custom-built data type including both data and operations class A type whose instances are objects instance An entity conforming to a type linked structure A data storage system in which items are connected via pointers top The head of a stack root The top node of a tree NIL pointer Indicates the end General Format Questions 1. What condition indicates that a linked list is empty? ANSWER: An empty linked list is indicated by a NIL head pointer. 2. The table below represents a portion of a computers main memory containing a linked list. Each entry consists of two cells, the first being data, the second being a pointer to the next entry. If the nil pointer is represented by 00 and the lists head pointer contains 52, modify the memory cells so the data at address 50 replaces the second entry in the list. Address Contents 50 AA 51 00 52 BB 53 58 54 CC 55 00 56 DD 57 00 58 EE 59 54 ANSWER: Change the cell at address 51 to 54 and change the cell at address 53 to 50. 3. The table below represents a portion of a computers main memory containing a linked list. Each entry consists of two cells, the first being data, the second being a pointer to the next entry. If the nil pointer is represented by 00 and the lists head pointer contains 52, modify the memory cells so the data at address 56 is inserted at the end of the list. Address Contents 50 AA 51 00 52 BB 53 58 54 CC 55 00 56 DD 57 00 58 EE 59 54 ANSWER: Change the cell at address 55 to 56. 4. The table below represents a portion of a computers main memory containing a binary tree. Each node consists of three cells, the first being data, the second being a pointer to the nodes left child, and the third being a pointer to the nodes right child. If the nil pointer is represented by 00 and the trees root pointer contains 53, draw a picture of the tree showing the data in each node? Address Contents 50 AA 51 56 52 00 53 BB 54 00 55 50 56 CC 57 00 58 00 ANSWER:  EMBED PBrush  5. Why is a queue normally implemented as a circular queue? ANSWER: To keep it from crawling through memory unchecked. 6. What is the distinction between a user-defined data type and an abstract data type? ANSWER: A user-defined data type is merely a data storage template whereas an abstract data type includes procedures for manipulating the data as well. 7. Define each of the following: A. Primitive data type B. User-defined data type C. Abstract data type ANSWER: A. A data type provided as a predefined feature of a programming language. B. A data arrangement template defined in a program. C. An extension of a user-defined type that incorporates procedures for manipulating the data. 8. What is the distinction between a type and an instance of that type? ANSWER: A type is a collection of characteristics. An instance of that type is an entity with those characteristics. (A type is a template from which an instance of that type is constructed.) 9. What is the distinction between direct addressing and indirect addressing? ANSWER: When using direct addressing, the address of the data to be manipulated is included in the instruction. When using indirect addressing, the location of a pointer to the data to be manipulated is included in the instruction. 10. The table below represents a portion of a computers main memory containing a binary tree stored row by row in a contiguous block as described in the chapter. Draw a picture of the tree. Address Contents 50 A 51 B 52 C 53 D 54 E 55 F 56 G ANSWER:  EMBED PBrush  11. In a machine language, what advantage does indirect addressing offer over immediate and direct addressing? ANSWER: Indirect addressing allows the same instruction to be used to perform the same operation on different items of data merely by changing the value of the pointer referenced in the instruction. +-FA C *+-.015689;<ABDEGHMNPQST!"$%'(-.01349:<=?@~ hvH* hv6H* hv6hAWhv hv5CJX,-GHwx { { | 1 2 \ ] h i  2 b UV&''hitu%&UVabABMNJ K()?@OPQRWXghijqr   $%&'./>}sjoD hvUjoD hvUVj@oD hvUj@oD hvUVjoD hvUjoD hvUVjoD hvUjoD hvUVjoD hvUjoD hvUVjhvUhvOJQJhvCJOJQJhv hvH*(JKg)*+: %=BCNO`>?@A[ $$%$K$L$$$$$%%%%|&}&&&Y,Z,i,޾ީޘލ~~~~~~~~ hv6j ?iD hvUj ?iD hvUV hv5CJjoD hvUjoD hvUVjoD hvUjoD hvUVjoD hvUjoD hvUVhvjhvUj=oD hvUj=oD hvUV0)=Qey )34ab^`bno89Nbv,@Thi`i"#jkvw  K L W X Y Z [ !!O!`O!P!!!!!""n"o"""-#.#/#W#X#$$$$$$_&`&r&s&&&H'H'I'Z'['((((((W)X)j)k)))++)+=+Q+e+y+++++++++,,,,C,D,m,n,,,,,-S-T-f-g-x-y-----h.i....`i,j,k,l,,,S-------i.j.Y///////p0q0U1:;;0;9;=;K;W;`;j;;;;;<<ެޞ|oh hAWhz/hz/hz/OJQJ^Jhz/ hAWhAWhAWhAWOJQJ^JhAWOJQJ^JhAWjoD hvUjoD hvUVjoD hvUjoD hvUVhvCJOJQJhvOJQJhvjhvUjnD hvUjnD hvUV(. /$/Y/Z/l/m/~//////o0p0000(1U1V1h1i1w1x1333*3`*3>3R3f3z3333333333l5m555555556"66676J6K6X6X6Y67778"868J8^8r888888888999999::):=:>:>:O:P:::::::I;J;k;|;;;;;;;;;<<H<I<h<x<<<<< < <<#<I<<==Y=l====>>>>>>>> ??!?B?R???????@ @+@4@N@@@@@A1A=ANATAvAAABBBvBBBBBB|EEG7GJJRRRRRRdYeYtYĺjnD hvUjnD hvUVjhvU hv5CJ hv5CJ jhvOJQJhvOJQJhz/hvI<<<<<:=;=N=O=m===>>9>Q>i>>>>>>>@?A?S?T?e?f????????@@M@N@k@@@@@@AAAtAuAAAAAAAAEBFBFBWBXBBBBBBB@CACVCjC~CCCCCCC D DDDDDJEKE]E^E^ExEyEzE{E|EEEGG8GuGG H8HZH|HHI]IIIJ[JxJJJJJJJJJJKKPKQKLLLLLM%M9MMMaMuMMMMMM`OaOvOOOOOOOOPP*P>P?PmPnPQQR(R?@ABCDEFGHIJLMNOPQRUcoYZ[\]^_`abnefghijklm~qrstuvwxyz{|}Root Entry} Fߚ;W@Data KWordDocument|*ObjectPool$0X;ߚ;_1148133251l F0X;0X;Ole PIC LMETA X  %',.35:<ACHJOQVX]_dfjklmnoprstuvxLu FPBrushPBrushPBrush9q l   ; =@@@@@@@45 A B;;(;B@@@@@@@g@VV\VHVč@V@  VVVeVV32VVB´VV1 Image螂V`V@Y`bY`!%lV]WV`V.VlV!%V@MM,,tF@VV_t1VtF@,?1Vt1?1VF@$VAt1VVHF@Z?1VZVčV `V$DF@0^`V&@HFn| DF@nM 6 n|.Ln|HFcn|SW2)6 .#W>5-O01A-8C3D-00AA001A165JJ_JwTJ_dwJJT<_JJJ_JwJ_dwJJtL ^:d &2MOGvHW V ʋ6^^چg-4CompObj MObjInfoOle10Native dOle10ItemNameBM6(;Bx@@@@@@@hl hT7ll h0VVL2@lVT7lFXFX7l l hl h@ pVxV0V\JO@4V/O@6Xl hxV .@lV7l X@lV $V+7l FXl h `PVs7l VD Vb7lVD`P8VV-@lV7l V7l FXx@`PV,@lV;6 FX>V&x@ D>HVm>|<7'o>Fdz>PG>=FX ndz=7l> >%W((̀Ѐ(($pV7lq$ i h h hŹ04$DlJ~ ~JJ8_JwzJ_dwJJzbn_JJVxf\ ]J~:d &2MOJvHW V ʋ6J~J~gV_1148184315 F0X;0X;Ole PIC  LMETA p<L FPBrushPBrushPBrush9qL<    C @@@@@@@$+\P06 $$$VG$Tl@Vl7$VV$V`V 0M^V`V\ 0M^V&ML`V@ 0M^V<VX 0,^V&,`X+0,V,\b,V`\,DV$+mV``F\_ $_c $+\ $b&j@\߄_+w_LvwdV**+w*$*W:ΆlW^< /9 +߅_+w_Jwd9 +,V@4Y\ "d:2&GOMvH8WVʋtgNf45 A ACC(CA@@@@@@@$+\P06$ $$VG$T@lV7l$VV$VV` M0^VV` \M0^V&MLV` @M0^VV< X,0^V&,`+X,0V,\,bV`\,DV+$Vm``F\_$ _c$ +\$ &bj@\܄_+wvL_dwV**+w*$*:WlW^ </ 9+_+wJ_dw 9+,V@Y4 \":d&2MOGv8HWVʋtgfN-4CompObj MObjInfo Ole10NativeOle10ItemName   BMz6(CAD@@@@@@@$+\P06$ $$VG$T@lV7l$VV$VV` M0^VV` \M0^V&MLV` @M0^VV< X,0^V&,`+X,0V,\,bV`\,DV+$Vm``F\_$ _c$ +\$ &bj@\܄_+wvL_dwV**+w*$*:WlW^ </ 9+_+wJ_dw 9+,V@Y4 \":d&2MOGv8HWVʋtgfN_1148133338T, F0X;0X;Ole PIC LMETA  FPBrushPBrushPBrush9qLu< p   ? =@@@@@@@45 A F??(?F@@@@@@@g@VV\VHVč@V@  VVVeVV32VVB´VV1 Image瞂VDžV@YbY!%žÞlV]WV`VÞVlV!%žV0@8MM,,pR@VV_t1VpR@,?1Vt1?1VR@$VAt1VVDR@Z?1VZVčV `V$@R@0^`V&@DRNz @R@nM 6 Nz.LNzDRcNzSW2)6 .#W>5-O01A-8C3D-00AA001A165IPJ_PJwTJ_dwIPJT<_IPJJ_PJwJ_dwIPJtL :}:d &2MOIvHW V ʋ:}:}چg~-4CompObjMObjInfoOle10NativeOle10ItemNameBM6(?F@@@@@@@@*  m'  m 0^Vg,*Vč DI(tZx,*p  VAPVm,**ZxtC_(! "pVV& pV HVt HVF`?@@@@@@@((̀Ѐ(($pV7lq$ i h h hŹ04$Dl*| ~II8_IwzJ_dwIIzbn_IWJVxf\ ]*|:d &2MOWJvHW V ʋ*|*|g_1148183872 F0X;0X;Ole PIC  LMETA  l   ; =@@@@@@@45 A B;;(;B@@@@@@@g@VV\VHVč@V@  VVVeVV32VVB´VV1 Image螂V`V@Y`bY`!%lV]WV`V.VlV!%V@MM,,tF@VV_t1VtF@,?1Vt1?1VF@$VAt1VVHF@Z?1VZVčV `V$DF@0^`V&@HFn| DF@nM 6 n|.Ln|HFcn|SW2)6 .#W>5-O01A-8C3D-00AA001A165JJ_JwTJ_dwJJT<_JJJ_JwJ_dwJJtL ^:d &2MOGvHW V ʋ6^^چg-4CompObj"MObjInfoOle10Native!#Ole10ItemName FPBrushPBrushPBrush9qL FPBrushPBrushPBrush9BM6(;Bx@@@@@@@hl hT7ll h0VVL2@lVT7lFXFX7l l hl h@ pVxV0V\JO@4V/O@6Xl hxV .@lV7l X@lV $V+7l FXl h `PVs7l VD Vb7lVD`P8VV-@lV7l V7l FXx@`PV,@lV;6 FX>V&x@ D>HVm>|<7'o>Fdz>PG>=FX ndz=7l> >%W((̀Ѐ(($pV7lq$ i h h hŹ04$DlJ~ ~JJ8_JwzJ_dwJJzbn_JJVxf\ ]J~:d &2MOJvHW V ʋ6J~J~gV_1148184299<& F0X;0X;Ole PIC %(LMETA <    C @@@@@@@$+\P06 $$$VG$Tl@Vl7$VV$V`V 0M^V`V\ 0M^V&ML`V@ 0M^V<VX 0,^V&,`X+0,V,\b,V`\,DV$+mV``F\_ $_c $+\ $b&j@\߄_+w_LvwdV**+w*$*W:ΆlW^< /9 +߅_+w_Jwd9 +,V@4Y\ "d:2&GOMvH8WVʋtgNf45 A ACC(CA@@@@@@@$+\P06$ $$VG$T@lV7l$VV$VV` M0^VV` \M0^V&MLV` @M0^VV< X,0^V&,`+X,0V,\,bV`\,DV+$Vm``F\_$ _c$ +\$ &bj@\܄_+wvL_dwV**+w*$*:WlW^ </ 9+_+wJ_dw 9+,V@Y4 \":d&2MOGv8HWVʋtgfN-4CompObj'*MObjInfo!Ole10Native)+Ole10ItemName"qL< FPBrushPBrushPBrush9qBMz6(CAD@@@@@@@$+\P06$ $$VG$T@lV7l$VV$VV` M0^VV` \M0^V&MLV` @M0^VV< X,0^V&,`+X,0V,\,bV`\,DV+$Vm``F\_$ _c$ +\$ &bj@\܄_+wvL_dwV**+w*$*:WlW^ </ 9+_+wJ_dw 9+,V@Y4 \":d&2MOGv8HWVʋtgfN_1148183869\. F0X;0X;Ole #PIC -0$LMETA < p   ? =@@@@@@@45 A F??(?F@@@@@@@g@VV\VHVč@V@  VVVeVV32VVB´VV1 Image瞂VDžV@YbY!%žÞlV]WV`VÞVlV!%žV0@8MM,,pR@VV_t1VpR@,?1Vt1?1VR@$VAt1VVDR@Z?1VZVčV `V$@R@0^`V&@DRNz @R@nM 6 Nz.LNzDRcNzSW2)6 .#W>5-O01A-8C3D-00AA001A165IPJ_PJwTJ_dwIPJT<_IPJJ_PJwJ_dwIPJtL :}:d &2MOIvHW V ʋ:}:}چg~-4CompObj/2&MObjInfo(Ole10Native13Ole10ItemName)Lu FPBrushPBrushPBrush9qBM6(?F@@@@@@@@*  m'  m 0^Vg,*Vč DI(tZx,*p  VAPVm,**ZxtC_(! "pVV& pV HVt HVF`?@@@@@@@((̀Ѐ(($pV7lq$ i h h hŹ04$Dl*| ~II8_IwzJ_dwIIzbn_IWJVxf\ ]*|:d &2MOWJvHW V ʋ*|*|g_1148186048t6 F0X;0X;Ole *PIC 58+LMETA  l   ; =@@@@@@@45 A B;;(;B@@@@@@@g@VV\VHVč@V@  VVVeVV32VVB´VV1 Image螂V`V@Y`bY`!%lV]WV`V.VlV!%V@MM,,tF@VV_t1VtF@,?1Vt1?1VF@$VAt1VVHF@Z?1VZVčV `V$DF@0^`V&@HFn| DF@nM 6 n|.Ln|HFcn|SW2)6 .#W>5-O01A-8C3D-00AA001A165JJ_JwTJ_dwJJT<_JJJ_JwJ_dwJJtL ^:d &2MOGvHW V ʋ6^^چg-4CompObj7:-MObjInfo/Ole10Native9;Ole10ItemName0  (' !"#$%&5B*+,-./01234A789:;<=>?@lDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijkopqrstuvwxyz{|}~BM6(;Bx@@@@@@@hl hT7ll h0VVL2@lVT7lFXFX7l l hl h@ pVxV0V\JO@4V/O@6Xl hxV .@lV7l X@lV $V+7l FXl h `PVs7l VD Vb7lVD`P8VV-@lV7l V7l FXx@`PV,@lV;6 FX>V&x@ D>HVm>|<7'o>Fdz>PG>=FX ndz=7l> >%W((̀Ѐ(($pV7lq$ i h h hŹ04$DlJ~ ~JJ8_JwzJ_dwJJzbn_JJVxf\ ]J~:d &2MOJvHW V ʋ6J~J~gVL FPBrushPBrushPBrush9q_1148186047d4> F0X;0X;Ole 1PIC =@2LMETA  <    C @@@@@@@$+\P06 $$$VG$Tl@Vl7$VV$V`V 0M^V`V\ 0M^V&ML`V@ 0M^V<VX 0,^V&,`X+0,V,\b,V`\,DV$+mV``F\_ $_c $+\ $b&j@\߄_+w_LvwdV**+w*$*W:ΆlW^< /9 +߅_+w_Jwd9 +,V@4Y\ "d:2&GOMvH8WVʋtgNf45 A ACC(CA@@@@@@@$+\P06$ $$VG$T@lV7l$VV$VV` M0^VV` \M0^V&MLV` @M0^VV< X,0^V&,`+X,0V,\,bV`\,DV+$Vm``F\_$ _c$ +\$ &bj@\܄_+wvL_dwV**+w*$*:WlW^ </ 9+_+wJ_dw 9+,V@Y4 \":d&2MOGv8HWVʋtgfN-4CompObj?B4MObjInfo6Ole10NativeACOle10ItemName7BMz6(CAD@@@@@@@$+\P06$ $$VG$T@lV7l$VV$VV` M0^VV` \M0^V&MLV` @M0^VV< X,0^V&,`+X,0V,\,bV`\,DV+$Vm``F\_$ _c$ +\$ &bj@\܄_+wvL_dwV**+w*$*:WlW^ </ 9+_+wJ_dw 9+,V@Y4 \":d&2MOGv8HWVʋtgfN_1148186046F F0X;0X;Ole 8PIC EH9LMETA )L< FPBrushPBrushPBrush9q< p   ? =@@@@@@@45 A F??(?F@@@@@@@g@VV\VHVč@V@  VVVeVV32VVB´VV1 Image瞂VDžV@YbY!%žÞlV]WV`VÞVlV!%žV0@8MM,,pR@VV_t1VpR@,?1Vt1?1VR@$VAt1VVDR@Z?1VZVčV `V$@R@0^`V&@DRNz @R@nM 6 Nz.LNzDRcNzSW2)6 .#W>5-O01A-8C3D-00AA001A165IPJ_PJwTJ_dwIPJT<_IPJJ_PJwJ_dwIPJtL :}:d &2MOIvHW V ʋ:}:}چg~-4CompObjGJ;MObjInfo=Ole10NativeIK6Ole10ItemName>BM6(?F@@@@@@@@*  m'  m 0^Vg,*Vč DI(tZx,*p  VAPVm,**ZxtC_(! "pVV& pV HVt HVF`?@@@@@@@((̀Ѐ(($pV7lq$ i h h hŹ04$Dl*| ~II8_IwzJ_dwIIzbn_IWJVxf\ ]*|:d &2MOWJvHW V ʋ*|*|g_1147748109N F0X;0X;Ole ?PIC MP@LMETA CPL*  T FPBrushPBrushPBrush9qL *  H(i&  @@@@@@@g@VV\HVV@V VVV3V2V›1VmIgaeV,@Vb!l]V`V‚Vl!VMML,PV_V1V,P?1V?11$PAVVVZPZ V`lV$P`[V& JnP M6.JȅJZW_=`w_J߅=@w_Lv:=@=`߅6wwd6*_@h=oVdXY Z^d:2&oOMvHtWVZZgfJ45i&A l(l@@@@@@@g@VV\VHV@V  VVVV32V´V1ImageV,V@b!lV]`VVlV!MML,PVV_1VP,?1V1?1P$VAVVPZZV `Vl$P[`V&J PnM 6J.JZW_`=wJ_ą@=wvL_:@=`=w6dw6*_@o=hVXd YZ^:d&2MOovtHWVʋZZgJf6 .#WV@5-O01=` =?'`O==60E`==<_==J_=wJ_dw==tP :d &2MOw=vHW V ʋچg&6xvv5vlauxx oo(rrxxcth  :cal-ntf-Zx-4CompObjORBMObjInfoDOle10NativeQSnLOle10ItemNameELBML6(lH@@@@@@@g@VV\VHV@V  VVVV32V´V1ImageV,V@b!lV]`VVlV!MML,PVV_1VP,?1V1?1P$VAVVPZZV `Vl$P[`V&J PnM 6J.JZW_`=wJ_ą@=wvL_:@=`=w6dw6*_@o=hVXd YZ^:d&2MOovtHWVʋZZgJf@V  V΀ ~==8_=wzJ_dw==zbVXL Y΀:d &2MO=vHW V ʋ΀΀g&B_1148096405LV F0X;0X;Ole FPIC UXGLMETA 6 FPBrushPBrushPBrush9qL    y @@@@@@@g@VV\HVV@V VVV3V2V ›1VmIgaê!V0@V0b0l]V`&V‚Vl!V`MM,V_V1V,@?1V?11$@AVVtVZ@Z V`0Vp$0@`]V&t ~~pn@ M6.~~ȅ~~tW_-4CompObjWZIMObjInfoKOle10NativeY[1Ole10ItemNameL1BM16(y^-@@@@@@@g@VV\VHV@V  VVVV32V ´V1Image!V0V@0b0lV]`V&VlV!`MM,VV_1V@,?1V1?1@$VAVVt@ZZV `V0$p@0]`V&t~~ p@nM 6~~.~~tW_H<wJ_ąJwvL_:JH<w6dw6*_OJhX Y^:d&2MOOvtHWVʋ6g2MOvg2).WIIIhXdMOʋj~~~xxhVdX}MOʋ}fVT y\1 ]}:d &2MOvHW V ʋ}}g>*_1148183326^ F0X;0X;Ole MPIC ]`NLMETA 6   y @@@@@@@g@VV\HVV@V VVV3V2V ›1VmIgaê!V0@V0b0l]V`&V‚Vl!V`MM,V_V1V,@?1V?11$@AVVtVZ@Z V`0Vp$0@`]V&t ~~pn@ M6.~~ȅ~~tW_-4CompObj_bPMObjInfoROle10Nativeac1Ole10ItemNameS FPBrushPBrushPBrush9qL" d FPBrushPBrushPBrush9     +? !"#$%&'()*>-./0123456789:;<=RABCDEFGHIJKLMNOPQoTUVWXYZ[\]^_`abcdefghijklmnrstuvwxyz{|}~1BM16(y^-@@@@@@@g@VV\VHV@V  VVVV32V ´V1Image!V0V@0b0lV]`V&VlV!`MM,VV_1V@,?1V1?1@$VAVVt@ZZV `V0$p@0]`V&t~~ p@nM 6~~.~~tW_H<wJ_ąJwvL_:JH<w6dw6*_OJhX Y^:d&2MOOvtHWVʋ6g2MOvg2).WIIIhXdMOʋj~~~xxhVdX}MOʋ}fVT y\1 ]}:d &2MOvHW V ʋ}}g>*_1148185085 Df F0X;0X;Ole TPIC ehULMETA ""  h E @@@@@@@$+\P06 $$$VG$Tl@Vl7$VV$V`V 0M^V`V\ 0M^V&ML`V@ 0M^V<VX 0,^V&,`X+0,V,\b,V`\,DV$+mV``F\_ $_c $+\ $b&j@\߄_+w_LvwdV**+w*$*W:ΆlW^< /9 +߅_+w_Jwd9 +,V@4Y\ "d:2&GOMvH8WVʋtgNf45A \EE(E\@@@@@@@$+\P06$ $$VG$T@lV7l$VV$VV` M0^VV` \M0^V&MLV` @M0^VV< X,0^V&,`+X,0V,\,bV`\,DV+$Vm``F\_$ _c$ +\$ &bj@\܄_+wvL_dwV**+w*$*:WlW^ </ 9+_+wJ_dw 9+,V@Y4 \":d&2MOGv8HWVʋtgfN-4CompObjgjWMObjInfoYOle10Nativeik$Ole10ItemNameZqL*  FPBrushPBrushPBrush9q BM6(E\@@@@@@@$+\P06$ $$VG$T@lV7l$VV$VV` M0^VV` \M0^V&MLV` @M0^VV< X,0^V&,`+X,0V,\,bV`\,DV+$Vm``F\_$ _c$ +\$ &bj@\܄_+wvL_dwV**+w*$*:WlW^ </ 9+_+wJ_dw 9+,V@Y4 \":d&2MOGv8HWVʋtgfN_1148123411n F0X;0X;Ole [PIC mp\LMETA ,h#*  ! O =@@@@@@@45!A `OO(O`@@@@@@@g@VV\VHVč@V@  VVVeVV32VVBp´VV1 ImagepHV (V@Y bY !%lV]WV`VVlV!%V@ MM,,4M@VV_t1V4M@,?1Vt1?1VbM@$VAt1VVM@Z?1VZVčV `VX}"M@]`V&@M M@nM 6 .L>McSW>2)6 .#W>?5-O01A-8C3D-00AA001A165<<_<wTJ_dw<<T<_<<J_<wJ_dw<<tM :d &2MO<vHW V ʋچgvNBLNS ANMMuEM6tW^$qErjA$$-4CompObjor^MObjInfo`Ole10Nativeqs@D"Ole10ItemNameaL  FPBrushPBrushPBrush9q@"BM6"6(O`@@@@@@@aH)  Hd_&  d_ ]Vg%*`Vč DI(t"%*  VAPVm%**("tC_-4CompObjwzeMObjInfogOle10Nativey{q1Ole10ItemNameh1BM16(y^-@@@@@@@g@VV\VHV@V  VVVV32V ´V1Image!V0V@0b0lV]`V&VlV!`MM,VV_1V@,?1V1?1@$VAVVt@ZZV `V0$p@0]`V&t~~ p@nM 6~~.~~tW_H<wJ_ąJwvL_:JH<w6dw6*_OJhX Y^:d&2MOOvtHWVʋ6g2MOvg2).WIIIhXdMOʋj~~~xxhVdX}MOʋ}fVT y\1 ]}:d &2MOvHW V ʋ}}g>*Oh+'0 0 @L l x  Test Bank Chap. 8 (9th ed.) Computer Science: An OverviewJ. Glenn BrookshearNormalOwner2Microsoft Office Word@@@R/&1Table$SummaryInformation(~iDocumentSummaryInformation8qDCompObjwr@R/&W ZF՜.+,0 px   $*R Test Bank Chap. 8 (9th ed.) Title  F Microsoft Word 97-2003 Document^ 2 0@P`p2( 0@P`p 0@P`p 0@P`p 0@P`p 0@P`p 0@P`p8XV~_HmH nH sH tH H`H Normal5$7$8$9DH$_HmH sH tH DA D Default Paragraph FontViV  Table Normal :V 44 la (k (No List PK![Content_Types].xmlN0EH-J@%ǎǢ|ș$زULTB l,3;rØJB+$G]7O٭V$ !)O^rC$y@/yH*񄴽)޵߻UDb`}"qۋJחX^)I`nEp)liV[]1M<OP6r=zgbIguSebORD۫qu gZo~ٺlAplxpT0+[}`jzAV2Fi@qv֬5\|ʜ̭NleXdsjcs7f W+Ն7`g ȘJj|h(KD- dXiJ؇(x$( :;˹! I_TS 1?E??ZBΪmU/?~xY'y5g&΋/ɋ>GMGeD3Vq%'#q$8K)fw9:ĵ x}rxwr:\TZaG*y8IjbRc|XŻǿI u3KGnD1NIBs RuK>V.EL+M2#'fi ~V vl{u8zH *:(W☕ ~JTe\O*tHGHY}KNP*ݾ˦TѼ9/#A7qZ$*c?qUnwN%Oi4 =3N)cbJ uV4(Tn 7_?m-ٛ{UBwznʜ"Z xJZp; {/<P;,)''KQk5qpN8KGbe Sd̛\17 pa>SR! 3K4'+rzQ TTIIvt]Kc⫲K#v5+|D~O@%\w_nN[L9KqgVhn R!y+Un;*&/HrT >>\ t=.Tġ S; Z~!P9giCڧ!# B,;X=ۻ,I2UWV9$lk=Aj;{AP79|s*Y;̠[MCۿhf]o{oY=1kyVV5E8Vk+֜\80X4D)!!?*|fv u"xA@T_q64)kڬuV7 t '%;i9s9x,ڎ-45xd8?ǘd/Y|t &LILJ`& -Gt/PK! ѐ'theme/theme/_rels/themeManager.xml.relsM 0wooӺ&݈Э5 6?$Q ,.aic21h:qm@RN;d`o7gK(M&$R(.1r'JЊT8V"AȻHu}|$b{P8g/]QAsم(#L[PK-![Content_Types].xmlPK-!֧6 0_rels/.relsPK-!kytheme/theme/themeManager.xmlPK-!0C)theme/theme/theme1.xmlPK-! ѐ' theme/theme/_rels/themeManager.xml.relsPK] R >i,<tYZ.24;@I{ 'JbiO!H'+.*3X6>:<?FB^EJO&SYZ/01356789:<=>?ABCDEFGH? O Q W g i q $&.>@Y$i$k$%%%'''JJJdQtQvQR:::::::::::::::8@0(  B S  ?V _    : R h   [ d q x %AD$l$$$+%4%B%I%%%t&}&&&&'''{(() )))03=3W3d3344#4V4a4j4m4z4}4444444444444Y5d556)626;6>6?6K6S6V6W6c6666666666 7B7K77777+848[8d8m8p8q8}888888888888819=9v999:v::::;;; ;JJcQwQR>E@Bpr L U h j  & ( A E ),25TWowrtVX n"u"n$s$$$$$$$%%%%j&s&&&&&&& ''&'*'''q(z(((((((()+)**,-j/q/m3q3~33334(4J4P4j4m4z4}444444444446#6;6>6S6V6k6t66667?777O8U8m8p8888888i9s99999999:v::8???u?|??? @ @8@=@Z@_@|@@@@AA]AeAAAAAB B[B^BxB|BBB D'DFF~IIJKR333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333; S T k l ()BD$m$%%''l3|3}3333JJJdQxQR{,z/AWv~sRR@RX@UnknownG* Times New Roman5Symbol3. * Arial?= * Courier NewA$BCambria Math"1h򆃊W ZF*W ZF*!xx24RR3HX?~s2!xx Test Bank Chap. 8 (9th ed.)Computer Science: An OverviewJ. Glenn BrookshearOwner MSWordDocWord.Document.89q