Top answers

Represent 83 in 8 bit binary.

Start on the left side of the binary number - the first digit is the "128s" digit - there are no "128s" in 83 (as 128 is clearly larger than 128), so we start with a 0.Next is 64 - there ...
RL
Answered by Rose L. • Computing tutor
7178 Views

What is the time complexity of Bubble Sort?

had problems before interview with submitting this and have therefore no longer got my answer, however was able to complete the interview successfully with the answer
BI
Answered by Ben I. • Computing tutor
1872 Views

In Python, write a recursive function that returns the first n Fibonacci numbers.

Begin by denoting the first and second Fibonacci number as 0 and 1 respectively. This helps us define a base case for our algorithm. We know that new Fibonacci numbers are formed by adding its 2 predecessors...
MS
Answered by Meer S. • Computing tutor
2111 Views

What are higher order functions in functional programming? How does the 'map' function work and why is it a higher order function?

Higher order functions either have one or more arguments that are themselves functions , return a function as their result, or both . Arguments to higher order functions can themselves be higher order functi...
JC
Answered by Joseph C. • Computing tutor
2311 Views

Describe the operations of an optical disk drive used to read data from an optical disk, such as a CD or DVD.

Data is stored one a continuous spiraled track around the optical disk, the track is made up of a continuation of lands and pits, where lands will reflect the light focused onto them, and pits will scatter t...
DC
Answered by Daniel C. • Computing tutor
3432 Views