32. What is the performance of an algorithm with recurrence relation T(n)=2T(n/8)+n? (a) O(n²) (b) O(n¹) (c) O(n log n)

[answerhappygod]

32 What Is The Performance Of An Algorithm With Recurrence Relation T N 2t N 8 N A O N B O N C O N Log N 1 (48.99 KiB) Viewed 8 times

32. What is the performance of an algorithm with recurrence relation T(n)=2T(n/8)+n? (a) O(n²) (b) O(n¹) (c) O(n log n) (d) O(n) (e) O(n) 33. In a M x N multidimensional array implemented using a single dimension array, what is the formula used to access an object based on indexes i and j? (a) i*N+j (b) i j (c) i *N+j*M (d) i+j (e) N+M-i 34. What is the post-order traversal of the tree below? P m (a) ABCDEFGIHIJKLM (b) DHBEAKIFCGLJM (c) ABDHECFIKGJLM (d) HDEBKIFLMJGCA (e) None of the above 11