Mena Sargios
Quiz von , erstellt am more than 1 year ago

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

336
0
0
Mena Sargios
Erstellt von Mena Sargios vor mehr als 7 Jahre
Schließen

4. 2-3-4 Tree

Frage 1 von 18

1

What are the internal node stipulations in a 2-3-4 tree?

Wähle eine der folgenden:

  • If the internal node has one data item in it, then it only has two children
    if the internal node has two data items in it, then it has three children
    if the internal node has three data items in it, then it has four children

  • none of the above

Erklärung

Frage 2 von 18

1

An internal node in a 2-3-4 tree is said to be a _ node if it has
_ data elements.

Wähle eine der folgenden:

  • A) 2, 2

  • B) 3, 2

  • C) 3, 4

  • D) 4, 4

Erklärung

Frage 3 von 18

1

What makes a 2-3-4 tree seperate from a binary tree?

Wähle eine der folgenden:

  • Each node can have up to three elements and four children.

  • none of the above

Erklärung

Frage 4 von 18

1

What does the 2,3,4 in a 2-3-4 tree mean

Wähle eine der folgenden:

  • A.how many links to child nodes can potentially be contained in a given node

  • B.how many searches must be done find element of the tree

  • C.none of the above

  • D.A and B

Erklärung

Frage 5 von 18

1

What are 2-3-4 tree's commonly used to implement?

Wähle eine der folgenden:

  • Dictionaries

  • none of the above

Erklärung

Frage 6 von 18

1

a 2–3–4 tree is a self-balancing data structure that is commonly used to implement dictionaries.

Wähle eins der folgenden:

  • WAHR
  • FALSCH

Erklärung

Frage 7 von 18

1

in a 2-3-4 tree a node can have up to 4 children?

Wähle eins der folgenden:

  • WAHR
  • FALSCH

Erklärung

Frage 8 von 18

1

Which of the following is true of 2-3-4 trees?

Wähle eine der folgenden:

  • a. a 2-node has TWO data elements and TWO child nodes.

  • b. a 3-node has TWO data elements and THREE child nodes.

  • c. a 4-node has THREE data elements and THREE child nodes.

  • d. None are true!

Erklärung

Frage 9 von 18

1

What is the maximum number of children in a 2-3-4 tree?

Wähle eine der folgenden:

  • A) There is no maximum

  • B) 9

  • C) 2

  • D) 4

Erklärung

Frage 10 von 18

1

A tree where every node with children has either 2, 3, or 4 children:

Wähle eine der folgenden:

  • 2-3-4 tree

  • none of the above

Erklärung

Frage 11 von 18

1

A 2-3-4 tree is a tree where every node with children has ________ child nodes.

Wähle eine der folgenden:

  • A. 2 3 or 4

  • B. 1 2 or 3

  • C. 4 5 or 6

  • D. 2 4 or 6

Erklärung

Frage 12 von 18

1

What is one proerty of 2-3-4 trees?

Wähle eine der folgenden:

  • A) All external nodes are at the same depth

  • B) The trees have height 2, 3, or 4

  • C) They are A-Trees

  • D) None

Erklärung

Frage 13 von 18

1

Which of the following is a characteristic of a 2-3-4 tree?

Wähle eine der folgenden:

  • A. all leaves are on the same level

  • B. each node has 2 keys with 3 children, and every tree is log 4 for searching

  • C. has 3 or 4 keys per node

  • D. each node can have any number of children, but only 2, 3, or 4 keys per node

Erklärung

Frage 14 von 18

1

What are the properties of a 2-3-4 tree?

Wähle eine der folgenden:

  • A. Every node (leaf or internal) is a 2-node, 3-node or a 4-node, and holds one, two, or three data elements, respectively.

  • B. All leaves are at the same depth (the bottom level).

  • C. All data is kept in sorted order.

  • D. All of the above

Erklärung

Frage 15 von 18

1

2-3-4 trees are an isometry of red-black trees.

Wähle eins der folgenden:

  • WAHR
  • FALSCH

Erklärung

Frage 16 von 18

1

In computer science, a 2–3–4 tree (also called a 2–4 tree) is a self-balancing data structure that is commonly used to implement dictionaries.
which is not correct the following properties of 2-3-4 tree?

Wähle eine der folgenden:

  • a. Every node (leaf or internal) is a 2-node, 3-node or a 4-node, and holds one, two, or three data elements, respectively.

  • b. All leaves are at the same depth (the bottom level).

  • c. All data is kept in sorted order.

  • d. All data is not kept in any certain sorted order.

Erklärung

Frage 17 von 18

1

which one is not right about the 2_3_4 tree?

Wähle eine der folgenden:

  • A. one node in a 2_3_4 tree must has 4 child nodes.

  • B. In the average case, the time complexity of searching one member of the 2_3_4 tree is O(logn).

  • C. In the average case, the time complexity of inserting one member into the 2_3_4 tree is O(logn).

  • D. 2–3–4 trees are B-trees of order 4.

Erklärung

Frage 18 von 18

1

In big O notation, what is the worst case time complexity for inserting a node into a 2-3-4 tree?

Wähle eine der folgenden:

  • A) O(Log(N+1))

  • B) O(Log(N-1))

  • C) O(Log(N/2))

  • D) O(Log(N))

Erklärung