ÍÃ×ÓÏÈÉú

Catalog description:

Review of sequence, selection, and iteration. The design and implementation of software using object-oriented programming techniques including inheritance, polymorphism, object persistence, and overloading. Students will analyze program specifications and identify appropriate data types, objects, and classes. Additional programming topics include dynamic memory, recursion, searching and sorting, using existing object libraries, and binary and text file processing.

Prerequisite:

CSE 174 with a grade of C- or above

Learning Outcomes:

• Design and implement computer programs using object oriented programming techniques.
  • Implement a class definition from a given design that incorporates primitive types, 3rd party classes, accessor and mutator methods, constructors, method overloading, static data and methods, and other methods for processing the object
  • Describe object-oriented programming concepts including objects, classes, methods, abstraction, encapsulation, inheritance, and polymorphism
  • Use class libraries to assist in problem solving
  • Write programs that use inheritance, polymorphism, composition, abstract classes, and interfaces
  • Write programs that use collection classes (e.g., HashMap, Set, ArrayList) and iterators
  • Write basic UML class diagrams based on a problem statement
  • Break a programming problem down into an appropriate set of classes, and identify appropriate methods for each class
  • Research and use classes not studied in the course to solve programming problems
• Write robust programs
  • Resolve compilation errors, validate program input, use the debugger to locate logic errors, and generate basic test cases as learned in CSE 174
  • Use the JUnit tool, and write JUnit tests to test the correctness of class implementations
  • Use Git to manage source code
  • Use Javadoc to document a class
  • Write code that throws and catches appropriate exception classes, including both checked and unchecked exceptions
• Use permanent storage to preserve the state of a program
• Use recursion as a problem solving technique
  • Analyze and trace recursive algorithms
  • Identify problem situations where recursion is appropriate
  • Implement recursive algorithms that implement numeric computations (such as factorial), arrays, and strings
• Describe and implement sorting algorithms
  • Review non-recursive sorting algorithms including such as bubble sort, insertion sort, and selection sort
  • Describe and implement recursive sorting algorithms including mergesort and quicksort algorithms
  • Compare sorting algorithms with respect to efficiency