From 85e76a58429d78fb6e9345b89c8124d65d136625 Mon Sep 17 00:00:00 2001 From: Jidong Xiao Date: Fri, 1 Mar 2024 13:52:31 -0500 Subject: [PATCH] adding hw6 discussion --- hws/discussions/inverse_word_search.txt | 13 +++++++++++++ 1 file changed, 13 insertions(+) create mode 100644 hws/discussions/inverse_word_search.txt diff --git a/hws/discussions/inverse_word_search.txt b/hws/discussions/inverse_word_search.txt new file mode 100644 index 0000000..a7af7f9 --- /dev/null +++ b/hws/discussions/inverse_word_search.txt @@ -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?