Top answers

Write a small program, in pseudocode or otherwise, that demonstrates a recursive algorithm. Write a small explanation of how recursion is used in your program.

The Fibonacci sequence is defined as: f(n) = f(n-1) + f(n-2)F(0) = 1F(1) = 1 Where n is a positive number. This allows for a recursive algorithm to be written that returns 1 for the two base cases, and retur...
JF
Answered by Jordan F. • Computing tutor
2755 Views

In terms of programming software, what is a translator? Describe the differences between the following three translators: assembler, compiler, interpreter.

A translator is used to convert high-level code into machine code. This is a set of instructions that can be directly executed by the computer's central processing unit (CPU). An assembler translates assembl...
JL
Answered by Joanna L. • Computing tutor
6898 Views

What is an Algorithm?

An algorithm is a set of instructions given to a computer to carry out a particular task.
MM
Answered by Max M. • Computing tutor
2574 Views

Convert 00110001 to Decimal

Ans = 49To solve:Use the binary place valuesWrite each digit of the binary number under each place valueAdd every place value with a '1'This give the answer
MM
Answered by Max M. • Computing tutor
4224 Views

Explain indexed addressing including the benefits when traversing certain data structures (4 Marks)

The question is an "Explain question" so we need to say what indexed addressing is and how it works (3 marks): " (1) There is an index register which holds the base value for where the data is...
RS
Answered by Ravi S. • Computing tutor
2414 Views