Quizalize logo
placeholder image to represent content

A Level Computer Science - Circular Queues

Quiz by Grace Shaffi

Feel free to use or edit a copy

includes Teacher and Student dashboards

Measure skills
from any curriculum

Tag the questions with any skills you have. Your dashboard will track each student's mastery of each skill.

With a free account, teachers can
  • edit the questions
  • save a copy for later
  • start a class game
  • automatically assign follow-up activities based on students’ scores
  • assign as homework
  • share a link with colleagues
  • print as a bubble sheet

Our brand new solo games combine with your quiz, on the same screen

Correct quiz answers unlock more play!

New Quizalize solo game modes
18 questions
Show answers
  • Q1
    How would you define an abstract data type?
    A type of data that is not clear to the user
    A data type that is simplified to make it easier to understand
    A data type that is not define within a programming language, but created by the programmer
    A data type that the programmer does not understand fully
    30s
  • Q2
    What type of data structure is a circular Queue?
    LIFO (Last In First Out)
    LILO (Last In Last Out)
    FILO (First In Last Out)
    FIFO (First In First Out)
    30s
  • Q3
    What is the role of the rear pointer in a Queue?
    It indicates the lowest value in the queue
    It indicates where the list begins
    It indicates where the last item currently stored in the queue is
    It indicates where the last space in the queue is for storing new items
    30s
  • Q4
    What data structure is commonly used to impliement a Queue?
    A linked list
    A 2D array
    An array
    A dictionary
    30s
  • Q5
    What method would add an item to the rear of the Queue?
    deQueue
    isFull()
    EnQueue
    isEmpty()
    30s
  • Q6
    What method would remove an item from the start of a Queue?
    EnQueue
    deQueue
    isFull()
    isEmpty()
    30s
  • Q7
    What is the role of the isFull() method?
    It checks if the queue is full
    It checks if the queue is empty
    It removes an item from the list
    It adds an item to the list
    30s
  • Q8
    What would happen if you tried to add something to a queue that was already full?
    The program would ask if you would like to delete something else
    A new queue is created
    The program would error
    The array length is incrimented by 1
    30s
  • Q9
    What would happen if you tried to remove an item from an empty queue?
    Nothing, the program would just move to the next line of code
    The program would error
    The index position would move to -1
    The front pointer and rear pointer would both be -1
    30s
  • Q10
    Which of these scenarios would not benefit from the use of a queue?
    The back button on an internet browser
    A printer system
    A food ordering system
    30s
  • Q11
    Data stored in a queue must be stored contiguosly in memory?
    TRUE
    FALSE
    30s
  • Q12
    Items will move up the queue as the front items are deleted?
    FALSE
    TRUE
    30s
  • Q13
    Linear queues impliemented using an array, are an exmaple of a ________ data structure?
    Static
    Dynamic
    30s
  • Q14
    Linear queues impliemented using a list, are an exmaple of a ________ data structure?
    Dynamic
    Static
    30s
  • Q15
    What is one advantage of a circular queue?
    There are no limits on how many items can be added to the queue
    Once items leave the queue, those places in memory can be re-used
    30s

Teachers give this quiz to your class