11th Grade Computer Systems Quizzes, Questions & Answers

Think your child knows their 11th grade Computer Systems? Read more

Computer Systems Quizzes By Grade

1st Grade 6th Grade 9th Grade 10th Grade 11th Grade 12th Grade

Find More 11th Grade Subject Quizzes

Top Trending Computer Systems Quizzes

This quiz focuses on topics of automata theory and compiler design, exploring language operations, regular expressions, and fundamental concepts of computability within formal language theory.

Questions: 10 | Attempts: 217 | Last updated: Jan 16, 2025

Sample Question 1
Consider the languages L1 = φ and L2 = {a}. Which one of the following represents L1.L2* U L1*

{Є}

φ

A*

{Є, a}

Sample Question 2
Given the language L = {ab, aa, baa}, which of the following strings are in L*? 1) abaabaaabaa 2) aaaabaaaa 3) baaaaabaaaab 4) baaaaabaa

1, 2 and 3

2, 3 and 4

1,2 and 4

1, 3 and 4

Sample Question 3
Which one of the following languages over the alphabet {0,1} is described by the regular expression: (0+1)*0(0+1)*0(0+1)*?

The set of all strings containing the substring 00.

The set of all strings containing at most two 0’s.

The set of all strings containing at least two 0’s.

The set of all strings that begin and end with either 0 or 1

11th Grade Computer Systems Quizzes, Questions & Answers

Computer Systems Quizzes By Grade

Find More 11th Grade Subject Quizzes

Popular Computer Systems Topics

Top Trending Computer Systems Quizzes