ࡱ>  Lbjbj 0rr,DJJJJJ^^^8LD^( &&<<<$"$JJJ<<CCCJ<J<CCCC<ővC0( C%e%C%JCPC$( % : Chapter 7 Exercises and Answers Answers are in blue. For Exercises 1-6, match the problem solving strategy with the definition or example. A. Ask questions B. Look for familiar things C. Divide and conquer 1.The first strategy to use when given a problem. A2.Don't reinvent the wheel. B3.Strategy used in the binary search algorithms C4.Is a solution to a previous problem appropriate for the current one? B5.Strategy used in the Quicksort algorithm C6.There is an apparent contradiction in the problem statement. A For Exercises 7-10, match the following phase with its output. A. Analysis and specification phase B. Algorithm development phase C. Implementation phase D. Maintenance phase 7.Working program C8.None D9.Problem statement A10.General solution B For Exercises 11-15, match the term with the definition. A. Information hiding B. Abstraction C. Data abstraction D. Procedural abstraction E. Control abstraction 11.The practice of hiding the details of a module with the goal of controlling access to the details of the module A12.A model of a complex system that includes only the details essential to the viewer B13.The separation of the logical view of an action from its implementation D14.The separation of the logical view of a control structure from its implementation E15.The separation of the logical view of data from its implementation C For Exercises 16 - 36, mark the answers true or false as follows: A. True B. False 16.Count-controlled loops repeat a specific number of times. A17.Event-controlled loops repeat a specific number of times. B18.Count-controlled loops are controlled by a counter. A19.Event-controlled loops are controlled by an event. A20.An infinite loop is a loop that never terminates. A21.Loops can be nested, but selection structures cannot. B22.Selection structures can be nested, but loops cannot. B23.All control structures can be nested. A24.The square root algorithm used a count-controlled loop. B25.An array is a homogeneous structure, but a record is not. A26.A record is a heterogeneous structure, but an array is not. A27.A record is a homogeneous structure; an array is a heterogeneous structure. B28.The bubble sort algorithm involves finding the smallest item in the unsorted portion of the array and swapping it with the first unsorted item. B29.Quicksort is not always quick. A30.A binary search can be applied to both a sorted and unsorted array. B31.A binary search is always faster than a linear search. B32.A selection sort puts one more item into its permanent place at each iteration. A33.An insertion sort puts one more item into its place with respect to the already sorted portion. A34.Recursion is another name for iteration. B35.Recursive algorithms use IF statements. A36.Iterative algorithms use WHILE statements. A Exercises 37 67 are short-answer questions. 37.List the four steps in Polya's How To Solve It List. Understanding the problem Devising a plan Carrying out the plan Looking Back38.Describe the four steps listed in Exercise 37 in your own words. Each student's answer is unique.39.List the problem-solving strategies discussed in this chapter. Ask questions Look for familiar things Divide and conquer40.Apply the problem-solving strategies to the following situations. Solutions are not unique. A. Buying a toy for your four-year-old cousin. Ask questions: What do four-year olds like? Is he or she into sports? What stores sell toys? Where is a particular store located? What toys does the cousin already have? Look for things that are familiar: I liked Lincoln Logs; would my cousin? I liked my red wagon; would my cousin? My cousin is like his (or her) mother; what did she play with as a child? Divide and conquer: Go to store. Go to toy aisle. Fine girl's (or boy's) toys. Choose one. B. Organizing an awards banquet four your soccer team. Ask questions: Where will it be? When will it be? How many will be there? How many trophies will be awarded? Look for things that are familiar: I organized one last year. I organized a fundraiser. I was a scout leader. I play soccer. Divide and conquer: Have Jane decide on day and time. Have Jim choose menu. Have Mary by trophies. Have Jeremy call people. C. Buying a dress or suit for an awards banquet at which you are being honored. Ask Questions: What time of day is the banquet? Where is the banquet being held? What will others be wearing? What is my best color? Look for things that are familiar: Last year the award winner wore a blue dress (suit). Last year I wore a green suit. I wore a suit when I was honored last year. Divide and conquer: Choose the store Go to the store Choose possibles from racks Choose one.41. Examine the solutions in Exercise 40 and determine three things they have in common. Each solution includes data objects: toy, food, dress, suit. Each solution involves choices or decisions. Each solution involves a container for objects: toy store, restaurant, clothing store.42. What is an algorithm? An algorithm is a set of instructions for solving a problem in a finite amount of time using a finite amount of data. 43. Write and algorithm for the following tasks. Solutions are not unique. A. Making a peanut butter and jelly sandwich. Get bread Get peanut butter Get jelly Get knife Spread peanut butter on one slice of bread Spread jelly on one slice of bread Combine slices of bread, peanut butter facing jelly B. Getting up in the morning. Alarm goes off Hit sleep button Alarm goes off Hit sleep button Alarm goes off Turn off alarm Move dog Throw back covers Put feet over side of the bed Stand up C. Doing your homework Turn off TV Turn off CD Get backpack Sit at desk Open backpack Pet cat Open book Open assignment WHILE (more to do) Solve problem Pet cat D. Driving home in the afternoon Find car Open car door Get into car Fasten seat belt Start engine Turn on radio WHILE (not yet home) Keep going Turn off engine Open car door Get out of car Close car door44.List the three phases of the computer problem-solving model. Algorithm development phase Implementation phase Maintenance phase45.How does the computer problem-solving model differ from Polya's? In Polya's list, the human executes the plan and evaluates the results. In a computer solution, a program is written that expresses the plan in a language that the computer can execute. The human then takes the computer output and evaluates the results.46.Describe the steps in the algorithm development phase. The algorithm development phase includes analysis (understanding the problem), proposed solution (logical sequence of solution steps), and testing (following algorithm). 47.Describe the steps in the implementation phase. The implementation phase includes coding (translating the algorithm into a computer language) and testing (compiling and running the program).48.Describe the steps in the maintenance phase. The maintenance phase involves using the program and modifying the program to add functionality or correct errors.49.Look up a recipe for chocolate brownies in a cookbook and answer the following questions. A. Is the recipe an algorithm? Justify your answer. (One author's solution.) Yes, the recipe is an algorithm. If the steps are followed exactly, brownies are produced. B. Organize the recipe as an algorithm, using pseudo-code. Preheat oven to 3750 Put 2 oz unsweetened chocolate in double boiler Add 1/2 cup butter to chocolate in double boiler Put double boiler over moderate flame Melt contents of double boiler Remove double boiler from flame Get a cup of sugar Put 2 eggs in bowl WHILE(more sugar) Beat eggs add sugar gradually Put contents of cooled double boiler in bowl Mix contents of bowl Sift 1/2 cup flour and dash of salt Stir in flour mixture into bowl Add 1 teaspoon vanilla to bowl Add 1/2 cup chopped nuts to bowl Mix contents of bowl Grease 9-inch square pan Pour contents of bowl into pan Set minutes to 20 Put pan in oven WHILE (minutes not 0) Set minutes to minutes - 1 Remove pan from oven Cut into 1-1/2" squares Eat C. List the words that have meaning in computing. WHILE is the only computing word. It means repetition. D. List the words that have meaning in cooking. Words with meaning in cooking include preheat, add, double boiler, melt, moderate flame, beat, gradually, mix, shift, dash, chopped, and grease. E. Make the cookies and take them to your professor.50.We said that following a recipe is easier than developing one. Go to the supermarket and buy a vegetable that you have not cooked (or eaten) before. Take it home and develop a recipe. Write up your recipe and your critique of the process. (If it is good, send it to the authors.) This is an activity. No answer expected.51.Describe the top-down design process. The top-down design process is characterized by successive layers of refinement. The top-level tasks are listed. At each succeeding level, the tasks from the previous one are further developed.52.Differentiate between a concrete step and an abstract step. An abstract step is one in which further development is needed. A concrete step is one in which all the steps are fully specified.53.Write a top-down design for the following tasks. Solutions are not unique. A. Buying a toy for your four-year-old cousin. Go to store Choose toy Buy toy Go to store Choose store Find location Take bus Choose toy Walk up and down aisles Panic at choices Grab nearest large stuffed animal Buy toy Go to clerk Give stuffed animal to clerk Give credit card to clerk Sign credit card slip B. Organizing an awards banquet four your soccer team. Rent banquet room Send invitations Choose menu Buy trophies Rent banquet room Find what is available Visit possible choices Choose one Make reservation Send invitations Get list of people to invite Buy invitations Address invitations Mail invitations Buy trophies Find out how many to buy Find store that carries trophies Order trophies over the phone Pick up trophies C. Buying a dress or suit for an awards banquet at which you are being honored. Go to favorite store Choose dress or suit that suits you Pay for choice Go home Go to favorite store Get in car Drive to favorite store Get out of car Walk in to store Choose dress or suit for occasion Make an initial selection of several Try each one on Choose best Pay for choice Take purchase to cashier Hand the cashier your credit card Sign receipt Go home Walk to car Get in Find keys Start car Drive home54.Write a top-down design for the following tasks. Solutions are not unique. A. Calculating the average of ten test scores. Set count to 0 Set sum to 0 WHILE (count < 10) Get score Set sum to sum plus score Set count to count plus 1 Set average to sum divided by 10 B. Calculating the average of an unknown number of test scores. Set count to 0 Set sum to 0 WHILE (there are more scores) Get score Set sum to sum plus score Set count to count plus 1 Set average to sum divided by count C. Describe the differences in the two designs. The loop in the first design operates exactly 10 times. The loop in the second design operates as long as there were more scores.55.Write a top-down design for the following tasks. Solutions are not unique. A. Finding a telephone number in the phone book. Find the right page Find the right column Search the column for name Find the right page Open to approximate part of book WHILE (page not found) Compare name with name on top of right page IF (name on top is less) Turn page forward ELSE Compare name with name on top of left page IF (name on top is greater) Turn page backward ELSE Page is found Find right column Current column is leftmost one WHILE (column not found) IF (name on bottom of current column is greater) Column is found ELSE Set current column to one at right of current column Search the column for name Set found to false WHILE (more to look at and not found) Get next name IF (name is the one you want) Get phone number Set found to true IF (found is false) Number not in book B. Finding a telephone number on the Internet. Log on to Internet Go to favorite search engine Type in "Find phone number" Go to first response Get phone number Log off C. Finding a telephone number on a scrape of paper that you have lost. Search purses (wallets) for scrap of paper Search waste paper baskets for scrap of paper Search trash can for scrap of paper Search purses (wallets) WHILE (paper not found and there are more purses or wallets) Get next one IF (paper is there) paper is found Search waste paper baskets WHILE (paper not found and there are more waste paper baskets) Get next one IF (paper is there) paper is found D. Describe the similarities and differences among these designs. The first and third both have a process repeated a number of times; the second does not. The first and third are processes that most of us have done physically many times. The first and third involve a linear search through a container of data: columns in a book and purses (wallets), and waste paper baskets.56.Distinguish between information and data. Information is any knowledge that can be communicated. When information is in the form that a computer can use, it is called data. Thus data is any knowledge that can be communicated in a form that a computer can process.57.Write a top-down design for sorting a list of names into alphabetical order. WHILE (more names) Scan list for name closest to beginning of the alphabet (smallest) Copy name to new list Cross name off original list Copy names back onto original list58.A. Why is information hiding important? Information hiding defers details until the level where the details are important. This process keeps an algorithm from being dependent on the implementation details, which may change. B. Name three examples of information hiding that you encounter every day. Talking on the telephone. Driving a car. Turning on the television.59.An airplane is a complex system. Solutions are not unique. A. Give an abstraction of an airplane from the view of a pilot. A pilot can view the airplane as a car that he or she drives on a highway of air. B. Give an abstraction of an airplane from the view of a passenger. A passenger can view the airplane as the inside of a limousine that is carrying the passenger from one place to another. C. Give an abstraction of an airplane from the view of the cabin crew. The cabin crew can view an airplane as a dining room. D. Give an abstraction of an airplane from the view of a maintenance mechanic. A maintenance mechanic can view an airplane as a collection of parts and wires put together according to his or her maintenance diagrams. E. Give an abstraction of an airplane from the view of the airline's corporate office. From the view of the boardroom, the airplane can be viewed as an expensive object used in the process of making money.60. List the identifiers and whether they named data or actions for the designs in Exercise 53. A. Actions: go, choose, buy, find, give, sign Data: store, toy, clerk, credit card B. Actions: rent send, choose, buy, find, visit, make, get, address, mail, order, pick up Data: banquet room, invitations, menu, trophies, reservation, list of people, phone C. Actions: go choose pay Data: store, dress, suit, choice, home61.List the identifiers and whether they named data or actions for the designs in Exercise 54. A. Actions: set, get Data: count, sum, score, average B. Actions: set, get Data: count, sum, score, average62.List the identifiers and whether they named data or actions for the designs in Exercise 55. A. Actions: find, search, open, compare, turn, set Data: page, column, name, book, right page, left page B. Actions: log on, go, type, get Data: Internet, search engine, first response, phone number Exercises 63-65 use the following array of values. length list[0][1][2][3][4][5][6][7][8][9][10]1123416620290934194099 63.Show the state of the list when firstUnsorted is first set equal to the 4th item in the selection sort. Array when firstUnsorted is first set to 4th item. [0] [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] 2 9 19 20 23 90 41 34 66 40 99 64.Show the state of the list when firstUnsorted is first set equal to the 5th item in the bubble sort algorithm. Array when firstUnsorted is first set equal to the 5th item. [0] [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] 2 9 19 20 23 41 66 34 40 90 99 65.Show the state of the list when the first recursive call is made in Quicksort using list[0] as split value. Array when first recursive call is made. [0] [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] 2 19 9 20 23 90 66 34 41 40 99  Exercises 66-67 use the following array of values. length list[0][1][2][3][4][5][6][7][8][9][10]1157203344464849101102105 66.How many comparisons does it take using a sequential search to find the following values or determine that the item is not in the list? A. 4 11 B. 44 5 C. 45 11 D. 105 11 E. 10 1167.How many comparisons does it take using a binary search to find the following values or determine that the item is not in the list? A. 4 4 B. 44 4 C. 46 1 D. 105 4 E. 106 4     2016 Jones & Bartlett Learning LLC, an Ascend Learning Company  HYPERLINK "http://www.jblearning.com" www.jblearning.com   56  & ( ) Z \ ]    ] ^      ! Z \ ] ķķķķķķķķķķ۔hdM~hdM~5#hdM~h [0J5CJOJQJaJ!hdM~h [B*CJ_HaJphhdM~h [CJ_HaJhdM~h [CJaJhdM~hdM~5CJaJhdM~h [5CJaJ hdM~CJhz.hdM~B*phhdM~h7 56  & {_kd$$Ifl0P4 t644 lapyt [ $Ifgd [ $$Ifa$gd [gd [gddM~gddM~& ( ) , Z \ $$Ifa$gd [_kdg$$Ifl0P4 t644 lapyt [ $Ifgd [\ ] ` $Ifgd [ $$Ifa$gd [_kd$$Ifl0P4 t644 lapyt [ $Ifgd [ $$Ifa$gd [_kd5$$Ifl0P4 t644 lapyt [   $Ifgd [ $$Ifa$gd [_kd$$Ifl0P4 t644 lapyt [   Z  $Ifgd [ $$Ifa$gd [gd [_kd$$Ifl0P4 t644 lapyt [ $Ifgd [ $$Ifa$gd [_kdj$$Ifl0P4 t644 lapyt [   $Ifgd [ $$Ifa$gd [_kd$$Ifl0P4 t644 lapyt [    $Ifgd [ $$Ifa$gd [_kd8$$Ifl0P4 t644 lapyt [ ! Z q > @ {{ $Ifgd [ $$Ifa$gd [  gddM~gd [_kd$$Ifl0P4 t644 lapyt [ ] ^ q s u > @ A @ B C G "#acdh򻮝hdM~h [5CJ hdM~h [!hdM~h [B*CJ_HaJphhdM~h [CJ_HaJhdM~h [CJaJhdM~hdM~5#hdM~hdM~0J5CJOJQJaJ#hdM~h [0J5CJOJQJaJhdM~h [5 hp57@ A E $Ifgd [ $$Ifa$gd [_kd$$Ifl0P4 t644 lapyt [  $Ifgd [ /$Ifgd [ $$Ifa$gd [_kdm$$Ifl0P4 t644 lapyt [ @ B {r $Ifgd [ |/$If^`gd [ $$Ifa$gd [_kd$$Ifl0P4 t644 lapyt [B C G  $Ifgd [ /$Ifgd [ $$Ifa$gd [_kd;$$Ifl0P4 t644 lapyt [ " $Ifgd [ $$Ifa$gd [gd [_kd$$Ifl0P4 t644 lapyt [ "#'ac $Ifgd [ $$Ifa$gd [_kd $$Ifl0P4 t644 lapyt [cdh $Ifgd [ /$Ifgd [ $$Ifa$gd [_kdp$$Ifl0P4 t644 lapyt [{r $Ifgd [ |/$If^`gd [ $$Ifa$gd [_kd$$Ifl0P4 t644 lapyt [ $Ifgd [ /$Ifgd [ $$Ifa$gd [_kd>$$Ifl0P4 t644 lapyt [LN $Ifgd [ /$Ifgd [ $$Ifa$gd [_kd$$Ifl0P4 t644 lapyt [LNOS689=y{|cefjijklp/0126aceݵhdM~h [5CJ!hdM~h [B*CJ_HaJphhdM~h [CJ_HaJhdM~h [CJaJ!hdM~h [B*CJ_HaJph hdM~h [DNOS $Ifgd [ /$Ifgd [ $$Ifa$gd [_kd $$Ifl0P4 t644 lapyt [ $Ifgd [ /$Ifgd [ $$Ifa$gd [_kds$$Ifl0P4 t644 lapyt [ $Ifgd [ /$Ifgd [ $$Ifa$gd [_kd$$Ifl0P4 t644 lapyt [68 $Ifgd [ /$Ifgd [ $$Ifa$gd [_kdA $$Ifl0P4 t644 lapyt [89=y{ $Ifgd [ /$Ifgd [ $$Ifa$gd [_kd $$Ifl0P4 t644 lapyt [{|zq $Ifgd [ |/$If^`gd [ $$Ifa$gd [_kd $$Ifl0P4 t644 lapyt [ce{r $Ifgd [ |D$If^`gd [ $$Ifa$gd [_kdv $$Ifl0P4 t644 lapyt [efjzq $Ifgd [ |/$If^`gd [ $$Ifa$gd [_kd $$Ifl0P4 t644 lapyt [zq $Ifgd [ |/$If^`gd [ $$Ifa$gd [_kdD $$Ifl0P4 t644 lapyt [zq $Ifgd [ |/$If^`gd [ $$Ifa$gd [_kd $$Ifl0P4 t644 lapyt [ikzq $Ifgd [ |/$If^`gd [ $$Ifa$gd [_kd $$Ifl0P4 t644 lapyt [klpzq $Ifgd [ |/$If^`gd [ $$Ifa$gd [_kdy $$Ifl0P4 t644 lapyt [zq $Ifgd [ |/$If^`gd [ $$Ifa$gd [_kd $$Ifl0P4 t644 lapyt [/1zq $Ifgd [ |/$If^`gd [ $$Ifa$gd [_kdG $$Ifl0P4 t644 lapyt [126aczq $Ifgd [ |/$If^`gd [ $$Ifa$gd [_kd $$Ifl0P4 t644 lapyt [cde  d$If $d$Ifa$_kd$$Ifl0P4 t644 lapyt [ ``a:] PQr?Mgz vde|  + \ !!""M###Q$R$$$$8%ӺӺӺӺӺӺӮӮhdM~B*CJaJph hdM~h [6B*CJaJphhdM~CJaJhdM~h [B*CJaJphhdM~h [CJaJ hdM~h [hdM~h [B*phD`^Ekd$$Ifl0," 4 la d$If $d$Ifa$Ekd|$$Ifl0," 4 la F`:] 'D d$If $d$Ifa$Ekd$$Ifl0," 4 laDP3Mcr?No;g{ d$If{ ] $d$Ifa$Ekdi$$Ifl0," 4 la d$If vw}^Ekd$$Ifl0," 4 la d$If $d$Ifa$Ekd$$Ifl0," 4 la #Nq"+=[d| d$Ifgd [ d$If d$Ifgd [ +4BO`m{ Vd$IfgddM~ Vd$Ifgd [ d$If d$Ifgd [ 6 K ] ^ b !^Ekd$$Ifl0," 4 la d$If $d$Ifa$EkdV$$Ifl0," 4 la !!!!""""M#^EkdC$$Ifl0," 4 la d$If $d$Ifa$Ekd$$Ifl0," 4 laM#N#R#####Q$$$$^Ekd$$Ifl0," 4 la d$If $d$Ifa$Ekd$$Ifl0," 4 la $8%M%}%%%%&&&9&K&V&k&&&&&'2'G'`''''''' Vd$Ifgd [ d$If8%K%L%((7(o(p((1)2)***++f,k,,,,,---6-7-B------(.d.e.w...%/&/3/////>0?0xhphpB*CJaJph hph [>*B*CJaJph3fhph [B*CJaJphhphdM~CJaJhph [B*CJaJphhph [CJaJhdM~h [CJaJhdM~CJaJ hdM~h [B*CJH*aJphhdM~h [B*CJaJph/'((7(o((1)g)h)l)** $d$Ifa$Ekd0$$Ifl0," 4 la d$If Vd$Ifgd [ ****++++f,^Ekd$$Ifl0," 4 la d$If $d$Ifa$Ekd$$Ifl0," 4 laf,g,k,,,,,,------6-7-B-Z-k- d$Ifgd [ d$If $d$Ifa$Gkd$$Ifl 0," 4 lak---------(.:.K.W.d.e.w........//%/&/3/ d$If d$Ifgd [3/L/m/////0'060>0?0T0_0w000000000 1$1F1 d$Ifgdp d$If d$Ifgd [?0T00000 1S1[11111 222233334444445!6"6466 7777777l8m882939K9999=:ʳʳʳʤʓʳʓ³yʤʓʳh,h [B*CJaJph3h,h [CJaJ hdM~h [>*B*CJaJph3fhdM~h [B*CJaJphhdM~h [B*CJaJphh,CJaJhdM~h [CJaJhphpB*CJaJphhphpCJaJ hphp>*B*CJaJph3f/F1S1[1g1n1x1111111 22)2<2 Vd$Ifgd [ d$If $d$Ifa$Ekdp$$Ifl0," 4 la d$Ifgdp<2H2c2~222223%3@3[333344484i4 $d$Ifa$Ekd$$Ifl0," 4 la d$If Vd$Ifgd [i4444444505G5t555555 66!6"646S6 d$Ifgd [ Vd$Ifgd [ d$Ifgd [ d$IfS6l666666 77D7S7r7777778"8>8S8d8 d$Ifgd [ d$Ifgd, d$Ifgd [ d$If V&d$Ifgd [d8l88892939K9999999:%:::K::; Vd$Ifgd [ d$Ifgd [ d$If d$Ifgd [=:J:K:L::;;<&======>>> ?M?s???? @!@e@@@&A\A]AA6B7BBCgChCjCCCCpDqDDDEEEPEQESEEEEEXFYF[FFFFFF⻲h,h,5CJaJh [5CJaJh,h [5CJaJh,B*CJaJphhdM~h [B*CJaJphhdM~h [CJaJh,h [CJaJh,CJaJ?;;;;<<<&=9=^N Vd$Ifgd [Ekd]$$Ifl0," 4 la d$If $d$Ifa$Ekd$$Ifl0," 4 la9=}======>> ?#?2?M? d$If $d$Ifa$Ekd$$Ifl0," 4 la Vd$Ifgd, Vd$Ifgd [ M?N?R?s??? @e@@&A\AA6BBC d$If $d$Ifa$Ekd$$Ifl0," 4 laCC CgCCCDpDDDD^Ekd$$Ifl0," 4 la d$If $d$Ifa$EkdJ$$Ifl0," 4 la DDE,EPEeEEEEEFXFzFFEkd$$Ifl0," 4 la d$If $d$Ifa$ FFFFFFFFGG G GGGGG!G%G*G $$Ifa$ $$If^a$Ekd7$$Ifl0," 4 laFF*G+G-G/GNGTGGHHHCHHHIIICIIIJJ%J&J'J)J[J\J]JjJJJJJJJLKMKPKTKUKYK\K]KbKeKfKlKoKpKuKxKyK}KLLLL LLLŹڵڵڵڵڦڵhdM~h [B*CJaJphh,h,h,5CJaJh [5CJaJh,h [5CJaJhdM~h [B*phhdM~h [CJaJ hdM~h [hdM~h [6A*G+G.G/G2G5G8G;G=G@GBGEGHGKGNGOGPGTGGGGGG$$If^a$K$ d$Ifgd [ $d$Ifa$Ff $$If^a$FfZGHH HHHHHHH!H$H'H*H-H0H3H6H9HH d$IfFf Ff$$If^a$K$>H?HCHHHHHHHII IIIIIIFf#$$If^a$K$$If d$If $d$Ifa$Ekd"$$Ifl0," 4 laII!I$I'I*I-I0I3I6I9II?ICII $d$Ifa$Ekd($$Ifl0," 4 la d$IfFfr&$$If^a$K$IIIIIIIIIIIJJJJ J JJJJJJJ"J%J&JFfY,Ff)$$If^a$K$$If&J'J(J)J\J]JdJeJjJnJrJvJzJ~JJJJJ $$Ifa$ $$If^a$Ekd.$$Ifl0," 4 la d$IfJJJJJJJJJJJJJJJJJJJJLKQKTKZK\K d$If $d$Ifa$Ff2Ff/ $$If^a$\KbKeKlKoKuKxKyK}KLLLLLLLL!L(L*L $d$Ifa$Ekdk5$$Ifl0," 4 la d$IfLLLLLL!L"L(L*L+L,L-L/L0L2L3L5L6L8L>LyLzLLLLLLLLLľhYah{'h{'CJh- h{'0JCJjh- h{'CJUh- h{'CJ h0CJh|Mjh|MUhdM~h [CJaJhdM~h [B*CJaJphhdM~h [B*ph hdM~h [h,*L+L,L.L/L1L2L4L5L7L8LyLLLLLgd{'Ekd5$$Ifl0," 4 la.:p [/ =!"#$% e$$If!vh#v#v4:V l t6554pyt [e$$If!vh#v#v4:V l t6554pyt [e$$If!vh#v#v4:V l t6554pyt [e$$If!vh#v#v4:V l t6554pyt [e$$If!vh#v#v4:V l t6554pyt [e$$If!vh#v#v4:V l t6554pyt [e$$If!vh#v#v4:V l t6554pyt [e$$If!vh#v#v4:V l t6554pyt [e$$If!vh#v#v4:V l t6554pyt [e$$If!vh#v#v4:V l t6554pyt [e$$If!vh#v#v4:V l t6554pyt [e$$If!vh#v#v4:V l t6554pyt [e$$If!vh#v#v4:V l t6554pyt [e$$If!vh#v#v4:V l t6554pyt [e$$If!vh#v#v4:V l t6554pyt [e$$If!vh#v#v4:V l t6554pyt [e$$If!vh#v#v4:V l t6554pyt [e$$If!vh#v#v4:V l t6554pyt [e$$If!vh#v#v4:V l t6554pyt [e$$If!vh#v#v4:V l t6554pyt [e$$If!vh#v#v4:V l t6554pyt [e$$If!vh#v#v4:V l t6554pyt [e$$If!vh#v#v4:V l t6554pyt [e$$If!vh#v#v4:V l t6554pyt [e$$If!vh#v#v4:V l t6554pyt [e$$If!vh#v#v4:V l t6554pyt [e$$If!vh#v#v4:V l t6554pyt [e$$If!vh#v#v4:V l t6554pyt [e$$If!vh#v#v4:V l t6554pyt [e$$If!vh#v#v4:V l t6554pyt [e$$If!vh#v#v4:V l t6554pyt [e$$If!vh#v#v4:V l t6554pyt [e$$If!vh#v#v4:V l t6554pyt [e$$If!vh#v#v4:V l t6554pyt [e$$If!vh#v#v4:V l t6554pyt [e$$If!vh#v#v4:V l t6554pyt [M$$If!vh#v#v :V l55 4M$$If!vh#v#v :V l55 4M$$If!vh#v#v :V l55 4M$$If!vh#v#v :V l55 4M$$If!vh#v#v :V l55 4M$$If!vh#v#v :V l55 4M$$If!vh#v#v :V l55 4M$$If!vh#v#v :V l55 4M$$If!vh#v#v :V l55 4M$$If!vh#v#v :V l55 4M$$If!vh#v#v :V l55 4M$$If!vh#v#v :V l55 4M$$If!vh#v#v :V l55 4M$$If!vh#v#v :V l55 4M$$If!vh#v#v :V l55 4Q$$If!vh#v#v :V l 55 4M$$If!vh#v#v :V l55 4M$$If!vh#v#v :V l55 4M$$If!vh#v#v :V l55 4M$$If!vh#v#v :V l55 4M$$If!vh#v#v :V l55 4M$$If!vh#v#v :V l55 4M$$If!vh#v#v :V l55 4M$$If!vh#v#v :V l55 4M$$If!vh#v#v :V l55 4M$$If!vh#v#v :V l55 4$$If!v h#v#v :V l4p0+55 / / / / /  4kd$$Ifl4p" rB R"b"2%`044444 la$$If!v h#v#v :V l40+55 / / / 4kd$$Ifl4" rB R"b"2% 044444 la$IfK$L$~!v h#v#v :V lp055 / 4a3kd$IfK$L$lp  ` 0p@ 0,,,,4 la$IfK$L$~!v h#v#v :V l055 / 4a3kd$IfK$L$l  ` 0p@ 0,,,,4 laM$$If!vh#v#v :V l55 4$IfK$L$~!v h#v#v :V lp055 / 4a3kd#$IfK$L$lp  ` 0p@ 0,,,,4 la$IfK$L$~!v h#v#v :V l055 / 4a3kd%$IfK$L$l  ` 0p@ 0,,,,4 laM$$If!vh#v#v :V l55 4$IfK$L$l!v h#v#v :V lp055 / 43kd($IfK$L$lp ~ N ^.0,,,,4 la$IfK$L$l!v h#v#v :V l055 / 43kd+$IfK$L$l ~ N ^.0,,,,4 laM$$If!vh#v#v :V l55 4$$If!v h#v#v :V l4p0+55 / / / / /  4kd.$$Ifl4p" rB R"b"2%`044444 la$$If!v h#v#v :V l40+55 / / / 4kd22$$Ifl4" rB R"b"2% 044444 laM$$If!vh#v#v :V l55 4M$$If!vh#v#v :V l55 4^ 666666666vvvvvvvvv666666>6666666666666666666666666666666666666666666666666hH6666666666666666666666666666666666666666666666666666666666666666666866666662 0@P`p2( 0@P`p 0@P`p 0@P`p 0@P`p 0@P`p(8HX`~_HmH nH sH tH @`@ NormalCJ_HaJmH sH tH X@X dM~ Heading 1$<@&5CJKHOJPJQJaJDA D Default Paragraph FontRi@R  Table Normal4 l4a (k (No List n@n  Table Grid7:V0_Hfof eoc_ll/ | (z^z`_HmH sH tH FoF  BLD_NumberB*CJOJQJaJphZoZ eoc_nl$ |v<^v`_HmH sH tH >O2> text$v^va$ CJPJaJLoAL dM~Heading 1 Char5CJKHOJPJQJ4R4 {'0Header  H$6oa6 {'0 Header CharCJaJ4 r4 {'0Footer  H$6o6 {'0 Footer CharCJaJ4U`4 {'0 Hyperlink >*phPK![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] D ] 8%?0=:FLL'2=NZ`fmv& \    @ B "cN8{ek1cD{!M#$'*f,k-3/F1<2i4S6d8;9=M?CDF*GG>HII&JJ\K*LL()*+,-./013456789:;<>?@ABCDEFGHIJKLMOPQRSTUVWXY[\]^_abcdeghijklnopqrstuwMuX8@0(  B S  ?  T????????C@p@q@@@@CAAAAAABLCOCPCQCSCWCYCZC[C_CaCbCdChCkClCnCrCtCuCwC}CDDD DDDDD!D$D*D+D,D.D/D1D2D4D5D7D8D=D>DDDV g W[AA,D.D/D1D2D4D5D7D8DDD3333 ZZZZ\\]^qq=()>>[B\B]B]BcBcBBBLCMCTCUC\C]CeCfCoCpCDDD DDDDD!D"D+D,D=D>DDDD ZZZZ\\]^qq=()+D,D.D/D1D2D4D5D7D8DDD OMp [$^YadM~/j,|M{'N!0,D.D@ %%%%D@UnknownG*Ax Times New Roman5Symbol3. *Cx Arial;. *Cx Helvetica3*Ax TimesqITC Legacy Sans BoldTimes New RomanA$BCambria Math 1h6<GRK,G , : "{, : "{24 D DKqX $Pt82!xx ,TFor Exercises 1-6, match the problem solving strategy with the definition or example Nell DaleTaylor FerracaneOh+'0, HT t  XFor Exercises 1-6, match the problem solving strategy with the definition or example Nell DaleNormalTaylor Ferracane7Microsoft Office Word@d@@|v , :՜.+,D՜.+,< hp|  {" D UFor Exercises 1-6, match the problem solving strategy with the definition or example Title 8@ _PID_HLINKSAp%"http://www.jblearning.com/  !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxz{|}~Root Entry FData y 61Table%WordDocument0SummaryInformation(DocumentSummaryInformation8CompObjr  F Microsoft Word 97-2003 Document MSWordDocWord.Document.89q