CSC305 Lecture 09

Individual Software Design and Development
Assignment
(202410)

Transcript

1. Dr. Javier Gonzalez-Sanchez javiergs@calpoly.edu www.javiergs.info o ffi ce: 14 -227 CSC 305 Individual Software Design and Development Lecture 09. Assignment
2. Previously
3. Hints 3 ✅ ✅ ✅ ❌ ❌ 🤔
4. Clean Code Re a d a bility • DRY • KIS • SRP • Comments • Error H a ndling with a Logger 4 Metrics • LOC (eLOC, lLOC) • CC • A • I • D
5. Assignment Version 1. Text-Based
6. Tower of Hanoi 6
7. Tower of Hanoi Move a st a ck of disks from one rod to a nother, following three simple rules: 1. Only one disk c a n be moved a t a time, 2. A l a rger disk c a nnot be pl a ced on top of a sm a ller one. 7
8. Example with three disks 8
9. Example with four disks 9
10. Code class GFG { void towerOfHanoi(int n, char from_rod, char to_rod, char aux_rod) { if (n == 0) return; towerOfHanoi(n - 1, from_rod, aux_rod, to_rod); System.out.println("Move disk " + n + " from rod “ + from_rod + " to rod “ + to_rod); towerOfHanoi(n - 1, aux_rod, to_rod, from_rod); } public static void main(String args[]) { int N = 3; // A, B, and C are the names of the rods towerOfHanoi(N, 'A', 'C', 'B'); } } 10
11. https://futurumcareers.com/solving-the-tower-of-hanoi
12. Assignment 12 Can we create a Text-Based Tower of Hanoi Game
13. Step 1 13 1. How many Disk do you want to use?
14. Step 2 14 Show the board 111 or ABC ___ ___ or | | | 
 A | | B | | C | | ——— ——— ———
15. Step 3 15 Ask the user for their move
16. Step 4 16 Is a correct move?
17. Step 5 17 An the Game can continue …
18. Step 5 18 Users can ask for HELP And the computer should move, It should make a good move!
19. Question 19 How many classes? Class Diagram! A I How many methods? CC LOC Develop It!
20. Questions 20
21. Lab 08. Diagram to Code
22. Part B 22 Write the Source Code
23. CSC 305 Individual Software Design and Development Javier Gonzalez-Sanchez, Ph.D. javiergs@calpoly.edu Summer 2024 Copyright. These slides can only be used as study material for the class CSC305 at Cal Poly. They cannot be distributed or used for another purpose.