Answer:
public class array{
public static void main(String []args){
int[] array = {2,4,7,1,9};
int num_vals = array.length;
for(int i=0;i<num_vals;i++){
System.out.println(array[i] + " ");
}
for(int i=num_vals-1;i>=0;i--){
System.out.println(array[i] + " ");
}
}
}
Explanation:
First create the class in the java programming.
Then create the main function and declare the array with values.
Store the size of array in num_vals variable by using the function array.length.
create a for loop to iterate the each element in the array and then print on the screen with spaces and newline.
it traverse the loop from first to last.
Then, again create the for loop to iterate the each element in the array and then print on the screen with spaces and newline but the traversing start from last to first.
Answer:
Time taken to travel from one track to the next = 0.08ms
Initial track= 15 0
4 (15-4)*(0.08)= 0.88
40 (40-4)*(0.08)= 2.88
35 (40-35)*(0.08)= 0.4
11 (35-11)*(0.08)= 1.92
14 (14-11)*(0.08)= 0.24
7 (14-7)*(0.08)= 0.56
----------------------------------------------
Total seek time=0.88+2.88+0.4+1.92+0.24+0.56=6.88ms
Explanation:
We caculate the seek time for each request, and then add them together to find the total seek time. The final track number for the current request becomes the current track of next request, and this process is repeated till the last request is processed.
Which generation is called the new silent generation?
A. Generation X
<u>B. the homelander generation </u>
C. the millennial generation
D. the boom generation
Answer:
class Foo:
def F(self, n):
if n == 1:
return 1
return self.F(n - 1) + 3 * n - 2
Explanation:
This should cover part a to this question. The thing I'm not sure on is they use the term "method" which in python technically means a class function...but then list one argument with the function call which makes me think it is possibly just supposed to be a regular function. Which would be the following snippet. It would depend on if you are using classes or not yet in your coding class.
def F(n):
if n == 1:
return 1
return F(n - 1) + 3 * n - 2
Play around with it and look into python "lists" and "for loops" for part c. Part b I'm not sure what kind of example they want since I'm not in that class. Good luck!
