11 views

Uploaded by Enggar Alfianto

save

- pgRoutingDocumentation.pdf
- lesson plan 1
- investigation 1
- Using a WIF to Make a Drawdown by Hand
- Section 1
- Sept12 Tcb2073 Tbb1073 Structured Programming and Database
- 111MId1Review_SP14
- Lesson 2
- Calc 3 syllabuusssss
- outdoor-led-wall.pdf
- study guide summative 3- function notation 2017-2018
- Final AI File
- 2008 Mathematical Methods (CAS) Exam Assessment Report Exam 1
- 1.4 Notes - Even and Odd Functions
- Transformations of Graphs
- OV7740
- ARCODE Priority Service Mode V10.En
- functionspart1unitportfolio-novella
- 2017-01-30 Bug Paths
- Solution Manual for College Algebra in Context With Applications for the Managerial Life and Social Sciences 5th Edition by Harshbarger
- Computer Science 61A
- (1)Relations and Functions

You are on page 1of 9

3 Movement of Ants Maple Quick Review Questions Introduction to Computational Science: Modeling and Simulation for the Sciences Angela B. Shiflet and George W. Shiflet Wofford College © 2006 by Princeton University Press This file contains system-dependent Quick Review Questions and answers in Maple for Module 11.3 on "Movement of Ants." Complete all code development in Maple. Grid Initialization Quick Review Question 1 This question refers to the initialization of the grid for ant movement. Suppose we establish constants EMPTY, NORTH, EAST, SOUTH, and WEST as representative characters, as follows:

EMPTY:= "T": NORTH :="N": EAST := "E": SOUTH := "S": WEST := "W":

a. b. c.

Write a statement to assign to EMPTY the character "T" without displaying the result. Similar statements give character values "N", "E", "S", and "W" to NORTH, EAST, SOUTH, and WEST, respectively. Write a function call to return a random integer between 1 and 4. We define a list, dir, of directions, as follows:

dir := [NORTH, EAST, SOUTH, WEST]:

d.

Suppose r is an integer between 1 and 4. Give the expression to return the direction from dir with index r. Complete the code to assign to initialGrid an n-by-n array of ordered pairs. The first member of each ordered pair is zero. With a probability of probAnt, the cell contains an ant that faces in a random direction. Otherwise, the cell does not contain an ant. Assume that rand0to1 is a function that returns a random floating point number between 0 and 1.

initialGrid:= [ ([ [ , `if`( dir[rand(1..4)()], j = 1..n)], i = 1..n)]: ( < )], ,

