Y1 A Level Computer Science Quiz -  AQA

Y1 A Level Computer Science Quiz - AQA

12th Grade

30 Qs

quiz-placeholder

Similar activities

Priority Queues and Heapsort

Priority Queues and Heapsort

9th - 12th Grade

27 Qs

Trees, Linked Lists, Stacks and Queues

Trees, Linked Lists, Stacks and Queues

11th Grade - University

30 Qs

Data Structures - Stacks

Data Structures - Stacks

12th Grade

35 Qs

Python Vocab

Python Vocab

9th - 12th Grade

34 Qs

Programming Basic Concepts

Programming Basic Concepts

12th Grade

30 Qs

מחשבים 4

מחשבים 4

11th Grade - University

26 Qs

Data Structures - Lists & Linked Lists

Data Structures - Lists & Linked Lists

12th Grade

26 Qs

AIJ Manajemen Bandwidth - PAS

AIJ Manajemen Bandwidth - PAS

12th Grade

35 Qs

Y1 A Level Computer Science Quiz -  AQA

Y1 A Level Computer Science Quiz - AQA

Assessment

Quiz

Computers

12th Grade

Hard

Created by

Kanishka Siriwardana

Used 3+ times

FREE Resource

30 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Process which adds an element to a stack

Pop

Enqueuing

Peeking

Push

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Definition of stack underflow

Push on full stack

Pop on empty stack

Push on empty stack

Pop on full stack

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What does a while loop do?

runs a part of the code while another part is running

repeats a part of the code while a condition is true

Makes a condition true while a part of the program is running

Allows you to change that part of the code while the program is running

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which line contains the error?

1     bool Run = true;

2     while (Run = true)

3     {string attempt = Console.ReadLine();

4      if (attempt = "beans")

5      { Run = false;}}

1

2

5

3

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What type of tree can have at most 2 child nodes?

Oak Tree

Rooted Tree

Binary Tree

Trigonome Tree

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which tree traversal method visits the root at the end of the Algorithm?

Climbing

Postorder

Inorder

Preorder

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is common in the three different types of traversals?

Root is visited before right subtree

Left subtree is always visited before the right subtree

Root is visited after left subtree

All of the above

Create a free account and access millions of resources

Create resources
Host any resource
Get auto-graded reports
or continue with
Microsoft
Apple
Others
By signing up, you agree to our Terms of Service & Privacy Policy
Already have an account?