Skagit Valley College logo

EMERGENCY NOTIFICATION

Friday, December 9, 10:10 am

All SVC locations are open with normal operations, with the exception of the Marine Technology Center in Anacortes. The Marine Technology Center in Anacortes is closed today.

×

Catalog Course Search Details

 Course Title:   Java Programming II

 Title Abbreviation:   JAVA PROGRAMMING II

 Department:    CS

 Course #:    143

 Credits:    5

 Variable:     No

 IUs:    5

 CIP:    110201

 EPC:    515

 REV:    2014


 Course Description  

Continuation of CS 142. Concepts of data abstraction and encapsulation including stacks, queues, linked lists, binary trees, and recursion.

 Prerequisite  

Prerequisite: CS 142 or Permission of Instructor

Additional Course Details

Contact Hours (based on 11 week quarter)

Lecture: 55

Lab: 0

Other: 0

Systems: 0

Clinical: 0


Intent: Distribution Requirement(s) Status:  

Academic Elective  

Equivalencies At Other Institutions

Other Institution Equivalencies Table
Institution Course # Remarks
U of Ws CSE 143

Learning Outcomes

After completing this course, the student will be able to:

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

General Education Learning Values & Outcomes

Revised August 2008 and affects outlines for 2008 year 1 and later.

3. Communication

Definition: Understanding and producing effective written, spoken, visual, and non-verbal communication.

Outcomes: Students will be able to . . .
3.6 Recognize, comprehend, and use visual communication appropriate to a given context.

8. Mathematical Reasoning

Definition: Understanding and applying concepts of mathematics and logical reasoning in a variety of contexts, both academic and non-academic.

Outcomes: Students will be able to . . .
8.2 Correctly apply logical reasoning and mathematical principles to solve problems.

Course Contents

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