CS111 Test II Topics to cover and coding review problems

Topics/practice
  1. Know the names of the search algorithms and have an understanding of how they work. You will NOT be asked to write the algorithms or use search algorithm code in the exam.
  2. Recursion Practice Problems from Labs 5 and 6.
  3. Linked List Practice Problems from Part III in Lab 9. This exam will NOT have questions about the LinkedList class provided by the Java library (java.util package). Skip Part I-II in Lab 9.
  4. You will be asked to code your own implementation of an add() and delete() in a given Linked List.

  5. Know what LIFO means in a Stack. Know the basics of how a Stack works. See Lab 10, Part I.
  6. Translate postfix into infix. See Lab 10, Part II.
  7. Know how to write a basic algorithm using a Stack: Reverse the words in a sentence.
  8. Know the difference between a stack and a queue.