MPS INTERNAL 2 TEST

Which algorithm searches for an element in a list by checking each element one by one until a match is found or the end of the list is reached?

• Sequential Search

• Binary Search

• Hashing

• Tree Search

Optimal Binary Search Trees are used to minimize the:

• Number of nodes in a binary tree

• Height of a binary tree

• Average search time in a binary search tree

• Maximum search time in a binary search tree

In the context of optimal binary search trees, what does the term "internal cost" refer to?

• The cost of searching in the root node

• The cost of searching in the internal nodes

• The cost of searching in the leaf nodes

• The cost of building the binary search tree

Floyd's algorithm is used for:

• Finding the shortest path in a weighted graph with negative edge weights

• Finding the shortest path in a weighted graph with non-negative edge weights

• Finding the longest path in a directed acyclic graph

• Finding the minimum spanning tree in a graph

What is the order of growth of the function f(n) = 2n3 + 3n2 + 4n ?

• O(n)

• O(n^2)

• O(n^3)

• O(n^4)

When analyzing the time complexity of a non-recursive algorithm, what is the primary focus?

• The number of iterations

• The number of function calls

• The size of the input

• The number of base cases