No.	Activity Name	Sem	Link
1	Towers of Honoi	3	Link
2	Software installation	6	link
3	X-game	6	Link
4	C Programming for Problem Solving	1	Link

Activity : Solving Tower of Hanoi Problem

Sem: 3

Subject: Data Structures and Applications

Subject Code: 17CS33

Faculty Name:   Deepak D J
 Asst. Professor, Dept of CSE, GMIT

Date : 11-10-2018

The Towers of Hanoi Problem:

In the game of Towers of Hanoi, there are three pegs labeled A, B, and C. Tower A contains n disks with decreasing size.

Objective : Move disks from peg A to peg C using peg B as an auxiliary.

Rules: The rules to be followed in moving the disks from peg A to peg C using peg B are as follows:

• Only one disk can be moved at a time.

• Only the top disk on any tower can be moved to any other tower.

• A larger disk cannot be placed on a smaller disk.

Recursive Solution:

Tower of Hanoi can be reduced to following subproblems for n>1 disks

1.       Move the top (n-1) disks from peg A to peg B.

2.       Move the top disk from peg A to peg C.

3.       Move the top (n-1) disks from peg B to peg C

Activity Description:

·       Props were prepared for 4 disks and 3 pegs.

·       Each team participating in activity had 4 students.

·       Every student is assigned a specific disk. It is the responsibility of the that student to move the disk based on the recursive solution. Student assigned with a particular disk should not move other disks.

·       Total of 12 teams participated in the activity.

·       The team which solved the problem fastest was considered as the winning team.

Sl no	Team Head	Time taken (sec)	Winners
1	Kavana	30
2	Uma	37
3	Sneha	29
4	Priyanka	38
5	Shruthi	30
6	Vidyasagar	19
7	Prajwal	12	Anand, Manjana Gowda, Pradeep
8	Vinayak	25
9	Nirmala	18
10	Sharath	18
11	Namaratha	15
12	Tejaswini	28