CMSC132 Final

Date: Friday, December 16, 2005

Time/Location:

4-6pm, Martin Hall (EGR) Room 1202

Exam Structure

• The exam will have a duration of 110 minutes.
• The exam will be closed book/closed notebooks. No calculators are allowed. (We recommend using a pencil and eraser, rather than a pen.)
• Format:
• Short answer questions: This includes multiple choice, True/False, and fill-in-the-blank type questions.
• Short essay questions: This includes questions requiring 1 or 2 sentence answers.
• Problem solving questions: This includes questions requiring you drawing figures such as UML diagrams, tables of values, trees, graphs, etc.
• Code analysis questions: Given a short segment of code, you may be asked to identify syntax and logical errors, generate code output, etc.
• Code Writing: Write a program/code snippets to solve a few given problems. (You should be prepared to give a complete program, including full class heading, import, package statement, and main methods, but we may also ask you to provide just a single method or a code fragment.)

Topics

The exam will include all the material covered in discussion session (lab), lecture, quizzes, and homeworks from the entire semester, including the following topics :

• All topics from Midterm #1 & #2
• Graph algorithms
• Compression
• Huffman trees
• Indexed trees
• Advanced trees
• Regular expressions
• Multithreading in Java
• Synchronization in Java
• Design patterns
• Sorting algorithms
• Algorithm strategies

Readings From Tymann/Schneider

You are not responsible for material from Tymann/Schneider that has not been discussed in lecture and or lab, but it is a good idea to review this material and the exercises in the back of each chapter, since this will provide you with a more complete understanding of the material. 

Practice Material

• Practice questions
• Partial solutions for practice questions