Answer:
// here is code in java.
import java.util.*;
class Solution
{
// main method of class
public static void main (String[] args) throws java.lang.Exception
{
try{
// declare variable
double caffeine;
// scanner object to read input from user
Scanner scr=new Scanner(System.in);
System.out.print("Enter the initial amount of caffeine:");
// read the initial amount of caffeine
caffeine=scr.nextDouble();
// calculate amount of caffeine after 6,12,18 hours
for(int i=1;i<=3;i++)
{
System.out.println("After "+ i*6+" hours:"+(caffeine/2)+" mg");
// update the caffeine after every 6 hours
caffeine=caffeine/2;
}
}catch(Exception ex){
return;}
}
}
Explanation:
Create a variable "caffeine" to store the initial amount of caffeine given by user. Run a loop for three time, it will calculate the amount of caffeine left after every 6 hours.First it will give the amount of caffeine left after 6 hours, then caffeine left after 12 hours and in last caffeine after 18 hours.
Output:
Enter the initial amount of caffeine:100
After6 hours:50.0 mg
After12 hours:25.0 mg
After18 hours:12.5 mg
Answer:
True
Explanation:
The reality is, wet signatures can easily be forged and tampered with, while electronic signatures have many layers of security and authentication built into them, along with court-admissible proof of transaction.
Answer:
In ADT graph the efficiency of addVertex has efficiency O(logn).
Explanation:
The time complexity of the method addvertex in ADT graph is O(logn). addVertex method has time complexity of O(logn) because it has to divide the list in half and add the vertex according to the place where the needs to be added.
hence we conclude that the answer is O(logn).
