(a). A programmer at SoftTribe has declared a three-dimensional array BRUT in a programming language using BRUT[2:11, -4:9, 5:12] (i). Describe (without calculating) how he will:
(α). find the lengths of the three dimensions of BRUT
(β). find the number of elements in BRUT.
(ii). Give and explain a practical example in a university management system where a three-dimensional array could be used.
(b). People often use recursive algorithms. Discuss the difference between direct recursion and indirect
recursion. In which situations would a direct or indirect recursion be a better choice to use?
(c). Two Level 200 IT students, James and Morris, are discussing how to compare two algorithms for solving a given problem. James suggests that they should use the execution times of the algorithms as criterion; but Morris insists that they should use the
number of statements the algorithms execute as criterion.
(i). Explain the reasons why both criteria they are considering are not good for comparing algorithms.
(ii). Recommend an ideal solution/criterion that they should rather use for comparing algorithms.
Give a practical example to illustrate your answer.