4 #Simulator.java X10 import java.util.Random;67 public class Simulator910DH23GS 8901111213141516170181000192002122222324252627282930313233340353637380394041125.4546474849505152535455565758596061062636465666768069707172737475767778798081828384private static final int DEFAULT_WIDTH = 120;private static final int DEFAULT_DEPTH = 80;85868708889909102private static final double FOX_CREATION_PROBABILITY = 0.02;private static final double RABBIT_CREATION_PROBABILITY = 0.08;private List animals;private Field field;private int step;private SimulatorView view;public Simulator(){this (DEFAULT_DEPTH, DEFAULT_WIDTH) ;}public Simulator(int depth, int width){42}43}440 public void simulateOneStep(){step++;// Provide space for newborn animals.List newAnimals = new ArrayList<>();if(width <= 0 || depth <= 0) {System.out.println("The dimensions must be greater than zero.");System.out.println("Using default values.");depth =DEFAULT_DEPTH;DEFAULT_WIDTH; }width =animals = new ArrayList<>();field = new Field (depth, width);view = new SimulatorView(depth, width);view.setColor (Rabbit.class, Color. ORANGE) ;view.setColor(Fox.class, Color.BLUE);reset();}public void runLongSimulation (){simulate (4000);}public void simulate(int numSteps){for(int step = 1; step <= numSteps && view.isViable(field); step++) {simulateOneStep();// Let all rabbits act.for (Iterator it = animals.iterator(); it.hasNext(); ) {Animal animal = it.next();animal.act(newAnimals);if(! animal.isAlive()) {it.remove();}}animals.addAll(newAnimals);view.showStatus(step, field);}public void reset(){step = 0;animals.clear();populate();view.showStatus (step, field);}private void populate(){Random rand = Randomizer.getRandom();field.clear();for(int row = 0; row < field.getDepth(); row++) {for(int col =0; col < field.getWidth(); col++) {}}if(rand.nextDouble() <= FOX_CREATION_PROBABILITY) {Location location = new Location (row, col);Fox fox = new Fox(true, field, location);animals.add(fox);}else if(rand.nextDouble() <= RABBIT_CREATION_PROBABILITY) {Location location = new Location (row, col);Rabbit rabbit = new Rabbit(true, field, location);animals.add(rabbit);}}private void delay(int millisec){try {catch}Thread.sleep (millisec);stodExconsJ Rabbit.java X10 import java.util.List;3 public class Rabbit extends Animal4957WNTOSO LASSE4 {5678' 10 11 12 13 24 15 16 7 18 192021222324 25 26 27 28 29 30 31 323343536738394444243445467 48 495051234 55 56 57 58 591001417404143047045255058 }private static final int BREEDING_AGE = 5;private static final int MAX_AGE = 40;private static final double BREEDING_PROBABILITY = 0.12;private static final int MAX_LITTER_SIZE = 4;Randomizer.getRandom();private static final Random rand =public Rabbit (boolean randomAge, Field field, Location location){{}public void act (List newRabbits)}super(field, location);setAge(0);if (randomAge) {}}setAge(rand.nextInt (MAX_AGE));incrementAge();if(isAlive()) {}giveBirth(newRabbits);}private void giveBirth (List newRabbits){}Location newLocation = getField().freeAdjacent Location (getLocatioif(newLocation != null) {setLocation (newLocation);}else {}setDead ();}}protected int getBreeding Age() {return BREEDING_AGE;Field fieldgetField();List free = field.getFreeAdjacent Locations (getLocation () );int births = breed();protected int getMaxAge() {return MAX_AGE;@Override=for(int b = 0; b < births && free.size() > 0; b++) {Location loc = free.remove(0);Rabbit young = new Rabbit(false, field, loc);newRabbits.add(young);OOPDA - Foxes_v3_copy/src/Fox.java - Eclipse IDEprotected double getBREEDING_PROBABILITY() {return BREEDING_PROBABILITY;protected int getMAX_LITTER_SIZE() {return MAX_LITTER_SIZE;Animal.java X10 import java.util.List;3456789OHATOONMANORA4 public abstract class Animal5 {10111201314151617181902021222302425262728290303132330404142430444804950515253545556hneddoTRANSFEREHEERE5859606162636406566676869700570 protected Field getField()return field;71727374757677787980081828384858687private boolean alive;private Field field;private Location location;private int age;private static final Random rand = Randomizer.getRandom();public Animal(Field field, Location location){alive = true;this.field = field;set Location (location);age = 0;}88}protected int getAge() {return age;}protected void setAge(int newAge) {age = newAge;}abstract public void act(List newAnimals);protected boolean is Alive ()return alive;{}protected void setDead(){alive = false;if(location != null) {}{}protected Location getLocation()return location;}protected void setLocation (Location newLocation){if(location != null) {}}field.clear(location);location = null;field = null;}}field.clear(location);}location = newLocation;field.place(this, newLocation);abstract protected int getBreedingAge();protected boolean canBreed() {return getAge() >= getBreedingAge();abstract protected int getMaxAge();protected void incrementAge() {setAge(getAge()+1);if (getAge() > getMaxAge()) {set Dead ();}abstract protected double getBREEDING_PROBABILITY();abstract protected int getMAX_LITTER_SIZE();}protected int breed(){int births = 0;if (canBreed() && rand.nextDouble() <= getBREEDING_PROBABILITY())births = rand.nextInt (getMAX_LITTER_SIZE()) + 1;}return births;WritableFox.java XJ Tester.java{5678910AAAAAAAAAN~~~~~~~~281112130141516171819202122232425▲26027293031323334353637383946 4 42 45 4 45 46 47 48 49 50 51 52 584041434405105253545655565758596061626364HTCORNER526566676869700717273747576777879808108283840858687088899009192private static final int BREEDING_AGE = 15;private static final int MAX_AGE = 150;private static final double BREEDING_PROBABILITY = 0.08;private static final int MAX_LITTER_SIZE = 2;private static final int RABBIT_FOOD_VALUE = 9;private static final Random rand = Randomizer.getRandom();private int foodLevel;public Fox (boolean randomAge, Field field, Location location){super(field, location);if (randomAge) {setAge(rand.nextInt (MAX_AGE));foodLevel = rand.nextInt (RABBIT_FOOD_VALUE);}else {}}public void act(List newFoxes){setAge(0);foodLevel = RABBIT_FOOD_VALUE;incrementAge();incrementHunger();if(isAlive()) {giveBirth(newFoxes);Location newLocation = findFood ();if (newLocationnull) {newLocation = getField().freeAdjacent Location (get Location());}}if(newLocation != null) {}set Location (newLocation);}else {}}}private void incrementHunger (){foodLevel--<=if (foodLevelsetDead ();}}private Location findFood (){Field field = getField();List adjacent = field.adjacent Locations (getLocation());setDead ();Iterator it = adjacent.iterator();while(it.hasNext()) {Location where = it.next();Object animal = field.getObjectAt (where);if(animal instanceof Rabbit) {0) {}Rabbit rabbit = (Rabbit) animal;if(rabbit.isAlive()) {rabbit.setDead ();}}return null;}private void giveBirth (List newFoxes){foodLevel = RABBIT_FOOD_VALUE;return where;Field field =getField();List free = field.getFreeAdjacent Locations (getLocation());int births= breed();for(int b = 0; b < births && free.size() > 0; b++) {Location loc = free.remove(0);}}protected int get Breeding Age() {return BREEDING_AGE;Fox young = new Fox(false, field, loc);newFoxes.add(young);}protected int getMaxAge() {return MAX_AGE;Smart Insert}protected double getBREEDING_PROBABILITY() {return BREEDING_PROBABILITY;protected int getMAX_LITTER_SIZE() {return MAX_LITTER_SIZE;89: 6:2671amM HW07-1 Create an SD diagram that will show the interaction between Simulator, Field, and a single Foxand a single Rabbit, based on your observations of runtime behavior and an examination of the sourcecode for Foxes v-2. [Assume your single Fox instance can possibly eat your single Rabbit!] Diagramshould use at least one Opt block and at least one Alt block. [Could also consider nested blocks!].Note: There may be 3-5 actors with timelines in your SD: AFox, ARabbit, theSimulator, and maybe ???and ???. Try to show messages between the timelines. Example "setDead()-→"Include a WORD document that describes your analysis for this, as well as the pdf for your diagram.

