Top answers

Explain how a stack could be used in the process of evaluating an expression in Reverse Polish notation.

Starting at the left hand side of the expression push values onto stack. Each time operator reached in the expression pop the top two values off the stack and apply the operator to them, then push the new va...
EF
Answered by Ellie F. • Computing tutor
3946 Views

Describe an IDE and its features in programming. (3 Marks)

IDE = Integreated Development EnvironmentAutocompletion of code, e.g finishing statementsBracket matchingTranslator , would also accept compiles/interprets codeDebug mode, e.g could step through codeLibrarie...
Answered by • Computing tutor
2597 Views

Image a graph. In which instances is it more appropriate to use an adjacency list instead of an adjacency matrix?

There are two criteria that usually determine whether we use an adjacency list or an adjacency matrix?a. The size of the graph and the number of edges. If the graph has a very big number of nodes but has onl...
CB
Answered by Calin B. • Computing tutor
2039 Views

Explain a bubble sort. You may use pseudocode and/or diagrams to help demonstrate your answer.

A bubble sort works by performing a number of passes on a list of data. With each pass the list will get closer to the final order. During a pass the algorithm compares a selected item with each item in the ...
CF
2193 Views

What is Bubble Sort algorithm and how it works? Give an example of pseudo-code explaining the process.

A Bubble Sort algorithm is one of the simplest and easy-to-program sorting algorithms, at an expense of inefficiency. One of the main reasons why it is simple is because that it uses the notion of swapping b...
NM
Answered by Nedas M. • Computing tutor
3767 Views