Tower of Hanoi

Duration: 10 min

This video lesson is available to enrolled students.

Return to /learn/UP-POLICE-COMPUTER-OPERATOR/data-structures/stack/toh-classic-apps/asset-tower-of-hanoi after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About the course: About the Course
  2. General Knowledge: Polity, Physics, Biology, State Wise GK, Chemistry, History, Geography, GK- Current Affairs, Indian Economy, Static General Knowledge, Environment, Evolution of Indian Banking (Banking & Financial Awareness)
  3. Mental Aptitude and Reasoning: Ratio and Proportion (Ratios), Data Interpretation, Permutation and Combination, Number System, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Vocabulary, Profit and Loss, Arithmetic, Mental Ability, Percentage, Algebra, Mensuration and Geometry, Age Problems, Clock, Calendar, Verbal Analogy (Word Based Analogy), Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Analogy, Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Selection Decision Table (Decision Making), Cubes & Dices, Blood Relations, Venn Diagram, Logical Sequence Of Words, Inequality, Directions (Direction Test), Data Arrangement, Syllogisms, Seating Arrangements, Ranking, Order and Sequence, Time and Work, Ratio and Proportion, Averages, Mixtures and Alligation, Percentages, Subject-Verb Agreement, Sentence Completion, Geometry, Reading Comprehension, Powers, Surds and Logarithms, Number System, Statistics, Three-Dimensional Patterns and Visualization, Permutations and Combinations, Alphabet and Word Tests, Sequences and Series, Simplification and Approximation, Mathematical Operations, Constraint Puzzles, Numerical Reasoning, Series Completion, Analogy and Classification, Patterns in Two-Dimensional Figures, Coding and Decoding, Direction Sense, Assembling and Grouping of Shapes, Transformation of Shapes, Cubes and Dice, Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Profit, Loss and Discount, Mensuration, Sentence Structure and Correction, Critical Reasoning, Syllogisms and Venn Diagrams, Order, Ranking and Sequence, Trigonometry, Probability, Measurement and Quantity Take-Off, Clocks and Calendars, Articles and Determiners, Logical Deduction and Induction, Narrative Sequencing, Project Monitoring, Resources and Safety, Traverse Surveying, Modals, Conditionals and Subjunctive, Algebra, Vocabulary, Data Interpretation, Speed, Time and Distance, Data Sufficiency, Blood Relations, Simple Interest and Compound Interest, Mixture and Alligation, HCF LCM, Combinatorics
  4. CS | Computer Fundamentals: Basics of COA, Number System, Number Representation, C Fundamentals, Algorithm Analysis, Input Output Organisation, Semiconductor Memories and Programmable Logic, Timing, Hazards and Testing, Processor Organization and Instructions, Memory Hierarchy and Input/Output, Number Systems and Codes, Combinational Logic Design, Combinational Logic Circuits, Number Systems and Codes
  5. CS | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, SQL
  6. CS | Workplace productivity Tools: MS Office Applications, Keyboard Shortcuts
  7. CS | Computer Networks: Introduction to CN, Data Communication, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Transport Layer Services, Application Layer, Hardware Basics, Network Security
  8. CS | The Internet: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Web Publishing & Hosting, Server Side & Security, Emerging Technologies
  9. CS | Emerging Technologies: Artificial Intelligence, Emerging Tech Trends, Introduction to OS, Windows OS, Linux OS, Unix OS, JavaScript-Basics, Internet of Things
  10. CS | Boolean algebra: Digital Systems & Boolean Basics, Boolean Expression, Boolean Minimization, Logic Gates & Hardware, Registers and Counters, Boolean Algebra and Logic Gates, Microprocessors and Microcontrollers, Logic Families and CMOS Logic, Microprocessors, Logic Gates and Boolean Algebra, Number Systems and Codes, Minimization of Boolean Functions, Semiconductor Memories and Programmable Logic Devices, Logic Families, Arithmetic Circuits, Waveform Generators and Timer Circuits, Minimization of Boolean Functions
  11. CS | Data Structures: Introduction to DS, Array, Stack, Queue
  12. CS | Cryptography: Society, Law & Ethics, Cyber Threats and Malware Attacks, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Electronic Data Interchange and E-Commerce, Physical Security and Cryptography Basics, Intrusion Detection Systems (IDS), Cyber Safety and Security
  13. UP Police Previous Year Papers:
  14. UP Police Full Mock Tests:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video provides a detailed lecture on the Tower of Hanoi puzzle, a classic problem in computer science and mathematics. The instructor begins by defining the puzzle, its components, and the initial setup involving three rods and disks of varying sizes. The lecture then outlines the three fundamental rules governing the movement of disks. A historical anecdote regarding the Tower of Brahma in Kashi Vishwanath is presented to explain the puzzle's alternative name. The core of the session focuses on the recursive algorithm used to solve the problem. The instructor displays pseudocode, explains the base case and recursive steps, and manually traces the execution for N=3 using a recursion tree. Finally, the video derives the time complexity formulas for total disk moves and total function calls.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The video opens with a slide titled 'Tower of hanoi'. The instructor, identified as Sanchit Jain Sir, introduces the puzzle. The slide text states: 'The Tower of Hanoi (also called the Tower of Brahma) is a mathematical game or puzzle.' It describes the physical components: 'It consists of three rods and a number of disks of different sizes, which can slide onto any rod.' The initial state is described as: 'The puzzle starts with the disks in a neat stack in ascending order of size on one rod, the smallest at the top, thus making a conical shape.' An image of the wooden puzzle is shown on the screen, illustrating the conical stack of disks on the leftmost rod.

  2. 2:00 – 5:00 02:00-05:00

    The lecture transitions to the rules and objective. A new slide appears with the text: 'The objective of the puzzle is to move the entire stack to another rod, obeying the following simple rules:' Three rules are listed: '1. Only one disk can be moved at a time.', '2. Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack or on an empty rod.', and '3. No larger disk may be placed on top of a smaller disk.' The instructor then introduces a story about an 'Indian temple in Kashi Vishwanath which contains a large room with three time-worn posts in it, surrounded by 64 golden disks.' He explains that 'Brahmin priests... have been moving these disks in accordance with the immutable rules of Brahma since that time,' which is why it is also known as the Tower of Brahma puzzle.

  3. 5:00 – 10:00 05:00-10:00

    The instructor presents the recursive solution. A code snippet is displayed: 'Tower(N, B, A, E)'. The base case is shown: 'if(n = 1) { B -> E; return; }'. The recursive logic follows: 'tower(n-1, B, E, A);', 'B -> E', and 'tower(n-1, A, B, E);'. The instructor draws a recursion tree on the screen to trace the execution for N=3. He writes 'T(3, B, A, E)' at the top. He branches it into 'T(2, B, E, A)' and 'T(2, A, B, E)'. He continues expanding the tree down to the base cases. On the right side, he lists the sequence of moves: 'B->E', 'B->A', 'E->A', 'B->E', 'A->B', 'A->E', 'B->E'. At the bottom of the slide, formulas are provided: 'total disk moves = 2^n - 1' and 'total number of function call = 2^(n+1) - 1'. He also notes 'how many invocation are required for the first disk to move = n'.

  4. 10:00 – 10:12 10:00-10:12

    The video concludes with the instructor finalizing the explanation of the recursion tree. The screen displays the fully drawn tree structure showing the branching of function calls for N=3. The formulas for total disk moves and function calls remain visible at the bottom. The instructor is seen wrapping up the derivation of the complexity analysis for the Tower of Hanoi algorithm.

The lecture systematically builds understanding of the Tower of Hanoi from its physical definition and rules to its mathematical solution. By combining the historical context with a step-by-step breakdown of the recursive algorithm, the instructor clarifies how the problem is solved efficiently. The visual tracing of the recursion tree and the derivation of the $2^n - 1$ formula provide a concrete understanding of the exponential time complexity inherent in the problem.

Loading lesson…