then the amount of chemical is the integer 29 because (50)(10)/17 = 29. NULL). and for column j the amount of chemical is a fraction. b::list. c::list. We begin by defining a function.11. NORTH. e. expressed as an integer. SOUTH. 2 Complete the loop to generate a chemical trail with no ants on the middle row of the grid initialGrid. lng := (mxDirList): .3 Maple QRQ e. that returns the direction. If more than one argument is equal to the maximum. . senseMax. ] Sensing Quick Review Question 2 With integer parameter a representing the amount of chemical. SOUTH. mx. For example. s. WEST. mxDirList := [ ( ( ( ( . NULL). NULL)]: c. a direction is picked at random. NULL). of the maximum 50. respectively. WEST. … a.41. w) local mx. The maximum amount of chemical. mxDirList. . NORTH. end do: ] := [ . lng. sense[ ). if j is 10 and n is 17. . 50. Assume the function definition begins as follows: senseMax := proc(n. mx := : b. Complete the statement to assign the maximum level of chemical in neighboring cells to mx. define(sense. the component in the resulting list should be NULL. Complete the statement to assign to mxDirList a list of directions (NORTH. indicating no value. EAST. . j / n. occurs in column n. occurs. SOUTH. EAST. j from 1 to n do grid[[IntegerPart[n/2] + 1. e::list) = Quick Review Question 3 This question refers to the second sense rule that an ant turns at random in the direction of one of the neighboring cells with the greatest amount of chemical. of the maximum of four arguments. If a parameter is not equal to mx. Complete the statement to assign to lng the number of elements in mxDirList. EAST. WEST) where the maximum level. d::list. complete the code for the first sense rule that an empty cell does not sense.

mxDirList[ ]. Ww::list) = [ . Ee::list. sense([a [b [e [s [w [ ). s. NE::list. Ww::list) = [ . Ss::list. the ant leaves the current cell and the amount of chemical at that site increments by one. and west directions. ]. Ee::list. south. . W::list. Complete the statement to return a random position from 1 and lng. walk([a . NW::list. . in mxDirList. inclusively.3 Maple QRQ 3 d. aa nn ee ss ww ]. ]. .11. walk([a . ]. definemore(sense. S::list. NW::list. W::list. Quick Review Question 5 Complete the definition of one form of the second walk bullet: If an ant wants to go north and the cell to the north is empty. ]. ]. definemore(walk. SE::list. SW::list. c ]. Ss::list. Complete the additional rule for sense (the first rule is in Quick Review Question 2). the amount of chemical remains the same. SW::list. S::list. . ]. as we see shortly. The rule uses delayed evaluation of senseMax. E::list. walk([a . e. Nn::list. NE::list. . … . . ]. ]) = (b. ] ). [b E::list. (walk. e. SE::list. N::list. N::list. . Nn::list. where each of the five parameters is a list consisting of an integer and a character parameter. w)] Walking without Concern for Collision Quick Review Question 4 Complete the definition of the first walk rule: For a cell that remains empty. this rule is not the first we define. Similar rules apply to the east. Because Maple applies the first rule that matches. Quick Review Question 6 Complete the definition of the third walk rule: If an ant stays in a cell. definemore(walk. the amount of chemical decrements by one but does not fall below 0.

]. … ]. In this case. NW::list. walk([a::integer. W::list. The pattern of arguments for this rule matches a rule for which previous Quick Review Questions? Quick Review Question 9 a. S::list. b. Ww::list) = [ . E::list. Nn::list. Ee::list. NE::list. [b::integer. Give the number of similar such rules. Nn::list. NW::list. SW::list. Ss::list. … ]. c. SW::list. south. we define it first. SE::list. the cell continues to have its same amount of chemical. ]. Complete the definition of the walk rule for the situation in Figure 11. NE::list. SE::list.3. Similar rules apply to ants in the east. [ne::integer. NW::list. Ss::list. ). walk([a::integer. E::list. [b::integer. The pattern of arguments for this rule matches a rule for which previous Quick Review Question? Walking with Concern for Collision Quick Review Question 8 a. S::list. Ww::list) = [ .3. ]. (walk. W::list. ]. and west directions facing the current site.11. ]. Complete the definition of one form of the fourth walk bullet: If an ant moves to a cell. definemore(walk.1 in which a collision should be avoided for the current ant that faces an empty cell to the north and a northeast ant that faces west.3 Maple QRQ E::list. the current site is initially empty and the cell to the north contains an ant that is facing south. SW::list. 4 ] Quick Review Question 7 a. SE::list. Ee::list. b. Because this rule is more specific than that of some previous Quick Review Questions. Ss::list.1 in which a collision should be avoided where the current site is empty but ants to . Complete the definition of the walk rule for the situation in Figure 11. Ww::list) = [ . Nn::list. S::list. Ee::list. W::list.

j]. definemore(walk. ]. the second coordinate of the ordered pair mat[i. Ww::list)= [max(a . j.11. SW::list. j) local siteColorAmt: … a. return a shade of red based on siteColorAmt.3 Maple QRQ the north and east both want to move into the site. 0). Complete the statement to assign to siteColorAmt the amount of chemical component. Otherwise. SE::list. Ee::list. Complete the if statement to return an RGB color designation for a cell. NE::list. [b::integer. . if (mat[i. return a shade of gray (equal amounts of red. scaled to be between 0. c.(mat[i.0. ]. it decrements by 1.5)/ : c. i. j) local siteColorAmt: global maxChem: siteColorAmt := 1. The complete function is as follows: matchColor := proc(mat. NW::list. . If the cell is empty. ) then . green. i. W::list. The definition of the latter begins as follows: matchColor := proc(mat. as described in this section. b. and maxChem is the maximum amount of chemical in any cell of any grid in graphList. ] = . S::list. . b. . ). Nn::list. 1] * 0.5 and 1. siteColorAmt := .1. and blue) based on siteColorAmt. Write a statement to indicate that variable maxChem is not local to matchColor.( ] * 0.5)/maxChem: . Give the number of similar such rules. if the amount of chemical at the site is positive. The function showGraphs uses a function matchColor to associate the value of a cell with a color. Ss::list. The pattern of arguments for this rule matches a rule for which previous Quick Review Questions? Visualizing the Simulation Quick Review Question 10 Suppose graphList is a list of square grids representing frames of the simulation at consecutive time steps.0 . ( else ( end if. walk([a::integer. ). In this situation. … 5 ]. [e::integer. j. ].

Complete the statement to assign to plotGrid a sequence of squares. = ).11. i = 1. end if. . Complete the statement to append to plotList a display of all the squares in the sequence from Part g plotList := [ (plotList). g.. . siteColorAmt. color = ). a. Write a statement to assign to g the kth grid. scaling = CONSTRAINED. axes = none.n): h. maxChem) local k.. g. colored as designated by matchColor and translated into the rows and columns corresponding to the grid g. Complete the statement to generate an animation of the elements in plotList. siteColorAmt. … e. The definition showGraphs to visualize the grids in graphList with maximum chemical amount of maxChem begins as follows: showGraphs := proc(graphList. ). plotGrid. siteColorAmt).n). 0).. in graphList. f. j. plotGrid := ( ( plottools[ ]( plots[ ](aSquare. Start with the origin and list the vertices in counterclockwise order. plotList. 0. n. j = 1. Write a segment to indicate that maxAmtChem is not local and to give it the value of parameter maxChem. [ ](plotList. aSquare. end proc: d. c. EMPTY := "T": The assignments for the other directions are as follows: NORTH := "N": EAST := "E": SOUTH := "S": WEST := "W": rand(1. siteColorAmt. else COLOR(RGB. Answers to Quick Review Questions 1. [ ](plotGrid)]: i. 2] = EMPTY) then COLOR(RGB. Write a statement to assign to aSquare a list containing the vertices of a unit square in the first quadrant with a vertex at the origin.3 Maple QRQ 6 if (mat[i. or square matrix.4)() dir[r] b.

nn::character].n)]. s. SOUTH. NULL). the following expression returns a random direction. w)] ). 3. S. SOUTH. sense([a::integer. d::list. W::list. E::list. NW::list. . c::list. lng. NULL). ww::character]) = [a. w): mxDirList := [`if`(n = `if`(e = `if`(s = `if`(w = mx. j] := [trunc(maxChem*j/n). definemore(walk. NORTH. j = 1. sense([a::integer..n)]: for j from 1 to n do initialGrid[trunc(n/2) + 1. W::list. NULL). [w::integer.. a. N. E. 2. walk([a::integer. EMPTY] ).. E::list. walk([a::integer. e.lng)()]. or W: d.. NULL)]: e. mx := max(n. S::list.3 Maple QRQ Thus.4)()]. `if`(s = mx.4)()] initialGrid := [seq([seq([0. ss::character]. b::list. definemore(walk. NULL):]: c.lng)()]. mx.. NULL). EMPTY] end do: 7 e. [b::integer.1. 0). EMPTY)]. mxDirList. b. NORTH]. EMPTY]). EAST. `if`(e = mx. NE::list. definemore(sense. Nn::list. lng = nops(mxDirList): mxDirList[rand(1. dir[rand(1. mx := max(n. aa::character]. SW::list. Ee::list. e. `if`(rand0to1() < probAnt. NULL). e. w): mxDirList := [`if`(n = mx. The complete definition of is as follows: senseMax := proc(n. define(sense. [e::integer. end proc: NORTH. s. e::list) = [a. 4. mx. i = 1. EMPTY]. NULL). d. S::list. e. mx. Ww::list) = [max(a . EMPTY]. `if`(w = mx. N::list. s.11. WEST. 5. Ss::list.. EAST. [s::integer. dir[rand(1. [b::integer. s. 'senseMax'(b. WEST. w) local mx. EMPTY]. SE::list. ee::character]. lng := nops(mxDirList): mxDirList[rand(1.

NE::list. S::list. Nn::list. j. Ww::list) = [a. Ww::list) = [`if`(a>0. W::list. E::list. E::list. … 8 6. NW::list. c. 7. Quick Review Question 4. global maxChem: siteColorAmt := 1. Ee::list.5)/maxChem: 10. SOUTH]. definemore(walk. 0). Ww::list) = [a. for the rule of the current. W::list. Ss::list. NW::list. more specific situation ever to apply. NW::list. NE::list. S::list. NW::list. and 7. SE::list. Thus. its definition must appear before the rules of Quick Review Questions 4. SOUTH]. Nn::list.3 Maple QRQ NE::list. [b::integer. define(walk. walk([a::integer. NORTH]. W::list. Thus. SE::list. Nn::list. NW::list. Ww::list)= [max(a . walk([a::integer. b. SW::list.11. [ne::integer. SW::list. a. 11 Quick Review Questions 5 and 6. N::list.(mat[i. NORTH]. EMPTY]. a.0 . 6. walk([a::integer. [e::integer. more specific situation ever to apply. EMPTY]. SE::list. a. Nn::list. EMPTY]. … 9.1. for the rule of the current. Thus. walk([a::integer. Ss::list. SE::list. Ee::list. WEST]. S::list. c::character]. S::list. definemore(walk. b. Nn::list. a. Ss::list. . and 7. SE::list. 6. c. Ee::list. [b::integer. NE::list. EMPTY]. definemore(walk. Ss::list. E::list. its definition must appear before the rules of Quick Review Questions 5 and 6. Ee::list. 0). 1] * 0. SW::list. Ee::list. b. Ww::list) = [a. EMPTY]. for the rule of the current. Ss::list. b. c] ). a+1. … 8. W::list. SW::list. 5 Quick Review Questions 4. SW::list.WEST]. its definition must appear before the rule of Quick Review Question 4. [b::integer. SOUTH]. more specific situation ever to apply.

i. i. [0.n): plotList := [op(plotList). 2] = EMPTY) then COLOR(RGB. 0). end if. j. j)). color = matchColor(g. 0]]: plotGrid := seq(seq( plottools[translate]( plots[polygonplot](aSquare. else COLOR(RGB. 1]. j. [1. 1]. insequence = true). g. 0. axes = none. e. siteColorAmt).. [1. siteColorAmt. g. scaling = CONSTRAINED. if (mat[i.. plots[display](plotGrid)]: plots[display](plotList. siteColorAmt.11. i). siteColorAmt. . global maxAmtChem: maxAmtChem := maxChem: global maxAmtChem: maxAmtChem := maxChem: g := graphList[k]: aSquare := [[0. h. 9 d. j = 1. f.3 Maple QRQ c.n). i = 1. 0].

- pgRoutingDocumentation.pdfUploaded byfedeori
- lesson plan 1Uploaded byapi-283599791
- investigation 1Uploaded byapi-320878080
- Using a WIF to Make a Drawdown by HandUploaded byJoOwl
- Section 1Uploaded byFrancisco Araujo
- Sept12 Tcb2073 Tbb1073 Structured Programming and DatabaseUploaded bykumutha
- 111MId1Review_SP14Uploaded byECAECA20
- Lesson 2Uploaded byAnonymous rQr3QJPh
- Calc 3 syllabuusssssUploaded byPatrick Lung
- outdoor-led-wall.pdfUploaded byThirukandiyur Sudarsana Sri Raman
- study guide summative 3- function notation 2017-2018Uploaded byapi-366582437
- Final AI FileUploaded byhammaddon
- 2008 Mathematical Methods (CAS) Exam Assessment Report Exam 1Uploaded bypinkangel2868_142411
- 1.4 Notes - Even and Odd FunctionsUploaded byJohn Mixer
- Transformations of GraphsUploaded bymomathtchr
- OV7740Uploaded byHiron Bose
- ARCODE Priority Service Mode V10.EnUploaded byHenri Kleine
- functionspart1unitportfolio-novellaUploaded byapi-264284566
- 2017-01-30 Bug PathsUploaded bysamjshah
- Solution Manual for College Algebra in Context With Applications for the Managerial Life and Social Sciences 5th Edition by HarshbargerUploaded bya594207545
- Computer Science 61AUploaded byDaniel Au
- (1)Relations and FunctionsUploaded byangelmusic27