CS 162 Introduction to Computer Science II
Covers software engineering principles, basic data structures, and abstract data types including arrays, strings, lists, and others. Introduces the analysis of algorithms run-time complexity as well as algorithm testing and verification. Explores sorting and searching techniques. Expands the areas of graphical user interfaces event-driven programming introduced in CS 161. Covers polymorphism, inheritance, recursion, and exception handling.
Prerequisite
Prerequisite: CS 161 Introduction to Computer Science I (Java) with a grade of C or better.
Notes
Lower Division Transfer (LDT) Course
General Education Requirements
AAOT Science/Math Non Lab,
Outcomes
Upon successful completion of this course, students will be able to:
Write and debug object-oriented code using class dependencies of aggregation and inheritance. Write object-oriented code that includes the use of two-dimensional collections of data and objects. Demonstrate the use of various layout managers and listeners in an event-driven programming paradigm. Demonstrate the use of polymorphism through inheritance and draw Unified Modeling Language (UML) diagrams of class hierarchies. Write code to sort and search one-dimensional collections. Write code that detects and handles exceptions. Demonstrate an understanding of recursion, contrast it to iteration, and select the best approach for a given problem.