Create an account to track your scores
and create your own practice tests:
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?
There is an error in the recursion in BTNode.
Acton
Betty
Felix
Guiral
Hervaeus
Lila
Lola
Peter Auriol
Pierce
Yiiiipppy
Yippy
Betty
Acton
Felix
Guiral
Lola
Lila
Pierce
Yiiiipppy
Yippy
Peter Auriol
Hervaeus
Hervaeus
Guiral
Felix
Acton
Betty
Peter Auriol
Lila
Lola
Yippy
Yiiiipppy
Pierce
Peter Auriol
Hervaeus
Guiral
Acton
Betty
Felix
Lila
Lola
Yippy
Pierce
Yiiiipppy
All AP Computer Science A Resources
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.
