Computer Science Engineering (CSE) Exam > Computer Science Engineering (CSE) Tests > Test: Regular Expressions & Languages- 2 - Computer Science Engineering (CSE) MCQ

Test Description

Test: Regular Expressions & Languages- 2 for Computer Science Engineering (CSE) 2024 is part of Computer Science Engineering (CSE) preparation. The Test: Regular Expressions & Languages- 2 questions and answers have been prepared
according to the Computer Science Engineering (CSE) exam syllabus.The Test: Regular Expressions & Languages- 2 MCQs are made for Computer Science Engineering (CSE) 2024 Exam.
Find important definitions, questions, notes, meanings, examples, exercises, MCQs and online tests for Test: Regular Expressions & Languages- 2 below.

Solutions of Test: Regular Expressions & Languages- 2 questions in English are available as part of our course for Computer Science Engineering (CSE) & Test: Regular Expressions & Languages- 2 solutions in
Hindi for Computer Science Engineering (CSE) course.
Download more important topics, notes, lectures and mock test series for Computer Science Engineering (CSE) Exam by signing up for free. Attempt Test: Regular Expressions & Languages- 2 | 30 questions in 90 minutes | Mock test for Computer Science Engineering (CSE) preparation | Free important questions MCQ to study for Computer Science Engineering (CSE) Exam | Download free PDF with solutions

1 Crore+ students have signed up on EduRev. Have you? Download the App |

Test: Regular Expressions & Languages- 2 - Question 1

Consider the regular grammar below

The Myhill-Nerode equivalence classes for the language generated by the grammar are

Detailed Solution for Test: Regular Expressions & Languages- 2 - Question 1

Test: Regular Expressions & Languages- 2 - Question 2

Consider the alphabet ∑ = {0,1} , the null/empty string λ and the set of strings X_{0},X_{1} and X_{2} generated by the corresponding non-terminals of a regular grammar. X_{0},X_{1} and X_{2} are related as follows.

Which one of the following choices precisely represents the strings in X_{0}?

Detailed Solution for Test: Regular Expressions & Languages- 2 - Question 2

Detailed Solution for Test: Regular Expressions & Languages- 2 - Question 3

Test: Regular Expressions & Languages- 2 - Question 4

Let L_{1} and L_{2} be languages over an alphabet £ such that L_{1} ⊂ L_{2}. Which of the following is true

Detailed Solution for Test: Regular Expressions & Languages- 2 - Question 4

Test: Regular Expressions & Languages- 2 - Question 5

Language L_{1} is defined by the grammar:

Language L_{2} is defined by the grammar:

Consider the following statements:

Which one of the following is TRUE?

Detailed Solution for Test: Regular Expressions & Languages- 2 - Question 5

*Multiple options can be correct

Test: Regular Expressions & Languages- 2 - Question 6

Choose the correct alternatives (More than one may be correct).

Let R_{1} and R_{2} be regular sets defined over the alphabet ∑ Then:

Detailed Solution for Test: Regular Expressions & Languages- 2 - Question 6

*Multiple options can be correct

Test: Regular Expressions & Languages- 2 - Question 7

Choose the correct alternatives (more than one may be correct) and write the corresponding letters only: Which of the following is the strongest correct statement about a finite language over some finite alphabet ?

Detailed Solution for Test: Regular Expressions & Languages- 2 - Question 7

Detailed Solution for Test: Regular Expressions & Languages- 2 - Question 8

Test: Regular Expressions & Languages- 2 - Question 9

Which of the following statements is false?

Detailed Solution for Test: Regular Expressions & Languages- 2 - Question 9

Detailed Solution for Test: Regular Expressions & Languages- 2 - Question 10

Test: Regular Expressions & Languages- 2 - Question 11

What can be said about a regular language L over { a } whose minimal finite state automaton has two states?

Detailed Solution for Test: Regular Expressions & Languages- 2 - Question 11

Test: Regular Expressions & Languages- 2 - Question 12

Consider the following two statements:

Which of the following statement is correct?

