Students who successfully complete this course will have solved problems and written programs that

• require decomposing a problem into smaller problems, and integrating solutions to smaller problems into a solution for the given problem using sequential or concurrent (threads) approaches

• use primitive data types and strings, as well as standard operations on primitives and strings

• use if, switch, while, for, and do-while statements

• use single- and multi-dimensional (array of arrays) arrays

• define and use classes, objects, methods, constructors, overloaded methods, interfaces, inheritance, and overridden methods

• use exception handling

• use graphical user interfaces, action listeners, frames, panels, and layout managers

• use text file I/O

• implement linear and binary searches and insertion and bubble sorts

• use stacks, queues, and linked lists (optional, might not be covered)
  

• understand recursion (optional or might not be covered)

[Items in green were covered in the class during fall 2010 and those in red could not be covered.]

Last update: August 22, 2011