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 Computer Science Resources

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

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

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.

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

Peter Auriol

Hervaeus

Guiral

Acton

Betty

Felix

Lila

Lola

Yippy

Pierce

Yiiiipppy

Betty

Acton

Felix

Guiral

Lola

Lila

Pierce

Yiiiipppy

Yippy

Peter Auriol

Hervaeus

Acton

Betty

Felix

Guiral

Hervaeus

Lila

Lola

Peter Auriol

Pierce

Yiiiipppy

Yippy

There is an error in the recursion in BTNode.

Report an Error Copyright Notice

Flashcards: Operations on Data Structures

What is the output for this method?

Your answer:

Hervaeus

Guiral

Felix

Acton

Betty

Peter Auriol

Lila

Lola

Yippy

Yiiiipppy

Pierce

Your answer:

Peter Auriol

Hervaeus

Guiral

Acton

Betty

Felix

Lila

Lola

Yippy

Pierce

Yiiiipppy

Your answer:

Betty

Acton

Felix

Guiral

Lola

Lila

Pierce

Yiiiipppy

Yippy

Peter Auriol

Hervaeus

Your answer:

There is an error in the recursion in BTNode.

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: Operations on Data Structures

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 the Tank Engine

Thomas Prufer

Thomas Cajetan

Thomas Aquinas

Thomas the Tank Engine

Thomas Prufer

Thomas the Bread-Eater

Thomas Cajetan

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 Prufer

Thomas the Bread-Eater

Thomas Aquinas

Thomas Cajetan

Report an Error Copyright Notice

Flashcards: Operations on Data Structures

What is the output for the main method above?

Your answer:

Thomas Aquinas

Thomas the Tank Engine

Thomas Prufer

Thomas the Bread-Eater

Thomas Cajetan

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

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 Computer Science Tutors

Ying
Certified Tutor

Iowa State University, Master of Science, Mathematics.

View Computer Science Tutors

Asad
Certified Tutor

NED University of Engineering and Technology, Bachelor of Science, Electrical Engineering. University of Cincinnati-Main Camp...

View Computer Science Tutors

Laurie
Certified Tutor

University of Massachusetts Amherst, Bachelor of Science, Computer Science. University of Massachusetts Amherst, Bachelor of ...

Computer Science Tutors in Top Cities:

Popular Courses & Classes

GRE Courses & Classes in Atlanta, ACT Courses & Classes in Denver, Spanish Courses & Classes in Miami, ACT Courses & Classes in Seattle, ISEE Courses & Classes in Atlanta, SSAT Courses & Classes in Philadelphia, ISEE Courses & Classes in New York City, GRE Courses & Classes in Philadelphia, SSAT Courses & Classes in San Francisco-Bay Area, ACT Courses & Classes in Phoenix

Popular Test Prep

ISEE Test Prep in Phoenix, ISEE Test Prep in Miami, ACT Test Prep in Philadelphia, ISEE Test Prep in Boston, ISEE Test Prep in San Francisco-Bay Area, SSAT Test Prep in Philadelphia, ACT Test Prep in Phoenix, GMAT Test Prep in Dallas Fort Worth, SSAT Test Prep in Seattle, ACT Test Prep in San Diego

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 Computer Science Resources

Flashcards: Operations on Data Structures

Flashcards: Operations on Data Structures

Flashcards: Operations on Data Structures

Flashcards: Operations on Data Structures

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 Computer Science Resources

Flashcards: Operations on Data Structures

Flashcards: Operations on Data Structures

Flashcards: Operations on Data Structures

Flashcards: Operations on Data Structures

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: