make it stop

Suppose you have an array of coins [9, 6, 5. 1) and you want to make change for 11 cents using the minimum number of coins. What is the optimal subset of coins that you should use?

• [6.5]

• [9.1,1]

• [1,1,1,1,1,1,1,1,1,1,1]

• [5,5.1]

What is the term for the number of edges that are incident to a vertex in a graph?

• Size

• Length

• Degree

• Order

Suppose you have a hash table of size 10 that uses the hash function h(k) = k mod 10. What is the index of the cell where the key 35 will be stored ?*

• 3

• 7

• 0

• 5

What is the term for a connected graph that has no cycles?

• 5panning tree

• Bipartite graph

• Tree

• Forest

What is the name of the optimization technique that speeds up the execution of a function by caching its previous results and returning them when the same inputs are given again ?

• Parallelization

• Memoization

• Recursion

• iteration

What is the name of the property that a problem must have in order to be solved by dynamic programming. which means that the optimal solution of the problem can be obtained by using the optimal solutions of its subproblems ?

• Optimal substructure

• Greedy choice

• Overlapping subproblems

• Divide and conquer

What is the name of the problem that asks for the optimal way to select a subset of activities from a given set. such that no two activities overlap in time and the number of selected activities is maximized, which can be solved using a greedy algorithm?

• Coin change problem

• Activity selection problem

• Knapsack problem

• Job scheduling problem

What is the name of the property that a problem must have in order to be solved by a greedy algorithm, which means that the optimal solution of the problem can be obtained by making the locally optimal choice at each step ?*

• Divide and conquer

• Overlapping subproblems

• Optimal substructure

• Greedy choice

Suppose you have a set of 6 activities with their start and finish times as follows: Activity = [1.2.3.4,5,6]. Start =[1,3,0,5,8,5]. Finish=[2,4,6,7,9,9].What is the maximum number of activities performed by a single person using the greedy solution for the activity selection problem ?

• 5

• 3

• 2

• 4

.Suppose you have an array of coins [1, 5, 10, 25] and you want to make change for 62 cents using the minimum number of coins. What is the value of the dynamic programming table entry F[62]. where F[i] represents the minimum number of coins required to make change for i cents?

• 4

• 3

• 6

• 5