Computer Science · Analysis of Algorithms
एक बैकट्रैकिंग एल्गोरिदम (Backtracking algorithm) को विकल्पों का एक पेड़ बनाकर लागू किया जाता है जिसे कहा जाता है:
- 1डिसीजन डीएजी (Decision DAG)
- 2नोड ट्री (Node tree)
- 3स्टेट-चार्ट ट्री (State-chart tree)
- 4स्टेट-स्पेस ट्री (State-space tree)✓
सही उत्तर देखें
स्टेट-स्पेस ट्री (State-space tree)
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 Analysis of Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Analysis of Algorithms