Jeff Martens's IS 247 & Java Page
Spring 2016 we are using a new text: Java Foundations:
Introduction to Program Design and Data Structures, third
edition, by John Lewis, Peter J. DePasquale, and Joseph Chase. The
publisher's page is here.
For More Practice:
IS 247 is a three credit course, so students are expected to spend
6-9 hours per week on IS 247 outside of class. This means reading
the text, reviewing the notes, doing the assignments, and,
especially, programming. To do well most students will have to
spend more time programming than is afforded by graded
CodingBat has an excellent
set of interactive exercises in
section. Especially worth some effort are the recursion
exercises, corresponding to Lewis, DePasquale, and Chase et
al. chapter 17.
- The lecture notes have many examples that can be run,
- The lecture notes often suggest extra programming
- The Liang text has exercises with answers online; see
A good source for extra practice is David
to Programming Using Java, 6th edition. At the end of
each chapter Eck has a chapter quiz, with answers, and related
programming exercises with sample solutions.
- Code examples from the lecture notes
are here, organized by chapter.
on answering a common type of test question.
- A brief introduction to space and time complexity
- Some tests and quizzes from past
semesters. These may or may not resemble those given
in any other semester, including this semester.
- For-each, Arrays, and
and Working Code
the difference? How are they related?
- WhereAmI.java is a quick
little ditty to display the current working directory. It
illustrates use of a static method from
System class, provides a static method that
can be called from elsewhere to get a process's current
working directory, or can be run from a GUI IDE to determine
the current working directory in that environment. This is the
intended primary use: when writing Java programs that perform
file I/O, knowing the current working directory often
simplifies matters. Often, the IDE hides this from the
student, making this tool useful.
Sometimes it is useful to know how long it takes to run a
piece of code. I have a brief discussion of this and a simple
A visualization explaining and comparing
quick and bubble sorts.
- In Dance (attributed to Sapientia U, Romania)
- In Sound