MADD

MADD

Assessment

Assessment

Created by

Dũng Lê

Mathematics

University

2 plays

Easy

16 questions

Show all answers

1.

MULTIPLE CHOICE

30 sec • 1 pt

In an ordered rooted tree, which of the following is true about the universal address system?

2.

MULTIPLE CHOICE

30 sec • 1 pt

hat is the address of the parent of a node labeled 3.4.5 in a universal address system?

3.

MULTIPLE CHOICE

30 sec • 1 pt

In the universal address system, which label represents the root of a tree?

4.

MULTIPLE CHOICE

30 sec • 1 pt

If a vertex in an ordered rooted tree has the address 2.3.4, how many levels deep is it?

5.

MULTIPLE CHOICE

30 sec • 1 pt

What is the minimum number of vertices in a tree if the address of one vertex is 3.4.5?

6.

MULTIPLE CHOICE

30 sec • 1 pt

If a tree node has the address 2.3, what is the address of its child in the first position?

7.

MULTIPLE CHOICE

30 sec • 1 pt

Which of the following is an example of a lexicographic order for tree vertices?

8.

MULTIPLE CHOICE

30 sec • 1 pt

In a preorder traversal of a tree, in what order are the vertices visited?

9.

MULTIPLE CHOICE

30 sec • 1 pt

How can the address system help in determining the number of vertices in a tree?

10.

MULTIPLE CHOICE

30 sec • 1 pt

In a postorder traversal, which of the following orders is correct for a rooted tree?

Explore all questions with a free account

or continue with
Microsoft
Apple
Others
By signing up, you agree to our Terms of Service & Privacy Policy
Already have an account?