Search over 10,000 free study notes
Over a million students use our free study notes to help them with their homework
Top answers
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
2554 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
2006 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
Answered by
Christopher F.
•
Computing tutor
2180 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
1852 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
2083 Views
1
2
3
4
5
→