Computer Sciences > Gate 2020 > Regular Language

Contributed by: Dr. Sarah Chen

Report Correct Copyright Claim

Which one of the following regular expressions represents the set of all binary strings with an odd number of 1′s ?

A

((0+1)*1(0+1)*1)*10*

B

(0*10*10*)*0*1

C

10*(0*10*10*)*

D

None

Check Answer

Explanation

Correct : d

Similar Questions

What is the worst-case time complexity of insertion in an AVL tree?

Question #23 Medium

Which operations on a binary search tree have O(h) complexity?

Question #31 Easy

Compare search complexities of sorted array vs balanced BST.

Question #47 Hard

Related Topics

Data Structures Binary Search Tree Time Complexity Algorithm Analysis Tree Algorithms Computer Science