Answer:
The code for this class is shown in the explanation section
Explanation:
public class Circle {
private double radius;
private double diameter;
private double area;
public Circle(double radius, double diameter, double area) {
this.radius = 1;
this.diameter = diameter;
this.area = area;
}
public void setRadius(double radius) {
this.radius = radius;
diameter = radius*2;
area= Math.PI*(radius*radius);
}
public double getRadius() {
return radius;
}
}
well not a note but here are some few points
Explanation:
1 Computers can have the huge impact on employment of people like job and other stuff.
2 lots of human can be jobless or unemployed
3 it can cuz impact on the health of peoples
4 it also can make us lazy and and lack of self knowledge
Answer:
C
Explanation:
<link rel="stylesheet" type="text/css" href="syb/syb.css" title="stylesheet"/>
The above code is self explanatory. All others have wrong rel or title. Title is always stylesheet, and rel as well stylesheet as well as href is external css file which we are loading, and text/css is always the type as it is the css. None of the other has this syntax. And hence this is the right answer.
Answer:
Question is incomplete.
Assuming the below info to complete the question
You have a collection of n lockboxes and m gold keys. Each key unlocks at most one box. Without a matching key, the only way to open a box is to smash it with a hammer. Your baby brother has locked all your keys inside the boxes! Luckily, you know which keys (if any) are inside each box.
Detailed answer is written in explanation field.
Explanation:
We have to find the reachability using the directed graph G = (V, E)
In this V are boxes are considered to be non empty and it may contain key.
Edges E will have keys .
G will have directed edge b1b2 if in-case box b1 will have key to box b2 and box b1 contains one key in it.
Suppose if a key opens empty box or doesn’t contain useful key means can’t open anything , then it doesn’t belongs to any edge.
Now, If baby brother has chosen box B, then we have to estimate for other boxes reachability from B in Graph G.
If and only if all other boxes have directed path from box B then just by smashing box B we can get the key to box b1 till last box and we can unlock those.
After first search from B we can start marking all other vertex of graph G.
So algorithm will be O ( V +E ) = O (n+m) time.
To present something infront of a crowd
