I.

Bucks County Community College

Math, Science, and Technology Department

CISC213 --­ Computer Science III

Summer 2013

 

II.

Instructor: Dr. Stuart P. Brian

Home Phone: 215-244-0983

e-mail: brians@bucks.edu

web page: faculty.bucks.edu/brians

 

Section E31 - Online

 

Office Hours:

 

My office hour will be online.  If you find that you are having difficulty, please do not hesitate to call me at the number above to set up a meeting with me.

 

III. Copy of official course syllabus:

 

I.            Course Number and Title:

CISC213 Computer Science III (Java)

II.           Number of Credits:

4 credits

III.         Minimum Number of Instructional Minutes Per Semester:

3000 minutes

IV.         Prerequisites:

CISC122 (C or better)

Corequisites:

None

V.          Other Pertinent Information:

Students will be evaluated via test results and problem solving. Evaluation will include: writing, testing, and documentation of complete programs. There will be at least 2 one-hour proctored examinations. The laboratory grade will be comprised of no more than one-third of the course grade.

VI.         Catalog Course Description:

This course is a continuation of Computer Science II. This course will apply object-oriented and software engineering techniques to the design and implementation of programs that manipulate complex data structures. Topics include recursion, stacks, queues, linked lists, hash tables, trees.

VII.        Required Course Content and Direction:

A.         Learning Goals:

The student will be able to:

1.        solve problems using complex data structures;

 

2.        design programs that demonstrate understanding of fundamental computing algorithms; and

 

3.        practice basic principles of software engineering for designing and implementing programs with emphasis on algorithm analysis and top-down design using good programming style and documentation.

B.         Planned Sequence of Topics and/or Learning Activities:

1.        Inheritance and polymorphism

2.        Recursion

3.        Array-based lists

4.        Stack

5.        Queues

6.        Sorting algorithms

7.        Binary trees

8.        Hash tables

9.        Graphs

10.     Collections

11.     Algorithmic analysis and strategies

12.     Software engineering

C.         Assessment Methods for Core Learning Goals:

This course is not in the Core.

Course-specific learning goals will be evaluated via test results and problem solving including writing, testing, and documentation of complete programs.

D.         Reference, Resource, or Learning Materials to be used by Students:

Departmentally selected textbook. Details provided by the instructor of each course section. See course format.

VIII.      Teaching Methods Employed:

At least 2 hours each week will be devoted to the presentation of course material and special projects in a classroom setting. Collaborative work will be encouraged. The remaining time will be used for laboratory exercises and assignments.

Review/Approval Date - 5/06

 

IV. Textbook:

 

Data Structures & Algorithms in Java, 2nd edition, by Robert LaforeSams, 2003, ISBN 0-672-32453-9.

 

Additional Java programming book to use as a reference.

 

V. Assignments

 

There will be approximately 12 lab-programming assignments given and discussed during class meetings as well as various written assignments.  Labs must be submitted at the beginning of the following class session with the proper documentation.  They will be due the following week.  Assignments will not be accepted late unless previous arrangements have been made.

 

Programs and output are to be printed out and handed in. Each page you turn in must have your name on it.  Programming assignments are to be completed by you alone and are to be submitted on time.  You are required to submit your program on time.  It is not required that your program run properly.  If you program is not running, write an explanation of what it is doing wrong.  If your output appears to be wrong, say so.

 

To get full credit for a program, the program must contain complete documentation, be able to run to completion and give the proper printed output.  Any program that cannot meet these three major requirements will be accessed a minimum of 10% penalty.

 

VI. Technology to be used in this class

 

The course will be taught using Sun Microsystems Java.  Students may use the IDE of their choice.

 

VII. Testing/Grading Procedures

 

A. Quizzes

 

There will be a short quiz at the beginning of each class session on the work covered the preceding week.  If you are absent, upon your return you should be prepared to take the quiz you missed as well as the quiz scheduled for that date.

 

B.  Examinations

 

There will be two one-hour examinations.  These will be announced at least one week in advance.  See the course outline for approximate dates.  Make-up exams will not be given unless there are extenuating circumstances.  If you cannot be present for a scheduled examination, please contact me before the examination for possible recourse or alternatives.

 

C.  Lab projects

 

There will be approximately 12 lab programming assignments given and discussed during class meetings.  Labs must be submitted at the beginning of the following class session with the proper documentation.

You must be able to present you lab projects and be able to discuss them upon request.

 

D.  Final Grade

 

Your final grade will be determined as follows:

 

Weekly quizzes                                   10%

Exams                                                  40%                            

Programming Assignments                 50%

                                                            ----

