- CS 239 – Java II (3)
- Prerequisites: Math 108, CS 238. This course covers the fundamentals of algorithms and object oriented software development. Topics include: primitive and reference data types, encapsulation, information hiding, selection, iteration, functions/methods, parameters, recursion, exception handling, generic linear data structures (arrays, records/structs) and maps, file types, file I/O, simple GUIs with event handling, programming to an interface, lambda expressions, semantics of inheritance and use of polymorphism, relation with subtyping, search, select and sort algorithms, complexity notation, documentation using standard tools, program testing (unit testing) and debugging, and reasoning about control flow in a program.