Answer:
Following are the statement is given below
if(updateDirection ==1) // check condition
{
++numUsers; // increments the value
}
else
{
--numUsers; // decrement the value
}
Explanation:
Following are the description of statement
- Check the condition in the if block .If the "updateDirection" variable is 1 then then control moves to the if block otherwise control moves to the else block statement.
- In the if block the statement is "++numUsers" it means it increment the value by 1 .
- In the else block the statement is "--numUsers" it means it decrement the value by 1 .
Answer:
Stack.
Explanation:
Topological sort requires a bit of addition to DFS algorithm.So DFS can be done by two ways that are either you can use recursion or you can use Stack data structure to implement DFS.
Since recursion uses stack memory when it makes recursive calls and if you want to do it iteratively you can stack data structure.
Answer:
The definition of function is as follows:
def typing_speed(number_of_words,Time_Interval):
number_of_words>=0
Time_Interval>0
speed=float(60*number_of_words/Time_Interval)
return speed
Explanation:
Above function is defined step-by-step as follows:
def typing_speed(number_of_words,Time_Interval):
- A function named typing speed has two arguments, num_of_words and Time_Interval.
number_of_words>=0
Time_Interval>0
- The variable number_of_words is the number of words entered that a person enters, they must be greater than or equal to 0. Where as Time_Interval is the variable for counting the time span in seconds, it must be greater than 0.
speed=float(60*number_of_words/Time_Interval)
return speed
- For determining result firstly the seconds are converted int minutes by multiplying with 60 and number_of_words is divided with Time_Interval in order to get words per minute. The return value will give speed which has data type float.
