REGULAR EXPRESSION

REGULAR EXPRESSION

University

10 Qs

quiz-placeholder

Similar activities

Revision of Asp.Net

Revision of Asp.Net

University

10 Qs

Quiz Latihan Soal-Soal UTS Teori Bahasa dan Otomata

Quiz Latihan Soal-Soal UTS Teori Bahasa dan Otomata

University

10 Qs

Automata theory Q1

Automata theory Q1

University

10 Qs

COA - Unit 1

COA - Unit 1

University

7 Qs

Automata

Automata

University

10 Qs

Regular Expressions

Regular Expressions

University

11 Qs

Exploring MT and Grammar Concepts

Exploring MT and Grammar Concepts

University

12 Qs

Hexadecimal

Hexadecimal

University

10 Qs

REGULAR EXPRESSION

REGULAR EXPRESSION

Assessment

Quiz

Computers

University

Hard

Created by

Dr. T. SAJU RAJ

Used 23+ times

FREE Resource

10 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 5 pts

1. Write regular expression for All the words of a language with alphabets {a,b,c}  that begins with an ‘a’ or a ‘c’ and then followed by some number of b’s.

 (a+c)b

 ((a+c)b)*

 ((a+c)*b)*

 (a+c)b*

2.

MULTIPLE CHOICE QUESTION

30 sec • 5 pts

2. Write regular expression for all the words of a language with alphabets {a,b}  that contains all the strings of a’s and b’s of length exactly three.

(a+b)3

(a3+b3)

(3a+3b)

(a+b)

3.

MULTIPLE CHOICE QUESTION

30 sec • 5 pts

3. Write regular expression for All the words of a language with alphabets {a,b}  that  begin with a and end with b

= ab(a+b)*ab

= a*(a+b)* b*

a(a+b)* b

= a(a+b) b

4.

MULTIPLE CHOICE QUESTION

30 sec • 5 pts

4.      Write regular expression for all the words of a language with alphabets {a,b}  that begin with a

a (a+b)*

a* (a+b)*

a (a+b)

a (a*+b*)*

5.

MULTIPLE CHOICE QUESTION

30 sec • 5 pts

5.      Write regular expression for all the words of a language with alphabets {a,b}  that ends with aa

(a+b)* a*a

aa

(a+b) aa

(a+b)* aa

6.

MULTIPLE CHOICE QUESTION

30 sec • 5 pts

6.      Write regular expression for all the words of a language with alphabets {a,b}  that have atleast one a

(a+b)a(a+b)

(a+b)* a (a+b)*

(a+b)* a* (a+b)*

(a+b)* a

7.

MULTIPLE CHOICE QUESTION

30 sec • 5 pts

7.      Write regular expression for all the words of a language with alphabets {a,b}  that have atleast one a and one b

(a+b)* a (a+b)* b (a+b)*  + (a+b)*b (a+b)* a (a+b)*

(a+b)* a (a+b)* b (a+b)* 

(a+b)*b (a+b)* a (a+b)*

(a+b)* a* (a+b)* b* (a+b)*  + (a+b)*b* (a+b)* a* (a+b)*

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?