SOUTH PUGET SOUND

hundredcarriageΛογισμικό & κατασκευή λογ/κού

3 Νοε 2013 (πριν από 3 χρόνια και 9 μήνες)

80 εμφανίσεις




SOUTH PUGET SOUND

COMMUNITY COLLEGE


T
ITLE
:


Object
-
Oriented Programming II

D
EPT
:

CS

N
O
.

143

C
REDITS

5



COURSE
OUTLINE


COURSE DESCRIPTION:

Apply object
-
oriented concepts in the design and programming phases of
application development. Includes graphical user interfaces, event
-
driven programming, recursive techniques, and
simple data structures.



Prerequisite:

CS 142.



I.

I
NSTRUCTIONAL
R
ESOURCES
:

A.

Text and/or learning resources will be selected appropriate to course content. Refer to individual
professor’s syllabus for details.

II.

S
TUDENT LEARNING OUTC
OMES
:


Upon completion of the course, the student will be able

to:

A.

Develop graphical user interfaces using Java’s AWT and Swing packages
.

B.

Draw graphical shapes using Java’s Graphics 2D package
.

C.

Use multiple
-
dimension arrays
.

D.

Use recursive algorithms
.

E.

Demonstrate knowledge of ADT (Abstract Data Types) and collections
.

F.

Demonstrate knowledge of sorting and searching data (Array List)
.

G.

Demonstrate knowledge of linked lists (single and doubly)
.

H.

Demonstrate knowledge of SLL implementation stack
.


III.

C
OLLEGE
-
WIDE ABILITIES
:

A.

Evaluate and process quantitative and symbolic da
ta.


IV.

C
OURSE CONTENT
:

A.

GUI (Graphical User Interface)
:

a.

AWT Package (Abstract Windowing Toolkit)
.

i.

Keyboard and mouse events
.

ii.

Components, actions, layouts
.

b.

Swing
:

i.


Swing overview
.

ii.


The Root Pane Container model
.

iii.


Swing components
.

iv.


Other swing topics
.

v.


Building a GUI with a swing
.

c.

Event
-
Handling
:

i.


Event model
.

ii.


Listeners
.

B.

Java Graphics 2D
:

a.

Graphics coordinate system
.

b.

Drawing shapes
.

c.

Borders and fill
.

d.

Colors and fonts
.

C.

Multi
-
dimensional arrays
:

a.

2D arrays
.

b.

Ragged arrays
.




SOUTH PUGET SOUND

COMMUNITY COLLEGE


T
ITLE
:


Object
-
Oriented Programming II

D
EPT
:

CS

N
O
.

143

C
REDITS

5


c.

Accessing and manipulating arra
ys
.

D.

Recursion
:

a.

Recursive functions
.

b.

Recursion or iteration?

E.

ADT (Abstract Data Types)
:

a.

What is a collection
?

b.

Collections framework
.

c.

Benefits of a collections framework
.

F.

Searching and sorting
:

a.

Binary search
.

b.

A
rrayList class
.

c.

Sorting algorithms
.

d.

Accumulating

sorted data
.

G.

Linked lists
:

a.

Linked list class
.

b.

Single/doubly linked lists
.

c.

Nodes
.

d.

Adding/deleting nodes
.

e.

T
raversing nodes in the list
.

H.

Stacks
:

a.


LIFO data structure
.

b.

Implement
ing a stack using a linked list.


V.

E
VALUATION
:

A.

The student

will earn a letter grade based on a combination of written examinations, labs and
programming assignments