Computer Science · Algorithms
निम्नलिखित में से कौन सा एल्गोरिथम प्रतिमान उप-समस्याओं को हल करने के लिए मेमोइजेशन (memoization) या टेबुलेशन (tabulation) का उपयोग करता है?
- 1ग्रीडी मेथड (Greedy Method)
- 2डायनेमिक प्रोग्रामिंग (Dynamic Programming)✓
- 3डिवाइड एंड कॉनकर (Divide and Conquer)
- 4ब्रांच एंड बाउंड (Branch and Bound)
सही उत्तर देखें
डायनेमिक प्रोग्रामिंग (Dynamic Programming)
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Want more practice questions on Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Algorithms