Scribd
Upload
16 views3 pages

Team Work

The project involves solving the Tower of Hanoi problem using stack data structures in Python, aimed at enhancing understanding of stacks and teamwork skills. Teams of 2-3 members will implement the solution, analyze its complexity, and prepare documentation and a presentation. Deliverables include Python code, a detailed Word document, and a PowerPoint presentation summarizing their work.

Uploaded by

AIKO.J Breezy
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
16 views3 pages

Team Work

The project involves solving the Tower of Hanoi problem using stack data structures in Python, aimed at enhancing understanding of stacks and teamwork skills. Teams of 2-3 members will implement the solution, analyze its complexity, and prepare documentation and a presentation. Deliverables include Python code, a detailed Word document, and a PowerPoint presentation summarizing their work.

Uploaded by

AIKO.J Breezy
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

project

University of Management and Technology (UNIMTECH)

Group Project (30 Marks)

Assignment Brief: Tower of Hanoi Problem Using Stack Data


Structure
Title:
Solving the Tower of Hanoi Problem Using Stack Data Structure

Objective:
The objective of this group project is to deepen your understanding of the stack data structure and its
applications by solving the classic Tower of Hanoi problem. You will implement the solution using Python,
demonstrating how stacks can be used to manage the recursive nature of the problem efficiently. This project
will also enhance your teamwork, problem-solving, and presentation skills.

Summary :
The Tower of Hanoi is a mathematical puzzle that consists of three rods and a number of disks of different sizes
that can slide onto any rod. The puzzle starts with the disks stacked in ascending order of size on one rod, the
smallest at the top. The objective is to move the entire stack to another rod, obeying the following rules:
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.
3. No disk may be placed on top of a smaller disk.
Page 1 of 3
project
In this project, you will:
1. Use the stack data structure to model the rods and disks.
2. Implement the Tower of Hanoi solution using stacks in Python.
3. Analyze the time and space complexity of your solution.
4. Present your findings and implementation in a professional manner.

Requirements :
1. Team Formation:
Form teams of 2-3 members .
Each team member must contribute equally to the project.

2. Problem Understanding :
Research and understand the Tower of Hanoi problem and its recursive solution.
Study the stack data structure and its operations (push, pop, peek, isEmpty).

3. Implementation:
Implement the Tower of Hanoi solution using stacks in Python.
Your program should:
Allow the user to input the number of disks.
Display the initial state of the rods and disks.
Show each move step-by-step until the problem is solved.
Use stacks to manage the disks on each rod.
Ensure your code is well-commented and follows best practices.

4. Documentation:
Prepare a Word document (docx) that includes:
A detailed explanation of the Tower of Hanoi problem.
A description of how stacks are used to solve the problem.
Pseudocode or flowchart of your solution.
Time and space complexity analysis of your implementation.
Challenges faced and how you overcame them.

5. Presentation:
Create a PowerPoint presentation (PPT) to present your work.
Your presentation should include:
An introduction to the Tower of Hanoi problem.
Explanation of the stack data structure.
Page 2 of 3
project
Demonstration of your Python implementation.
Complexity analysis and key takeaways.
A live demo of your program (if possible).

6. Submission:
Submit the following files:
Python source code ( .py file).
Documentation ( .docx file).
Presentation ( .ppt file).

Evaluation Criteria :
Criteria Weightage Description
Understanding of 10% Clear explanation of the Tower of Hanoi problem and stack data
Problem structure.
Implementation 30% Correct and efficient implementation of the solution using stacks
in Python.
Code Quality 15% Well-structured, commented, and readable code.
Documentation 20% Comprehensive and professional documentation of the solution.
Presentation 15% Clear, engaging, and well-organized presentation with a live demo
(if possible).
Teamwork 10% Equal contribution from all team members.

Deliverables :
1. Python Source Code : A fully functional Python program that solves the Tower of Hanoi problem using
stacks.
2. Documentation : A detailed Word document explaining your approach, implementation, and analysis.
3. Presentation : A PowerPoint presentation summarizing your work and demonstrating your solution.

created with the evaluation version of Markdown Monster

Page 3 of 3

You might also like