AAST – COURSE SYLLABUS 2022-2023

Course: PLTW AP Computer Science A

PLTW AP Computer Science A is a college-level introductory course to programming. You do not have to
major in computer science to find this course useful. In today's technologically developed world, coding
is a very important skill, and you will find yourself at a competitive advantage if you know how to code.
The course teaches a subset of the Java programming language. The major emphasis of the course
however is in algorithms - or the art of solving problems. You will learn to analyze different situations
and develop your own unique approaches to solving this problem.

Important Notes about AP CS A

 You cannot fall behind in this course and catch up later. If you are more than 1 week behind,
get help immediately.

 You must do your own homework to pass this course. You are not learning Java. You are
learning algorithms (the art of solving problems) and Java is only the tool.

 There are many ways to solve problems and you will all develop your own distinct style - it is
very easy to tell if someone is cheating.

Assignments

• Classwork is to be completed in class and submitted on time.

• Homework is to be complete and submitted on time. Please do your own work - I can tell if
you are cheating because people code differently. You will also not learn and this will snowball
faster than you think.

Grading Policy

Grading will be done on a percentage-based system.

Grading Scale

A: 90%-100%, B: 80%-89%, C: 70%-79%, D:60%-69%, F Below 60%

Course Progression:

● Chapter 1 – Java Coding Fundamentals

Chapter 1 welcomes students to the world of Java programming fundamentals. Students work with an
embedded code editor and Microsoft Visual Studio Code to learn the fundamentals of coding in Java. At
the end of the chapter students will implement everything they have learned to design, plan, and
collaboratively develop a solution that completes the functionality of a provided Escape Room style
game

Activity 1.1.1 Why Programming? Why Java? (1 day)

Activity 1.1.2 Variables and Data Types (1 day)

Activity 1.1.3 Expressions and Assignment Statements (1 day)

Activity 1.1.4 Compound Assignment Operators (1 day) Activity

Activity 1.1.5 Casting and Ranges of Variables (3 days)

Project 1.1.6 Numbers Riddle (3 days)

● Chapter 2 - Using Objects

This unit introduces a new type of data: reference data. Reference data allows real-world objects to be
represented in varying degrees specific to a programmer’s purpose. This unit builds on students’ ability
to write expressions by introducing them to Math class methods to write expressions for generating
random numbers and other more complex operations. In addition, strings and the existing methods
within the String class are an important topic within this unit. Knowing how to declare variables or call
methods on objects is necessary throughout the course.

Activity 1.2.1 Objects: Instances of Classes (1 day)

Activity 1.2.2 Creating and Storing Objects (2 days)

Activity 1.2.3 Calling a Void Method (1 day)

Activity 1.2.4 Calling a Void Method with Parameters (1 day)

Activity 1.2.5 Calling a Non-Void Method (1 day)

Activity 1.2.6 String Objects: Concatenation, Literals, and More (2 days)

Activity 1.2.7 String Methods (2 days)

Activity 1.2.8 Wrapper Classes: Integer and Double (2 days)

Activity 1.2.9 Using a Math Class (2 days)

Project 1.2.10 PLTW Project - Mad Libs (3 days)

● Unit 3 - Object-Oriented Programming

Understand object-oriented programming and create classes and methods Implement programs
to interface with a hardware element. Algorithms are composed of three building blocks:
sequencing, selection, and iteration. This unit focuses on selection, which is represented in a
program by using conditional statements. Conditional statements give the program the ability to
decide and respond appropriately and are a critical aspect of any nontrivial computer program.
In addition to learning the syntax and proper use of conditional statements, students will build
 on the introduction of Boolean variables by writing Boolean expressions with relational and
logical operators.

Activity 1.3.1 Boolean Expressions (1 day)

Activity 1.3.2 if Statements and Control Flow (1 day)

Activity 1.3.3 if/else Statements (1 day)

Activity 1.3.4 else if Statements (1 day)

Activity 1.3.5 Compound Boolean Expressions (2 days)

Activity 1.3.6 Equivalent Boolean Expressions (2 days)

