Create an account to track your scores
and create your own practice tests:
Flashcards: Operations on Data Structures
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?
Hervaeus
Guiral
Felix
Acton
Betty
Peter Auriol
Lila
Lola
Yippy
Yiiiipppy
Pierce
Betty
Acton
Felix
Guiral
Lola
Lila
Pierce
Yiiiipppy
Yippy
Peter Auriol
Hervaeus
There is an error in the recursion in BTNode.
Peter Auriol
Hervaeus
Guiral
Acton
Betty
Felix
Lila
Lola
Yippy
Pierce
Yiiiipppy
Acton
Betty
Felix
Guiral
Hervaeus
Lila
Lola
Peter Auriol
Pierce
Yiiiipppy
Yippy
All Computer Science Resources
Computer science is a complicated topic, whether you’re a college student beginning your studies, or a professional who has begun working in the field. Some describe it as the study of how to efficiently implement and automate computational processes.
If you’re looking for study tools to help you succeed in learning computer science at the college level or at the professional level, Varsity Tutors’ Learning Tools include a set of online flashcards that cover two separate areas of computer science: A+ certification and Computer Science.
Computer enthusiasts who are looking to earn the A+ professional certification to advance their careers have an option in the numerous free flashcards online in this set. Within the A+ certification flashcard set, you’ll cover topics like identifying acronyms, identifying hard drive form factors, determining the appropriate commands to use to obtain specific results, and selection of the appropriate program to use for specific tasks. This set of flashcards presents a multiple-choice question with four possible answers, and will show you what the right answer is, whether you’ve chosen it or not. If you’ve chosen the incorrect answer, you’ll also see an explanation of why the correct answer is the correct one.
If you’re not interested in the A+ certification, but instead are interested in learning about computer science, you’ll probably want to check out the numerous free online flashcards for computer science. These cover topics like object-oriented program design, program analysis, program implementation, operations and algorithms, and standard data structures. The computer science specific flashcards offer five possible answers, but also give explanation of the correct answer.
These flashcards are great if you have a busy schedule and have to balance your studying with a variety of other time-consuming pursuits, like work and other classes. You don’t have to spend hours at a time reviewing these concepts; with the Computer Science Flashcards, you can review as few or as many concepts as you choose. The online flashcards allow you to move through flashcards, skipping questions without penalty, or revisiting questions after you’ve answered them, if you choose.
Setting up an account with Varsity Tutors’ Learning Tools web site allows you to track your progress through the flashcards. You can also use the flashcard template to create personalized flashcards to focus on the concepts you struggle with.
Varsity Tutors’ Learning Tools also include other ways to study computer science. There is a Diagnostic Test that you can use to find out where your understanding might be weakest. There are many Practice Tests that you can use as you study to judge how well you understand the topic, and there’s an interactive syllabus called Learn by Concept, which allows you to explore different concepts of computer science. The final Learning Tool is the Question of the Day series, which presents a random question related to computer science, which also allows you to determine how well you understand the topic, and if there are areas that you might want to study further.
