CS 143 - Java Programming II

Credits: 5
Variable Credit Course: No

Lecture Hours: 55
Lab Hours: 0
Worksite/Clinical Hours: 0
Other Hours (LIA/Internships): 0

Course Description: This course is a continuation of CS 142. The successful student will be able to read and write Java code containing recursion and abstract data types (ADTs) such as stacks, queues, linked lists, binary trees, lists, sets and maps. Students will utilize OOP concepts such as encapsulation, inheritance, interfaces and polymorphism while implementing data structures themselves, or using components from the Java Collections Framework.

Prerequisite: CS 142 with a grade of C or higher; and either MATH 099 with a grade of C or higher (or placement into MATH& 141).
Meets FQE Requirement: No
Elective Requirements: Fulfills Academic Electives
Integrative Experience Requirement: No

Student Learning Outcomes

Read and write Java code containing dynamic memory allocation.
Read and write recursive Java code.
Read and write Java code that uses data abstraction and encapsulation to process stacks, queues, linked lists and binary trees.
Read, write, and perform complexity analysis of sorts, searches, and other algorithms.

Course Contents

Data abstraction and encapsulation including stacks, queues, linked lists and binary trees.
Recursion.
Algorithm analysis.
Searching and sorting.

Instructional Units: 5