NumicornNumicornLearn, solve, progress

Computer Science Practice Tests

These Grade 11 Additional Subjects practice tests examine algorithms, abstraction, decomposition, variables, control structures, functions, data structures, complexity, debugging, Internet systems, cybersecurity, databases, privacy, and computational ethics.

Skills covered

  • Explaining algorithms, abstraction, decomposition, variables, Boolean logic, loops, conditionals, functions, and parameters
  • Comparing arrays, stacks, queues, maps, sets, trees, graphs, searching, Big O, and common algorithmic strategies
  • Diagnosing syntax, runtime, logic, boundary, testing, and edge-case errors
  • Understanding packets, IP addresses, DNS, HTTP, APIs, encryption, authentication, phishing, and multifactor security
  • Evaluating bandwidth, latency, cloud computing, databases, SQL, algorithmic bias, privacy, anonymization, and consent

How to use these practice tests

Identify the input, process, data structure, or system first. Then trace the behavior, compare the relevant trade-off, and consider security, privacy, fairness, and reliability where appropriate.

For more Grade 11 Additional Subjects practice, return to the Grade 11 Additional Subjects category.

Select a test

5 Tests
1. Test2. Test3. Test4. Test5. Test

2. Test

Grade 11 Computer Science Practice Tests

Practice Grade 11 Additional Subjects questions about algorithms, programming, data structures, complexity, debugging, Internet systems, cybersecurity, databases, privacy, and computational ethics.

Choose the best answer. Identify the computational process, data structure, network concept, security practice, or ethical principle described by the prompt.

10 Questions
0/10 Questions0 %
Correct 0
Incorrect 0
Unanswered 10
1. QuestionMultiple choice

What is an array commonly used for?

Please select an answer first.

Correct answer: A

The correct answer is Storing an ordered collection of elements that can be accessed by position.

  1. Identify the computing concept: Determine whether the prompt describes an algorithm, data structure, program behavior, network, security practice, or ethical issue.
  2. Apply the computational principle: Arrays organize related values and commonly support index-based access.
  3. Check the result: The correct answer is Storing an ordered collection of elements that can be accessed by position.

Arrays organize related values and commonly support index-based access.

2. QuestionMultiple choice

What is a stack data structure?

Please select an answer first.

Correct answer: B

The correct answer is A last-in, first-out collection in which the most recently added item is removed first.

  1. Identify the computing concept: Determine whether the prompt describes an algorithm, data structure, program behavior, network, security practice, or ethical issue.
  2. Apply the computational principle: A stack follows LIFO behavior, like a pile in which the top item is handled first.
  3. Check the result: The correct answer is A last-in, first-out collection in which the most recently added item is removed first.

A stack follows LIFO behavior, like a pile in which the top item is handled first.

3. QuestionMultiple choice

What is a queue data structure?

Please select an answer first.

Correct answer: C

The correct answer is A first-in, first-out collection in which the earliest added item is removed first.

  1. Identify the computing concept: Determine whether the prompt describes an algorithm, data structure, program behavior, network, security practice, or ethical issue.
  2. Apply the computational principle: A queue follows FIFO behavior, like a line in which the earliest arrival is served first.
  3. Check the result: The correct answer is A first-in, first-out collection in which the earliest added item is removed first.

A queue follows FIFO behavior, like a line in which the earliest arrival is served first.

4. QuestionMultiple choice

What is a dictionary or map?

Please select an answer first.

Correct answer: D

The correct answer is A collection that associates keys with corresponding values.

  1. Identify the computing concept: Determine whether the prompt describes an algorithm, data structure, program behavior, network, security practice, or ethical issue.
  2. Apply the computational principle: Maps provide key-based lookup, such as associating a student ID with a record.
  3. Check the result: The correct answer is A collection that associates keys with corresponding values.

Maps provide key-based lookup, such as associating a student ID with a record.

5. QuestionMultiple choice

What is a set?

Please select an answer first.

Correct answer: A

The correct answer is A collection that stores unique elements without requiring duplicates.

  1. Identify the computing concept: Determine whether the prompt describes an algorithm, data structure, program behavior, network, security practice, or ethical issue.
  2. Apply the computational principle: Sets are useful for membership tests and removing repeated values.
  3. Check the result: The correct answer is A collection that stores unique elements without requiring duplicates.

Sets are useful for membership tests and removing repeated values.

6. QuestionMultiple choice

What is a tree data structure?

Please select an answer first.

Correct answer: B

The correct answer is A hierarchical structure made of nodes connected by parent-child relationships.

  1. Identify the computing concept: Determine whether the prompt describes an algorithm, data structure, program behavior, network, security practice, or ethical issue.
  2. Apply the computational principle: Trees represent hierarchies such as folders, organization charts, and search structures.
  3. Check the result: The correct answer is A hierarchical structure made of nodes connected by parent-child relationships.

Trees represent hierarchies such as folders, organization charts, and search structures.

7. QuestionMultiple choice

What is a graph data structure?

Please select an answer first.

Correct answer: C

The correct answer is A collection of vertices connected by edges that represent relationships.

  1. Identify the computing concept: Determine whether the prompt describes an algorithm, data structure, program behavior, network, security practice, or ethical issue.
  2. Apply the computational principle: Graphs model networks such as roads, social connections, web links, and dependencies.
  3. Check the result: The correct answer is A collection of vertices connected by edges that represent relationships.

Graphs model networks such as roads, social connections, web links, and dependencies.

8. QuestionMultiple choice

What is linear search?

Please select an answer first.

Correct answer: D

The correct answer is Checking elements one at a time until a target is found or the collection ends.

  1. Identify the computing concept: Determine whether the prompt describes an algorithm, data structure, program behavior, network, security practice, or ethical issue.
  2. Apply the computational principle: Linear search works through a collection sequentially and can be used even when the data is not sorted.
  3. Check the result: The correct answer is Checking elements one at a time until a target is found or the collection ends.

Linear search works through a collection sequentially and can be used even when the data is not sorted.

9. QuestionMultiple choice

When can binary search be applied effectively?

Please select an answer first.

Correct answer: A

The correct answer is When the data is sorted and the search repeatedly eliminates about half of the remaining range.

  1. Identify the computing concept: Determine whether the prompt describes an algorithm, data structure, program behavior, network, security practice, or ethical issue.
  2. Apply the computational principle: Binary search uses ordering to discard half of the candidates at each step.
  3. Check the result: The correct answer is When the data is sorted and the search repeatedly eliminates about half of the remaining range.

Binary search uses ordering to discard half of the candidates at each step.

10. QuestionMultiple choice

What does Big O notation describe?

Please select an answer first.

Correct answer: B

The correct answer is How an algorithm's resource use grows as input size increases.

  1. Identify the computing concept: Determine whether the prompt describes an algorithm, data structure, program behavior, network, security practice, or ethical issue.
  2. Apply the computational principle: Big O describes asymptotic growth, often for time or space, rather than an exact runtime on one machine.
  3. Check the result: The correct answer is How an algorithm's resource use grows as input size increases.

Big O describes asymptotic growth, often for time or space, rather than an exact runtime on one machine.

Previous testNext test