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).
No Answer is Posted For this Question
Be the First to Post Answer
What is floating data type?
what modifiers are used with top-level class?
Why can't we use static class instead of singleton?
If I only change the return type, does the method become overloaded?
for(i=0;i<100;i++) { int i=method();//method returns no's from 1 to 10; /* insert some stmts which can give output like no.of times numbers(1-10) returned. (for example if it returns 2 then i want output how many times 2 returned) like that i want output for no's 1 - 10 how many times each no returned. */ }
Do you know thread pools?
Is sizeof a keyword in java programming?
what are the rules to use try catch finally?
Write a program to print the pattern given below
Explain yield() method in thread class ?
How do you declare a destructor in java?
Is it possible to compare various strings with the help of == operator? What are the risks involved?