1. OBJECT ORIENTED PROGRAMMING II GEORGE KOUTSOGIANNAKIS
CS 201
OBJECT ORIENTED PROGRAMMING II
EXAM # 3 INFORMATION
GEORGE KOUTSOGIANNAKIS
Copyright: Illinois Institute of Technology/George Koutsogiannakis

2. Midterm Examination When: Monday November 7.
Where: Your regular classroom.
Duration: 15 minutes extra tim3 will be provided at the end (up to 12:55 pm).
The service class will be provided but the packaging has to be added.

3. READ TEXT CHAPTERS
CHAPTER 7 UP TO SECTION 7.15 (PAGE 439)-USER DEFINED CLASSES
CHAPTER 8 –SINGLE DIMENTIONAL ARRAYS
INCLUDES SEARCHING AND SORTING ALGORITHMS
CHAPTER 9-MULTIDIMENTIONAL ARRAYS
CHAPTER 10-INHERITANCE/ABSTRACT CLASSES AND METHODS.

4. READ PRESENTATION SLIDES
CONCENTRATE ON THE CONCEPTS OUTLINED IN LECTURES:
LECTURE 13_1
LECTURE 13_2
LECTURE 13_4
LECTURE 14
LECTURE 15
LECTURE 16
LECTURE 17

5. Labs
Lab 4
Lab 5
Lab 6

6. TOPICS Service classes (template classes).
Client classes to service classes.
Packaging and the corresponding packaging DOS commands for compiling and interpreting.
StringTokenizer class
Using the scanner to read input from keyboard or from a text file.
Using Vectors.

7. Topics Using arrays and arrays of objects. Using Enumerations.
Using Multidimensional arrays.
ArrayList class. Using ArrayList to store data.
Selection Sort. Know how to do it by sorting either arrays or ArrayLists or Vectors.
Binary Search. Know how to do it using Arrays/ArrayLists/Vectors

8. Topics Basic concept of Inheritance.
Know the concept of super class and subclasses and how the inheritance tree can be used by a client.

9. TYPES OF QUESTIONS PROGRAMMING EXERCISE s CLOSED BOOK CLOSED NOTES
CAN USE THE COMPUTER ONLY TO TYPE SOURCE CODE ON A TEXT EDITOR AND COMPILE/INTERPRET.
USE NOTEPAD ++ AND DOS WINDOWS ONLY ON THE COMPUTER STATION .

10. TYPES OF QUESTIONS
REQUIRES USAGE OF DATA STRUCTURE STUDIED THUS FAR (ARRAYS, MULTIDIMENTIONAL ARRAYS, ARRAYLIST, VECTORS)
KNOW HOW TO PROGRAM THE SELECTION SORT ALGORITHM AND THE BINARY SEARCH ALGORITHM IN ARRAYS AND ARRAYLISTS AND VECTORS.
PROGRAMMING A SIMPLE SUPERCLASS , A SIMPLE SUBCLASS AND A CLIENT.

11. WHAT TO EXPECT QUESTION 1: QUESTION 2 :
A PROGRAMMING EXERCISE. THE SERVICE CLASS CODE WILL BE PROVIDED. YOU WILL HAVE TO ADD THE PACKAGING ONLY AND COMPILE IT.
YOU WILL HAVE TO WRITE THE CLIENT CLASS FOR IT THAT WILL INVOLVE HELPER METHODS FOR SORTING AND BINARY SEARCH OF A DATA STRUCTURE (PROBABLY OTHER THAN ARRAYS).
QUESTION 2 :
A SIMPLE SUPER CLASS AND SUBCLASS RELATIONSHIPS PROGRAM

12. HOW TO PROGRAM FOR THE TEST TECHNIQUES
IF YOU HAVE TROUBLE MEMORIZING THE PROGRMMING TECHNIQUES:
CHOOSE A PROGRAM THAT INCLUDES MOST OF THE CONCEPTS DISCUSSED , KEEP WORKING ON THE SAME PROGRAM MULTIPLE TIMES UNTIL YOU CAN DO IT WITHOUT LOOKING AT THE ANSWERS.

13. SUBMISSION INSTRUCTIONS
UPLOAD SOURCE CODE AND COMPILED FILES ON BLAKBOARD ON FOLDER “MIDTERM EXAM”.
ZIP (DO NOT RAR) AND NAME ZIP FILE AS midterm_yourfirstname_yourlastname.zip