Register

UGC NET CSE | September 2013 | Part 3 | Question: 39

• recategorized by
1,374 views

1 Answer

0 votes
0 votes
possible parenthesized of a sequence of n matrices is  

Ω($2^{n}$)
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2.5k
views
2 answers
3 votes
makhdoom ghaya asked Oct 1, 2016
2,466 views
UGC NET CSE | August 2016 | Part 3 | Question: 31
Consider the problem of a chain <$A_{1} , A_{2} , A_{3},A_{4}$> of four matrices. Suppose that the dimensions of the matrices $A_{1} , A_{2} , A_{3}$ and ... $ is ____.$14875$21000$9375$11875$
User Avatar
7.2k
views
2 answers
1 votes
go_editor asked Jul 24, 2016
7,241 views
UGC NET CSE | September 2013 | Part 3 | Question: 42
Given 0-1 knapsack problem and fractional knapsack problem and the following statements:$S_1$: 0-1 knapsack is efficiently solved using Greedy algorithm.$S_2$: Fractional ... $S_2$ are not correct$S_1$ is not correct and $S_2$ is correct
User Avatar
1.2k
views
1 answers
1 votes
go_editor asked Jul 24, 2016
1,234 views
UGC NET CSE | September 2013 | Part 3 | Question: 37
The time complexity of reccurence relation T(n) = T(n/3) + T(2n/3) +O(n) isO(Ig n)O(n)O(n Ig n)O(n$^2$)
User Avatar
1.8k
views
1 answers
1 votes
go_editor asked Jul 22, 2016
1,756 views
UGC NET CSE | September 2013 | Part 3 | Question: 2
$\alpha - \beta$ cutoffs are applied toDepth first searchBest first searchMinimax searchBreadth first search
User Avatar
Link Copied!