Answer:
Shows the programming checking if num1 is greater than num2
Explanation:
So num1 and num2 are inputs
for you to code this you would need to put
num1=int(input("What is your first number? ))
and the same for num2 except change num1 for num 2 and first for second
When the input is completed, the computer will check if num 1 is greater than num2
it will do this by using a code something like:
if num1>num2:
Print("Your first input was greater than your second")
But in this example if it greater it just ends
But if it was less than you would put
if num1>num2:
Print("Your first input was greater than your second")
elif num1<num2:
Print("Your first input is less than your second")
So basically this code shows the computer checking if one number is greater than the other or not
Answer:
None of the mentioned options
Explanation:
- If we define a method in a derived class with same declaration type as that of base class then it is said to be overriding a function which behaves differently which will depend on the object which is calling the method.
- Option a,b and c are not any kind of methods we implement using coding.
- Option d is done when number or data types of parameters are different than the declaration of the base type.
<span>but of culture, values and traditions. Cultura</span>
Answer:
Check the explanation
Explanation:
We can utilize the above algorithm with a little in modification. If in each of the iteration, we discover a node with no inward edges, then we we’re expected succeed in creating a topological ordering.
If in a number of iteration, it becomes apparent that each of the node has a minimum of one inward edge, then there must be a presence of cycle in the graph.
So our algorithm in finding the cycle is this: continually follow an edge into the node we’re presently at (which is by choosing the first one on the adjacency list of inward edges to decrease the running time).
Since the entire node has an inward edge, we can do this continually or constantly until we revisit a node v for the first time.
The set of nodes that we will come across among these two successive visits is a cycle (which is traversed in the reverse direction).