Activity 1.3.7 Comparing Objects (2 days)

Project 1.3.8 PLTW Project - Choose Your Path (4 days)

Problem 1

Students will implement everything they have learned to design, plan, and collaboratively develop a
solution that completes the functionality of a provided Escape Room style game.

Problem 1 Escape Room (4 days)

● Unit 4 - Graphical User Interfaces

This unit focuses on iteration using while and for loops. It introduces several standard
algorithms that use iteration. Knowledge of standard algorithms makes solving similar problems
easier, as algorithms can be modified or combined to suit new situations. Iteration is used when
traversing data structures such as arrays, ArrayLists, and 2D arrays.

Activity 2.4.1 While Loops (2 days)

Activity 2.4.2 For Loops (2 days)

Activity 2.4.3 Developing Algorithms Using Strings (2 days)

Activity 2.4.4 Nested Iterations (2 days)

Activity 2.4.5 Informal Code Analysis (2 days)

Project 2.4.6 Consumer Review Lab (8 days)

● Unit 5 - Raspberry Pi

This unit will pull together information from all previous units to create new, user-defined
reference data types in the form of classes. The ability to accurately model real-world entities in
a computer program is a large part of what makes computer science so powerful. This unit
focuses on identifying appropriate behaviors and attributes of real-world entities and organizing
these into classes. The creation of computer programs can have extensive impacts on societies,
economies, and cultures. The legal and ethical concerns that come with programs and the
responsibilities of programmers are also addressed in this unit.
 Activity 2.5.1 Anatomy of a Class (1 day)

Activity 2.5.2 Constructors (2 days)

Activity 2.5.3 Documentation with Commands (2 days)

Activity 2.5.4 Accessor Methods (2 days)

Activity 2.5.5 Mutator Methods (2 days)

Activity 2.5.6 Writing Methods (1 days)

Activity 2.5.7 Static Variables and Methods (2 days)

Activity 2.5.8 Scope and Access (2 days)

Activity 2.5.9 this Keyword (2 days)

Activity 2.5.10 Ethical and social Implications of Computing (2 days)

Project 2.5.11 PLTW Project - Game of Nim (4 days)

 Problem 2

At the end of this chapter students will implement everything they have learned to design, plan, and
collaboratively develop an ad system for a social media sight to help people sell their pet food.

Problem Sell My Pet Food (4 days)

 Unit 6 Arrays

This unit focuses on data structures, which are used to represent collections of related data
using a single variable rather than multiple variables. Using a data structure along with iterative
statements with appropriate bounds will allow for similar treatment to be applied more easily to
all values in the collection. Just as there are useful standard algorithms when dealing with
primitive data, there are standard algorithms to use with data structures. In this unit, students
apply standard algorithms to arrays; however, these same algorithms are used with ArrayLists
and 2D arrays as well.

Activity 3.6.1 Array Creation and Access (2 days)

Activity 3.6.2 Traversing Arrays (2 days)

Activity 3.6.3 Enhanced Loops for Arrays (1 days)

Activity 3.6.4 Developing Algorithms Using Arrays (3 days)

Project 3.6.5 PLTW Project - Memory Game (3 days)

 Unit 7 ArrayList

Building on what students learned in Unit 6, data structures are helpful when storing multiple
related data values. Arrays have a static size, which causes limitations related to the number of
elements stored, and it can be challenging to reorder elements stored in arrays. The ArrayList
 object has a dynamic size, and the class contains methods for insertion and deletion of
elements, making reordering and shifting items easier. Deciding which data structure to select
becomes increasingly important as the size of the data set grows, such as when using a large
real-world data set. In this unit, students will also learn about privacy concerns related to storing
large amounts of personal data and about what can happen if such information is compromised.

Activity 3.7.1 Introduction to ArrayList (1 day)

Activity 3.7.2 ArrayList Methods (2 days)

Activity 3.7.3 Traversing ArrayLists (1 days)

Activity 3.7.4 Developing Algorithms Using ArrayLists (2 days)

Activity 3.7.5 Searching (4 days)

Activity 3.7.6 Sorting (4 days)

