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

Test Description

Test: Regular Expressions & Finite Automata- 2 for Computer Science Engineering (CSE) 2024 is part of Computer Science Engineering (CSE) preparation. The Test: Regular Expressions & Finite Automata- 2 questions and answers have been prepared
according to the Computer Science Engineering (CSE) exam syllabus.The Test: Regular Expressions & Finite Automata- 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 & Finite Automata- 2 below.

Solutions of Test: Regular Expressions & Finite Automata- 2 questions in English are available as part of our course for Computer Science Engineering (CSE) & Test: Regular Expressions & Finite Automata- 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 & Finite Automata- 2 | 20 questions in 60 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

Test: Regular Expressions & Finite Automata- 2 - Question 1

Which one of the following is TRUE?

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

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

Test: Regular Expressions & Finite Automata- 2 - Question 3

Which of the regular expressions given below represent the following DFA?

I) 0*1(1+00*1)*

II) 0*1*1+11*0*1

III) (0+1)*1

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

Test: Regular Expressions & Finite Automata- 2 - Question 4

**Q. Which one of the following is CORRECT?**

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

Test: Regular Expressions & Finite Automata- 2 - Question 5

Let L1 = {w ∈ {0,1}^{∗} | w has at least as many occurrences of (110)’s as (011)’s}.

Let L2 = { ∈ {0,1}^{∗} | w has at least as many occurrences of (000)’s as (111)’s}.

**Q. Which one of the following is TRUE?**

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

Test: Regular Expressions & Finite Automata- 2 - Question 6

The length of the shortest string NOT in the language (over Σ = {a, b}) of the following regular expression is ______________.

a*b*(ba)*a*

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

Test: Regular Expressions & Finite Automata- 2 - Question 7

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 & Finite Automata- 2 - Question 7

Test: Regular Expressions & Finite Automata- 2 - Question 8

Consider the regular language L = (111 + 11111)*. The minimum number of states in any DFA accepting this languages is:

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

Test: Regular Expressions & Finite Automata- 2 - Question 9

Consider the machine M:

**Q. The language recognized by M is :**

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

Test: Regular Expressions & Finite Automata- 2 - Question 10

Let Nf and Np denote the classes of languages accepted by non-deterministic finite automata and non-deterministic push-down automata, respectively. Let Df and Dp denote the classes of languages accepted by deterministic finite automata and deterministic push-down automata, respectively. Which one of the following is TRUE?

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

Test: Regular Expressions & Finite Automata- 2 - Question 11

The following diagram represents a finite state machine which takes as input a binary number from the least significant bit.

**Q. Which one of the following is TRUE?**

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

Test: Regular Expressions & Finite Automata- 2 - Question 12

The following finite state machine accepts all those binary strings in which the number of 1's and 0's are respectively.

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

Test: Regular Expressions & Finite Automata- 2 - Question 13

The regular expression 0*(10*)* denotes the same set as

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

Test: Regular Expressions & Finite Automata- 2 - Question 14

Consider the following deterministic finite state automaton M.

Let S denote the set of seven bit binary strings in which the first, the fourth, and the last bits are 1. The number of strings in S that are accepted by M is

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

Test: Regular Expressions & Finite Automata- 2 - Question 15

Consider the NFA M shown below.

**Q. Let the language accepted by M be L. Let L1 be the language accepted by the NFA M1, obtained by changing the accepting state of M to a non-accepting state and by changing the non-accepting state of M to accepting states. Which of the following statements is true ?**

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

Test: Regular Expressions & Finite Automata- 2 - Question 16

The Finite state machine described by the following state diagram with A as starting state, where an arc label is x / y and x stands for 1-bit input and y stands for 2- bit output

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

Test: Regular Expressions & Finite Automata- 2 - Question 17

The smallest finite automation which accepts the language {x | length of x is divisible by 3} has :

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

Test: Regular Expressions & Finite Automata- 2 - Question 18

Consider the following two statements:

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

Test: Regular Expressions & Finite Automata- 2 - Question 19

Given an arbitary non-deterministic finite automaton (NFA) with N states, the maximum number of states in an equivalent minimized DFA is at least

Test: Regular Expressions & Finite Automata- 2 - Question 20

Consider a DFA over ∑ = {a, b} accepting all strings which have number of a’s divisible by 6 and number of b’s divisible by 8. What is the minimum number of states that the DFA will have?

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

Information about Test: Regular Expressions & Finite Automata- 2 Page

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

Download as PDF