JamesFlare/CSCI-1200
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

adding hw6 discussion

Browse Source
This commit is contained in:
Jidong Xiao
2024-03-01 13:52:31 -05:00
parent 0f520ed3eb
commit 85e76a5842
1 changed files with 13 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

13
hws/discussions/inverse_word_search.txt Normal file
View File

@@ -0,0 +1,13 @@
In-class discussion (This discussion only focus on the basic logic of the program; optimization is not the scope of this discussion)
Discuss the following questions with students around you.
1. What data structure is good to represent one solution? What data structure is good to represent all solutions?
2. Do we need to initialize the board(s)?
3. What shall we do in the main function?
4. Do we need to track where exactly (in the board) a word is inserted?
5. Do we need to track if one location is occupied or not?
6. Do we need to track if a location is shared by multiple words or not?
7. In the word search program we have discuss before relevant to this assignment? Can we use some of the logic from that program?