Project 3.7.7 Data Lab (3 days)

 Unit 8 2D Arrays

Previous concepts will be implemented with two-dimensional (2D) arrays in this unit. A 2D array
is most suitable to represent a table. Each table element is accessed using the variable name
and row and column indices. Unlike 1D arrays, 2D arrays require nested iterative statements to
traverse and access all elements. The easiest way to accomplished this is in row-major order,
but it is important to cover additional traversal patterns, such as back and forth or column-
major.

Activity 3.8.1 2D Arrays (3 days)

Activity 3.8.2 Traversing 2D Arrays (5 days)

Project 3.8.3 Stenography Lab (4 days)

 Problem 3

At the end of chapter problem, students pursue a question of interest to them. To accomplish this,
they will pose a question, identify a data set that will help them answer the question, and develop a
program to use the data set to gain information to help them answer their question.

Data Lab Activity 4 (4 days)

 Unit 9 Inheritance

Creating objects, calling methods on the objects created, and being able to define a new data type
by creating a class are essential understandings before moving into this unit. One of the strongest
advantages of Java is the ability to categorize classes into hierarchies through inheritance. Certain
existing classes can be extended to include new behaviors and attributes without altering existing
code. These newly created classes are called subclasses. In this unit, students will learn how to
recognize common attributes and behaviors that can be used in a superclass and will then create a
 hierarchy by writing subclasses to extend a superclass. Recognizing and utilizing existing hierarchies
will help students create more readable and maintainable programs.

Activity 4.9.1 Creating Superclasses and Subclasses (1 days)

Activity 4.9.2 Writing constructors for Subclasses (3 days)

Activity 4.9.3 Overriding Methods (2 days)

Activity 4.9.4 Super Keyword (2 days)

Activity 4.9.5 Creating References Using Inheritance Hierarchies (2 days)

Activity 4.9.6 Polymorphism (2 days)

Activity 4.9.7 Object Superclass (1 days)

Project 4.9.8 Celebrity Lab (4 days)

 Unit 10 Recursion

Sometimes a problem can be solved by solving smaller or simpler versions of the same problem
rather than attempting an iterative solution. This is called recursion, and it is a powerful math and
computer science idea. In this unit, students will revisit how control is passed when methods are
called, which is necessary knowledge when working with recursion. In this unit, students will learn
how to write simple recursive methods and determine the purpose or output of a recursive method
by tracing.

Activity 4.10.1 Recursion (2 days)

Activity 4.10.2 Recursive Searching and Sorting (2 days)

Activity 4.10.3 PLTW Project (3 days)

 Problem 4

This Problem brings together all of the skills students have learned throughout the course. Students will
use the software development cycle they have used in other projects. In this problem, they will design
and develop a program of their choosing.

Almost Anything! (5 days)

Final Exam:

There is also a final exam at the end of the semester. This exam will count as 20% of the overall course
grade.

Senior Mastery Project:

Every Computer Science Major student will complete a senior mastery project. This project includes
original research, a prototype artifact, and a presentation. As this is a major project, we will begin to
prepare for it at the beginning of class. Presentations and projects will be submitted in the Spring. More
information will be provided throughout the semester and certain benchmarks will be incorporated into
the class.

CTSO (Career and Technology Student Organization): All Computer Science Majors are expected to
participate in a CTSO. (TSA, HOSA, and Skills USA)

Grading:

High Grades – Exams / Projects: 50%

Mid-Level Grades – Quizzes / End of Project Notebook Checks / Apps

Low-Level Grades – Notebook Checks / Homework / Classwork / Participation

PARENT-TEACHER COMMUNICATION:

If you should have any questions or concerns about your student and his/her progress, please do not
hesitate to call me at 843-903-8460 ex: 583510. I can also be reached via email at
tvaught002@horrycountyschools.net. My planning period is 1st Block – 8:15 am – 9:30 am

CELL PHONE POLICY:

