• Welcome to Advanced Placement Computer Science A 3010

    Advanced Placement Computer Science A is a college-level course preparing students for the AP College Board Computer Science A Exam.  Students successfully completing this course will gain a more in-depth knowledge of programming and software development principles applicable to most major programming languages and environments.  

    The primary language used in this course is JAVA, however students will have exposure to C++, Python, Ruby, Processing, and Arduino languages as well.


    NEISD # 3010     Credit: 1.0      TEKS: Chapter §126.62. Advanced Placement (AP) Computer Science A
    Teacher: Dean Arteaga, M.S.      Successful completion of Pre-AP Computer Science I is a required prerequisite.


    This course is taught at a college level. As such, taking notes and student self-motivation are essential to student success in this class.

    Notebooks are periodically reviewed and graded by the teacher.  Keeping an updated notebook is part of the course grade.  Loose / torn-out papers or pocket folders are not acceptable and will not be reviewed or graded.

    A USB drive for online materials and for project work is recommended BUT NOT required for this class.


    Grading:


    Projects: 45%
    Exams: 30%
    Daily Work / Quizzes / Participation: 25%

    Late work accepted is accepted as per page 9 of the NEISD guidelines (NEISD Grading Policy) - until we begin the next unit for a 20% deduction in possbile points.

Recommended/ Required Course Materials

  • Required Items

    Highly Recommended Items

    • A 2gb or larger USB flash drive - recommended
    • Be-prepared-for-the-AP-Computer-Science-Exam-in-Java-book-cover Be Prepared for the AP® Computer Science Exam in Java, 6th edition By Maria and Gary Litvin
      ISBN-13: 978-0982477533 | Available for purchase at bookstores/Amazon (about $21) - Highly recommnended
    • Java-8-PocketGuide-Book-Cover   Java 8 Pocket Guide: Instant Help for Java Programmers 1st Edition by by Robert Liguori and Patricia Liguori ISBN-13: 978-1491900864 | Available for purchase at bookstores/Amazon (about $13) - recommnended

    Notes:

     

     

Software for Practice at Home

  • public static void main(String[] args) {

    Scanner InputDevice = new Scanner(System.in);
    String[][] gridInPlay = reSetGrid();
    int i,j;
    boolean checkIfAvailablePopulate = true;
    boolean playagain = true;
    boolean quit = false;
    boolean validNumberC = true;
    boolean validNumberR = true;
    boolean doneWithTurn = true;
    //gridInPlay[0][1] = "x";
    //gridInPlay[0][0] = "X";
    welcome();

    //your do - while code logic goes here

    }

    private static boolean availableSpace(int i,int j,String[][] gridInPlay, String S){

    //your logic - this checks if the space chosen by the player is available for play!

    }

    private static boolean checkForWin(String[][] gridInPlay, String S) {

    // checks vertical - horizontal - diagonal wins

    }

     

    //this give you a new playing grid

    private static String[][] reSetGrid() {
    String[][] gridInPlay = new String[3][3];
    for(int i = 0; i < 3; i++)
    {
    for(int j = 0; j <3; j++)
    {
    gridInPlay[i][j] = "";
    }
    }
    return gridInPlay;

    public static void makeGameGrid(String[][] gridInPlay){
    System.out.println(" | | ");
    if(gridInPlay[0][0].equalsIgnoreCase("X"))
    {
    System.out.print(" X | ");
    }
    if(gridInPlay[0][0].equalsIgnoreCase("O"))
    {
    System.out.print(" O | ");
    }
    if(gridInPlay[0][0].equalsIgnoreCase(""))
    {
    System.out.print(" | ");
    }
    if(gridInPlay[0][1].equalsIgnoreCase("X"))
    {
    System.out.print("X | ");
    }
    if(gridInPlay[0][1].equalsIgnoreCase("O"))
    {
    System.out.print("O | ");
    }
    if(gridInPlay[0][1].equalsIgnoreCase(""))
    {
    System.out.print(" | ");
    }
    if(gridInPlay[0][2].equalsIgnoreCase("X"))
    {
    System.out.println("X ");
    }
    if(gridInPlay[0][2].equalsIgnoreCase("O"))
    {
    System.out.println("O ");
    }
    if(gridInPlay[0][2].equals(""))
    {
    System.out.println(" ");
    }
    //System.out.println("");
    System.out.println("___|___|___");
    System.out.println(" | | ");
    if(gridInPlay[1][0].equalsIgnoreCase("X"))
    {
    System.out.print(" X | ");
    }
    if(gridInPlay[1][0].equalsIgnoreCase("O"))
    {
    System.out.print(" O | ");
    }
    if(gridInPlay[1][0].equalsIgnoreCase(""))
    {
    System.out.print(" | ");
    }
    if(gridInPlay[1][1].equalsIgnoreCase("X"))
    {
    System.out.print("X | ");
    }
    if(gridInPlay[1][1].equalsIgnoreCase("O"))
    {
    System.out.print("O | ");
    }
    if(gridInPlay[1][1].equalsIgnoreCase(""))
    {
    System.out.print(" | ");
    }
    if(gridInPlay[1][2].equalsIgnoreCase("X"))
    {
    System.out.println("X ");
    }
    if(gridInPlay[1][2].equalsIgnoreCase("O"))
    {
    System.out.println("O ");
    }
    if(gridInPlay[1][2].equals(""))
    {
    System.out.println(" ");
    }
    //System.out.println("");
    System.out.println("___|___|___");
    System.out.println(" | | ");
    if(gridInPlay[2][0].equalsIgnoreCase("X"))
    {
    System.out.print(" X | ");
    }
    if(gridInPlay[2][0].equalsIgnoreCase("O"))
    {
    System.out.print(" O | ");
    }
    if(gridInPlay[2][0].equalsIgnoreCase(""))
    {
    System.out.print(" | ");
    }
    if(gridInPlay[2][1].equalsIgnoreCase("X"))
    {
    System.out.print("X | ");
    }
    if(gridInPlay[2][1].equalsIgnoreCase("O"))
    {
    System.out.print("O | ");
    }
    if(gridInPlay[2][1].equalsIgnoreCase(""))
    {
    System.out.print(" | ");
    }
    if(gridInPlay[2][2].equalsIgnoreCase("X"))
    {
    System.out.println("X ");
    }
    if(gridInPlay[2][2].equalsIgnoreCase("O"))
    {
    System.out.println("O ");
    }
    if(gridInPlay[2][2].equals(""))
    {
    System.out.println(" ");
    }
    System.out.println(" | | ");
    }

    private static String[][] reSetGrid() {
    String[][] gridInPlay = new String[3][3];
    for(int i = 0; i < 3; i++)
    {
    for(int j = 0; j <3; j++)
    {
    gridInPlay[i][j] = "";
    }
    }
    return gridInPlay;
    }
    private static boolean availableSpace(int i,int j,String[][] gridInPlay, String S)
    { boolean available = false;
    if(gridInPlay[i][j].equalsIgnoreCase(""))
    {
    available = true;
    gridInPlay[i][j] = S;
    }
    return available;
    }

    private static void welcome() {
    System.out.println("Welcome to Tic-Tac-Toe.\n"
    + "The first player is the X.\n"
    + "The second player is the O.\n"
    + "Please enter your row and then collumn number when asked.\n"
    + "Remember, this is a Computer Science Class and the first number is not one, it is zero!\n"
    + "Lastly, you may quit by entering a 7 at both the row AND at the collumn prompts.");
    }