Topic List

 Sorting  Dynamic Programming  Recursion  Binary Trees  Abstract Data Types  Graph  Searching  Heap  Trees  Hash Tables  Stacks  Cryptography  Number Theory  Shortest Path  Graph Search  Arrays  Algorithms  Computational Geometry  Miscellaneous  Complexity Classes  Matching  Backtracking  Trie  Bipartite Graphs  Lists  Flow Problem  B-Trees  String Matching  Minimum Cut

Backtracking on Data Structure and Algorithms related Questions and Answers - Page 5

Question 41 : Which of the following logical programming languages is not based on backtracking?
1. Icon
2. Prolog
3. Planner
4. Fortran
View Answer   Discuss with Members

Question 42 : Of the following given options, which one of the following is a correct option that provides an optimal solution for 4-queens problem?
1. (3,1,4,2)
2. (2,3,1,4)
3. (4,3,2,1)
4. (4,2,3,1)
View Answer   Discuss with Members


View 41 - 42 of 42 Questions

* Be the First to Post a Comment.

Submit comment :

Captcha Image
Reload

Ask Question

Captcha Image
Reload

Note : Name and Email never shown.





Subscribe


Become a part of EducationForever. Subscribe to our FREE Newsletter