CSCI 3333 (Fall 2011)

Review for the final exam

A. To prepare for the exam, use the lecture notes as study guides, and ensure that you truly understand the covered topics.

1. Review thoroughly the following topics.

a. Basic concepts of data structures and algorithm analysis, big-Oh, little-Oh, Big-Omega, Big-Theta

b. Linked Lists, Stacks, Queues, Trees, Binary Search Trees

c. Recursions (and Recursive traces), Tree Traversals, conversion between recursive and iterative methods

d. Algorithm analysis of various data structures and methods

e. Intro. to software engineering (This is the short topic that I intended to but did not get to cover in the last class due to lack of time. It should only take a few minutes for you to review the concepts. Feel free to ask if you’ve got any questions concerning the slides.)

f. Hashing

g. Sorting

2. Review labs 1 through 6.

3. Review the in-class exercises.

4. Review related sample programs available at http://sceweb.sce.uhcl.edu/yang/teaching/JavaProgrammingExamplesandRelatedTopics.htm.

5. Use the chapter-end exercises to assess your own preparation.

6. Here’s a sample exam: CSCI3333-spring2011-final.doc

B. Types of questions –

a) Fill in the blanks

b) Tracing the execution and screen output of programs or program segments

c) Definition of simple Java classes and methods