Course Syllabus
(2005 Spring Semester, Mar – June)
Course Title: Java Programming
Course No: COMP313X Contact Hours: 3 Credit Hours: 3
Course No: COMP313XL Contact Hours: 2 Credit Hours: 1
Course Instructor: Dr.
E-mail Address: [email protected]
Web Site: http://eclipse.fre.devry.edu/~glai or http://www.gegcities/com/grg_lai
Lecture Hours: Tuesdays
Saturdays
Lab Hours Tuesdays 7:30pm to 9:20pm
Office Hours Tuesdays, Fridays
Mondays, Fridays
Course Description
This course helps students to develop problem-solving skills and to solve problems using Java
programming language. Students are introduced to fundamentals of Java programming with emphasis
on
primitive data types, control structures, functions and arrays. At the completion of this course,
students will be able to write simple computer programs using control
statements (if, if/else, switch),
and
repetition statements (for, while, and do while). Emphasis is placed on interfacing with
networks
and network devices. (Prerequisite: COMP140)
The course is taught through three lectures and one 2-hour lab session each week. The lectures
cover the programming concepts and the labs are designed to support the lectures and to give
students hands-on programming practice.
Course
Goals
Upon successful completion of this course, students will be able to understand fundamentals of Java
Programming and gain practical skills to solve programs using Java language.
Part I Java
Program, and Java Development Tools (JDK & JBuilder8)
1. Given a hardcopy of a Java program, demonstrate how to create a Java source code, compile, and
execute the program using JDK and JBuilder8 software tools.
2. Given a set of input variables, design and write a Java program to compute numeric results using
all arithmetic operators.
Part II Use of Control Structures
3. Given a problem that requires simple logic with multiple conditions, write a Java program
using the control structure statements to solve the problem.
4. Given a program specification requiring the use of repetition control structures (while, do/while),
design and write program that will employ appropriate looping constructs.
5. Given a simple problem that requires selection from different options, write a Java program
using multiple-selection structure (switch with break and continue) to solve the problem.
6. Given a simple program containing a simple function, compare and contrast its main
features.
7. Given an application program using several functions that requires parameter passing
between
multiple functions; compare and contrast the different types of functions.
Part IV Arrays
8.
Given a group of
numeric variables of the same type in a program specification, design and
write
programs that use a one-dimensional array.
9.
Given a group of numeric
variables of the same type in a program specification, design and
write programs that
use a two-dimensional array.
10. Given a group of strings or
numeric variables that is listed in a file, design and write
a program to store the
information in an array and do a search of a KEY or do a sort
of the stored information.
|
Week |
Topics |
TCO's |
Reading |
Lab |
Due |
|
1 |
Java development
tools |
1 |
Ch 1, 2 |
# 1 |
Week 1 |
|
2 |
Mathematical
manipulations |
2 |
Ch 3, 4,5 |
# 2 |
Week 2 |
|
2 |
Making Decisions |
3 |
Ch 5 |
# 3 |
Week 2 |
|
3 |
Switch |
5 |
Ch 6 |
# 4 |
Week 3 |
|
3 |
For Loop |
4 |
Ch 7 |
# 5 |
Week 3 |
|
4 |
While and
Do While |
4 |
Ch 7 |
# 6 |
Week 4 |
|
4 |
Review and Midterm |
1 - 5 |
Ch 1 - 7 |
Examples |
-- |
|
5 |
Functions/Methods |
6, 7 |
Ch 8 |
# 7 |
Week 5 |
|
5 |
Application using
functions |
6, 7 |
Ch 9 |
# 8 |
Week 5 |
|
6 |
Arrays |
8, 9 |
Ch10 |
# 9 |
Week 6 |
|
6 |
Searching and
Sorting Arrays |
8, 9 |
Ch 11 |
# 10 |
Week 6 |
|
7 |
Sequence File
Operations |
10 |
Ch 12 |
#11 |
Week 7 |
|
7 |
Data Base
Operations |
10 |
Ch 13 |
#12 |
Week 7 |
|
8 |
Review |
1-10 |
All Ch |
-- |
Tuesday |
|
8 |
Final |
|
|
|
Saturday |
Julia
Bradley & Anita Millspaugh
Programming with Java
ISBN
0-07-248819-0
McGraw-Hill
Higher Education
One Zip
Disk Storage Device or One USB Storage Device
Grading Policy
Quizzes
& Examinations 50%
Lab
Work 20%
Final 30%
A for 90%
- 100%
B for 80% - 89%
C for 70% - 79%
D for 60% - 69%
F for < 60%
Attendance / Class
Participation
According to DeVry policy, each student is required to attend every lecture in the course. If a student
misses a lecture, then it is the responsibility of the student to determine what work was missed.
Be aware that some exam material may come from lectures,
in-class assignments, and class discussion
that is not covered in your text. You are responsible for notifying your instructor of planned absences,
and for fulfilling course requirements missed during an absence.
Working with your classmates to discuss and solve the homework is strongly encouraged. However,
the submitted solutions must be your own work, using your own words. Academic misconduct
(i.e. cheating, plagiarism, etc.) will NOT be tolerated with regards to labs, homework assignments, and quizzes
or exams during the course! If a student violates the academic integrity policy by gaining advantage over
others through unfair means, he or she will earn a non-pass grade. All students are expected to follow
the academic honesty policy.
What IS cheating?
What is NOT cheating?
find logical
and/or syntactical bugs/errors in their program.
Student Academic Integrity Policy
All
students are expected to follow the academic honesty. Academic honesty is violated when students
gain advantage over
other students through unfair means.
When
students violate the academic honesty, they get a non-passed grade.