Detailed Solution for Test: Regular Expressions & Languages- 2 - Question 12

Test: Regular Expressions & Languages- 2 - Question 13

Consider the following languages:

Which of the languages are regular?

Detailed Solution for Test: Regular Expressions & Languages- 2 - Question 13

Test: Regular Expressions & Languages- 2 - Question 14

If s is a string over (0+1)* then let n_{0}(s) denote the number of 0’s in s and n_{1}(s) the number of 1’s in s. Which one of the following languages is not regular ?

Detailed Solution for Test: Regular Expressions & Languages- 2 - Question 14

Test: Regular Expressions & Languages- 2 - Question 15

Which of the following statements about regular languages is NOT true ?

Detailed Solution for Test: Regular Expressions & Languages- 2 - Question 15

Test: Regular Expressions & Languages- 2 - Question 16

Let L be a regular language. Consider the constructions on L below:

Which of the constructions could lead to a non-regular language?

Detailed Solution for Test: Regular Expressions & Languages- 2 - Question 16

Test: Regular Expressions & Languages- 2 - Question 17

Which of the following languages is regular?

Detailed Solution for Test: Regular Expressions & Languages- 2 - Question 17

Detailed Solution for Test: Regular Expressions & Languages- 2 - Question 18

Test: Regular Expressions & Languages- 2 - Question 19

Which of the following languages is (are) non-regular?

reads the same forward and backward}

contains an even number of 0's and an even number of 1's}

Detailed Solution for Test: Regular Expressions & Languages- 2 - Question 19

Test: Regular Expressions & Languages- 2 - Question 20

Which of the following are regular sets?

Detailed Solution for Test: Regular Expressions & Languages- 2 - Question 20

Test: Regular Expressions & Languages- 2 - Question 21

Let P be a regular language and Q be a context-free language such that (For example, let P be the language represented by the regular expression Then which of the following is ALWAYS regular?

Detailed Solution for Test: Regular Expressions & Languages- 2 - Question 21

Test: Regular Expressions & Languages- 2 - Question 22

Given the language which of the following strings are in L*?

Detailed Solution for Test: Regular Expressions & Languages- 2 - Question 22

Test: Regular Expressions & Languages- 2 - Question 23

Consider the languages Which one of the following represents

Detailed Solution for Test: Regular Expressions & Languages- 2 - Question 23

Detailed Solution for Test: Regular Expressions & Languages- 2 - Question 24

Detailed Solution for Test: Regular Expressions & Languages- 2 - Question 25

Test: Regular Expressions & Languages- 2 - Question 26

Which of the following is/are regular languages?

, is the reverse of string ω

Detailed Solution for Test: Regular Expressions & Languages- 2 - Question 26

Test: Regular Expressions & Languages- 2 - Question 27

Consider the following three statements:

(i) Intersection of infinitely many regular languages must be regular.

(ii) Every subset of a regular language is regular.

(iii) If L is regular and M is not regular then L.M is necessarily not regular.

Which of the following gives the correct true/false evaluation of the above?

Detailed Solution for Test: Regular Expressions & Languages- 2 - Question 27

Test: Regular Expressions & Languages- 2 - Question 28

Let B consist of all binary strings beginning with a 1 whose value when converted to decimal is divisible by 7 .

Detailed Solution for Test: Regular Expressions & Languages- 2 - Question 28

Test: Regular Expressions & Languages- 2 - Question 29

Which one of the following languages over the alphabet 0,1 is regular?

Detailed Solution for Test: Regular Expressions & Languages- 2 - Question 29

Test: Regular Expressions & Languages- 2 - Question 30

Identify the regular expression which represents the language containing all strings of a's and b's where each string contains at least two b's

Detailed Solution for Test: Regular Expressions & Languages- 2 - Question 30

Information about Test: Regular Expressions & Languages- 2 Page

In this test you can find the Exam questions for Test: Regular Expressions & Languages- 2 solved & explained in the simplest way possible.
Besides giving Questions and answers for Test: Regular Expressions & Languages- 2, EduRev gives you an ample number of Online tests for practice

Download as PDF