Difference between revisions of "AP Computer Science A"
(infobox) |
(course catalog) |
||
| Line 8: | Line 8: | ||
'''AP Computer Science A''' is a [[Computer Science (department)|computer science]] course. Entering requires either [[FOOP]] to be completed, or concurrent enrollment in [[Analysis H]] while completing summer homework. | '''AP Computer Science A''' is a [[Computer Science (department)|computer science]] course. Entering requires either [[FOOP]] to be completed, or concurrent enrollment in [[Analysis H]] while completing summer homework. | ||
| + | |||
| + | == Course catalog description == | ||
| + | This Blended Learning* course is designed to give the student a taste of what it is like to be a freshman computer science | ||
| + | major at a good university. The course includes data abstraction, procedural abstraction, evaluation processes, top-down | ||
| + | design, iteration, recursion, primitive and abstract data types, data structures (arrays, lists, sets, tables, queues, stacks, | ||
| + | trees), algorithm analysis and orders of growth, the beginnings of an object system (with message passing), searching and | ||
| + | sorting, inheritance and delegation, interfaces and polymorphism, and more! Students should be able to analyze code in | ||
| + | terms of functionality, efficiency, readability, reusability, modularity, and meaning. | ||
| + | * Prerequisites: Either completion of FOOP (and FOOP math prerequisites) OR A or A+ in an honor’s track math class plus completion of the <u>Summer Homework</u> | ||
| + | * Homework Expectation: 4 hours per week | ||
| + | * District SLOs Addressed in this Course: 1, 2, 5, 6, 7 | ||
| + | * This is an advanced placement course | ||
| + | * Not approved NCAA course | ||
| + | <nowiki />*''Blended Learning Courses feature instruction delivered in a non-traditional schedule; possibly meeting one less time per week. This will require independent learning by students using web-based tools, along with check-in times with teachers. For additional information about Blended Learning Courses, see page 85.'' | ||
== External links == | == External links == | ||
* [https://paleyontology.com/AP_CS/ Course calendar] | * [https://paleyontology.com/AP_CS/ Course calendar] | ||
Revision as of 20:01, 17 September 2021
- Not to be confused with AP Computer Science Principles
| Department | CTE |
|---|---|
| Length | Year |
| Credit type | Weighted |
| Teacher(s) | Mr. Paley Mr. Bautista |
AP Computer Science A is a computer science course. Entering requires either FOOP to be completed, or concurrent enrollment in Analysis H while completing summer homework.
Course catalog description
This Blended Learning* course is designed to give the student a taste of what it is like to be a freshman computer science major at a good university. The course includes data abstraction, procedural abstraction, evaluation processes, top-down design, iteration, recursion, primitive and abstract data types, data structures (arrays, lists, sets, tables, queues, stacks, trees), algorithm analysis and orders of growth, the beginnings of an object system (with message passing), searching and sorting, inheritance and delegation, interfaces and polymorphism, and more! Students should be able to analyze code in terms of functionality, efficiency, readability, reusability, modularity, and meaning.
- Prerequisites: Either completion of FOOP (and FOOP math prerequisites) OR A or A+ in an honor’s track math class plus completion of the Summer Homework
- Homework Expectation: 4 hours per week
- District SLOs Addressed in this Course: 1, 2, 5, 6, 7
- This is an advanced placement course
- Not approved NCAA course
*Blended Learning Courses feature instruction delivered in a non-traditional schedule; possibly meeting one less time per week. This will require independent learning by students using web-based tools, along with check-in times with teachers. For additional information about Blended Learning Courses, see page 85.