Kale was discoverd just 2 years ago ........
Answer:
Let L and R be the sub-trees underneath the root r.
If the height of L (where we consider height to be the maximum length of all root-leaf paths) is ∆ more than that of R, ∆ ≥ 0, then the length of the edge (r, R) is increased by ∆.
Then, we separately perform the same cycle over L and R.
Once more, by induction, argue that this greedy algorithm is efficient –
when it does not increase the length of (r, R) edge by ∆, then prove that the solution can be improved.
Answer:
numX = 3
Explanation:
First, let's analyze what the code is showing:
If both conditions in the if-statement are true, then numX = 3. If one or both conditions are false, then numX = 7 ('and' means that both conditions have to be true for the if-statement to become true).
- this statement is true.
!= 
- this statement is also true (!= means 'not equal').
Since both conditional statements are true, then numX must equal .
Hope this helps :)
Answer:
The output of the following code is "14".
Explanation:
In the python program firstly we define a function that is pass_it() function. In this function, we pass the two variable that is x,y. Then we define two variable z and result in the function. The z variable is used to store the multiplication value of the x,y. In the result variable, we use another function that is get_result() function in this function we pass the value of the z variable as a parameter. This function adds a value that is 2 and returns its value. Then we declare a variable that is num1 and num2. In this variable, we assign value that is 3 and 4 and return value of the pass_it() function in the answer variable and print it.
Answer: 50
Explanation: let amit's current age = a and armaan's current age be b.
(a-5) = 3* (b-5)
i.e. a= 3b-10 -(i)
10 years later,
(a+10) = 2(b+10)
i.e. a=2b+10 -(ii)
From eqn (i) and (ii),
b=20,
and a=50