Here's a sequence diagram showing the interaction between the Simulator, Field, a single Fox, and a…

HW07-1 Create an SD diagram that will show the interaction between Simulator, Field, and a single Fox and a single Rabbit, based on your observations of runtime behavior and an examination of the source code for Foxes v-2. [Assume your single Fox instance can possibly eat your single Rabbit!] Diagram should use at least one Opt block and at least one Alt block. [Could also consider nested blocks!].

HW07-1 Create an SD diagram that will show the interaction between Simulator, Field, and a single Fox and a single Rabbit, based on your observations of runtime behavior and an examination of the source code for Foxes v-2. [Assume your single Fox instance can possibly eat your single Rabbit!] Diagram should use at least one Opt block and at least one Alt block. [Could also consider nested blocks!].

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

For the Assignment 5 (Part 2), Routes v.2 at the end of this module you will create a Route class that has a member a "bag" of Leg objects. The bag is to use a vector of pointers, but since all the objects in the bag are to be Leg s, it's okay to use Leg* instead of void* in the bag's declaration. You wrote its first constructor in a previous exercise. Now write a second one. (You may refer to the Assignment page to refer to the completed class declarations of Leg and Route classes). Assume that class Leg has data member C strings const char* const beginCity; and const char* const endCity; that are available to Route by a friend relationship. Write a constructor function for a Route class that takes exactly two parameters: a constant Route object reference to an already-existing Route , and a constant Leg object reference to be appended to the end of that Route to form the new Route . Here's the algorithm: Copy the first parameter's bag into the host object's bag. If the endCity of…
Implement a simple heuristic for TSP with web interface and display (web). Should use classes and objects.
A. Suppose that q1 is a class CircularQueue object that is using circular queue concept and the maximum size of the array implementing q1 is 10. The current index value of front is 5 while the current index value of rear is 9. i. What are the index values of front and rear after adding TWO (2) elements into q1? Draw the circular queue diagram to show the addition process. ii. After implementing the process in Question 2A (i), what are the index values of front and rear after removing FIVE (5) elements from q1? Draw the circular queue diagram to show the removing process. iii. What are the current number of elements after implementing the process in Question 2A (i) and Question 2A (ii)? =======================
Use Matlab to solve this question. Please attach the desired execution snip for this code.
As stated before, transitions and triggers may be found in state diagramming. 3.1 Show the various trigger kinds.
Computer science. Correct answer will be upvoted else downvoted. Development of the exhibit in William's cell machine happens iteratively in the accompanying manner: In the event that the component is dead and it has precisely 1 alive neighbor in the present status of the exhibit, then, at that point, on the following emphasis it will become alive. For a component at list I the neighbors would be components with files i−1 and i+1. In case there is no component at that list, it is viewed as a dead neighbor. William is a sympathetic individual so all alive components stay alive. Check the note area for instances of the advancement. You are given some underlying condition, everything being equal, and you really wanted to help William discover the condition of the cluster after m emphasess of advancement. Input Each test contains various experiments. The principal line contains the number of experiments t (1≤t≤103). Depiction of the experiments follows. The primary…
Assume you need to store book data in a structured manner. Either more books should be added, or books that are already there should only be removed from one side of the shelf. Choose the best data structure for this case and describe it. Give a dynamic example of how books are added to a shelf. Additionally, what happens when there isn't enough room in a data structure for new data to be added?
Before using the spark ML library to train the machine learning model; we are required to assemble the features into one vector. If you are given a spark dataframe DF with numerical columns ['featurel','feature2', 'feature3', 'feature4', 'label'] Import all necessary libraries and write a spark code snippet to assemble features Vector for ['featurel','feature2', 'feature3', 'feature4']
A ring buffer, or circular queue, is a FIFO data structure of a fixed size N. It is useful for transferring data between asynchronous processes or for storing log files. When the buffer is empty, the consumer waits until data is deposited; when the buffer is full, the producer waits to deposit data. Develop an API for a RingBuffer and an implementation that uses an array representation (with circular wrap-around)
Considering the pseudo-code of the wait() and the signal() system calls with NO Busy waiting: a) Make your own UNIQUE and ORIGINAL simulation where 4 processes (Pi, P?, P?? and P???)1 want to enter the same critical section: at every row of the simulation show ALL interesting parameters, e.g. S.value, S.L, and make appropriate comments. The simulation must stores at least 8 rows. b) Assuming that, at time t, the process control block of Pi is in the queue of S.L: 1) Which is the current state of Pi? 2) Does Pi have a partition in Main Memory (MM)? Explain (no point without explanation).
Question for 2.7 Hi there, I'm having difficulty with this problem, specifically with part C. I'm unsure about the steps to take. Would it be possible for you to provide a visual representation or diagram to assist me with both parts? I would prefer a drawing of the pushdown automaton rather than explanations in text. I'm specifically seeking help with question 2.7 and would appreciate a visual representation of the pushdown automaton. Please ensure that the components are labeled so I can distinguish part C. My request is solely for assistance with question 2.7. However, addressing question 2.6 is necessary to tackle 2.7. Once again, my main focus is on question 2.7. Could you kindly provide a picture illustrating both parts of the pushdown automaton? 2.7 Give informal English descriptions of PDAs for the languages in Exercise 2.6. question 2.6 2.6 Give context-free grammars generating the following languages. c. {w#x | w R is a substring of x for w, x ∈ {0,1} ∗ }
a) Complete the program dependence graphs for the program shown above and 1. Add edges for data dependences in all graphs. 2. Combine the individual SDGs. In particular, you need to add call edges from the call sites tothe invoked method entry node, parameter-in edges from the actual parameters to the formalparameter nodes, and parameter-out edges from the return value ($ret) to the node where theresult is used or from the fields of objects that constitute a side-effect. 3. Add Summary Edges that summarize the effect of parameters on the result. Any summary edgesymbolizes a parameter that has a directed path from its parameter edge to the return value ofthe respective function invocation. b) Determine the 2-phase (context-sensitive) slice of the second call to println(o.get()). Which nodesare marked in the first phase, which in the second?