From 281c47d77177ce660513b7c033ab6043052da73f Mon Sep 17 00:00:00 2001 From: Jidong Xiao Date: Mon, 3 Mar 2025 16:58:18 -0500 Subject: [PATCH] adding the FAQs --- hws/inverse_word_search/README.md | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/hws/inverse_word_search/README.md b/hws/inverse_word_search/README.md index a1107a6..8069351 100644 --- a/hws/inverse_word_search/README.md +++ b/hws/inverse_word_search/README.md @@ -73,11 +73,11 @@ You must do this assignment on your own, as described in the [Collaboration Poli ## FAQs -1. Q: Am I allowed to use data structures not covered in this class? +1. Q: Am I allowed to use data structures not covered in this class? A: Yes. For this homework, you can use whatever data structures you want to use; but last year, the student who topped the leaderboard with a very large margin, did not use any fancy data structures. The student used std::set, but did not use std::unordered_set or std::unordered_map, or any data structures which had not been covered in this class. -2. Q: What bonus do I get if my program ranks higher than the instructor's program on the leaderboard? - A: If by Thursday night 10pm (which is hte submission deadline), your program ranks higher than the instructor's program, you have many options. You can choose one of these: +2. Q: What bonus do I get if my program ranks higher than the instructor's program on the leaderboard? + A: If by Thursday night 10pm (which is the submission deadline), your program ranks higher than the instructor's program, you have many options. You can choose one of these: - Drop the lowest test score - Drop the lowest homework - Skip 1 future homework