Answer:
Option a, b, d, f, and j is legal method calls.
Explanation:
In the given question some information is missing, that is the method definition which can be described as follows:
Method definition:
int x =2, y=3; //defining integer variable
int mathMethod (int x) //method definition
{//method body
int z=x+y; //calculate value
return z; //return value
}
In the given question option a, b, d, f, and j is legal, because these options follow the correct syntax, and other option were incorrect which can be defined as follows:
- In option c, It is illegal because it accepts only one parameter.
- In option e, It is accepts long number, that's why it is illegal.
- In option g, It accepts float value, that's why it is illegal.
- In option h, It doesn't accepts any parameter.
- In option i, It isn't use in method.
Answer:
Explanation:
Algorithm:
a. In each day, you will have to loop through the hotels that come to the hotel after you stayed last night.
b. If a hotel 'h' is found at more than 'd' distance away from last stayed hotel, then the hotel previous of 'h' is chosen to wait for that night. This is the greedy step, and you stay in this hotel.
c. The process for steps a and b is then repeated until we've reached the last hotel xn.
Running time:
Notice that the worst case occurs if each hotel is at a distance of successive multiples of 'd'. The best move is to estimate the distance to each hotel twice the whole computation in the scenario.
Thus, the total running time that could occur in the worst case is O(2n) = O(n). This is said to be linear time.
The answer to this question is b that's the answer
According to the given question, sales is a two-dimensional array and contains 10 rows and 7 columns wherein each component is of type integer and the variables sum and j are also of integer type.
<u>Explanation:</u>
In order to find the sum of the elements of the fifth row of sales, the correct piece of code should be:
sum=0;
for(j=0;j<7;j++)
sum=sum+sales[4][j];
The indexing in an array always starts from zero, therefore, to calculate the sum of the fifth row, the user has to write 4 in the index to point to the fifth row.
It is known as the PACING Calendar.