Search our library of All subjects All levels questions

Top answers

All subjects

All levels

Given a graph with n nodes and m edges, every edge has a passing cost that can be negative, find the minimum distance between node 1 and every other node

We will use the Bellman-Ford algorithm to compute the minimum distance between that start node and every other one, by passing through each edge for a maximum of n times and "relaxing the edge",...

Answered by Victor S. • Computing tutor

4312 Views

How can the idea of precondtioning as part of 'Thinking Ahead' benefit a programmer when writing code?

'Thinking Ahead' is one of 5 main aspects of Computational Thinking. It is the planning of inputs, ouputs and preconditions that the program will adhear to. By 'Thinking Ahead' programmers can discover ho...

Answered by Nathan H. • Computing tutor

9979 Views

What is the decimal equivalent of the following sequence of bits, which represents an unsigned binary integer: 1101001. What is the decimal equivalent if the sequence in bits encodes a two’s complement binary integer.

1101001

Unsigned binary number means every bit represents a power of two. The sum of the powers present in the binary representation gives the number in decimal.

We start from right to left...

Answered by Alexandru P. • Computing tutor

2555 Views

Taken from an AQA paper: A common misconception is that the Internet is the World Wide Web. Explain the differences between the Internet and the World Wide Web.

Using these terms interchangeably is a pet-hate of Sir Tim-Bernes-Lee, who invented the WWW and works at our university, so it seemed an appriate choice! The internet can be thought of as a massive networ...

Answered by George G. • Computing tutor

3052 Views