You are playing a video game under the following idealized conditions. the computer memory is unbounded and you have no time limit for finishing the game. the game board is the set of points in the plane with integer coordinates and time moves in discrete integer steps. there is a hidden submarine: you do not not know its location, you do not know its speed and you do not know its direction of motion. the speed and direction of motion do not change throughout the game. the speed is a natural number and the direction of motion is either up, down, left or right. for example, the submarine could start at (1,3) have speed 6 and move right. then at step 0 it is at (1, 3), at step 1 it is at (7, 3), at step 2 it is at (13, 3) and so on. at every step you get to zap a point: you enter the coordinates and if the submarine is at that point, at that time step, you will destroy it. of course, there is no point zapping a position before it gets there or after it leaves. give a strategy or scheme that is guaranteed to get the submarine at some nite stage. important : you do not know where it started, you do not not know its direction and you do not know its speed; you only know that the speed and direction do not change.

Consider a slotted aloha system, where the time slot equals the fixed duration of each packet. assume that there are 4 stations a, b,c, d sharing the medium. (a) stations a, b,c, d receive one packet each from higher layers at times 1.3, 1.5, 2.6,5.7 respectively. show which transmissions take place when, according to the slottedaloha protocol; describe all transmissions until all four packets have been successful. when needed, each station has access to the following sequence of random number, provided by a random number generator and drawn uniformly between 0 and 1: (1) station a draws numbers: 0.31, 0.27, 0.78, 0.9, 0.9, 0.11, 0. (2) station b draws numbers: 0.45, 0.28, 0.11, 0.83, 0.37, 0.22, 0. (3)station c draws numbers: 0.1, 0.2, 0.3, 0.4, 0. (4) station d draws numbers: 0.36, 0.77, 0.9, 0.1, 0.1, 0.1, 0.1, 0. (b) in slotted aloha, a station transmits in each time slot with a given probability. what probabilities would you assign to each of the four stations so as to: (i) maximize the efficiency of the protocol? (ii) maximize fairness among the four stations? (c) will the efficiency increase or decrease if we modify slotted aloha as follows: (i) get rid of slots and allow stations to transmit immediately? (ii) implement carrier sensing? (iii) implement collision detection? (iv) implement collision avoidance?

If your accelerator suddenly gets stuck what should you do

If you want to import a picture into a dtp application, what must you do first? draw an image frame. import text. open the folder containing the file. select get image… from the windows menu.