FINAL EXAM INFORMATION CS116 SPRING 2017

Time and Place Section – 01 (10:00 a.m. class) Exam. Date: TUESDAY , MAY 2 10:30 a.m. – 12:30 p.M. Room: SB108

Time and Place Section – 02 (11:25 a.m. class) Exam. Date: MONDAY , MAY 1 10:30 a.m. – 12:30 p.m. Room: SB108

Time and Place Section – 03 (1:50 P.m. class) Exam. Date: WEDNESDAY , MAY 3 8:00 a.m. – 10:00 a.m. Room: SB108

TAs TAs are required to show up at the designated times for the exams.

Final Exam -Topics INHERITANCE / ABSTRACT CLASSES POLYMORPHISM/INTERFACES/MULTIPLE INHERITANCE ERROR HANDLING USING EXCEPTIONS I/O USING STREAMS (open files for reading/writing) Text files Binary data Serializable Objects RECURSION

TEXT CHAPTERS COVERED Chapter 10 Chapter 11 Chapter 13

Lectures Notes Lecture 8 Lecture 9 Lecture 10 Lecture 11 Lecture 12

Labs & Exercises Concepts from Labs: 5,6,7,8,9 Extra Credit Exercises 5, 6,7, 8

Exam Format Closed Book /Closed Notes It is worth 30 points Write programs independent of each other. The programs utilize one or more of the concepts listed in previous slides. You don’t have to memorize the sorting algorithm. Learn the binary search recursive implementation or other recursive algorithms as taught.

Suggestions Emphasis will be on: Inheritance principles. Writing serializable objects into a file and reading serializable objects from a file. Writing text into a file and reading text from a file. Writing binary formatted data into a file and reading it from the file. How to handle exceptions (Error Handling). Creating your own exception class and using it in another program. Recursion

EXAM RULES USE THE COMPUTER STATION (NOT A LAPTOP). ONLY OPEN APPLICATIONS ALLOWED: NOTEPAD++ DOS PANE DO NOT BRING FLASH DRIVE TO CLASS!!!! DO NOT EMAIL! DURING THE TEST!! DO NOT USE THE INTERNET DURING THE TEST! IF ANY OF THE ABOVE IS VIOLATED YOU COULD RECEIVE A ZERO FOR THE EXAM. AND FINAL GRADE FOR THE COURSE!