Description
Question 1 (20 points) For predicate p = (a ∧ b) ∨ (b ∧ c) ∨ (a ∧ c), answer the following questions: • (a) Compute and simplify the conditions under which each of the clauses determines predicate p. The condition must only use ∧, ¬, and ∨. Complete the table. (8 points) • (b) Identify all pairs of rows from your table that satisfy GACC with respect to each clause. (4 points) • (c) Identify all pairs of rows from your table that satisfy CACC with respect to each clause. (4 points) • (d) Identify all pairs of rows from your table that satisfy RACC with respect to each clause. (4 points) a b c p pa pb pc 1 T T T 2 T T F 3 T F T 4 T F F 5 F T T 6 F T F 7 F F T 8 F F F Question 2 (20 points) Answer the following questions for the method intersection() below: public Set intersection (Set s1, Set s2) // Effects: If s1 or s2 is null, throw NullPointerException // else return a (non null) Set equal to the intersection of Sets s1 and s2 Characteristic: Size of s2 – s2 has even number of elements (in other words, the size of s2 is an even number) – s2 has odd number of elements (in other words, the size of s2 is an odd number) Characteristic: Relation between s1 and s2 – the size of s1 is not bigger than the size of s2 – the size of s2 is not bigger than the size of s1 • (a) Does the partition “Size of s2” satisfy the completeness property? If not, give a value for s2 that does not fit in any block. (4 points) • (b) Does the partition “Size of s2” satisfy the disjointness property? If not, give a value for s2 that fits in more than one block. (4 points) • (c) Does the partition “Relation between s1 and s2” satisfy the completeness property? If not, give a pair of values for s1 and s2 that does not fit in any block. (4 points) • (d) Does the partition “Relation between s1 and s2” satisfy the disjointness property? If not, give a pair of values for s1 and s2 that fits in more than one block. (4 points) • (e) If the “Base Choice” criterion were applied to the two partitions (exactly as written), how many test requirements would result? (4 points) Question 3 (20 points) In this question, you will criticize and improve an existing bug report in Mozilla and write your own bug reports. 2 • (a) Read the Mozilla bug report 112785 (https://bugzilla.mozilla.org/show_bug.cgi?id=112785). What are the problems of the initial bug report (the “Title” and the “Description”)? Identify four problems. How would you improve this bug report? (10 points) • (b) The program HashTable.java is an implementation of hash table using linear open addressing and division in Java. This program has a bug, because the put function will NOT update the element associated with the given key if an entry with the same key is put. However, this hash table implementation should update the element even if the element’s key already exists in the hash table (see the comment in the put function). Write a good bug report for this bug using the Firefox bug report format. (10 points) 3
