Company: Ukg_5sep
Difficulty: medium
What is the cost of the minimum spanning tree in a graph with the following edges: (0,1,4), (0,7,8), (1,2,8), (1,7,11), (2,3,7), (2,8,2), (2,5,4), (3,4,9), (3,5,14), (4,5,10), (5,6,2), (6,7,1), (6,8,6), (7,8,7)? 37 39 41 43 Given the prefix expression 'a' and postfix expression 'b' derived from the same mathematical logic, which of the following statements is true regarding their evaluation? They always yield different numerical results. They differ in the order in which operands and operators are processed. Prefix expressions are inherently more memory-efficient than postfix. Postfix expressions require a double-ended queue for evaluation. The string S is initially empty. The following operations can be performed: 1) Append any character to S for 5 points. 2) Copy any substring of S that ends at the current rightmost character and append it to S for 5 points. What is the minimum cost to construct the string "abhibhibhi"? 25 30 35 40 An array of 8 elements was sorted using a sorting al