Answer:
import java.awt.Point;
public class Line{
private Point point1, point2;
public Line(Point p1, Point p2){
point1 = p1;
point2 = p2;
}
public Point getP1(){
return point1;
}
public Point getP2(){
return point2;
}
public String toString(){
return "[( The " + point1.x + "," + point1.y + "), (" + point2.x + "," + point2.y +")]";
}
public static void main(String args[]){
Line lineObj = new Line(new Point(7,9), new Point(6,2));
System.out.println(lineObj.toString());
}
}
Explanation:
- Declare the points inside the class Line.
- Initialize the getters and setters method for the class.
- Define a toString method that returns the information in a formatted manner.
- Inside the main method, initialize an object with some values.
- Display the information by calling the toString method.
Answer:
1 35
Explanation:
* There is a little typo in printf. It should be "\n".
Initially, the value of the first is 1, and the value of the second is 2. Then, do_something(&second, first) is called. The value of the <em>first</em> will still be 1. However, there is a call by reference for <em>second </em>variable. That means the change made by the function <em>do_something</em> will affect the value of the <em>second</em> variable.
When you look at the calculation inside the <em>do_something</em> function, you may see that value of the <em>second</em> will be 35.
Answer:
The answer is "a1 and a2 is an array of pointers".
Explanation:
In this question, A collection of pointers refers to an array of elements where each pointer array element points to a data array element. In the above-given statement, the two-pointer type array "a1 and a2" is declared that holds the same size "8" elements in the array, and each element points towards the array's first element of the array, therefore, both a1 and a2 are pointer arrays.
Answer:
The answer to this question is given below in the explanation section.
Explanation:
The selection sort algorithm step started from 0, and continue till the sorting is done.
The correct answer after selection sort algorithm at the 4th step is:D
[0,1,2,4,8,10].
The complete detail of step by step execution is shown in the attached document file.
