Students who successfully complete this course will have solved problems and written programs that [items in green have been covered in the class and those in red could not be covered]

  • 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
  • understand recursion (not covered in depth)


Last update: December 11, 2010 [Classes have ended]