Answer:
scope
Explanation:
Destructor is a member function and it call automatically when the class object goes out of scope.
Out of scope means, the program exit, function end etc.
Destructor name must be same as class name and it has no return type.
syntax:
~class_name() { };
For example:
class xyz{
xyz(){
print(constructor);
}
~xyz(){
print(destructor);
}
}
int main(){
xyz num;
}//end program
when the object is create the constructor will called and when the program end destructor will call automatically.
Answer:
- import java.util.Arrays;
- public class Main {
-
- public static void main(String[] args) {
- String [] first = {"David", "Mike", "Katie", "Lucy"};
- String [] middle = {"A", "B", "C", "D"};
- String [] names = makeNames(first, middle);
-
- System.out.println(Arrays.toString(names));
- }
-
- public static String [] makeNames(String [] array1, String [] array2){
-
- if(array1.length == 0){
- return array1;
- }
-
- if(array2.length == 0){
- return array2;
- }
-
- String [] newNames = new String[array1.length];
-
- for(int i=0; i < array1.length; i++){
- newNames[i] = array1[i] + " " + array2[i];
- }
-
- return newNames;
- }
- }
Explanation:
The solution code is written in Java.
Firstly, create the makeNames method by following the method signature as required by the question (Line 12). Check if any one the input string array is with size 0, return the another string array (Line 14 - 20). Else, create a string array, newNames (Line 22). Use a for loop to repeatedly concatenate the string from array1 with a single space " " and followed with the string from array2 and set it as item of the newNames array (Line 24-26). Lastly, return the newNames array (Line 28).
In the main program create two string array, first and middle, and pass the two arrays to the makeNames methods as arguments (Line 5-6). The returned array is assigned to names array (Line 7). Display the names array to terminal (Line 9) and we shall get the sample output: [David A, Mike B, Katie C, Lucy D]
Answer:
By Using the Greedy- Activity- Selection algorithm
Explanation:
The Greedy- Activity- Selection algorithm in this case involves
First finding a maximum size set S1, of compatible activities from S for the first lecture hall.
Then using it again to find a maximum size set S2 of compatible activities from S - S1 for the second hall.
This is repeated till all the activities are assigned.
It requires θ(n2) time in its worse .
Assuming Victoria is using Adobe
Photoshop to create her brochure, below are the steps she is required to
follow.
She should first open the image on
Photoshop, click on the image option and select duplicate just in case the
resized image is not what she wants.
Still on the image option, she
should select Image size. A screen will pop up at this point, indicating the
image’s current size. For the purposes of image resizing, Victoria should
select Pixel dimensions category.
She should be able to type her preferred
dimensions for both the width and height. She should make sure ‘Constrain
Proportions’ is unchecked to be able to type in separate values.
If she decides to use the photo editing
program, she can simply click on the image, and if resize handles appear around
it, she can click and drag those to the desired size.
Answer:
Gradient fill
Explanation:
A gradient fill is a visual effect that makes a three dimensional color look by mixing one color shade gradually progressing to another shade of the same color or one color progressing to another color. for example a dark red progressively changing to light red or red progressively changing to blue.
