Csit 212

In an array-based implementation of a dictionary, you can store key-value pairs

In the unsorted array-based dictionary class ArrayDictionary, a new key-value entry is entered

In an array-based implementation of a dictionary, if you represent the entries as an array of objects that encapsulate each search key and corresponding value, how many pointers will you use per array entry

Write a statement to create an instance of a class Dictionary that implements DictionaryInterface. Your dictionary contain Word objects that are lists of synonyms for words. The key value is a String representing the word to look up. Call your dictionary thesaurus.

Write a statement to create a key iterator for a dictionary called thesaurus that is an instance of the class Dictionary and implements Dictionary Interface. The search keys are strings and the values stored are Word object

Malware files are often identified by hash values to uniquely identify the files. Create an instance of an empty dictionary called malware that is a class Dictionary that implements DictionaryInterface, Your dictionary will contain strings for the name of the malware. It will use MDHash objects that contain the hash value as search keys for the malware names.

The ADT dictionary organizes and identifies its entries by position

The recommended size of a hash table is a

16. A good hash function should

Assume you have a hash table length of 53. Given the value 216, what index will the entry map to? Select the best answer (one or more could be correct)

An ___ maps each search key into a different integer that is suitable as an index to the hash table

The technique for determining an array index using only a search key and not searching is called

You can perform a binary search on this array: int[] list = [2,4,7,10,45,11,50,59,60,66,69,79,70]

Swapping requires three assignment statements and a temporary storage location

Regarding the preceding question: to swap the values of first and second you could write this code and it would be correct: temp = first, first = second, second = temp

27. The processing of the selection sort algorithm includes the swapping of two values

The graphic below depicts

The Tower of Hanoi problem is often used as a classical problem to demonstrate recursion and recursive programming. This is so because a solution to the problem can not be done via an iterative algorithm

In the previous question, it was asserted that an iterative algorithm to solve the tower of Hanoi problem is not possible. Hopefully you answered that this statement was False. Given then, that an iterative solution is possible in this case, we can assert that an iteration algorithm is much less efficient that a recursive one. What do you say to that?

Consider the function f(x) = x^2 +C…. For C=1 the output of the first 3 iterations is

For small, (+) numbers such as 0.1 f(x) = x^2 + C

What number between -2(?) and 0 must be our input to get an output that alternates between 0 and -1?

A correct array representation of the max heap would be

41. Give a depth-first traversal of the following graph beginning at vertex A

If a directed graph has 5 vertices. How many edges can it have

An undirected graph has n vertices. How many edges can it have?

In a weighted graph the shortest path is the one with the smallest edge weight sum

In the unsorted linked dictionary, the worst case time efficiency of adding a key-value pair is

In the unsorted linked dictionary, the worst case time efficiency of removing a key-value pair is

In the unsorted linked dictionary, the worst case time efficiency of retrieving a key-value pair is

In the sorted linked dictionary, the worst case time efficiency of retrieving a key-value pair is