A
B
C
D
E
100

This algorithm checks each element one by one and has a time complexity of O(n).

What is linear search?

100

This data structure operates using the Last In, First Out principle.

What is a stack?

100

This component of the CPU performs arithmetic and logical operations.

What is the ALU?

100

This protocol’s name stands for Internet Protocol.

What is IP?

100

This is a named storage location used to hold a value in a program.

What is a variable?

200

This programming technique involves a function calling itself.

What is recursion?

200

This search algorithm repeatedly halves the dataset and has an average time complexity of O(log n).

What is binary search?

200

This is the key difference between a stack and a queue.

What is LIFO vs FIFO?

200

his type of memory stores frequently accessed data to speed up processing.

What is cache memory?

200

This is the key difference between LAN and WAN.

What is local vs wide geographical area?

250

This system monitors and filters incoming and outgoing network traffic based on rules.

What is a firewall?

250

This type of translator converts high-level code into machine code before execution.

What is a compiler?

250

This sorting algorithm consistently performs at O(n log n) and uses a divide-and-conquer approach.

What is merge sort?

250

This feature allows hash tables to achieve average-case O(1) lookup time.

What is hashing (or use of a hash function)?

250

This is the name of the cycle consisting of fetching, decoding, and executing instructions.

What is the fetch-decode-execute cycle?

275

This is one reason increasing clock speed does not always improve CPU performance.

What is heat generation / power consumption / bottlenecks like memory speed?

275

This system translates domain names like google.com into IP addresses.

What is DNS?

275

This OOP concept allows methods to behave differently depending on the object.

What is polymorphism?

275

When the input size doubles, the runtime of an O(n²) algorithm increases by this factor.

What is four times (x4)?
275

This is a disadvantage of linked lists compared to arrays.

What is no direct/random access (or extra memory for pointers)?

300

These are two methods used to handle collisions in hash tables.

What are chaining and open addressing?

300

This CPU technique improves performance by overlapping instruction execution stages but can suffer from hazards.

What is pipelining?

300

This type of encryption uses a public and private key pair

What is asymmetric encryption?

300

This development methodology emphasises iterative development, collaboration, and flexibility.

What is Agile?

300

The time complexity of a loop running n times that performs a binary search inside each iteration.

What is O(n log n)?

M
e
n
u