ࡱ> @ )9bjbjצצ ()144445g666666663g5g5g5g5g5g5g$hiRk|YgvB66vBvBYg66ngEEEvB663gEvB3gEE_a66 t[p4(CvG`7eg0g_`\6lC6l0a6la|6:Ev=D?666YgYg13DE3AP Computer Science AB Syllabus Course Overview [C1] AP Computer Science A and AP Computer Science AB are taught in the same classroom. Because of the requirements and the dynamics of our school and state, most students cannot afford time in their schedule to take two years of computer science. A typical class usually consists of 15 25 students and on average 3 5 students take the course for two years. Students who enter these courses may or may not have any prior programming experience. Both courses are taught using Java as the programming language. All students have their own copy of each textbook and resource book listed below. The content and objectives of the AP Computer Science AB course includes the course objectives for AP Computer Science A and AB as discussed in the AP Computer Science Course Description. The content and objectives of the AP Computer Science A course also includes a few AP Computer Science AB topics. Many of my students attend an in-state university which only accepts credit for the AP Computer Science AB course, so it is necessary for me to provide all AP Computer Science A and AB topics over a one year time frame. Developing, interpreting, and implementing both algorithms and classes are taught throughout every aspect of this course. Facilities All AP Computer Science classes are taught using both a classroom and a computer lab. The classroom is an interactive setting with an LCD projector and a Smarboard. The computer lab has 28 stations, CD-RW drives, and laser printers. Students are in the lab a minimum of 3 days a week using Java 5. The classroom lab, along with other school labs and media center facilities, is open to students before and after school and during their lunch period. Textbooks Koffman, Elliot B., Wolz, Ursula. Problem Solving with Java, 2nd edition. New York: Addison Wesley, 2002. Main, Michael. Data Structures and Other Objects Using Java, 2nd edition. New York: Addison Wesley, 2003. Resources Schram, Leon. Multiple-Choice and Free Response Questions in Preparation for the AP Computer Science (A and AB) Examination, 5th edition. D&S Marketing Systems, Inc., 2004. College Board. AP GridWorld Case Study. New York: College Entrance Examination Board, 2006. Jython Environment for Students (JES) Software,  HYPERLINK "http://coweb.cc.gatech.edu/mediaComp-plan/94" http://coweb.cc.gatech.edu/mediaComp-plan/94. AP Central: Computer Science AB Quick Reference Guide. Course Outline [C2] 1st SemesterWeek 1 [C8] [C9]Introduction to Programming and Problem Solving Explore number systems and data storage Binary, octal, hexadecimal systems Overflow, integer boundaries, floating-point representations, and round-off errors Overview of Computer Components Hardware and software components and relationships (old vs. current) Computer generations, anatomy of memory, storage devices Operating systems and compilers Applying computer software development and high-level languages Professional ethics for computer programmers (ethical, social, and legal) Reading: Koffman, Chapter 1 Main, Chapter 1 Assignment: Each student will study the schools web policy and report on examples of incidents about how computer piracy, ethical, social, or legal issues surrounding computers have impacted society. Students will report their finding in a Powerpoint (or Flash) presentation to the class.Weeks 2 3 [C4] [C5] [C6]Basic Java Syntax and Introduction to Classes Goals of software development Development Life Cycle models Fundamentals of algorithm analysis and development Declaring primitive data types Processing numeric data Writing mathematical formulas in Java Constant declarations Introduction of the String Class and the Math Class Differentiation between object and primitive declarations Input/output methods in Java JOptionPane, system.out.print/println Anatomy of a program Error handling (Compile time, run-time, and logic errors) Introduction to Big Oh notation for basic algorithms Reading: Koffman, Chapter 2 Assignments: Koffman, p. 50 (1 6), p. 91 (1 2), p. 96 (1) Programs: Koffman, p. 102 (1,4,6,7)Weeks 4 6 [C3] [C4] [C5]Control Structures Boolean Algebra (Truth Tables) Sequential, conditional, iteration algorithms Boolean variables Relational and Boolean operators Short-circuit evaluation DeMorgans Theorem Character comparison (ASCII code) Comparison of primitive vs. objects Decisions and loops if, if-else, switch, while, for, for-each Increment/decrement operators State and counter controlled loops Loop errors (identify/correct segments) Exception and error handling Reading: Koffman, Chapter 4 Assignments: Koffman, p. 262 (1 14) Schram, Chapter 1,2 Programs: Koffman, p. 266 (1,5,7,8)Weeks 7 10 [C6]Introduction to Object Oriented Design The main objective of this unit is to specify a problem, decompose the problem into classes and identify responsibilities and relationships among those classes. We will also design and implement a set of interacting classes as well as design an interface. Assignment of class hierarchy and definitions Method definitions (pre-conditions/post-conditions) Constructor methods/accessor methods/mutator methods Void/value-returning methods Class methods/instance methods Method parameters/Pass by value concept Inheritance hierarchy (is-a, subclass, superclass) Composition of classes (has-a) Interfaces/Extending a class Abstract classes Method overloading/overriding Polymorphism Reading: Koffman, Chapter 3, 6 Main, Chapters 2, 13 Assignments: Koffman, p. 175 (1 10), p. 434 (1 10) Main, p. 686 (1 16), Schram, Chapter 8 Programs: Interpret a pre-existing class (understand purpose and goals) Understand class hierarchy by adding methods to a class and creating client code. Design a set of interacting classes based on a model that is encountered in everyday life. Main, p. 97 (8, 9) - Quadratics Design and use an abstract class as well as an interface (Geometric Figures) 3 full programs: Define a problem and create an interface and a class for Bank Account, Complex Numbers, and Rational Numbers.Week 11 [C4] [C5] [C6] [C7]GridWorld Case Study (Outline and Overview) Discuss the Grid Interface Familiarize students with the basic structure of the case study Discuss testing and write new classes to emphasize inheritance Assignments/Programs: Explore purpose of GridWorld and Bug Variations through assignments that modify existing code Reading: Case Study Part 1, 2Week 12 [C3] [C6]Other Java Topics (including some Java Library Classes) Object Class String Class Math Class Random Class Integer Class Double Class Comparable Interface Exception Handling Reading: Koffman, Chapter 5 (337 340) Assignments: Schram, Chapters 4 and 5 Programs: Lab assignments using each of the classes discussed in this unit.Weeks 13 14 [C4] [C5] [C6]Arrays and the ArrayList Class Students now begin to really explore an abstract data type. They concentrate on when to use specific algorithms and data structures depending on the problem or task being solved, discuss collection concepts and terms, and decide when to implement a specific ADT. Declaring arrays, storage allocation Array index/finding the length of an array Traversals/insertions/deletions/iterators Operations with whole arrays Loop invariants Array of objects Multi-dimensional arrays (nested loops) Writing methods using 2-D arrays Declaring/creating an ArrayList ArrayList methods Looping through an ArrayList ArrayList/Wrapper Classes Exception Handling (revisited) Reading: Koffman, Chapter 5 Main, Chapter 3, GridWorld Chapter 3 Assignments: Koffman, p. 350(1 11) Schram, Chapters 3, 6 Develop algorithms for GridWorld classes and interfaces Programs: Koffman, p. 353 (1,2,8,10), The Game of Nim Main, p. 163 (9), GridWorld Jumper ActivityWeek 15 [C4] [C5] [C6] [C7GridWorld Case Study (continued) Discuss Interacting Objects Critters and their behavior Extending the critter class Assignments/Programs: Various assignments and code segments to explore the behavior of the classes and how they interact with one another Reading: Case Study Part 4Week 16 [C4] [C5]Introduction to Recursion Develop algorithms for recursive methods Properties of recursive problems Recursion of mathematical models Tracing a call to a recursive method Recursively tracing arrays Change iterative code into recursive code Reading: Koffman, Chapter 9 Main, Chapter 8 Assignments: Koffman, p. 586 (1 4) Schram, Chapters 7, 9 Programs: Main, p. 430 (6) greatest common divisor factorial Fibonacci sequence Towers of HanoiWeeks 17 18Semester Review Semester Exams2nd SemesterWeek 1 2 [C4] [C5] [C6]Linked Lists and the LinkedList Class Build a Linked List using the ListNode Class Perform basic operations such as inserting/deleting nodes and traversing a List LinkedList compared to ArrayList Doubly Linked Lists Circular Linked Lists LinkedList Class methods The List Interface/List methods The Iterator Interface/Iterator methods The ListIterator Interface/ListIterator methods Exception handling within this data structure Reading: Koffman, Chapter 10 (623 635) Main, Chapter 4 Assignment: Koffman, p. 634 (1 3), p. 671 (1 11) Schram, Chapter 11 Programs: Koffman, p. 635 (1), p. 676 (12) Main, p. 238 (6, 14)Week 3 [C4] [C5] Stacks and Queues Examine stack, queue, and priority queue processing Define stack and queue abstract data types Compare stack and queue implementations Discuss common uses for implementing the stack and queue algorithms (applications for using stacks and queues) Explore implementations of a stack and queue ADT (array and linked list) Reading: Koffman, Chapter 10 (636 649) Main, Chapters 6, 7 Assignments: Koffman, p. 643 (1 4), p. 649 (1 4) Schram, Chapter 10 Programs: Koffman, p. 649 (1) Main, p. 340 (4), p. 386 (1)Week 4 [C4] [C5]The Set Interface The Set Interface methods HashSet/TreeSet classes The Map Interface (methods) HashMap/TreeMap classes Discuss all collection classes with respect to sets Reading: Main, Chapter 5 Assignments: Schram, Chapter 13 Programs: Main, p. 297 (8)Weeks 5 8 [C4]Trees Terminology Binary Search Trees (BST) Insertions/deletions in a BST Pre-order/post-order/in-order traversals Revisit recursion as it applies to BST BST class TreeNode class Heaps Exception Handling (wrap-up) Review of Set, Map, TreeSet, TreeMap concepts Reading: Koffman, Chapter 10 (649 665) Main, Chapter 9, 10 Assignments: Main, p. 545 (1 14), Schram, Chapter 12 Programs: Code all three traversals, Koffman, p. 665 (3) Main, p. 498 (1), p. 547 (2)Week 9 [C4] [C5] [C6]Big-Oh Analysis Review Complexity analysis of algorithms is mentioned throughout each topic but this unit is used to pull the total concept together. Worst-case/average-case/best-case time and space analysis of all algorithms studied Counting how many statements are executed Estimating how many statements are executed Combining estimates Multiplicative loops Dangers of overestimation Assignments: Complete comparison diagram of all algorithms and their Big Oh analysis Schram, Chapter 14 Week 10 11 [C4] [C5] [C6]Searching and Sorting Searching Algorithms Sequential search (iterative/recursive) Binary search (iterative/recursive) Hashing/Hash Functions Sorting Algorithms Selection sort Insertion sort Merge sort Quick sort Heap sort Recursion algorithms are discussed as they apply to the above concepts. Performance of each searching and sorting techniques (Big-Oh) Reading: Main, Chapter 11, 12 Assignments: Main, p. 585 (1 8), p. 635 (1 9) Programs: Main, p. 588 (2), p. 636 (3)Weeks 12 14 [C7]GridWorld Case Study Data structure implementation of the case study Reading: GridWorld Case Study, Part 5 Assignments/Programs: Practice questions and program segments to understand the unbounded and bounded environments, Big-Oh discussion on GridWorldWeek 15 17 AP Exam Review (2004,2005,2006 exams) Practice multiple choice and free response questions.Week 18Semester Review Semester Exams !"16789EMju. / > O x 8 ! G c d Ķ񥘋~qch=.%ha6OJQJ^Jh=.%hJOJQJ^Jh=.%hP&0OJQJ^Jh=.%hOJQJ^Jh=.%haOJQJ^J h=.%haCJOJQJ^JaJh=.%h]5OJQJ^Jh=.%hK5OJQJ^J h=.%hCJOJQJ^JaJh=.%h=.%5OJQJ^Jh=.%ha5OJQJ^J$!"89    @ab^gdpZ`gdD~gdpZ^gdlgdlgd)9 m s }     >KNٿ栒̿tbTC h=.%hlCJOJQJ^JaJh=.%hl5OJQJ^J#h=.%h*B*OJQJ^Jph'jh=.%h=.%OJQJU^J!jh=.%h=.%OJQJU^J h=.%h=.%CJOJQJ^JaJh=.%hpZOJQJ^Jh=.%h=.%6OJQJ^Jh=.%h=.%OJQJ^J1:XY!4FGHklmyǺǺLj~qd~qLjLjZǺMh=.%hJOJQJ^Jh^OJQJ^Jh=.%hD~OJQJ^Jh=.%h])OJQJ^Jh;(OJQJ^Jh=.%OJQJ^Jh=.%hKOJQJ^Jh=.%hKVF5OJQJ^Jh=.%h]OJQJ^Jh=.%hKVFOJQJ^Jh=.%h;(OJQJ^Jh=.%h }OJQJ^Jh=.%h }5H*OJQJ^Jh=.%h }5OJQJ^J1Y|uul $Ifgd;( & F$Ifgd;( $IfgdpZ $$Ifa$gdKVFgkd)$$Ifl,"" t0644 la 4mGHlmsnb $$Ifa$gdKVFzkdr$$Ifl0,"  t0644 la $Ifgd;( & F$Ifgd;( syz'F^&La01V $Ifgd & F$Ifgd $IfgdpZ $$Ifa$gdKVF$'aq/01VWcsµϨϨϨϞϑzm`Rmh=.%h55OJQJ^Jh=.%h]OJQJ^Jh=.%h5OJQJ^JhocOJQJ^Jh=.%hocOJQJ^Jh=.%h])OJQJ^JhOJQJ^Jh=.%hOJQJ^Jh=.%hJOJQJ^Jh=.%hKOJQJ^Jh^OJQJ^Jh^h^OJQJ^JhJ5OJQJ^Jh=.%hJ5OJQJ^JVW]cdsxxxxoofooo $Ifgd $IfgdpZ $$Ifa$gdKVFzkd$$Ifl0,"  t0644 la 2 )3<=>Z[\irٿٵ̨̇zzmm`Rh=.%h/z5OJQJ^Jh=.%h]OJQJ^Jh=.%h/zOJQJ^Jh=.%hD~OJQJ^Jh.OJQJ^Jh=.%h])OJQJ^JhTUOJQJ^Jh=.%hTUOJQJ^Jh^OJQJ^Jh=.%ha OJQJ^Jh=.%h.OJQJ^Jh=.%h}"wOJQJ^Jh=.%h5OJQJ^Jh=.%hOJQJ^J 2Tx =>[\ $Ifgd. & F$Ifgd}"w $IfgdpZ>rxxxxoboooo & F$Ifgd/z $IfgdpZ $$Ifa$gdKVFzkd0$$Ifl0,"  t0644 la  'fghj `aٵ٫ّّّّ}pcYch^OJQJ^Jh=.%hTUOJQJ^Jh=.%h)OJQJ^JhI OJQJ^JhD~OJQJ^Jh=.%hD~OJQJ^Jh=.%h])OJQJ^Jh/zOJQJ^Jh=.%hY{OJQJ^Jh?OJQJ^Jh=.%hKOJQJ^Jh=.%h/zOJQJ^Jh=.%h.5OJQJ^Jh^5OJQJ^J >]z'ghijvaN & F$IfgdpZ & F$Ifgd/z $Ifgd/z $IfgdpZa8 D M N O l 1!2!3!!!!!!!!!!!̿ٲvi\O\h=.%hjsOJQJ^Jh=.%h^OJQJ^Jh=.%hbOJQJ^Jh:OJQJ^Jh=.%h])OJQJ^JhdiOJQJ^Jh=.%hdiOJQJ^Jh=.%h:5OJQJ^Jh=.%h:OJQJ^Jh=.%h.OJQJ^Jh=.%h/zOJQJ^Jh=.%hY{OJQJ^Jh=.%h)OJQJ^Jh=.%hQOJQJ^JN O T W X l 2!3!xxxxooobY $Ifgd]) & F$Ifgddi $IfgdpZ $$Ifa$gdKVFzkd$$Ifl0,"  t0644 la 3!!!!!!!!!"!"."9"{oooo $$Ifa$gdKVFzkd$$Ifl0,"  t0644 la $IfgdpZ !!"""`"a"v"""""""""")#/#0#1#2#6#7#8#H#f#g#ֵ֛֛̿֎ttgYKh=.%h:5OJQJ^Jh=.%hb5OJQJ^Jh=.%h,sOJQJ^Jh=.%hjsOJQJ^Jh=.%h:OJQJ^Jh=.%hbOJQJ^Jh=.%hQOJQJ^Jh=.%h])OJQJ^Jh^OJQJ^Jh=.%h^OJQJ^Jh^OJQJ^Jh=.%h^OJQJ^Jh=.%h^5OJQJ^Jh=.%h=5OJQJ^J9"F"T"a"v""""""(#)#rzkdM$$Ifl0,"  t0644 la $Ifgd^ $IfgdpZ )#0#8#9#H#g#o$$$$%%'%O%p%%%%%%%)&M&N&t&& & F$Ifgdq $IfgdpZ $$Ifa$gdKVFg####n$o$$$%%%%&&&(&9&L&M&N&\&e&k&s&&&''''$'G'i''''¸ܞ}ܞ܇pfܞܞpYh=.%h:OJQJ^JhOJQJ^Jh=.%hOJQJ^Jh6OJQJ^Jh?OJQJ^Jh=.%h=OJQJ^Jh=.%hQOJQJ^Jh=.%h])OJQJ^JhTUOJQJ^Jh=.%hTUOJQJ^Jh=.%hbOJQJ^Jh=.%h6OJQJ^Jh^OJQJ^Jh=.%hqOJQJ^J"&&''G''''''''{oooof $Ifgdjs $$Ifa$gdKVFzkd$$Ifl0,"  t0644 la $IfgdpZ '''((((((((((()))))))))))* **G*S*d*i*j*m*s***xkxkkkk^h=.%hY{OJQJ^Jh=.%hm/ OJQJ^Jh=.%hI OJQJ^JhdiOJQJ^JhIOJQJ^Jh=.%hIOJQJ^Jh=.%heOJQJ^Jh=.%h,s5OJQJ^Jh=.%h,sOJQJ^Jh=.%h])OJQJ^JhjsOJQJ^Jh=.%hjs5OJQJ^Jh=.%hjsOJQJ^J$'''((((((((eYY $$Ifa$gdKVFzkd $$Ifl0,"  t0644 la $Ifgd]) & F$Ifgdjs $Ifgdjs (((()8)Y)~))))))*G*S*d*|**** & F$IfgdI $IfgdpZ $$Ifa$gdKVF******xxoo $IfgdpZ $$Ifa$gdKVFzkdj$$Ifl0,"  t0644 la*********+(+;+J+U+w+++++++,,,,,,,,--1-X-Y-Z-e-׺׺re[ree[rhc!OJQJ^Jh=.%hc!OJQJ^Jh=.%h])OJQJ^Jh=.%hdiOJQJ^JhdiOJQJ^Jh3IOJQJ^Jh=.%heOJQJ^Jh=.%h.:OJQJ^Jh=.%h3IOJQJ^Jh=.%h3I5H*OJQJ^Jh=.%h3I5OJQJ^Jh=.%hI5OJQJ^Jh=.%hIOJQJ^J#***x $$Ifa$gd3Izkd$$Ifl0,"  t0644 la*****+(+U+++++ ,),Q,, $Ifgd3I $$Ifa$gd3Igkd($$Ifl,"" t0644 la,,,,,,1-Y-Z-----{o $$Ifa$gd3Izkdq$$Ifl0,"  t0644 la $Ifgd3I e-n------------Z.[....//>/c/d/e/s/|/////////0'0˽ukuuauhOJQJ^Jh3IOJQJ^Jh=.%hOJQJ^Jh=.%hPOJQJ^Jh=.%h])OJQJ^JhdiOJQJ^Jh=.%heOJQJ^Jh9OJQJ^Jh=.%h3I5OJQJ^Jh=.%hP5OJQJ^Jh=.%h.:OJQJ^Jh=.%h3IOJQJ^Jh=.%hc!OJQJ^J#-----.3.\..//@/d/e/////0 $Ifgd3I $$Ifa$gd3I0000'090S0k000000xxxoooooooo $Ifgd3I $$Ifa$gd3Izkd$$Ifl0,"  t0644 la '080900000000001111,141:1<1?1A1F1G1Z1`11112E2µ̵vi\Oh=.%hTUOJQJ^Jh=.%heOJQJ^Jh=.%hY{OJQJ^Jh=.%h}M5OJQJ^Jh=.%h}MOJQJ^Jh3IOJQJ^Jh=.%hfbOJQJ^Jh=.%h3IOJQJ^Jh=.%h])OJQJ^JhdiOJQJ^JhhOJQJ^Jh=.%hhOJQJ^Jh=.%h3I5OJQJ^Jh=.%hh5OJQJ^J0011-1.141;1<1A1G1S1m1{oooo $$Ifa$gd3Izkd/$$Ifl0,"  t0644 la $Ifgd3I m11111112F2G2q22222 383 $Ifgd}M & F $Ifgde $Ifgd3IE2F2G2b2p2q22222222222 383>3?3N3O3P3h3i33333344;4<4444¸ܫܫܝuuuuukhWOJQJ^Jh=.%hWOJQJ^Jh=.%hOJQJ^Jh=.%h3I5OJQJ^Jh=.%h5OJQJ^Jh=.%hOJQJ^Jh3.OJQJ^Jh=.%h3.OJQJ^Jh=.%h}MOJQJ^Jh=.%h3IOJQJ^Jh=.%h])OJQJ^Jh}MOJQJ^J$8393>3@3A3P3i33<4f444xxxxoboooo & F $Ifgd $Ifgd3I $$Ifa$gd3Izkd$$Ifl0,"  t0644 la 4444 5I5v5w5|55555{oooo $$Ifa$gd3Izkd$$Ifl0,"  t0644 la $Ifgd3I 45"5s5}55555555555 66#6$6(666u666667777,7P7Q7R7]7y77Ϝυ{ndndnh3IOJQJ^Jh=.%h])OJQJ^Jh$4}OJQJ^Jh=.%hOJQJ^JhI OJQJ^Jh=.%hY{OJQJ^JhdiOJQJ^Jh=.%h3I5OJQJ^Jh=.%h$4}5OJQJ^Jh=.%h$4}OJQJ^Jh=.%h3IOJQJ^Jh?OJQJ^Jh=.%hfOJQJ^J$555 6#6$676F6U6`6k6u666677Q7R7z7 $Ifgd$4} $Ifgd & F$Ifgd$4} & F$Ifgd$4} $Ifgd3Iz7{77777777778xxxxoooooo $Ifgd3I $$Ifa$gd3IzkdL$$Ifl0,"  t0644 la 777777777777777 88888888888999'9(9ʽ晽ugYuuh=.%h5OJQJ^Jh=.%hM5OJQJ^Jh=.%hMOJQJ^Jh=.%h;uOJQJ^Jh3IOJQJ^Jh=.%hY{OJQJ^Jh=.%h])OJQJ^Jh)NOJQJ^Jh=.%h)NOJQJ^Jh=.%h3I5OJQJ^Jh=.%h)N5OJQJ^Jh=.%h3IOJQJ^Jh=.%ho OJQJ^J888888xxof $IfgdM $Ifgd3I $$Ifa$gd3Izkd$$Ifl0,"  t0644 la89999'9xxoo $Ifgd3I $$Ifa$gd3Izkd $$Ifl0,"  t0644 la'9(9)9gdpZzkdi$$Ifl0,"  t0644 la(9)9h=.%hKVFOJQJ^J&1h:p / =!"#$%)DyK -http://coweb.cc.gatech.edu/mediaComp-plan/94yK Zhttp://coweb.cc.gatech.edu/mediaComp-plan/94G$$If!vh5"#v":Vl t65"]$$If!vh5 5#v #v:Vl t65 5]$$If!vh5 5#v #v:Vl t65 5]$$If!vh5 5#v #v:Vl t65 5]$$If!vh5 5#v #v:Vl t65 5]$$If!vh5 5#v #v:Vl t65 5]$$If!vh5 5#v #v:Vl t65 5]$$If!vh5 5#v #v:Vl t65 5]$$If!vh5 5#v #v:Vl t65 5]$$If!vh5 5#v #v:Vl t65 5]$$If!vh5 5#v #v:Vl t65 5G$$If!vh5"#v":Vl t65"]$$If!vh5 5#v #v:Vl t65 5]$$If!vh5 5#v #v:Vl t65 5]$$If!vh5 5#v #v:Vl t65 5]$$If!vh5 5#v #v:Vl t65 5]$$If!vh5 5#v #v:Vl t65 5]$$If!vh5 5#v #v:Vl t65 5]$$If!vh5 5#v #v:Vl t65 5]$$If!vh5 5#v #v:Vl t65 5]$$If!vh5 5#v #v:Vl t65 5@@@ NormalCJ_HaJmH sH tH DA@D Default Paragraph FontRi@R  Table Normal4 l4a (k(No Listj@j KVF Table Grid7:V06U@6 =.% Hyperlink >*B*ph)1!"89 @ab$  1 Y | 4 m   G H l m s y z 'F^&La01VW]cds2Tx =>[\>r >]z'ghijvaNOTWXl23!.9FTav()089Hgo'Op)MNtG  !8!Y!~!!!!!!"G"S"d"|"""""""""""""""#(#U##### $)$Q$$$$$$$1%Y%Z%%%%%%%%%&3&\&&''@'d'e'''''(((('(9(S(k((((((())-).)4);)<)A)G)S)m)))))))*F*G*q***** +8+9+>+@+A+P+i++<,f,,,,,, -I-v-w-|------- .#.$.7.F.U.`.k.u....//Q/R/z/{//////////0000001111'1(1+1000000000000000000000000000000x000x000 000000000 0 00 0 0 0 0 0 0000 00000000000000 00 0000000000000000000000000 00000000000000000 0 0000000000000000000000 0 0 0 0 0 0  0 0x0x0x0x 0x0x0x 00000x 0| 0x0x0x0x 0x0000000000000x 0| 0000 0 0000000000000000000000000 0 0x0x0x0x 0x0x 0x 00000x 0| 0x0x0x0x 0x0x0x0x0x000000x0x0x 0x 0x 0x 0x 0x 0| 0x0x 0x0x 0| 0x 0| 0000 00000000000000000000 0 0x0x0x0x 0x0000000x000x000x0x 0| 000 000000000000 0 0x0x0x0x 0x0x0x0x0x 0x0x0x0x0x000x00000x0x 0| 0x0x0x0x 0x 0x0x0x0x0x0x00000x 0| 0x0x0x0x 0x0 0x 0x 0x0x0x 0x 0x 0x 0x 0x0x0x0x0x0x0x0x0x 0| 0x0x0x0x 0x0x0x0x0x0x 0| 0x0x 0x0x 0| 0x0x 0x0x 0| 0""01111'1(1+100 CH7L  ?00, hI:X h ?00, l?00?0000I:X   0B a!g#'*e-'0E247(9)9 !#$(*-/257;?BEHKOsVN 3!9")#&'(***,-00m18345z788'9)9"%&')+,.0134689:<=>@ACDFGIJLMN)9$ ` )1XH,,ll,,4   , - ##L,l\@,#Lܷ##\##ܶ##\# #!#"l##@$?%#&#'#()d*+,,-5".D5"/5"0́12l3|456 @7DV8\W9X:܄;t<=>?@ABt @@   7 >>a !!!""$$$%''P''((()G*G***+../,/]///+1      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHH   ; EEe  !!!""$$$%''T''((( )N*N***+// /0/a///+1   !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFG9H*urn:schemas-microsoft-com:office:smarttagsplace8G*urn:schemas-microsoft-com:office:smarttagsCity9F*urn:schemas-microsoft-com:office:smarttagsStateB9*urn:schemas-microsoft-com:office:smarttagscountry-region HGFHGFHGFHFHFHG9HFHGFHGHHGHHGHGHHHGHGHHGHHGHGHHGHGHHHGHHHGHHHGHHHHGHHHHG; E ]f9BktF#N#####$.+.00+1)4l $.6.+133333333  F G /0<=Z[fghj12LM  !!!!$$$$X%Y%''c'd'''(((())E*F*****,, -"-#.$...//P/Q/////(1+1$.+.+1 2~Ys >[F+$%H] e*B,ZlWSN=~bZ) w2!`b#~h^`OJQJo(hHh^`OJQJ^Jo(hHohpp^p`OJQJo(hHh@ @ ^@ `OJQJo(hHh^`OJQJ^Jo(hHoh^`OJQJo(hHh^`OJQJo(hHh^`OJQJ^Jo(hHohPP^P`OJQJo(hHh^`OJQJo(hHh^`OJQJ^Jo(hHohpp^p`OJQJo(hHh@ @ ^@ `OJQJo(hHh^`OJQJ^Jo(hHoh^`OJQJo(hHh^`OJQJo(hHh^`OJQJ^Jo(hHohPP^P`OJQJo(hHh^`OJQJo(hHh^`OJQJ^Jo(hHohpp^p`OJQJo(hHh@ @ ^@ `OJQJo(hHh^`OJQJ^Jo(hHoh^`OJQJo(hHh^`OJQJo(hHh^`OJQJ^Jo(hHohPP^P`OJQJo(hHh^`OJQJo(hHh^`OJQJ^Jo(hHohpp^p`OJQJo(hHh@ @ ^@ `OJQJo(hHh^`OJQJ^Jo(hHoh^`OJQJo(hHh^`OJQJo(hHh^`OJQJ^Jo(hHohPP^P`OJQJo(hHh^`OJQJo(hHh^`OJQJ^Jo(hHohpp^p`OJQJo(hHh@ @ ^@ `OJQJo(hHh^`OJQJ^Jo(hHoh^`OJQJo(hHh^`OJQJo(hHh^`OJQJ^Jo(hHohPP^P`OJQJo(hHh^`OJQJo(hHh^`OJQJ^Jo(hHohpp^p`OJQJo(hHh@ @ ^@ `OJQJo(hHh^`OJQJ^Jo(hHoh^`OJQJo(hHh^`OJQJo(hHh^`OJQJ^Jo(hHohPP^P`OJQJo(hHh^`OJQJo(hHh^`OJQJ^Jo(hHohpp^p`OJQJo(hHh@ @ ^@ `OJQJo(hHh^`OJQJ^Jo(hHoh^`OJQJo(hHh^`OJQJo(hHh^`OJQJ^Jo(hHohPP^P`OJQJo(hHh^`OJQJo(hHh^`OJQJ^Jo(hHohpp^p`OJQJo(hHh@ @ ^@ `OJQJo(hHh^`OJQJ^Jo(hHoh^`OJQJo(hHh^`OJQJo(hHh^`OJQJ^Jo(hHohPP^P`OJQJo(hHh^`OJQJo(hHh^`OJQJ^Jo(hHohpp^p`OJQJo(hHh@ @ ^@ `OJQJo(hHh^`OJQJ^Jo(hHoh^`OJQJo(hHh^`OJQJo(hHh^`OJQJ^Jo(hHohPP^P`OJQJo(hH ~blWSs +$%2) wb#~[ e*                                                                                  wP1]Xl9JSKtm/ 1 WR{9SE_y`QH/ ])j)i( . o C"b" %=.%l@&;(w*7 ,-C-3.k/P&0B0;1|1i2c$46Q 6C6(V6YF8l'9:.:<j;<o< >FCJEFKVF(_FF@HdUHI3IJM)NaRFTTU6sVzYN ZpZg_y_Y0abfboceJeje)idi-m?n^nYokuoq,s tItv}"wYw^}$4}9~_~G8aH BjTI0Mf:S#Y{D~8Ih}MP pc!W-W9{@^R(v;D<APedio,$heH^Ad~Pl iQc aqGf>y@\f_C{^  l m VWsNOl()H """""""#%%%(('(-).)A)8+9+P+v-w--z/{//000011'1(1+1@ $.$.$.$.)1p@UnknownGz Times New Roman5Symbol3& z ArialK,Bookman Old Style5& zaTahoma?5 z Courier New;Wingdings"qhٳFٳFV)YV)Y!24d113QH)?AP Computer Science AB vtarleton vtarleton0         Oh+'0   < H T`hpxAP Computer Science ABP  vtarletonertartarNormalo vtarletoner2arMicrosoft Word 10.0@F#@b+[p@b+[pV)՜.+,D՜.+,H hp  CCBOEcY1O AP Computer Science AB Title 8@ _PID_HLINKSAO-http://coweb.cc.gatech.edu/mediaComp-plan/94  !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPRSTUVWXZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~Root Entry F[pData Q1TableYflWordDocument(SummaryInformation(DocumentSummaryInformation8CompObjj  FMicrosoft Word Document MSWordDocWord.Document.89q