Question 2 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: (a). find the lengths of the three dimensions of BRUT (B). 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.

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question
Question 2
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:
(a). find the lengths of the three dimensions of BRUT
(B). 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.
Transcribed Image Text:Question 2 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: (a). find the lengths of the three dimensions of BRUT (B). 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.
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY