Search our library of All subjects All levels questions

Top answers

All subjects

All levels

Write pseudocode for the linear search algorithm, and then explain it’s complexity using big-O notation

Pseudocode: FUNCTION linearSearch(list, searchTerm): FOR index FROM 0 -> length(list): IF list[index] == searchTerm THEN ...

Answered by Jacob N. • Computing tutor

27573 Views

Describe what you understand by abstraction, and how it is relevant to software engineering.

Two parts: Abstraction: Separating ideas from reality / implementationHiding (irrelevant) details from the userA representation / simplification of a concept Application: Object oriented programming is fu...

Answered by Jacob N. • Computing tutor

2448 Views

What is an interface and why are they useful?

An interface in the Object Oriented Programming (OOP) sense is very similar to a class definition - it is the definition of the various functions and procedures provided by the class (in this case interfa...

Answered by Kajetan C. • Computing tutor

8290 Views

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

4173 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

9771 Views