Answer Posted / rakesh kumar jha

YES, Finalization is a feature of the Java programming
language that allows you to perform postmortem cleanup on
objects that the garbage collector has found to be
unreachable. It is typically used to reclaim native
resources associated with an object.
When the garbage collector determines that obj is
unreachable, it notices that obj is finalizable -- as it
had been recorded upon allocation -- and adds it to the
JVM's finalization queue. It also ensures that all objects
reachable from obj are retained, even if they are otherwise
unreachable, as they might be accessed by the finalizer.

So, we can say that it can be reachable.

Are generics important java?

917

---

What is increment in java?

918

---

What is set string?

1077

---

What is meant by call by reference?

946

---

What is parseint?

949

---

Can a class have an interface?

917

---

Give me example of derived data types.

1085

---

What does @override mean?

1101

---

How will you print number in reverse (descending) order in BST.

942

---

There are two classes named classa and classb. Both classes are in the same package. Can a private member of classa can be accessed by an object of classb?

1424

---

What is proper subset?

916

---

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.

1970

---

What is a flag and how does it work?

936

---

Does every java program need a main?

937

---

Is nan false?

915

---