{
    "q1": {
        "type": "blank",
        "question": "\n<strong>\nHow many subsets of <tt>{0, 1, 2, 3, 4, 5, 6, 7, 8, 9}</tt> are divisible by\n<tt>3</tt> (that is the sum of the all the elements in the subset is divisble by 3)?\n\nWrite a program that computes this and enter in the number below.\n\n____\n\nNote: As shown in the book, order does not matter when defining a subset.  Therefore,\n<tt>{0, 1, 2}</tt> and <tt>{1, 0, 2}</tt> counts as one set.\n</strong>\n"
    },
    "q2": {
        "type": "blank",
        "question": "\n<strong>\n\nComplete the C++ code below so that the program prints all permutations of\n\"ABC\": <tt>ABC, ACB, BAC, BCA, CAB, CBA</tt>.\n\n</strong>\n\n<pre>\nint main(int argc, char *argv[]) {\n    string s = \"ABC\";\n    ____(s.begin(), s.end());\n    do {\n        cout << s << endl;\n    } while (____(s.begin(), s.end()))\n\n    return 0;\n}\n</pre>\n"
    },
    "q3": {
        "type": "blank",
        "question": "\n<strong>\n\nComplete the Python code below so that the program prints all permutations\nof \"ABC\": <tt>ABC, ACB, BAC, BCA, CAB, CBA</tt>.\n\n</strong>\n\n<pre>\nimport ____\n\ns = \"ABC\"\nfor p in ____(s):\n    print ''.____(p)\n\n</pre>\n"
    },
    "q4": {
        "type": "blank",
        "question": "\n<strong>Complete the following script utilizing bitsets in Python:</strong>\n\n<pre>\nelements = (1, 2, 4)\nbitset   = ____                     # 1. Initialize bitset\n\n# Add elements to bitset\nfor i in elements:\n    bitset = ____                   # 2. Add element to bitset\n\n# Print contents of bitset\nprint(bitset)                       # A. After adding alements to bitset\n\n# Test for elements in bitset\nfor i in range(6):\n    if ____:                        # 3. Test if element is in bitset\n        print(i)\n\n# Remove elements from bitset\nfor i in elements:\n    bitset = _____                  # 4. Remove element from bitset\n\n# Print contents of bitset\nprint(bitset)                       # B. After removing elements from bitset\n</pre>\n"
    },
    "q5": {
        "type": "blank",
        "question": "\n<strong>\n\nGiven a completed version of the bitset Python script above, what values\nare printed at the lines marked by the comments:\n\n</strong>\n\n<p>\nA. ____ After adding elements to bitset.\n</p>\n\n<p>\nB. ____ After removing elements from bitset.\n</p>\n"
    },
    "q6": {
        "type": "blank",
        "question": "\n<strong>\n\nA ____ algorithm starts with an empty solution and extends the solution\nstep by step by ____ searching through all the different ways a solution\ncan be constructed.  Because this can be quite exhaustive, we may wish to\nadd \"intelligence\" to our search by ____ the search tree, which mean to\neliminate a candidate solution if we can determine that it is a dead-end.\n\n</strong>\n"
    },
    "q7": {
        "type": "multiple",
        "question": "\n<strong>\n\nIn regards to greedy algorithms, which of the following statements are true\n(select all that apply)?\n\n</strong>\n",
        "responses": {
            "approach": "A greedy algorithm constructs a solution by choosing the best option at the moment.",
            "backtrack": "A greedy algorithm will backtrack when it finds a suboptimal solution.",
            "guarantee": "A greedy algorithm is guaranteed to find the optimal solution.",
            "efficiency": "A greedy algorithm tends to be very efficient."
        }
    }
}