Bihar STET – TOC Practice Test | Set 2 ⋆ CSE Study247

Bihar STET – TOC Practice Test | Set 2

Questions 16-20 of 100

0% completed (0/100 answered)

Question 16

MCQ · Single Correct 1 mark

Previous Year Question Bihar STET C.S. 18.09.2023 (Shift-I) PYQ

What is the minimum number of states in a DFA accepting all binary strings where the number of '0's is a multiple of 3 AND the number of '1's is a multiple of 2?

A $6 states (3 \times 2)$ B 5 states C 4 states D 12 states

Question 17

MCQ · Single Correct 1 mark

What language is accepted by the regular expression (a + b)* a (a + b)^k, where k is a fixed positive integer?

A All strings of length k B All strings starting with 'a' C All palindromes D All strings over {a, b} whose (k + 1)-th symbol from the RIGHT END is 'a'

Question 18

MCQ · Single Correct 1 mark

What is the state complexity (number of states) of a minimal DFA accepting the language $L_{k}$ = { w ∈ {a, b}* | the k-th symbol from right end is 'a' }?

A $2^k states$ B 2k states C k + 1 states D $k^2 states$

Question 19

MCQ · Single Correct 1 mark

Which algebraic property is satisfied by Kleene Star (L*) for any language L?

A L* = L ∩ L B $L* = L^0 ∪ L^1 ∪ L^2 ∪ ... = \epsilon ∪ L L*$ C $L* = L^2$ D $L* = L - \epsilon$

Question 20

MCQ · Single Correct 1 mark

What is the relationship between Positive Closure (L+) and Kleene Star (L*) for a language L?

A L+ = L* B $L+ = L^2$ C L+ = L ∩ L* D L+ = L L* = L* - {$\epsilon } (if \epsilon ∉ L)$