On midterm #1:
<p>
What to expect: Here are the sorts of questions I tend to ask:

<ul>
<li> Define terms in your own words.

<li> Sketch the execution of an algorithm. For example, show me the steps in the POP algorithm.

<li> Give pseudocode describing an algorithm.

<li> Give the setup for a problem. 

<li> Compare different algorithms and their strengths/weaknesses.

<li> Explain why an algorithm has the characteristics it does. Why is backward chaining not complete?

</ul>
<p>
Here are the sorts of questions I will not ask.
<p>
<ul>
<li> Write syntactically correct Python code. (I may ask you to write
pseudoode, but I'll be interested in program correctness, not whether
every bracket and colon is in the right place)
<li> Multiple choice questions. 
<li> "Trick" questions - the point of this exam is to test your
knowledge of the topics we've covered. I may ask you hard questions,
but I won't ask things that are deliberately misleading or deceptive.
</ul>
<p>

Potential exam topics:
<p>
<ul>
<li> NLP - chunking and tagging</li>
<li> Propositional logic</li>
<ul> 
<li>Definitions - sound, complete, tautology, contradition, modus ponens, etc</li>
</li>
<li> Inference: forward chaining, backward chaining, resolution</li>
</ul>
<li> First-Order logic</li>
<ul>
<li> Encoding sentences </li>
<li> Quantification </li>
<li> Inference: forward chaining, backward chaining, resolution</li>
</ul>
<li> Ontologies</li>
<ul>
<li> Design principles</li>
<li> Definitions: Closure axioms, semantic network, OWL, competency questions, etc.</li>
</ul>
<li> Planning </li>
<li> Decision Trees</li>
<li> Basic probability. (most of this will wait until the final.) </li>




</ul>