Answer: A) Modular decomposition
Explanation: Modular decomposition is the composition of a graphs into small modules. These modules are the subset of the whole graphs and thus the part of the graph. These modules are these very design efficient and so they are not capable of handling the exceptions .They have precise representation which has modules which cannot seem to have exception because that will disturb the structure of the graph .
Answer: I think the answer is A
Explanation:
If i'm wrong i'm sorry
Transfer rate.
/////////////////////
Answer:
In Python:
def fib(nterms):
n1, n2 = 1, 1
count = 0
while count < nterms:
term = n1
nth = n1 + n2
n1 = n2
n2 = nth
count += 1
return term
Explanation:
This line defines the function
def fib(nterms):
This line initializes the first and second terms to 1
n1, n2 = 1, 1
This line initializes the Fibonacci count to 0
count = 0
The following while loops gets the number at the position of nterms
<em> while count < nterms:
</em>
<em> term = n1
</em>
<em> nth = n1 + n2
</em>
<em> n1 = n2
</em>
<em> n2 = nth
</em>
<em> count += 1
</em>
This returns the Fibonnaci term
return term
