Advanced Placement Computer Science III Syllabus

Advanced Placement Computer Science III
Spring 2010


Course: CS323
URL:http://www.asms.net/facultymanaged/lilly/PlacementIII.html
Instructor: Dr. Albert Lilly, Ph.D. in Computer and Information Sciences from UAB, M.S. in Computer Science from UA
Course
    Description:
Topics include programming methodology, software engineering, blocks, data types, control structures, methods, recursion, text files, arrays, encapsulation, inheritance, polymorphism, data abstraction, searching algorithms, sorting algorithms and the AP case study. This course targets juniors or seniors with a 'B' or above average. Students are expected to take the AP Computer Science Exam in the spring. Prerequisites: Java 1/3-3/3.
Textbooks: Introduction to Programming Using Java, Version 5.0.1, May 2007 by David J. Eck
AP Computer Science: The Grid World Case Study by The Advanced Placement Program: The College Board
References: College Board Online: AP Computer Science by The Advanced Placement Program: The College Board
Grading  scale: 90 - 100 A
80 -   89 B
70 -   79 C
** -   69 D
** Lower limit of D and upper limit of F are at the discretion of the instructor
Weights:          Classwork and homework
Exams
20%
80%
                         
Absences
    and tardies:
Students are expected to attend class and exhibit a positive attitude. Ten percent will be deducted for work, including a test, that is late if unexcused. For each set of three unexcused absences, a student will lose six points from the final grade. Excused absences are sickness approved by the nurse or other reasons approved by the instructor ahead of time. Unexcused time away from class (either arriving late or leaving class without permission) will be recorded. Each 55 minutes of accumulated unexcused time will count as one unexcused absence for the purpose of deducting six points from the final grade. Students cannot come in outside of class to make up an unexcused absence.
Office hours: Monday: 3:30 p.m. to 4:30 p.m.; Tuesday, Wednesday, Thursday, and Friday: 9:00 a.m. to 10:00 a.m.; or by appointment



Tentative Schedule

Week 1: Sequential search, binary search, relative efficiency of searches

Week 2: Selection sort

Week 3: Insertion sort

Week 4: Mergesort
Test I

Week 5: Recursion revisited

Week 6: Encapsulation, inheritance, polymorphism, and data abstraction revisited

Week 7: Matrices

Week 8: Review

Week 9: Selected Topics

Week 10: Selected Topics
Test II

Week 11: Selected Topics