Course Description

An overview of abstract data types, multidimensional arrays and records, sets and strings, binary files, searching and sorting, introductory algorithm analysis, recursion, pointers and linked lists, software engineering concepts, and dynamic data structures.

Course Objectives

These objectives are directed toward the following general education expected outcomes of the college:

1. Analytical and Critical-Thinking Skills: Students should be able to reason and the think analytically in solving problems and making decisions.

2. Mathematical Skills: Students should be able to understand and apply fundamental mathematical concepts in solving problems.

3. Communication Skills: Students should be able to read and listen with understanding and to communicate clearly and effectively in writing and speaking.

4. Information Technology Skills: Students should be able to appropriately use computer software in solving various problems and accomplishing various tasks.

Upon completion of CSCI 1302, students should have an understanding of:

1. Software engineering principles including algorithm analysis, and data abstraction.

2. Linear data structures including vectors, linked lists, stacks and queues.

3. Recursion and recursive data structures including trees and graphs.

4. More powerful sorting and searching methods.

Prerequisite

CSCI 1301

Required Textbook

Object Oriented Data Structures Using Java. D. S. Nell Dale, Daniel T. Joyce, and Chip Weems. (2002). Jones and Bartlett Computer Science, Sudbury, MA.

Grading

Item Percentage

Projects/major assignments 55%

Three one-hour tests 20%

Final exam 25%

Projects/major assignments will be completed outside of class and must be your own work. There will be one or more projects for certain units during the semester. These assignments will include computer programs, quizzes (both announced and unannounced), and possibly exercises from the textbook. All projects are due at the beginning of the class period on the date due. Late projects will not be accepted except in the case of an extreme emergency, which must be documented with a note or phone call. Late projects will receive only 55% of the credited points. No project will be accepted more than one class period past the due date for any reason.

Requirements for submitting assignments

All assignments should include the student's name, student id number, course and section number, and date due.

For computer programs, I will not need for you to turn in your diskette, but will require both a printout of the program code, and a printout of the program output. Your program source code should be placed in your folder on the Gordon College network. No assignments will be accepted via email.

Tests

There will be three one-hour tests during the course of the semester. Tests start at the beginning of class and may not be rescheduled or made up if missed excepting extreme emergencies. Late students may not be permitted to enter the classroom. The test grades will together account for 20% of your class grade. All tests are required and none can be dropped.

Final Exam

There will be a comprehensive final examination at our scheduled final examination period in our regular classroom. This final examination accounts for 25% of your course grade.

Missed Tests

Normally, makeup tests will be given only in the cases of illness, a death or serious illness in the immediate family, or a similar extreme emergency. Students may be asked to produce written documentation in support of their request (e.g. a note from the doctor or supervisor).

Extra Credit Policies

This course already involves a substantial workload, and it is the instructor's philosophy that students need to focus on the work already assigned rather than taking on additional work. Therefore, there will be no extra credit assignments offered.

Grading Scale

Letter grades for the course are based on a standard 100-point grading scale, with 90-100 = A, 80-89 = B, 70-79 = C, 60-69 = D, below 60 = F.

Absence Policy

Regular attendance is the most critical factor in your success in this class. You are expected to attend all classes and examinations as scheduled. A students wishing to withdraw from class, whether before or after midpoint, must withdraw themselves by submitting their own withdrawal form to the Registrar's office. Before the midpoint, students withdrawing from the course will receive a "W". After the midpoint, students withdrawing from the class will receive a grade of "WF".

Students are responsible for every instruction, every change in the syllabus, and all material covered in class whether or not they are present. Students who enroll in the course late are responsible for material covered before they enrolled.

Classroom Etiquette: Students are expected to treat the instructor and other students with respect. Please refrain from the following during class time:

Talking with other students (other than during classroom or group activities).
Leaving class early (other than an emergency).
Leaving the desk to sharpen a pencil in the middle of a lecture.
Consistently late coming to class.
Pagers beeping during class.
Placing or receiving cellular phone calls during class.

