TJHSST, 2011-2012
TJHSST, 2011-2012
AP Computer Science A plus Data Structures
Assignment Schedule
Course Description: This course is a standard second-semester college course on algorithms and data structures in an object-oriented environment. The sorting algorithms include selection, insertion, merge, quick, and heap. The data structures include arrays, recursion, linked lists, stacks, queues, trees, sets, maps, and graphs. Additional topics include the Java Collections framework, Big-O analysis, and class design. Java is the language of instruction. Since this class prepares students for TJ's follow-on courses, it includes college material going well beyond the topics tested by the College Board’s Advanced Placement© Computer Science A exam.
Textbook: Lambert, Kenneth and Osborne, Martin. Fundamentals of Java: AP Computer Science Essentials for A and AB Exams. 3rd Edition, Thompson Course Technology, Boston, Massachusetts, 2006. ISBN 0-619-26723-2. FCPS replacement cost: $126.00
Assignments: TJ students can access all handouts and program files through TJ's intranet.
Teachers:
Mr.
Billington
Mr. Rose
Ms. Luxenberg
September: arrays, strings, files, recursion
October: sorts, Big-O notation
November: ListNode linked lists, ArrayList, LinkedList
December: Java Collections, AP Computer Science© Gridworld Case Study
January: stacks, queues, priority queues
February: trees (binary trees, BST, BXT), sets
March: maps, hashcode, heaps, heap sort
April: Sort Detective, Design Question, mock AP exam
May: AP Computer Science© Exam on Tuesday, May 8. After that we study graphs
June: individual projects
Installing at Home