CS2223 Algorithms 
Information about Exam 2 - B Term 2013

PROF. CAROLINA RUIZ 

In class, Dec. 3, 2013  

Exam Instructions:

• "Cheat sheet": You can have your own 8.5"x11" piece of paper with your notes on both sides during the exam. Other notes, books, calculators, computers, cell phones, ... won't be allowed.

• Topics covered by this Exam:

  • This exam is cumulative. It includes all the topics covered since the beginning of the term EXCEPT for dynamic programming. Although the exam is cumulative, more emphasis will be placed on divide-and-conquer and recurrences.

  • Textbook chapters and sections included in the exam:
    • Chapter 1: all sections.
    • Chapter 2: all sections.
    • Chapter 3: all sections, except for small-oh and small-w notations.
    • Chapter 4: all sections.
    • Chapter 7: sections 7.1-7.3.

  • Lecture topics and resources.
    Study closely all the resources posted on the course Lecture Notes webpage for the following topics (included slides, handouts, solutions to previous exams and homework assignments):
    • Introduction
    • Algorithms - Design and Analysis
    • Growth of Functions
    • Sorting
    • Divide and Conquer

  • This term's HW2 Solutions

  • This term's HW3 Solutions

• Take advantage of the numerous office hours before the exam.

• Needless to say, this will be an individual exam. No collaboration will be allowed.

• Remember to show your work and explain your answers. Correct answers without complete explanations won't receive full credit. Incorrect answers with explanations may receive some partial credit.