logo

Crowdly

Browser

Додати до Chrome

Questions Bank (1270364 total)

___ is the maximum amount of time an algorithm takes to execute a specific set of inputs.
Переглянути це питання
If for a problem an optimal solution can be created by constructing optimal solutions for its subproblems, the problem possesses ____________ .
Переглянути це питання
In flow networks Residual capacity Cf(u,v) is given by
0%
0%
0%
0%
Переглянути це питання
Which of the following is a primary advantage of the Knuth-Morris-Pratt (KMP) algorithm over the naive string matching algorithm?
0%
0%
0%
0%
Переглянути це питання
In what manner is a state-space tree for a backtracking algorithm constructed?
0%
0%
0%
0%
Переглянути це питання
The type of encoding where no character code is the prefix of another character code is called?
0%
0%
0%
0%
Переглянути це питання
Time complexity of LCS
Переглянути це питання
We use ___ for finding solutions to sub-problems, so as to reduce recalculation.
0%
0%
0%
0%
Переглянути це питання
Solve the recurrence relation: T(n)= T(n/2)+O(1)
Переглянути це питання
Which of the following statements about loop invariants is false?
0%
0%
0%
0%
Переглянути це питання