If you mean "splitting" a single drive into several partitions, you are talking about a term called Partitioning.
Recurrence relations can be resolved using the Recursion Tree Method. Recursive trees are created using this method from a recurrence relation.
Each node reflects the expense incurred at different recursive levels. The overall cost is calculated by adding the costs from each level.
20 nodes at level 0 are equal to one.
21 + 2 Equals number of nodes at level 1.
Number of nodes at level 2log10/9(n), which is equal to nlog10/9 (2)
nlog10/9(2) x T(1) = nlog10/9(2) x 1 = nlog10/9 Cost of subproblems at level log2(n) (last level) (2)
Step 4: Add up all of the levels' costs in the recursive tree.
T(n) = n times (number of levels - 1) plus the cost of the last level.
= log10/9(n) times + (nlog10/9(2)) = n + n + n + —-
= (nlog10/9(2)) + nlog10/9(n)
Learn more about recursive here-
brainly.com/question/20749341
#SPJ4
Answer:
if-then-else
switch (expr) { case value: statements ;}
Explanation:
Required
Which do not represent loop
Literally, looping means repeating an action or sequence of actions as long as a given condition is true.
For options (a) to (d), we have:
(a): if-then-else:
if statements are used to test conditions; depending on the truth or falsity of the condition, only one block of code can be executed at once.
<em>In summary, if statements are not loops</em>
(b): switch statements
This is an alternate to if statements and can be used in place of if statements.
<em>Hence, switch statements are not loops</em>
(c) and (d): for and while:
The above represent loops, because they both involve repetition of operations until the condition is no longer satisfied.
