Lý Thuyết CSD

Specify the correct statement about open addressing method for handling collision
Select one:

• A. Each position of the table is associated with a linked list or chain of structures whose info fields store keys or references to keys

• B. The collision is resolved by finding an available table entry other than the position to which the colliding key is originally hashed

• C. The collision is resolved by open an address to store any collision

• D. An address is opened for storing keys

Select the most correct statement:

• A. In all cases the insertion sort is O(n^2).

• B. The complexity of insertion sort is O(n^2), in the best case it is O(n).

• C. The complexity of insertion sort is Onlog n), in the best case it is O(n).

• D. The complexity of insertion sort is O(n^2), in the best case it is O(nlog n).

Specify the correct statement about chaining method for handling collision

• A. In chaining, each position of the table is associated with a linked list or chain of structures whose info fields store keys or references to keys

• B. In chaining, only some positions of the table is associated with a linked list or chain of structures whose info fields store keys or references to keys

• C. In chaining, the linked-list is used instead of array for a hash table

• D. None of others

Run length encoding is a lossless compression method in which repeated occurrences of a symbol are replaced by one occurrence of the symbol followed by the number of occurrences.

• A. True

• B. False

In a max heap tree,.......

• A. Values in a node is greater than every value in left sub tree and smaller than right sub tree

• B. Values in a node is greater than every value in children of it

• C. Both of other conditions applies

Select the statement that is most correct.
Basically, the complexity of counting the number of items in a doubly-linked list is

• A. O(n)

• B. O(n^2)

• C. O(nlogn)

• D. O(1)

Linked lists are best suited

• A. for relatively permanent collections of data

• B. for the size of the structure and the data in the structure are constantly changing

Fill in blank to form a correct statement: "A recursive method is a method that invokes itself directly or indirectly. For a recursive method to terminate there must be one or more _______

• B. steps

• A. base cases

• C. limit conditions

• D. conditions

The number of edges required to create a minimum spanning Tree of the graph G (n vertices) is

• A. n

• C. n+1

• B. n-1

• D. 2n

In a linked list, the tail node is introduced for performance purpose only.

• A. False

• B. True