Call Now to Set Up Tutoring:

(888) 888-0446

Create an account to track your scores
and create your own practice tests:

Create an Account Create a Practice Test

All AP Computer Science A Resources

1 Diagnostic Test 84 Practice Tests Question of the Day Flashcards Learn by Concept

Want to review AP Computer Science A but don’t feel like sitting for a whole test at the moment? Varsity Tutors has you covered with thousands of different AP Computer Science A flashcards! Our AP Computer Science A flashcards allow you to practice with as few or as many questions as you like. Get some studying in now with our numerous AP Computer Science A flashcards.

If you’re interested in a college major like applied physics, aerospace engineering, computer forensics, or computer science, the Advanced Placement Computer Science A course is one step that you could take to prepare while still in high school. Also called AP Computer Science A, the course is the equivalent of a first year college computer science course.

The course focuses on object-oriented problem solving, as well as imperative problem solving and design with Java language. Completion of this course can prepare you to design and analyze solutions to problems, use common algorithms, write, run, test, and debug solutions in Java programming language, and to understand the ethical and social impact of computer usage. AP Computer Science A can be a complex course, and if you’re like many students, you may find yourself looking for Learning Tools to help you understand the course subject matter. This is where Varsity Tutors’ Learning Tools, including their AP Computer Science A Flashcards come in handy.

Varsity Tutors' Learning Tools offers hundreds of free flashcards online that cover topics that will arise in the AP Computer Science A course. You can use these flashcards any time you have an Internet connection and spend as little or as much time as you wish in reviewing various concepts. Whether you’re taking time to prepare for a test, to reinforce the in-class learning, or before the lab time required for the course, you can work through the various flashcards, whether you’re moving through specific topics in a specific order, or are more interested in a general overview of the course.

Each of the flashcards offer multiple-choice questions and the related answers, in topics like object-oriented program design, program analysis, debugging, program implementation, standard data structures, standards operations and algorithms, searching, and sorting. When you answer a question, you’ll find that you get an explanation of the correct answer, and the opportunity to return to the flashcard you just worked with, if you so desire. These flashcards are designed to help you master the concepts of the course with flexibility.

The AP Computer Science A exam is composed of multiple-choice questions, as well as a free response section that requires short answers to several questions with Java programming language. Questions on these free flashcards online are meant to be similar to what you’ll see on the AP Computer Science A exam, but are not the exact questions that you’ll find on the test.

Varsity Tutors’ Learning Tools include a Full-Length Practice Tests similar to one you would see on test day, nearly 100 Practice Tests on AP Computer Science A topics, a Question of the Day series that gives a random question from any topic to test your breadth of knowledge, these Flashcards, and an interactive syllabus called Learn by Concept. Not only can you access the various Learning Tools, but if you create an account, you can track your scores and use the flashcards creator to make your own customized flashcards, in case you are looking to take more focus in a particular topic.

Our AP Computer Science A flashcards each contain one question that might appear on the AP Computer Science A exam. You can use them to get a comprehensive overview of each topic covered on the AP Computer Science A exam one problem at a time, or to do problem drills that focus on particular problem types or content areas found on the AP Computer Science A exam.

Flashcards: Standard Operations & Algorithms

Consider the code below:

