You are on page 1of 1

DEPARTMENT OF INFORMATION TECHNOLOGY 4th YEAR 7th SEM ARTIFICIAL INTELLIGENCE

TUTORIAL SHEET 5

Q1. What do you mean by space complexity and time complexity? Q2. Discuss the complexity of various uninformed search algorithms. Q3. Show that iterative lengthening search algorithm is optimal for general path costs. Q4. What are the various parameters on the basis of which we judge any search algorithm? Q5. What are the merits and demerits of bidirectional search?

You might also like