Total                                                  100%

 

 

IX. Attendance Policy and Withdrawal Information:

 

Since the subject matter in this course is cumulative, attendance is required and will be taken at each class meeting.  Frequent absence may adversely affect your learning and your grade. Absences should be used only for emergencies or illnesses. If you are absent please telephone or email me to inform me of your status in the course and to request any class handouts and assignments to be mailed to you. If you are absent for more than 4 class meetings during the semester, then a grade of F will be assigned.

 

If you should find it necessary to withdraw from this course, the college policy states that:

 

The last day you may withdraw from class is Monday, July 15.  You must fill out the appropriate form at the Admissions Office.  A grade of W will be assigned.

 

After the above date you may not withdraw from this course.   If you stop coming to class and do not complete the course requirements a grade of F must be assigned.

 

Until Monday, July 8, your instructor may withdraw you from the class if you are excessively absent.  For this purpose excessive absence is defined as follows: If you are absent from four or more class meetings prior to mid­-semester, you will be withdrawn from the class by the instructor.

 

 

X.     Disability Accommodations

 

In compliance with the Bucks County Community College policy and equal access laws, appropriate academic accommodations can be made for students eligible for such support.  Students are encouraged to register with the Disability Services Office (215-968-8463) to verify their eligibility for appropriate accommodations.  Please speak to your instructor about any requests for academic accommodations or other concerns as early in the semester as possible.

 

XI. Cheating and Plagiarism

 

The expectation at Bucks County Community College is that the principles of truth and honesty will be rigorously followed in all academic endeavors.  This assumes that all work will be done by the person who purports to do the work without unauthorized aids.  In addition, when making use of language and some idea not his or her own, whether quoting them directly or paraphrasing them into his or her own words, the student must attribute the source of the material in some standard form, such as naming the source in the text or offering a footnote. (Source: BCCC Catalog, College Policy Regarding Cheating and Plagiarism)

 

XI. Student’s Responsibility to Retain Course Materials

 

Students are always responsible for retaining copies of their own work and/or correspondence, including that posted to a web course space.  Student access to a Bucks County Community College web course space is available only during the stated semester/session as indicated by the College’s academic calendar.  All web course sites, including content, are routinely removed form the server at the conclusion of each semester/session.

 

XII. Study Requirements

 

A student should devote at least two hours a week outside of class for each hour in class (of which there are 3 1/2).

 

You will not be able to complete laboratory assignments during class time (closed lab time).  Additional use of a computer will be required.  There should be a closed/open lab schedule posted at the computer center. 

 

XIII. Excessive Absence

 

If you are absent more than four (4) classes during the semester, a grade of ‘F’ shall be given.

 

XIV. Student Responsibility

 

It is your responsibility to read the pages listed on the course outline above for the week assigned.  If you have any questions about the material please ask me.  If you are absent, the class will go on without you. You should obtain class notes from a classmate. 

 

Each student is to have a course notebook which is to be neatly organized by date and present at all class meetings.  You should carry with you all course documents, notes, and graded quizzes.  You will need a flash drive to store your programs.  The java programs on your flash drive must be available upon request.

 

Students have the right to review and the responsibility to retain a copy of all returned graded material.  If there are any questions on the final grade, you must be able to produce this material.

 

XV. Course Outline

 

The course will follow the plan given below.  This is a plan; therefore it is subject to change.  If any changes occur, you will be notified in the class meetings.  Please read the chapters before the week on which they are indicated.

           

Tentative Schedule:

Week   Date                             Activity                                    Chapter                        Lab Due

 

1          5/28/13                      Overview and Arrays                           1, 2     

           

 

2          6/03/13                       Simple Sorting                                      3                      2

                                                                                   

           

3          6/10/13                      Stacks and Queues                                4                      3

           

                                                           

4          6/17/13                        Linked Lists                                        5                      4

           

           

5          6/24/13                                 Recursion                                            6                      5

           

           

6          7/1/13                      Advanced Sorting                                7                      6

 

           

7          7/8/13                       Binary Trees (Exam 1 due)                          8                   7

 

                                          Red – Black  Trees                                  9                      

 

           

8                 7/15/13                    2-3-4 Trees and External Storage          10                        8

 

 

9           7/22/13                    Hash Tables                                          11                    10

 

           

10        7/29/13                     Heaps                                                    12                    11

              

 

11        8/05/13                     Graphs                                                   13                    12

 

           

12        8/12/13                     Weighted graphs                                   14                    13

 

                                

            8/15/13                    When to use what                                  15                    14

                                                      

           

EXAM 2 due                                                                               

                       

All work must be in by August 15