Chapter 4: Recursion — Data Structure and Algorithms (CSC211) Notes

Principle of Recursion, Comparison between Recursion and Iteration, Tail Recursion; Factorial, Fibonacci Sequence, GCD, Tower of Hanoi(TOH); Applications and Efficiency of Recursion.

Core Course8 Pages
Ch. 4: Recursion8 Pages
100%
Pageof 8
Data Structure and Algorithms Chapter 4 Notes (Recursion) — Page 1
Page 1 of 8
Ch. 3: QueueCh. 5: Lists

Topics & Key Objectives in Chapter 4

Principle of RecursionComparison between Recursion and IterationTail RecursionFactorialFibonacci SequenceGCDTower of Hanoi(TOH)Applications and Efficiency of Recursion.

Related Study Resources for Data Structure and Algorithms (CSC211)

Subject HubData Structure and Algorithms (CSC211)Official CurriculumData Structure and Algorithms SyllabusTU Board PapersData Structure and Algorithms Past QuestionsSemester Directory3rd Sem Subjects