There is an overwhelming amount of research that shows a downward trend in students’ academic
performance when cell phones and other electronic devices are allowed in classes. Students do not
multitask well, nor do they retain as much information when they are not actively engaged in classroom
activities. In order to help all students be successful in my classes, I will be enforcing a strict policy of NO
cell phones and other personal electronic devices unless specifically instructed by the teacher or by
needed accommodations. These devices must be turned off and left in their book bags or placed in the
cell phone holder. If a student chooses not to follow directions the phone/device will be taken by the
teacher. The students will receive a written office referral for refusing to follow directions and the
phone/device will be turned into the office. The student will need to make arrangements with the
appropriate administrator in order to retrieve the phone/device

STUDENT RESPONSIBILITIES:

As a member of the PLTW CSE class, you have certain responsibilities that will enable you to learn the
knowledge and skills that are taught.

1. You must attend class regularly. This class moves at a rapid pace with each new skill scaffolding to the
next. You can easily fall behind. All makeup work must be made up in accordance to the AAST makeup
policy.

2. To receive credit for the day’s work:

a. You must do all assignments during class time.

b. All assignments must be stored on the student’s Google Drive or Schoololgy to receive credit.

c. All requested assignments must be printed out and turned in to the teacher by the end of the
period. All assigned work not handed in by the due date will be averaged in as a zero.
3. It is your responsibility to obtain make-up work from the teacher. Tutoring is offered after school as
needed. Students should request a tutoring session with the main office, and it will be assigned.

4. It is the student’s responsibility to work out a time with the teacher for all make-up tests.

5. You are responsible for listening to and following the teacher’s instructions and for asking questions
when something is unclear.

6. Each student should be in his/her seat when the tardy bell rings-ready to begin work.

Honor Code: The Academic Honesty Policy is being implemented to ensure that students submit
credible work that is evident of their content mastery. Students should seek to be totally honest in their
dealings with others. They should complete their own work and be evaluated based on its originality.
They should avoid academic dishonesty and misconduct in all its forms, including plagiarism, fabrication
or falsification, cheating, and other academic misconduct.

CLASSROOM DISCIPLINE PLAN

District Policy will be enforced as outlined in the AAST Student Handbook. This includes but is not
limited to proper usage of the Internet. It is the responsibility of the parents and students to be familiar
with these rules. In addition to the above, all students will be asked to adhere to the following class
rules. These additional rules are necessary for the safety of the teacher, students, and equipment in the
computer lab.

Class Rules:

1. Students will be in the classroom, prepared, and ready to start when the tardy bell rings.

2. Students will place all backpacks and personal items in the designated area of the lab for the duration
of the class.

3. NO food or drinks will be allowed in the lab.

4. No talking without permission. Pay attention during class - - maximize learning.

5. Keep the chairs in place at the desk and stay seated unless you have permission from the teacher.

6. Treat your teacher, computer equipment, classmates, and yourself with respect.

7. NO CELL PHONES OR OTHER PERSONAL ELECTRONIC DEVICES. They will be confiscated and turned
into an administrator at the end of the day if seen or HEARD.

Consequences:

1. Students will receive a warning.

2. Second warning - - student/teacher conference after class.

3. Third warning - - Written discipline slip and call to parent/guardian.

Rewards:
1. Good behavior is rewarded with extra time to get help in class with assignments.

2. Praise

3. Good grades

4. Complimentary notes and phone calls to parents.

Career and Technical Education Student Organizations

Technology Student Association

National Technical Honor Society

National Technical Honor Society

Mission

To honor student achievement and leadership, promote educational excellence, and enhance career
opportunities for the NTHS membership.

Vision

To be the leader in providing recognition for excellence in career and technical education and creating
significant occupational opportunities for America's top workforce education students. Committed to
providing the highest quality recognition for outstanding students in career and technical education,
supplying excellent services to our diverse and multi-cultural membership and member schools, creating
new and emerging relationships between the educational community and business and industry, being a
flexible organization on the leading edge of technology and constantly responding to change,
maintaining financial responsibility to meet our increasing needs, and sustaining growth, innovation and
continuous improvement based upon the ongoing evaluation.

Requirements for membership in the NTHS:

1. Overall cumulative 3.5 GPA *

*Please include your current GPA overall