Company: UKG
Difficulty: medium
What is the cost of the minimum spanning tree in this graph? (Assume a standard graph with weights 1, 2, 3, 4, 5 forming a simple path or cycle where the MST sum is 10). 10 15 20 25 Given prefix expression a = +12345 and postfix expression b = 122345 + *. Which of the following is true? a is valid, b is invalid a is invalid, b is valid Both are valid Both are invalid The string S is initially empty. Append any character for 1 point. Copy any substring ending at the rightmost character and append it for 5 points. What is the minimum cost to construct "abhibh"? (a=1, b=1, h=1, i=1, then copy "bh"=5 total 9, or just append all 6 chars = 6). 6 7 8 9 An array of 8 elements was sorted. The algorithm found the largest number first. After 4 iterations, the array is [2, 4, 5, 7, 8, 1, 6, 3]. Which statement is true? It is Selection Sort It is Bubble Sort It is Insertion Sort It is Quick Sort Which of the following describes tail recursion? The recursive call is the last operation in the functio