..:: Backtracking on Data Structure and Algorithms related Questions and Answers

Backtracking on Data Structure and Algorithms related Questions and Answers

Question : A node is said to be ____________ if it has a possibility of reaching a complete solution.
1. Non-promising
2. Promising
3. Succeeding
4. Preceding
Answer : 2 - Promising

* Be the First to Post a Comment.

Submit comment :

Ask Question

Note : Name and Email never shown.

Other Questions

Practice Paper sets

Backtracking on Data Structure and Algorithms related Questions and Answers

Submit comment :

Ask Question

JagSchool of Transformative Skills

PDPM Indian Institute of Information Technology Design Manufacturing

Global Institute Of Technology & Management

Institute for future education Entrepreneurship and leadership

Other Questions

Practice Paper sets

Backtracking on Data Structure and Algorithms related Questions and Answers

Submit comment :

Ask Question

Subscribe