Final Exam Q and A

Ask Questions Here

FAQs

• you can submit questions as many times as you like; only the last submission is marked
• run_tests.sh for Q1 say PASSED; run_tests.sh for Q2 says OK; OK == PASSED
• Q1,Q2: always run make after you make changes, and before you do sh run_tests.sh
• Q1,Q2: we don't care about efficiency or style, just correctness
• ignore the comments referring to sortStudents() at the start of graphIsBinTree() in q2
• Q2: you can assume that the graph will have only one (weakly) connected component
• q?.txt questions are hand-marked; formatting doesn't matter, but try to make them nice
• Q5: in this exam, a single node does not form a clique
• Q5: "connected components" should interpreted as "weakly connected components"
• Q7: you only need to show the removal of 99