Algorithms and OOD (CSC 207 2014S) : EBoards

CSC 207 2014S: Extra Session, Week 13


Overview

Questions and Answers

Is problem 1 closely related to something we did in lab?

Yes.

Can we just submit our answers to that lab writeup?

I would not recommend it.

Can we refer to them?

Certainly, provided you cite.

For problem 2a, how many unit tests should we write?

A minimum of 49, although they can be combined into a single function. There are seven ways to rearrange a subtree tree after deleting the "root". There are seven places that subtree can be. (See Q&A in exam.) 7x7 is 49.

For problem 2b, are there hints?

Take advantage of things like

                operation = "remove(" + key + ")";
                ops.add(operation);
                ...
  static void reportError(BST<Character, String> dict, ArrayList<String> ops,
                          String message)
  {
    System.err.println(ops);
    dict.dump(new PrintWriter(System.err, true));
    fail(message);
  } // reportError

Tips on problem 3?

Go through the versions systematiclaly.

On problem 4, is there an order in which we have to iterate the keys and values?

No. Whatever order is most convenient.

Copyright (c) 2013-14 Samuel A. Rebelsky.

Creative Commons License

This work is licensed under a Creative Commons Attribution 3.0 Unported License. To view a copy of this license, visit http://creativecommons.org/licenses/by/3.0/ or send a letter to Creative Commons, 543 Howard Street, 5th Floor, San Francisco, California, 94105, USA.