Department of Computer
Science
CS152
Computer
Science II
Spring 2007 Syllabus
READ THIS SYLLABUS CAREFULLY. YOU ARE RESPONSIBLE FOR KNOWING THIS
INFORMATION!
Prerequisite: CS 151 and MATH 152 (formerly MATH 122).
Course Description: Computer
Science II
Further topics in
object-oriented programming: (tree structure of classes, inheritance,
polymorphism), GUI (Graphical User Interface), Event-driven programming,
Elementary searching and sorting techniques, Introduction to software
engineering, Recursion.
Instructor: Irena
Pevac
Phone: 832-2721
Email: pevac at ccsu.edu
Office: MS219
Office Hours: MW
TR
Textbooks:
2.
Irena
Pevac: Recursive Examples in
Java XanEdu OriginalWorks
2006
http://xanedu.proquest.com/originalworks/Prevac
Topics Covered:
Week 1
·
Review of arrays.
·
Arrays of Objects.
·
Two-dimensional arrays.
·
Dynamic arrays. ArrayList
class.
·
Introduction to BlueJ.
·
Assignments:
o
Review
Chapter 7.
o
Download, install and study BlueJ (www.bluej.org)
Week 2
·
Inheritance. Creating subclasses and class
hierarchies.
·
Overriding methods.
·
Interfaces. The Comparable Interface.
·
Abstract methods and classes.
·
Assignments:
o
Review
Chapter 6 and 7 (pay special attention to sections 6.5 and 6.6)
o
Study
Chapter 8 (except for sections 8.7 and 8.8)
Week 3
·
Late binding.
·
Polymorphism (via inheritance).
·
Polymorphism (via interfaces).
o
Assignment:
Study sections 9.1 – 9.3.
Week 4
·
Sorting arrays of objects.
·
The sorting problem: selection, insertion and bubble
sorts.
·
The
searching problem: linear and binary searches.
·
Assignments:
o
Study
sections 9.4 and 9.5.
o
Week 5
·
Recursive
programming.
·
Recursion
versus iteration.
·
Recursion
with integers
·
Recursion
with array
o
Study
Chapters 1-3 from textbook 2.
Week 6
·
Recursion
in graphics.
·
Recursive
methods
·
Assignments:
o
Study
Chapter 6 from textbook 2.
o
Study
sections 11.1 – 11.3 from textbook1.
Week 7
·
Examples
of recursive binary searching and sorting.
·
Assignments:
o
Study
sections 11.4.
o
Review
Chapters 8, 9 and 10.
Week 8
·
Introduction
to graphics.
·
Writing
simple applets.
·
GUI
containers: frames and panels.
·
Writing
GUI applications.
·
Assignments:
o
Study
sections 2.7 – 2.9.
o
Study
sections 3.9 - 3.11.
The last day to withdraw from a course
is
Week 9
·
Graphical
objects: buttons and text fields.
·
Event
driven programming.
·
More
GUI objects: dialog boxes, check boxes, and radio buttons.
·
Assignments:
o
Study
sections 4.5 – 4.9.
o
Study
sections 5.9 – 5.12.
Week 10
·
Advanced
GUI design.
·
Layout
managers.
·
Containment
hierarchies.
·
Assignments:
o
Study
sections 6.10 – 6.13
Week 11
·
Polygons
and polylines.
·
Assigmenent
·
Study
section 7.8
Week 12
·
Mouse
events and key events.
·
Assignment:
o
Study
sections 7.9 – 7.10.
Week 13
·
Extending
adapter classes.
·
Timer
class.
·
Event
processing and polymorphism.
·
File
choosers, color choosers.
·
Assignment:
o Study Sections 8.7, 8.8, 9.6 – 9.10.
Week 14
·
Exceptions
and exception handling.
·
The
try-catch statement.
·
Assignment:
o Study Chapter 10.
Week 15
·
Introduction
to Software Engineering.
·
Software
development models.
·
Introduction
to data structures.
·
Summary
and Review.
Tests: There will be three tests
during the semester and a final exam. All tests are cumulative.
Class Meeting Times:
MW
Course Requirements: Three tests, five projects.
“A general rule for
any college course is that you are expected to put in at least 2 hours of work
outside of class for every hour in class.” For
this course, the expectation is at least 6 hours per week outside of class.
University Policies:
1. You
must take the final examination at the time specified in the course selection
book.
2. If you need course adaptations or
accommodations because of a disability, if you have emergency medical information
to share with me, or if you need special arrangements in case the building must
be evacuated, please make an appointment with me as soon as possible.
3. In the
event of a weather emergency which requires curtailment or cancellation of
classes, listen to WTIC (1080 AM) or call (860) 832-3333 for the “general snow
message.”
4. The
last day to withdraw from a course is
After
5. You are responsible for understanding and abiding by the
University’s policy on academic integrity.
Information on the policy may be found at http://www.ccsu.edu/AcademicIntegrity/. This policy is rigorously enforced by the
Department of Mathematical Sciences.
Resources Available:
1. If you need help, take advantage of your
instructor's office hours. Do not wait
until just before the first test to do so.
2. The Computer Club meets regularly in MS 314.
Free tutoring is often available from Club members as well as from UPE members. A schedule for hours the MS 314 lab is open
will be posted soon after the beginning of the semester.
3. Form a study group with other students in
your section. Explaining and discussing solutions
to homework problems and projects with each other is a good way to learn.
Copying code from others is strongly prohibited.
4. Check with the department secretary in MS 206, phone 860.832.2710 for names of possible tutors for
hire.
Evaluation
The
average for the course will be based on the following weights: 10 points for
each of the three tests, 20 points for the final exam, 10
points for each of the five projects. Minimum
averages have been established for each of these grades:
A 94% A– 90% B+ 87% B 83% B– 80% C+ 77% C 73% C– 70% D+ 67% D 63% D– 60%
Schedule for tests, projects and final exam
|
CS152
TEST DATES |
PROJECTS DUE |
|
Test#1
|
P1 02-08- 2007 10 points P2 |
|
Test#2
|
P3 P4 |
|
Test#3
|
P5
|
|
Final exam |