Answer Posted / abzy wabzy

import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
public class MainClass {
public static void main(String[] a) {
List list = new ArrayList();
list.add("A");
list.add("C");
list.add("B");
Collections.sort(list);//for Ascending order
System.out.println(list);
Collections.sort(list, Collections.reverseOrder
());//for descending order
System.out.println(list);
}
}

What is void in java?

1013

---

Which java collection does not allow null?

1090

---

what are abstract functions?

974

---

Difference between arraylist and vector.

1055

---

How to create com object in Java?

1009

---

what do you mean by stream pipelining in java 8? Explain

972

---

What is ctrl m character?

988

---

What are the advantages of passing this into a method instead of the current class object itself?

1616

---

What is meant by class loader? How many types are there? When will we use them?

912

---

When does a class need a virtual destructor?

949

---

What is files manifesting?

2144

---

What is static import?

1094

---

what is the final keyword denotes in java?

1020

---

placement papaers of spring computing technology

1360

---

For ease of programming you can consider the maze as a 2D array with colors represented by below integer and characters (in capital letters). • B - Black • W -White • G- Green • R- Red R B W B W W W W W W B W B B W W W W W W W B W B W W W B W W W W B B W W W B W W W B W W B B B B W B W B W W B W W W B W W W B B B W W B W W W B W W B W B W W W B W B W W W W B B W W W W B W W W W W G Shortest Route Problem: • Solution that finds the shortest Route between Red and Green  White will have 1 Weight.  Red and Green carry no weights.  Shortest path is the path with less weight when you add up the weights in the path.

1972

---