שאלות ותשובות - Homework Assignments - HW3 Frequently Asked Questions - Homework Assignments - HW3 Вопросы и Ответы - Homework Assignments - HW3 أسئلة وأجوبة - Homework Assignments - HW3

		.. (לתיקייה המכילה)

		Dry
	In question 2.2 (MergeSort), what arguments do the function gets? It is up to you to decide what arguments must be passed in order to get a generic and correct function. But please make sure you explain what is the role of every one of them in 2.2.b. In Question 2.3., what should be the function behaviour in cases where n=1,0 ? If n=1, the function should return a copy of the only list in the input array. If n=0, the function should return NULL. In question 2.3. can we assume that there are no cycles in any list? Yes. In question 2.3. can we use the functions defined in list.h? No. The only thing that is defined by us is the given list structure (with no functionality). Should the functions check bad inputs? In mergeSort - you can assume all inputs are valid. In all other functions in the dry part you should return NULL in case of invalid arguments. How do we deal with memory allocation failures in mergeSort? Assume using assert that the allocations do not return NULL. In question 2.3.1. should we return a new list or just modify list1 (as might be understood from the drawing)? You should return a new allocated list. In question 2.3, can we wrap the list structure with an ADT with functionality? No. It is really unnecessary. Can we use listDestroy() function (as stated in notes)? Yes. In 2.3, are we supposed to write code that works with generic lists? No, you are asked to write functions that work with lists of ints only. What is a priority queue (תור עדיפויות)? Priority queue is a data structure that provides the following two functionalities: - Insert an element with some given priority. - Extract the element with the highest priority.

		Wet, General
	Can we write any utility (non-ADT) files? Yes. When writing tests for generic ADTs (map_mtm for instance) how many different instances of the ADT should we test? It is sufficient to test only one instance of the generic ADT (for example: map of strings to ints, etc.), but you have to test every functionality and every case (including edge cases, success, and failure) deep enough so the test will cover ~100% of the code you have written. What extension should the MakeFile file have? None.

		Wet, First Part: Implementing an ADT of a Map
	Can we use the ADTs implemented as part of libmtm.a static library? No. In case you need an internal ADT to be contained inside the ordered map, you will have to implement it yourself. Where should we put the map_mtm_test.c file in the submission? In the tests folder. What should mapPut and mapRemove return when NULL pointers are passed as key and/or data? MAP_NULL_ARGUMENT What do you mean when you say that the iterator value is "undefined" after calling a function? When the iterator value is said to be undefined after calling some function, the user should not assume anything about the iterator, meaning you do not have to guarantee anything regarding its value, and you are allowed to modify it as you want. This came to simplify things, so do not overthink it. What do you mean by saying that a function "resets the iterator"? It is equivalent to saying that the iterator after calling this function is "undefined" (see above). What should happen when the user calls mapPut for a key that already exists? The data for the key should be replaced with the new given one, and the function should return MAP_SUCCESS. Should mapGet return the element itself, or a copy of it? mapGet should return the element itself.

		Wet, Second Part: Implementing the PokemonGo game
	Are we required to use all three ADT given in the static library (set, list and map)? No, it is not necessary that you use them all, but make sure that the data structure you choose to use in every place is the most suitable one. That doesn't mean that an implementation that uses only some of the ADTs is incorrect. You can ask yourself questions like the one asked in the first question in the dry part to find the best match. When testing the submission folder, will you add test_utilities.h anywhere? Yes, we will add it to the tests folder. It's your responsibility to have it anywhere else in your submission folder. Where should the execution files generated by the makefile (all *_test files) be? In the main submission directory. Do we have to implement the functions declared in print_utils.h? No, they are implemented in libmtm.a. All you need to do is link the library at compilation. Which external C libraries can we use? You can use all C standard libraries. https://en.wikipedia.org/wiki/C_standard_library#Header_files When a Pokemon with ID=2 for example dies, then a fourth Pokemon is caught by the trainer, does he get ID=2 or ID=4? In other words, are "free ID slots" occupied by newly caught Pokemons? In the example, the new caught Pokemon would get ID=4. The ID assignment mechanism is very simple: The i^th Pokemon caught by the trainer gets ID=i, no matter how many Pokemons died. Also, Pokemon IDs dont change once assigned. In case a Pokemon evolves after fighting a battle, do we print the old or the new specifications of the Pokemon? In the battle result report, you print the specifications of the old Pokemon, before the evolution occur. When a Pokemon dies, does it evlove? Whether a dead Pokemon evolve or not is not relevant since it should be removed out of the game. When printing the locations report, what do we print besides every location? You should print the first Pokemon on the list of that location, i.e., the Pokemon that is in that location at the moment (if any). When adding a new trainer to the game, with a start point with no Pokemons, what happens, and is it an error? The trainer will just start the game with no Pokemons. This is not considered an error. Can two trainers in different locations fight a battle? Yes. What do you mean by lexicographic order (of locations printed)? By lexicographic order of strings we mean the order defined by strcmp. In unit tests for the various ADTs, how should we test the print functions? It should be enough to just print the output to stdout and check by yourself whether it is correct. Is it possible that a Pokemon evolves more than once due to a single battle? Yes. Consider the following example of possible evolutions: A -> B 5 B -> C 6 Suppose a Pokemon A with level 4 fights a battle that raises its level to 7. Pokemon A will evolve then to C. Are we obliged to store the types of a Pokemon inside the Pokemon's struct? No it is not necessary. Notice that types matter only when the Pokemon is captured. Therefore, an implementation that consider the types of a Pokemon when it's captured, but do not store them in the Pokemon struct is totally fine since the types are not used again. Do we have to test the print functions in unit tests? If so, how? Print functions are the only functions that you do not need to test in unit tests of the various ADTs. Can we assume that Pokemon types are always given in capital letters? Yes. Can we assume that there is a single space between every two words in the three input files? And that there are none before the first word? Yes. Which channel/ file should the errors be printed to? All errors should be sent to the standard error channel stderr.