Crowdly
Додати до Chrome
Questions Bank (1238270 total)
In flow networks Residual capacity Cf(u,v) is given by
f(u, v) – c(u,v)
0%
s(u,v) – t(u,v)
0%
c(u,v) – f(u,v)
0%
t(u,v) – s(u,v)
0%
Переглянути це питання
We use ___ for finding solutions to sub-problems, so as to reduce recalculation.
Recursion
0%
Backtracking
0%
Branch and bound algorithms
0%
Memoization
0%
Переглянути це питання
The type of encoding where no character code is the prefix of another character code is called?
trie encoding
0%
prefix encoding
0%
frequency encoding
0%
optimal encoding
0%
Переглянути це питання
Which algorithm startegy builds up a solution by choosing the option that looks the best at every step.
branch and bound
❌
dynamic programming
❌
greedy method
✅
divide and conquer
❌
Переглянути це питання
What is the time complexity of Floyd-Warshall Algorithm for finding shortest paths between all pairs of vertices?
O(V^2)
❌
O(V log V)
❌
O(VE)
❌
O(V^3)
✅
Переглянути це питання
A graph is said to have a negative weight cycle when?
The graph has 1 or more negative weighted edges
❌
The graph has a cycle
❌
The graph has 1 negative weighted edge
❌
The total weight of the graph is negative
✅
Переглянути це питання
If a problem can be solved by combining optimal solutions to non-overlapping problems that doesnot depend on each other, the strategy is called _____________
Divide and conquer
✅
Dynamic programming
❌
Recursion
❌
Greedy
❌
Переглянути це питання
In the KMP algorithm, the "prefix match" table is used to:
Avoid re-examining characters that have already been matched.
✅
Skip comparisons after each mismatch.
❌
Skip unnecessary text character checks.
❌
Determine the starting index of the match
❌
Переглянути це питання
Solve the recurrence relation: T(n)= T(n/2)+O(1)
O(n)
❌
O(1)
❌
O(log n)
✅
O(n log n)
❌
Переглянути це питання
Time complexity of matrix chain multiplication
O(n^3)
✅
O(n)
❌
O(nlogn)
❌
O(n^2)
❌
Переглянути це питання
Попередня
1
Більше сторінок
112316
112317
112318
112319
112320
Більше сторінок
123827
Наступна
Telegram
Instagram
TikTok
Question Bank
Умови використання
Зв'яжіться з нами
Додати до Chrome