Top answers

All subjects
All levels

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...

Answered by Ellie F. Computing tutor
2887 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 codeLibra...

Answered by Computing tutor
2023 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 ...

Answered by Calin B. Computing tutor
1353 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 t...

Answered by Christopher F. Computing tutor
1530 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

Answered by Ben I. Computing tutor
1436 Views

We're here to help

contact us iconContact usWhatsapp logoMessage us on Whatsapptelephone icon+44 (0) 203 773 6020
Facebook logoInstagram logoLinkedIn logo

© MyTutorWeb Ltd 2013–2025

Terms & Conditions|Privacy Policy
Cookie Preferences