Course Content

Other Courses

Tribhuvan university CSIT 2065 Syllabus Discrete Structure Old Questions 2071

Discrete Structure - Old Questions

Question Answer Details
Syllabus Notes Old Questions Unit Wise Questions Question Bank

18. Find the recurrence relation to find the number of moves needed to solve the TOH (Tower of Hanoi) problem with n disks. Discuss application of recurrence relation in divide-and-conquer algorithms.

8 marks
Asked in 2071

Answer

Back to Question Paper
AI Generated Answer

AI is thinking...