Chapter Study

BCA Semester 3 Data Structure and AlgorithmsUnit 6: Recursion (4Hrs)

Comprehensive questions and detailed answers for Unit 6: Recursion (4Hrs). Perfect for exam preparation and concept clarity.

3
Questions
15
Marks
Back to All Chapters

Write a recursive program to generate Fibonacci number up to nth terms.

MediumTHEORY5 marks2021(TU FOHSS Final)

What is tower of Hanoi problem? How recursion can be used of Hanoi problem?

MediumTHEORY5 marks2023(TU FOHSS Final)

What is recursion and recursive function? Write a recursive function to compute Fibonacci number.

MediumTHEORY5 marks2024(TU FOHSS Final)
Showing 3 questions

Sample Questions

Write a recursive program to generate Fibonacci number up to nth terms.

Marks: 5Chapter: Unit 6: Recursion (4Hrs)

What is tower of Hanoi problem? How recursion can be used of Hanoi problem?

Marks: 5Chapter: Unit 6: Recursion (4Hrs)

What is recursion and recursive function? Write a recursive function to compute Fibonacci number.

Marks: 5Chapter: Unit 6: Recursion (4Hrs)

Unit 6: Recursion (4Hrs) chapter questions with answers for Data Structure and Algorithms (BCA Semester 3). Prepare for TU exams with our comprehensive question bank and model answers.