Discussion Forum
Que. | Which approach is to pretend that a pure divide and conquer algorithm will work? |
a. | Goal independence |
b. | Sub-goal independence |
c. | Both a & b |
d. | None of the mentioned |
Answer:Sub-goal independence |
Que. | Which approach is to pretend that a pure divide and conquer algorithm will work? |
a. | Goal independence |
b. | Sub-goal independence |
c. | Both a & b |
d. | None of the mentioned |
Answer:Sub-goal independence |
Questions from Previous year GATE question papers
UGC NET Previous year questions and practice sets
UGC NET Previous year questions and practice sets
Attempt a small test to analyze your preparation level. This GATE exam includes questions from previous year GATE papers.
Practice test for UGC NET Computer Science Paper. The questions asked in this NET practice paper are from various previous year papers.