Mark correct and incorrect assertions about

(yes) Dictionary with linear ordering of keys is called ordered dictionary.

(no) A log file is a dictionary implemented by means of a sorted sequence.

Let us have an

implementation - operation - running time.

(yes) Log File -

(no) Lookup Table -

Let us have an

(yes)

(no)

A simple open addressing strategy for collision handling in hash tables is linear probing. Let us have a bucket array A = {35,14,D,21,E,12,E} with capacity N = 7, where E means "empty" and D means "deattached" (or "available") item. The hash function is h(k) = k mod 7. Find the correct/incorrect correspondence, where -> means "is equivalent to".

(yes) insrtItem(7) -> A[2] = 7

(no) insrtItem(38) -> A[3] = 38

(yes)

(no)

Class

Mark the correct/incorrect assertions about this function.

(yes) This function places an Item of BST (dictionary) at position

(no) Replacing

Let us have an AVL tree ADT in parenthetic string representation

44(17(-,32),78(50(48,62),88)).

External nodes are not included in this representation. Determine the correct/incorrect resulting AVL tree after applying the corresponding operation.

(yes) insertItem(54) 44(17(-,32),62(50(48,54),78(-,88)))

(no) insertItem(54) 44(17(54,32),78(50(48,62),88))

Class

in the

(yes) The return value is a reference to a data member of

(no)

Look at the part of the realization of the

(yes) Every object of class

(no) The function

Mark the correct/incorrect definitions and assertions about search trees.

(yes) Keys stored at nodes in the left subtree of a node v (of a search tree) are less then or equal to the key at v.

(no) Each internal node of a (2,4) tree has at least four children.

Let us have a (2,4) tree ADT in parenthetic string representation

T={12}({3,6,9},{15}).

External nodes are not included in this representation. Determine the correct/incorrect resulting (2,4) tree after applying the corresponding operation.

(yes) insertItem(1) - T={12,6}({1,3},{9},{15})

(no) insertItem(1) - T={12,3}({1,6,9},{15})

Let us have a (2,4) tree ADT in parenthetic string representation

T={10,15,24}({2,8},{12},{18},{27,32,35}).

External nodes are not included in this representation. Determine the correct/incorrect resulting (2,4) tree after applying the corresponding operation.

(yes) removeElement(24) - T={10,15,27}({2.8},{12},{18},{32,35})

(no) removeElement(2) - T={10,15,24}({8,12},{18},{27,32.35})

Let us have a red-black tree ADT in parenthetic string representation, where black nodes are bold, and red nodes are italic. External nodes are not included in this representation. Determine the correct/incorrect resulting red-black tree after applying the corresponding operation.

(yes) 6(8) - insertItem(7) - 7(6,8)

(no) 6(8) - insertItem(9) - 6(8,9)

Let us have a red-black tree ADT in parenthetic string representation, where black nodes are bold, and red nodes are italic. External nodes are not included in this representation. Determine the correct/incorrect resulting red-black tree after applying the operation

(ye

(no)

Look at the

(yes) The function

(no) The function