Back to Dashboard

2.1 Algorithms Diagnostic

Definitive 21-Question Sequence | Violet Tier Diagnostics

Question 1 2 Marks

Define Abstraction in the context of creating a game simulation.

Question 2 2 Marks

Explain why Decomposition is used when developing a complex software project.

Question 3 3 Marks

Complete the hierarchical matching for Computational Thinking concepts.

TermMatching Description
Abstraction
Decomposition
Algorithmic Design
Question 4 3 Marks

Complete the labels for this Structure Diagram of a retail system.

Retail System
Customer Login
Inventory System
Question 5 4 Marks

Complete the Trace Table for the following pseudocode.

01
02
03
04
05
06
x = 5
y = 2
while x > 0
  x = x - y
  y = y + 1
endwhile
Line numberxy
Start (01-02)52
Loop 1 (04-05)
Loop 2 (04-05)
Question 6 2 Marks

Correct the labels on the decision exit lines for this flowchart.

Start
Input Score
Score >= 50?
(b) Path
Output "Fail"
(a) Path
Output "Pass"
Question 7 3 Marks

[Danger Zone] Binary Search: Identify the pre-condition for a Binary Search and the calculation for the midpoint.

Question 8 2 Marks

Describe the Bubble Sort mechanism in terms of "swapping".

Question 9 2 Marks

[Correction Pair]: Identify the error and provide the entire corrected line.

01 limit = 20
02 val = input("Enter number")
03 if val > limit then
04 print("Access Denied")
05 endif
Question 10 2 Marks

Contrast Merge Sort with Bubble Sort in terms of efficiency for large datasets.