|
Prerequisite |
CS1073 |
|||
|
|
||||
|
Lecture |
T Th |
|
|
|
|
Tutorial |
T 11:30 a.m. in GWD124 |
|
|
|
|
Instructor |
P. Pochec |
|
|
|
|
|
||||
|
Textbook |
JAVA, JAVA, JAVA: Object-Oriented Problem Solving, by Ralph Morelli, 3rd edition, Prentice Hall, 2006 |
|||
|
Course Web Site |
Additional course information, including the assignments, is made available via Blackboard |
|||
|
|
||||
|
Marking Scheme |
20% - Assignments |
|||
|
|
||||
|
Assignments |
The assignments will focus on the development of several small software modules, meant to illustrate the concepts covered in the lectures and/or in the text. Each assignment must have a signed cover page stapled to it. A blank CS1083 cover page is provided via the assignments web page; complete this cover page and attach it to every assignment. What you pass in must be your own work. Students are not to discuss assignment solutions with one another prior to the assignment due date; all questions should be directed to the course instructors or Java Lab assistants. Incidents of plagiarism and other academic offences will be reported. |
|||
|
|
||||
|
Midterm Exam |
The midterm test will take place on |
|||
|
|
||||
|
Final Exam |
The final exam will be scheduled by the Registrar's Office. It will also be a closed book exam. Note: You must pass the final exam to receive a course grade exceeding D. |
|||
|
|
|
|||
|
Computing resources |
LINUX workstations are available in ITD415 and GWC112. |
|
||
|
Extra Help |
Scheduled tutorials: the goal of CS1083 tutorials is to review the topics presented in class, and answer questions. No new topics will be presented during tutorials. Student lab assistants will also be "on duty" in IT-D415 during selected times to answer questions regarding Java, Emacs, Linux, etc. Their job is NOT to do your assignments for you. They will not simply give you the answers; instead, they will assist you in overcoming stumbling blocks along the way. Student consultants are also available at the ITS Help Desk (H-D11) to help you with technical problems (e.g. printer problems in the ITS labs, etc.) These consultants are NOT there to answer questions regarding your assignments. |
|
||
PLAGIARISM
(from pages 44-45 of 2005-2006 Undergraduate Calendar (also in 2008 Calendar)
Plagiarism includes: $1. quoting verbatim or almost verbatim from a source
(such as copyrighted material, notes, letters, business entries, computer
materials, etc.) without acknowledgment; $2. adopting someone else's line of
thought, argument, arrangement, or supporting evidence (such as, for example,
statistics, bibliographies, etc.) without indicating such dependence; $3.
submitting someone else's work, in whatever form (film, workbook, artwork,
computer materials, etc.) without acknowledgment; $4. knowingly representing as
one's own work any idea of another. NOTE: In courses which include group work,
the instructor must define and warn against plagiarism in group work. Unless an
act of plagiarism is identified clearly with an individual student or students,
a penalty may be imposed on all members of the group. Penalties for Deliberate
Plagiarism. In a case of deliberate plagiarism, the penalties are: First
Offence: If the student does not appeal, or if, on appeal, the Committee
upholds the instructor's decision: $1. A notation will be placed on the
student's transcript of academic record concerning the academic offence. The
length of time the notation appears on the student's transcript of academic
record is to be decided when the penalty is imposed and will depend on the
severity of the offence. $2. The student may be required to submit a
satisfactory and genuine piece of work to replace the one involving plagiarism.
If the assignment is not resubmitted or is unsatisfactory, the student will
receive a grade of F (zero) in the course. NOTE: If this penalty is assessed,
the period of time allowed for the submission of the work will be determined by
the Registrar in consultation with the faculty member making the charge, and,
where appropriate, the Committee. $3. The student will receive a grade of F
(zero) on the piece of work and, depending on the severity of the offence, may
receive a grade of F for the course. $4. Other penalties as outlined in
penalties for Other Academic Offences may be imposed. Subsequent Offence: In
cases where the Committee considers that the student has plagiarized again: $1.
The student will receive a grade of F in the course and a notation of the
academic offence will appear on the student's transcript of record. The length
of time the notation appears on the student's transcript of academic record is
to be decided when the penalty is imposed. $2. Other penalties as outlined in
penalties for Other Academic Offence may be imposed. For further information on
procedures for dealing with cases of plagiarism, students should refer to the
regulations found on pages 44-45 of the 2005-2006 Undergraduate Calendar.
Tentative Lecture Schedule
|
Week |
Week Of |
Topics |
Readings |
|
1 |
Sept. 8 |
OO programming overview |
Ch 0 - 9 |
|
2 |
Sept. 15 |
Array processing review:
searching and counting; algorithmic complexity |
Ch 9 |
|
3 |
Sept. 22 |
Error handling and robust
program design, exceptions |
Ch 10 |
|
4 |
Sept. 29 |
Files and streams |
Ch 11 |
|
5 |
Oct. 6 |
Focus on recursion |
Ch 12 |
|
6 |
Oct. 13 |
GUI programming |
Ch 13 |
|
7 |
Oct. 20 |
Threads, interface
responsiveness |
Ch 14 |
|
8 |
Oct. 27 |
Networking: client server
communication |
Ch 15 |
|
9 |
Nov. 3 |
Review 1, midterm test |
Ch 0 - 14 |
|
10 |
Nov. 10 |
Elements of data
structures: linked lists |
Ch 16 |
|
11 |
Nov. 17 |
Stacks, queues |
|
|
12 |
Nov. 24 |
Trees |
|
|
13 |
Dec. 1 |
Review 2 |
Review Ch 0 - 16
(inclusive) |
Note: The above lecture schedule is tentative. Instructors reserve the right to make modifications at any time.