|
info@meritcampus.com +91-85006-22255
|
|
class ArrayExample
{
public static void main(String s[])
{
int[] a = new int[4];
int total = a[1] + a[2] + a[3]; // LINE A
System.out.println("Total = " + total);
}
}| A. |
|
| B. |
|
| C. |
|
| D. | No exception will be thrown |
| Input (List) | Output (Triangle) |
|---|---|
{[71,1], [0,70], [12,5], [72,9], [0,55], [13,2], [0,0], [11,2]} |
{[0,70] - [72,9] - [0,0]} |
{[-225, 100], [-175, 0], [0, 50], [300, 0], [30, 45], [20, 20], [-50, 25], [-75, 125]} |
{[-175,0] - [20,20] - [-75,125]} |
{[0, 0], [10, 0], [5, 8], [50, 0], [25, 43], [2, 3], [4, 4]} |
{[0,0] - [50,0] - [25,43]} |
{[2, 3], [4, 3], [6, 6], [3, 18], [2, 14], [5, 0], [-1, -3], [-8, 4], [-4, 2]} |
{[3,18] - [5,0] - [-8,4]} |
{[0, -63], [63, -63], [99, -18], [-9, 63], [-27, 45], [-72, 27], [63, -117], [-63, -117]} |
{[99,-18] - [-72,27] - [-63,-117]} |
{[0, 10], [25, 18], [32, 45], [28, 66], [29, 33], [11, 18]} |
null |
class FindLargestAcuteTriangle
{ public static void main(String s[])
{
List points = new ArrayList();
points.add(new Point(71, 1));
points.add(new Point(0, 70));
points.add(new Point(12, 5));
points.add(new Point(72, 9));
points.add(new Point(0, 55));
points.add(new Point(13, 2));
points.add(new Point(0, 0));
points.add(new Point(11, 2));
System.out.println("Largest Acute Triangle is : " + getLargestAcuteTriangle(points));
}
public static Triangle getLargestAcuteTriangle(List<Point> points) {
//Write code here to get the largest acute triangle.
}
}
class Point {
int x;
int y;
Point(int x, int y) {
this.x = x;
this.y = y;
}
@Override
public String toString() {
return "[" + x + "," + y + "]";
}
}
class Triangle {
Point p1;
Point p2;
Point p3;
public Triangle(Point p1, Point p2, Point p3) {
this.p1 = p1;
this.p2 = p2;
this.p3 = p3;
}
@Override
public String toString() {
return "{" + p1 + " - " + p2 + " - " + p3 + "}";
}
//If required write any additional methods here
//Implement the equals method here such that the triangles are considered equal when all the points are equal
}