Answer:
D)
Explanation:
At first the two members just want to create the presentation but work together and agree to share the research and work together on creating the presentation.
The conflict resolution is more than agree upon problem, identify issue or brainstorm solutions. The answer is D) negotiate a solution.
Answer:
// here is code in java.
import java.util.*;
// class definition
class Solution
{
// main method of the class
public static void main (String[] args) throws java.lang.Exception
{
try{
// scanner object to read innput
Scanner s=new Scanner(System.in);
// variables
long min,years,days;
long temp;
System.out.print("Please enter minutes:");
// read minutes
min=s.nextLong();
// make a copy
temp=min;
// calculate days
days=min/1440;
// calculate years
years=days/365;
// calculate remaining days after years
days=days%365;
// print output
System.out.println(temp+" minutes is equal to "+years+" years and "+days+" days");
}catch(Exception ex){
return;}
}
}
Explanation:
Read the number of minutes from user and assign it to variable "minutes" of long long int type.Make a copy of input minutes.Then calculate total days by dividing the input minutes with 1440, because there is 1440 minutes in a day.Then find the year by dividing days with 365.Then find the remaining days and print the output.
Output:
please enter the minutes:1000000000
1000000000 minutes is equal to 1902 years and 214 days.
Answer:
a. engranaje 1 → engranaje 2 → engranaje 3 → engranaje 4
z1 = 10 z2 = 20 z3 =10 z4 = 20
b. n2 = 600 rpm, n3 = 1200 rpm, n4 = 600 rpm
la relacion de transmision = 2
Explanation:
where z1 = 10, z2 = 20, z3 = 10, z4 = 20
and n1 = 1200 rpm
n2 = n1 * z1/z2 = (1200 * 10)/ 20 = 600 rpm
n3 = n2 * z2/z3 = (600 * 20)/ 10 = 1200 rpm
n4 = n3 * z3/z4 = (1200 * 10)/ 20 = 600 rpm
la relacion de transmision = z2/z1 * z3/z2 * z4/z3
= 20/10 * 10/20 * 20/10 = 2 * 0.5 * 2 = 2
Answer:
Explanation:
( n cards are there initially )
we pick out the first card in random it takes n-1 comparisons to figure out
its Equivalence card - n-1 steps
Two cards have been eliminated ( this leaves us with 2 and n-2 cards)
we pick out the 2nd card in random it takes n-3 comparisons to figure out
its Equivalence card - n-3 steps
we continue to do this.. till all cards are exhausted ( leaves us with 2
and n-4 cards again)
the last comparison will
have
- n-(n-3)
the sum of all these steps - (n-1) + (n-3) + (n-5) + .........+
(n-(n-3))
if you draw this in the form of a tree.
n - n
2
n-2 - n
2
n-4 - n-2
2
n-6 - n-4
2
n-8 - n- 6
the height of the tree will be log n , sum @ each level is at most n
