If a problem can be solved by combining optimal solutions to non-overlapping problems, the strategy is called __________
Asked in Mizoram PSC 3.Technical Paper-I
Answer under review: our editors are checking this question. Try the other MPSC Prelims previous year questions questions meanwhile.
More MPSC Prelims previous year questions questions
- Depth First Search is equivalent to which of the traversal in the Binary Trees?
- Time Complexity of DFS is? (V – number of vertices, E – number of edges)
- The PreOrder and PostOrder traversal of binary tree generate the same out put. The tree can have maximum
- In a stack, if a user tries to remove an element from empty stack it is called __________
- The postfix form of A*B+C/D is?
- The result of evaluating the postfix expression 5, 4, 6, +, *, 4, 9, 3, /, +, * is?
- If we choose Prim’s Algorithm for uniquely weighted spanning tree instead of Kruskal’s Algorithm, then
- If a node having two children is deleted from a binary tree, it is replaced by its