Write an algorithm program in java for the following question..
In a VLSI design techniques,they used rectangles to design circuits.
EVery rectangle is to be placed according to x,y coordinates.
Check whether or not two rectangles overlap each other.
Here overlapping of rectangles is acceptable, if
1) one rectangle intersect with other.
2) one rectangle fully covers other.
The time of algorithm should not exceed o(n logn).
In multi-threading how can we ensure that a resource isn't used by multiple threads simultaneously?
Is array synchronized in java?
How you can force the garbage collection?
Is string a data type in java?
How do listeners work?
How use .contains in java?
How do you add an element to a hashset in java?
what are the design patterns in struts?
What does void * mean?
What is core java called?
Write a factorial program using recursion in java?
Why should I use abstract class?