Question 1 of 25
Hints left: 3
Q1
Q1: Which of the following is not a sorting algorithm? (1-2)
Q2
What shape will the program draw?
Q3
What is the time complexity of an insertion sort on average and worst case?
Q4
Q8: Which sorting algorithm needs to go through the list repeatedly? (4-5)
Q5
A FIFO replacement algorithm associates with each page the
Q6
Q9: A linear search is to be performed on the list: 12 6 8 1 3 How many comparisons would it take to f ind the number 1?
Q7
Process are classified into different groups in
Q8
How much is the least cost TSP tour for the given graph?
Q9
What is SPAM? Select ALL the correct answers.
Q10
A section in a flowchart that requires an action from a user is known as a
Q12
Linear Search is faster than Binary search
Q14
Numbers inputted are 5 and 8. Answers?
Q15
Which of the following is similar to generalisation?
Q16
To draw a regular polygon in Scratch:The number of sides is equal to:
Q17
Is this elevator button panel an example of good or bad UCD?
Q18
Which type of error will not allow the program to run?
Q19
A datatype that can hold more than one value is known as
Q20
What is Pseudo code?
Q21
Using the formula given, what is the triangular number of 9?
Q22
What would be the Value of human-Age given the input 3
Q23
Identify the routing algorithm.
Q24
let p(x) = g(x)q(x) +r(x). If degree of p(x) is 6 and degree of g(x) is 3 then degree of r(x) cannot be
Q25
The Queue represent which page replacement algorithm?