Computer Lab Facilities

For your assignments, you may use the Gordon College writing lab facilities in the academic building room 109 or the computer facilities in the Library at any time that the lab facilities are open. All students are expected to familiarize themselves with the posted lab rules and regulations

Note that the labs exist only to provide access to the college's computer facilities for all students. The labs do NOT provide tutorial assistance with your coursework. The lab staff is responsible for keeping the computer hardware and software functioning properly and monitoring lab usage, not for helping you with your assignments. Although the lab assistants will try to answer your questions about using the computer system, they are not familiar with your assignments, and many of them do not know the materials we are working with. If you are having trouble with an assignment, you need to call or visit me for help.

If you have your own computer at home or work, with appropriate software available, you may certainly use that computer for your assignments.

Academic Integrity Policy

Cheating and/or plagiarism in this class is not tolerated. Students are expected to adhere to the Academic Dishonesty Policy in the Gordon College Academic Catalog. Examples of academic dishonesty involving computers include, but are not limited to:

a. submitting the programs, documentation, or program results of another person as your own;

b. obtaining or attempting to obtain unauthorized access to information stored in electronic form;

c. submitting false results of a program's output for a class assignment or falsifying the results of

program execution for the purpose of improving a grade.

All assignments for this course are to be substantially the work of the individual student whose name appears on the submitted assignment, unless the assignment is specifically indicated, in writing, as being a group assignment. It is your responsibility to ensure that you submit the correct work.

Students are permitted to discuss assignments with one another and assist one another with minor problems as they work on assignments. However, each student is to develop their individual problem analysis and algorithm, and write and test their own program. This allows you to consult with and assist one another as you work on assignments, though your final product is to be your own work. In working on your assignments, you should be extremely careful about giving another student a copy (preliminary or final) of your work or showing another student your work, as this leaves both of you open to a charge of plagiarism.

Any instances of two or more individuals turning in assignments which are identical, either in form or logic, will be regarded as cheating unless either:

1.The logic and structure used in a program is so obvious and straightforward

that it is expected that most students would use this logic in this program, or

2.The logic and structure used in a program follows that of any sample algorithm

for the assignment handed out by the instructor.

Tentative Course Schedule – CSCI 1302, Spring 2010

WEEK DATE CHAPTER TOPICS

1 01/11 5 Introduction, Syllabus, Warm-Up Program

2 01/18 6 Arrays, Olympic Diver Program

3 01/25 6 Multidimensional Arrays, Matrix Program

4 02/01 6 Multidimensional Arrays, Matrix Program

5 02/08 7 Inheritance, Programming Project #1, page 462

6 02/15 chapters 6, & 7 Test 1, and Polymorphism and Abstract Classes pp. 468 - 485

7 02/22 8 Polymorphism and Abstract Classes pp. 486 - 500

8 03/01 9 Exception Handling pp. 508 – 528, 532-551

8 03/04 Thurs. Midterm – last day to withdraw with a grade of W

8 03/08 chapters 8 & 9 Test 2

9 03/15 Spring Break for faculty and students

10 03/22 10 File I/O pp. 562 – 573 and pp. 574-594

11 03/29 10 File I/O pp. 595 - 624

12 04/05 11 Recursion pp. 634 – 646, and pp. 646-662

13 04/12 15 Linked Data Structures pp. 784 - 806

14 04/19 15 Linked Data Structures pp. 784 - 806

15 04/26 Chapters 10, 11, 15 Test 3

15 05/03 Last Day of Class, finish up

This schedule is subject to change. Students are responsible for being aware of any and all changes.

Important Dates:

Final Examination: CSCI 1302: as scheduled

Midterm, last day to withdraw with a grade of W – Thursday March 4, 2010

Spring Break – March 15 – March 19, 2010