Reference no: EM1380187
Question: A two dimensional array (N X M) should be used to represent number of times the bug reached each tile on the floor. All cells of this array should be initialized to zero. The position of the bug on the floor is represented by the coordinates (i-bug, j-bug). The eight possible moves the bug can make at each time interval are represented by the tiles located at [i-bug + i-move(k), j-bug + j-move(k)] where 1<k<8 and :
i-move(1) = -1 j-move(1) = 1
i-move(2) = 0 j-move(2) = 1
i-move(3) = 1 j-move(3) = 1
i-move(4) = 1 j-move(4) = 0
i-move(5) = 1 j-move(5) = -1
i-move(6) = 0 j-move(6) = -1
i-move(7) = -1 j-move(7) = -1
i-move(8) = -1 j-move(8) = 0
A random walk to one of the eight given squares is simulated by generating a random value for k lying between 1 and 8. The bug can not move up the wall so those coordinates which lead beyond a wall must be ignored and a new random combination formed. Each time a square is touched, the count for that square is incremented. Thus, a non-zero entry in the array shows the number of times the bug has landed on the corresponding square. When every square has been touched at least once, the simulation is complete.
Design a program to perform the simulation using a 40 by 20 tiled floor (N = 40, and M = 20). For each run, output:
a. The total number of legal moves which the bug makes
b. The final values in the N by M array (this will show the "density" of the walk, that is, the number of times each tile on the floor was touched during the experiment)
You should include an iteration limit, that is, a maximum number of squares that the bug may enter during the experiment. This assures that your program will not get "hung" in an infinite loop. A maximum of 50,000 iteration is appropriate for this simulation.
|
Creating algorithm to implement function
: Create an Algorithm to implement the given function and explain how the required task can be achieved in a step by step process.
|
|
Administration plan for the hypothetical situation
: Discuss how would you approach a backup and administration plan for hypothetical condition given below. With any network administration systems that should be installed for remote access in event of a network emergency.
|
|
Writing a c program
: Create a C program that has a declaration in main() to store the following numbers into an array named channels: 2, 4, 5, 7, 9, 11, 13. There should be a function call to display().
|
|
Find the derivatives
: How much should you save every year on order to have the proper amount invested when you retire and find the derivatives
|
|
Random walk simulation
: A two dimensional array should be used to represent number of times the bug reached each tile on the floor. All cells of this array should be initialized to zero.
|
|
Creating two single dimension arrays
: Make two single dimension arrays that contain ten floating point numbers in each array. Make a third single dimension array to hold a sum.
|
|
Comparison of the applicability of array
: Data structures include: 1. a linked list, 2. an ordered, one dimensional array, and three. a binary tree. Assume the list of letters R, A, N, B, C, F, X and G are stored in a list.
|
|
Question about branch hazard
: Provide a relevant example using MIPS instruction set architecture. Discuss the similarities and differences of the code will proceed it the branch is taken, vs if the branch is not taken, and explain how this affects the pipeline.
|
|
Creating two arrays of integers
: Prepare two arrays of integers, each holding 10-elements of data. Make a third array of integers for a result array. The main program will take the 2-arrays of integers and pass them to the function subtract().
|