Mena Sargios
Quiz by , created more than 1 year ago

Algorithms and Data Structures | Test 3 Review | CSCI-3110-002 MTSU

220
0
0
Mena Sargios
Created by Mena Sargios about 8 years ago
Close

1. Trees Splay Trees

Question 1 of 20

1

Splay trees use AVL rotation by taking nodes that not have been accessed and move them toward the leaves.

Select one of the following:

  • True
  • False

Explanation

Question 2 of 20

1

What is a splay tree and what is the act of splaying?

Select one of the following:

  • A splay tree is a self-adjusting binary search tree. The act of splaying is
    that after a node is accessed, it is moved up in the tree toward the root with
    AVL rotations.

  • none of the above

Explanation

Question 3 of 20

1

What is the Big O for average case of Reterieval for Splay trees?

Select one of the following:

  • log(N)

  • O(N^2)

Explanation

Question 4 of 20

1

What is the benefit of using splay trees?

Select one of the following:

  • it allows easier access to recently added values.

  • none of the above

Explanation

Question 5 of 20

1

Splaying is used for balancing binary search trees.

Select one of the following:

  • True
  • False

Explanation

Question 6 of 20

1

What is the worst case to search a Splay tree?

Select one of the following:

  • A.n

  • B.amortized O(log n)

  • C.n^2

  • D.none of these

Explanation

Question 7 of 20

1

How are splay trees different from AVL trees?

Select one of the following:

  • Splay trees splay the node visited all the way to the root to make them more easily accessed.

  • none of the above

Explanation

Question 8 of 20

1

A splay tree is a type of balanced binary search tree.

Select one of the following:

  • True
  • False

Explanation

Question 9 of 20

1

what do you trying to splay a node with the root(zig)?

Select one of the following:

  • A) Avl single rotation

  • B) Avl double rotation

Explanation

Question 10 of 20

1

Which of the following is a disadvantage of a splay tree?

Select one of the following:

  • a) Recently accessed items are at the bottom of the tree

  • b) Implementation is very complex

  • c) Splay trees are not very efficient

  • d) The tree height can potentially be n

Explanation

Question 11 of 20

1

What is a binary search tree with the additional property that recently
accessed elements are quick to access again called?

Select one of the following:

  • A) B-Tree

  • B) Spray Tree

  • C) AVL Tree

  • D) Splay Tree

Explanation

Question 12 of 20

1

What algorithm do you need to use to create a minimum spanning tree?

Select one of the following:

  • Prim’s Algorithm

  • none of the above

Explanation

Question 13 of 20

1

What is a splay tree?

Select one of the following:

  • A. A tree with no leaves

  • B. A tree with two root nodes

  • C. A self-adjusting binary search tree

  • D. An empty tree

Explanation

Question 14 of 20

1

What is a splay tree?

Select one of the following:

  • A) A self-adjusting binary search tree.

  • B) A tree that spreads out

  • C) there is no such thing

Explanation

Question 15 of 20

1

What is a condition for a zig-zag step?

Select one of the following:

  • A. X is the right child of P and P is the right child of G

  • B. X is the left child of P and P is the left child of G

  • C. X is the left child of P and P is the right child of G

  • D. zig-zag is done when P is the root (therefore there is no G)

Explanation

Question 16 of 20

1

What are splay trees?

Select one of the following:

  • A. self-adjusting binary sort trees

  • B. self-adjusting binary search trees

  • C. self-adjusting binary splay trees

  • D. non self-adjusting binary sort trees

Explanation

Question 17 of 20

1

When dealing with splay trees the condition for the Zig-Zag step is when X is the left child of P, and P is the right child of G, or When X si the right child of P and P is the left child of G.

Select one of the following:

  • True
  • False

Explanation

Question 18 of 20

1

In average case, what is the efficiency of Deletion of an AVL tree?

Select one of the following:

  • A. logn

  • B. nlogn

  • C. n

  • D. n2

Explanation

Question 19 of 20

1

Splay trees are NOT self adjusting Binary Search Trees.

Select one of the following:

  • True
  • False

Explanation

Question 20 of 20

1

What is splaying?

Select one of the following:

  • Moving the last accessed node in a tree to the root with AVL rotations.

  • none of the above

Explanation

Previous
Check answer
Next