CMSC132 Midterm #2

Date: Wednesday, November 9, 2005

Time/Location: Carefully read the following table to find the room and time associated with your exam.

Section	Time	Room
0101 and 0102 (Chau-Wen's Sections)	During your assigned lab session	Usual Lab Room
0201 and 0202 (Nelson's sections)	1:00 pm - 1:50 pm	CSI 1115
Honor Section	4:00 pm - 4:50 pm	Usual Lab Room

Regarding Wednesday's lecture:

• There will be lecture the day of the exam. 
• Chau-Wen's lecture will take place at 10 am as usual. 
• Nelson's lecture will take place in lab session (after the exam).
• Students in the honor section will attend lecture at 2pm in the usual lab room.   

Exam Structure

• The exam will have a duration of 50 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 for example, multiple choice, True/False and fill-in-the-blank type questions.
• Code analysis questions: We will give a short segment of code and 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 including the following topics:

• Networking
  • Networking fundamentals (e.g., sockets, URL, client/server model)
  • You do not need to memorize any Java Networking methods, just recognize how to use them.
• Files and Streams
  • You should be prepared to implement code that opens a text file and reads the file contents using a Scanner class.
  • You should be prepared to implement code that writes to a text file strings, integers and doubles.
  • No binary files for the exam.
• Asymptotic Analysis
• Debugging
• Generics
• Recursion
• Linear Data Structures
  • Singly linked lists
  • Doubly linked lists
  • Stacks
  • Queues
  • Circular lists
• Trees
  • Binary Trees
  • Binary Search Trees
• Maps
• Heaps
• Priority Queues
• Hashing
• Specific Java Topics
  • You do not need to memorize any methods associated with the interfaces/classes defined by the Java Collections Framework, however, you should be familiar with the examples provided in class, and should be able to use the classes during the implementation of a problem solution.   For example, how to use a TreeMap to solve a particular problem.

The exam will NOT cover the following topics::

• GUI Design or any Swing methods associated with GUI design.

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 solution for practice questions