public static class BTNode {

public static final int PARSE_IN = 1;

public static final int PARSE_PRE = 2;

public static final int PARSE_POST = 3;

String name;

BTNode lPointer,rPointer;

public BTNode(String s) {

name = s;

lPointer = rPointer = null;

}

public void insert(String s) {

insert(this,s);

}

private static void insert(BTNode node,String s) {

int comparison = s.compareTo(node.name);

if(comparison < 0) {

if(node.lPointer != null) {

insert(node.lPointer,s);

} else {

node.lPointer = new BTNode(s);

}

} else if(comparison > 0) {

if(node.rPointer != null) {

insert(node.rPointer,s);

} else {

node.rPointer = new BTNode(s);

}

public ArrayList<String> parse(final int parseOrder) {

return parse(this,parseOrder);

}

private static ArrayList<String> parse(BTNode node, final int parseOrder) {

ArrayList<String> retVal = new ArrayList<String>();

if(node == null) {

return(retVal);

}

ArrayList<String> leftList = parse(node.lPointer,parseOrder);

ArrayList<String> rightList = parse(node.rPointer,parseOrder);

if(parseOrder == PARSE_PRE) {

retVal.add(node.name);

retVal.addAll(leftList);

retVal.addAll(rightList);

} else if (parseOrder == PARSE_POST) {

retVal.addAll(leftList);

retVal.addAll(rightList);

retVal.add(node.name);

} else {

retVal.addAll(leftList);

retVal.add(node.name);

retVal.addAll(rightList);

}

return retVal;

}

public static void main(String[] args) {

String[] names = {"Hervaeus","Peter Auriol","Guiral","Felix","Lila","Lola","Yippy","Yiiiipppy","Acton","Pierce","Betty"};

BTNode node = new BTNode(names[0]);

for(int i = 1; i < names.length; i++) {

node.insert(names[i]);

}

ArrayList<String> traversedNames = node.parse(BTNode.PARSE_IN);

for(String s : traversedNames) {

System.out.println(s);

}

What is the output for this method?

Peter Auriol

Hervaeus

Guiral

Acton

Betty

Felix

Lila

Lola

Yippy

Pierce

Yiiiipppy

There is an error in the recursion in BTNode.

Hervaeus

Guiral

Felix

Acton

Betty

Peter Auriol

Lila

Lola

Yippy

Yiiiipppy

Pierce

Acton

Betty

Felix

Guiral

Hervaeus

Lila

Lola

Peter Auriol

Pierce

Yiiiipppy

Yippy

Betty

Acton

Felix

Guiral

Lola

Lila

Pierce

Yiiiipppy

Yippy

Peter Auriol

Hervaeus

Report an Error Copyright Notice

Flashcards: Standard Operations & Algorithms

What is the output for this method?

Your answer:

Peter Auriol

Hervaeus

Guiral

Acton

Betty

Felix

Lila

Lola

Yippy

Pierce

Yiiiipppy

Your answer:

There is an error in the recursion in BTNode.

Your answer:

Hervaeus

Guiral

Felix

Acton

Betty

Peter Auriol

Lila

Lola

Yippy

Yiiiipppy

Pierce

Your answer:

Betty

Acton

Felix

Guiral

Lola

Lila

Pierce

Yiiiipppy

Yippy

Peter Auriol

Hervaeus

Correct answer:

Acton

Betty

Felix

Guiral

Hervaeus

Lila

Lola

Peter Auriol

Pierce

Yiiiipppy

Yippy

Explanation:

The code given is a standard implementation of a binary tree containing an insert and a parse method. For now, you can merely pay attention to your parse logic, particularly just the logic that will be invoked for the indicator value PARSE_IN. (Notice that this is merely in the else of the parse method. This is a "catch all" / default in case a bad value is given for the parse order.)

retVal.addAll(leftList);

retVal.add(node.name);

retVal.addAll(rightList);

This is just the standard binary tree style of parsing based on our insert. The smaller items are on the left of the current node, and the larger ones are on the right of it. Thus, you have:

List of all smaller values + This current value + List of all larger values

Recursively, this will end with an ordered list, which is just what you need.

Flashcards: Standard Operations & Algorithms

Consider the following code:

import java.util.ArrayList;

public class MethodClass5 {

public static class BTNode {

public static final int PARSE_IN = 1;

public static final int PARSE_PRE = 2;

public static final int PARSE_POST = 3;

String name;

BTNode lPointer,rPointer;

public BTNode(String s) {

name = s;

lPointer = rPointer = null;

}

public void insert(String s) {

insert(this,s);

}

private static void insert(BTNode node,String s) {

int comparison = s.compareTo(node.name);

if(comparison < 0) {

if(node.lPointer != null) {

insert(node.lPointer,s);

} else {

node.lPointer = new BTNode(s);

}

} else if(comparison > 0) {

if(node.rPointer != null) {

insert(node.rPointer,s);

} else {

node.rPointer = new BTNode(s);

}

public ArrayList<String> parse(final int parseOrder) {

return parse(this,parseOrder);

}

private static ArrayList<String> parse(BTNode node, final int parseOrder) {

ArrayList<String> retVal = new ArrayList<String>();

if(node == null) {

return(retVal);

}

ArrayList<String> leftList = parse(node.lPointer,parseOrder);

ArrayList<String> rightList = parse(node.rPointer,parseOrder);

if(parseOrder == PARSE_PRE) {

retVal.add(node.name);

retVal.addAll(leftList);

retVal.addAll(rightList);

} else if (parseOrder == PARSE_POST) {

retVal.addAll(leftList);

retVal.addAll(rightList);

retVal.add(node.name);

} else {

retVal.addAll(leftList);

retVal.add(node.name);

retVal.addAll(rightList);

}

return retVal;

}

public static void main(String[] args) {

String[] names = {"Thomas Aquinas","Thomas Cajetan","Thomas Prufer","Thomas the Tank Engine","Thomas the Bread-Eater"};

BTNode node = new BTNode(names[0]);

for(int i = 1; i < names.length; i++) {

node.insert(names[i]);

}

ArrayList<String> traversedNames = node.parse(BTNode.PARSE_POST);

for(String s : traversedNames) {

System.out.println(s);

}

What is the output for the main method above?

Thomas the Bread-Eater

Thomas Aquinas

Thomas the Tank Engine

Thomas Prufer

Thomas Cajetan

Thomas Aquinas

Thomas Cajetan

Thomas Prufer

Thomas the Bread-Eater

Thomas the Tank Engine

Thomas the Bread-Eater

Thomas the Tank Engine

Thomas Prufer

Thomas Cajetan

Thomas Aquinas

Thomas the Tank Engine

Thomas Prufer

Thomas the Bread-Eater

Thomas Aquinas

Thomas Cajetan

Thomas Aquinas

Thomas the Tank Engine

Thomas Prufer

Thomas the Bread-Eater

Thomas Cajetan

Report an Error Copyright Notice

Flashcards: Standard Operations & Algorithms

What is the output for the main method above?

Your answer:

Thomas the Bread-Eater

Thomas Aquinas

Thomas the Tank Engine

Thomas Prufer

Thomas Cajetan

Your answer:

Thomas Aquinas

Thomas Cajetan

Thomas Prufer

Thomas the Bread-Eater

Thomas the Tank Engine

Your answer:

Thomas the Tank Engine

Thomas Prufer

Thomas the Bread-Eater

Thomas Aquinas

Thomas Cajetan

Your answer:

Thomas Aquinas

Thomas the Tank Engine

Thomas Prufer

Thomas the Bread-Eater

Thomas Cajetan

Correct answer:

Thomas the Bread-Eater

Thomas the Tank Engine

Thomas Prufer

Thomas Cajetan

Thomas Aquinas

Explanation:

This code is a standard implementation of a Binary Tree class. The call that we are making in main is meant to parse the tree (traverse it) in post-fix order. This means that we will always look to the left of each node first, then to the right, then finally to the value we are at. However, the tree is unbalanced, so the parsing will do much more right traveral than anything else. See the following sequence of inserts:

Step 1:

Tree11

Step 2:

Tree12

Step 3:

Tree13

Step 4:

Tree14

Step 5:

Tree15

Now, your traversal path will look like this:

Tree16

Interestingly, this means that you will end up with a list that is in reverse order. This is only the case for the given data as it happened to have been inserted.

DMCA Complaint

If you believe that content available by means of the Website (as defined in our Terms of Service) infringes one or more of your copyrights, please notify us by providing a written notice (“Infringement Notice”) containing the information described below to the designated agent listed below. If Varsity Tutors takes action in response to an Infringement Notice, it will make a good faith attempt to contact the party that made such content available by means of the most recent email address, if any, provided by such party to Varsity Tutors.

Your Infringement Notice may be forwarded to the party that made the content available or to third parties such as ChillingEffects.org.

Please be advised that you will be liable for damages (including costs and attorneys’ fees) if you materially misrepresent that a product or activity is infringing your copyrights. Thus, if you are not sure content located on or linked-to by the Website infringes your copyright, you should consider first contacting an attorney.

Please follow these steps to file a notice:

You must include the following:

A physical or electronic signature of the copyright owner or a person authorized to act on their behalf; An identification of the copyright claimed to have been infringed; A description of the nature and exact location of the content that you claim to infringe your copyright, in \ sufficient detail to permit Varsity Tutors to find and positively identify that content; for example we require a link to the specific question (not just the name of the question) that contains the content and a description of which specific portion of the question – an image, a link, the text, etc – your complaint refers to; Your name, address, telephone number and email address; and A statement by you: (a) that you believe in good faith that the use of the content that you claim to infringe your copyright is not authorized by law, or by the copyright owner or such owner’s agent; (b) that all of the information contained in your Infringement Notice is accurate, and (c) under penalty of perjury, that you are either the copyright owner or a person authorized to act on their behalf.

Send your complaint to our designated agent at:

Charles Cohn Varsity Tutors LLC
101 S. Hanley Rd, Suite 300
St. Louis, MO 63105

Or fill out the form below:

Do not fill in this field

Contact Information

* Full legal name

Company name

* Phone number

* Email address

Address

* Address1

Address2

* City

* State

* Zipcode

* Country

Complaint Details

* URL of copyrighted work (where your original material is located)

* Please describe the copyrighted work so that it may be easily identified

I am the owner, or an agent authorized to act on behalf of the owner of an exclusive right that is allegedly infringed.

I have a good faith belief that the use of the material in the manner complained of is not authorized by the copyright owner, its agent, or the law.

This notification is accurate.

I acknowledge that there may be adverse legal consequences for making false or bad faith allegations of copyright infringement by using this process.

* Signature (your digital signature is legally binding)

View Tutors

Dolly
Certified Tutor

UTD, Bachelor of Science, Computer Science. UTD, Master of Science, Computer Science.

View Tutors

Muntaser
Certified Tutor

Illinois Institute of Technology, Bachelors, Computer Engineering.

View Tutors

Hassan
Certified Tutor

University of Central Florida, Current Undergrad, Computer Science.

Popular Subjects

Math Tutors in Philadelphia, SAT Tutors in Houston, Calculus Tutors in New York City, MCAT Tutors in Chicago, MCAT Tutors in Philadelphia, Algebra Tutors in Philadelphia, English Tutors in Seattle, Math Tutors in Houston, Physics Tutors in New York City, ISEE Tutors in Dallas Fort Worth

Popular Courses & Classes

SAT Courses & Classes in San Francisco-Bay Area, Spanish Courses & Classes in New York City, SSAT Courses & Classes in Phoenix, MCAT Courses & Classes in Seattle, SSAT Courses & Classes in Washington DC, Spanish Courses & Classes in San Francisco-Bay Area, SSAT Courses & Classes in San Francisco-Bay Area, LSAT Courses & Classes in Houston, LSAT Courses & Classes in Chicago, SAT Courses & Classes in Washington DC

Popular Test Prep

SAT Test Prep in Los Angeles, SSAT Test Prep in Philadelphia, GMAT Test Prep in Houston, MCAT Test Prep in Los Angeles, SSAT Test Prep in Chicago, GMAT Test Prep in Miami, LSAT Test Prep in Seattle, SAT Test Prep in Dallas Fort Worth, SSAT Test Prep in Denver, LSAT Test Prep in Washington DC

HIGH SCHOOL

GRADUATE SCHOOL

K-8

Search 50+ Tests

math tutoring

science tutoring

foreign languages

elementary tutoring

other

Search 350+ Subjects

Create an account to track your scores
and create your own practice tests:

All AP Computer Science A Resources

Flashcards: Standard Operations & Algorithms

Flashcards: Standard Operations & Algorithms

Flashcards: Standard Operations & Algorithms

Flashcards: Standard Operations & Algorithms

Report an issue with this question

DMCA Complaint

Contact Information

Address

Complaint Details

Email address:
Your name:
Feedback:

HIGH SCHOOL

GRADUATE SCHOOL

K-8

Search 50+ Tests

math tutoring

science tutoring

foreign languages

elementary tutoring

other

Search 350+ Subjects

Create an account to track your scores and create your own practice tests:

All AP Computer Science A Resources

Flashcards: Standard Operations & Algorithms

Flashcards: Standard Operations & Algorithms

Flashcards: Standard Operations & Algorithms

Flashcards: Standard Operations & Algorithms

Report an issue with this question

DMCA Complaint

Contact Information

Address

Complaint Details

Create an account to track your scores
and create your own practice tests: