CS 170 Reading Quiz -- Week 10, Tuesday

Please fill out this quiz, and press the "Submit" button at the end. Don't collaborate with anyone on quiz exercise solutions.

Please answer all questions.


SID: [No spaces and no dashes.]

Login ID : [e.g., cs170-xy]

1. True/False: the importance of finding search problem formulations of problems is so that we can apply already-discussed search algorithms like Dijkstra's.

2. True/False: The optimization formulation of CLIQUE is "Given a graph, find the largest k such that there is a k-clique in the graph", and the corresponding search formulation of CLIQUE is "Given a graph, find if there is any clique in the graph."

3. What did you find difficult or confusing about the reading for the upcoming lecture, and what would you most like to see explained better? If nothing was difficult or confusing, and you understand the material pretty well, tell us what you found most interesting. Please be as specific as possible.

4. How did you feel about the exam? Good/bad? Too easy/hard, short/long? Any concepts you expected less/more of?

CS 170 home page