Which of the alternatives below is seen as a disadvantage of using the distance as a criterion for linearity between genetic structures?
a) The distance takes into account recombination and only certain types of mutations, such as insertions and deletions
b) The distance takes account only the changes, leaving aside recombinations
c) The distance takes account insertions but ignores deletions
d) The distance is not always strictly additive
e. None of the above
Original idea by: Priscila Nascimento Biller
quinta-feira, 26 de março de 2015
sexta-feira, 13 de março de 2015
Given two algorithms A and B to solve a problem. Given a input of size N ∈
.
The algorithm A takes time f(N)=N².
The algorithm B takes g(N)=aN, where a is a constant, for any size of N.
We can conclude that:
a) The A algorithm will always be faster than B because A is quadratic, regardless the size of N.
b) The B algorithm will always be faster than A because B is linear, regardless the size of N.
c) When the size of N is smaller than a, the quadratic algorithm will be faster.
d) When the size of N is larger than a, the quadratic algorithm will be faster.
e) NOTA
Original idea by Rodrigo Ritter.

The algorithm A takes time f(N)=N².
The algorithm B takes g(N)=aN, where a is a constant, for any size of N.
We can conclude that:
a) The A algorithm will always be faster than B because A is quadratic, regardless the size of N.
b) The B algorithm will always be faster than A because B is linear, regardless the size of N.
c) When the size of N is smaller than a, the quadratic algorithm will be faster.
d) When the size of N is larger than a, the quadratic algorithm will be faster.
e) NOTA
Original idea by Rodrigo Ritter.
Assinar:
Postagens (Atom)