Great Learning
Great Learning Logo

Tower of Hanoi 

  • Offered byGreat Learning

Tower of Hanoi
 at 
Great Learning 
Overview

Duration

1 hour

Total fee

Free

Mode of learning

Online

Difficulty level

Beginner

Official Website

Explore Free Course External Link Icon

Credential

Certificate

Tower of Hanoi
 at 
Great Learning 
Highlights

  • Earn a certificate of completion
Details Icon

Tower of Hanoi
 at 
Great Learning 
Course details

What are the course deliverables?
  • Tower of Hanoi
  • Java Implementation
  • Python Implementation
More about this course
  • In Computer science, different programming approaches are used for Solving the mathematical puzzles and Games
  • This course is about one of the puzzles named The Tower of Hanoi Problem which uses the concept of Dynamic programming
  • The concept behind solving the tower of Hanoi using 3, 4 to n disks is discussed along with programming constructs like recursion used for writing programs is discussed
  • The implementation of this problem is also discussed using Java and Python Programming Constructs

Tower of Hanoi
 at 
Great Learning 
Curriculum

Summary

Agenda To Tower of Hanoi

Introduction to Tower of Hanoi

Tower of Hanoi for n Disks

Tower of Hanoi for 3 Disks

Tower of Hanoi for 4 Disks

Recursive Algorithm

Tower of Hanoi Codes in Java

Tower of Hanoi Codes in Python

Tower of Hanoi Using Stack

Complexity Analysis of Tower of Hanoi

Other courses offered by Great Learning

3.5 L
5 months
– / –
97 K
4 months
– / –
2.75 L
12 months
– / –
2.75 L
12 months
– / –
View Other 1225 CoursesRight Arrow Icon
qna

Tower of Hanoi
 at 
Great Learning 

Student Forum

chatAnything you would want to ask experts?
Write here...