Maths for Regular Expressions (AQA A-Level Computer Science): Quizzes

📚Quizzes
Revision NotesModel AnswersQuizzesFlashcardsExam Questions
Maths for Regular Expressions
Sign up to keep practising.Create a free account to play more quizzes and track your progress.

Practise the questions

10 questions from this quiz

Show

Which statement about sets is true?

Each value appears only once

In set comprehension notation {x∣x∈N}\{x \mid x \in \mathbb{N}\}, what does the symbol ∣\mid mean?

Such that

How is the empty set different from zero?

Zero is a value, empty set is a container

What is the cardinality of the set A={2,4,6,8,10}A = \{2, 4, 6, 8, 10\}?

5

If A={a,b}A = \{a, b\} and B={1,2,3}B = \{1, 2, 3\}, how many elements are in A×BA \times B?

6

What is {1,3,5}∪{3,5,7}\{1, 3, 5\} \cup \{3, 5, 7\}?

{1,3,5,7}\{1, 3, 5, 7\}

What is {1,3,5,7,9}∩{1,3,4,6,8}\{1, 3, 5, 7, 9\} \cap \{1, 3, 4, 6, 8\}?

{1,3}\{1, 3\}

What is {1,2,3,4}⊖{2,4,6}\{1, 2, 3, 4\} \ominus \{2, 4, 6\}?

{1,3,6}\{1, 3, 6\}

If A={1,2,3}A = \{1, 2, 3\} and B={1,2,3,4,5}B = \{1, 2, 3, 4, 5\}, which is true?

A⊆BA \subseteq B

Is the set {1,2,3}\{1, 2, 3\} a proper subset of {1,2,3}\{1, 2, 3\}?

No, sets must be different for proper subset

Explore AQA A-Level Computer Science Revision Notes by Topics

Abstraction and Automation

Finite State Machines

The Turing Machine

Regular and Context-Free Languages

Maths for Regular Expressions

Big O Notation and Classification of Algorithms

Explore AQA A-Level Computer Science Model Answers by Topics

Abstraction and Automation

Finite State Machines

The Turing Machine

Regular and Context-Free Languages

Maths for Regular Expressions

Big O Notation and Classification of Algorithms

Explore AQA A-Level Computer Science Flashcards by Topics

Abstraction and Automation

Finite State Machines

The Turing Machine

Regular and Context-Free Languages

Maths for Regular Expressions

Big O Notation and Classification of Algorithms

Explore AQA A-Level Computer Science Exam Questions by Topics

Abstraction and Automation

Finite State Machines

The Turing Machine

Regular and Context-Free Languages

Maths for Regular Expressions

Big O Notation and Classification of Algorithms

Join 100,000+ A-Level students studying Quizzes with us.

Select your subjects, and get access to A+ resources today.