# Theory of Computation [GATE (Graduate Aptitude Test in Engineering) Computer Science]: Questions 7 - 9 of 91

Access detailed explanations (illustrated with images and videos) to **2290** questions. Access all new questions- tracking exam pattern and syllabus. View the complete topic-wise distribution of questions. *3 Year Validity- Access Unlimited Times on Unlimited Devices*.

View Sample Explanation or View Features.

Rs. 600.00 -OR-

How to register? Already Subscribed?

## Question 7

Appeared in Year: *2016*

### Question MCQ▾

Let L be the language generated by regular expression and accepted by the deterministic finite automata M. Consider the relation RM defined by M. As all states are reachable from the start state, has … equivalence classes.

### Choices

Choice (4) | Response | |
---|---|---|

a. | 6 | |

b. | 2 | |

c. | 4 | |

d. | 5 |

## Question 8

Appeared in Year: *2016*

### Question MCQ▾

Which of the following statements is TRUE?

The decomposition of the schema into and is always lossless.

: The decomposition of the schema having into and is lossless.

### Choices

Choice (4) | Response | |
---|---|---|

a. | Only | |

b. | Neither and | |

c. | and | |

d. | Only |

## Question 9

Appeared in Year: *2016*

### Question MCQ▾

The symmetric difference of two sets and is defined as

The nor of two languages is defined as

nor

Which of the following is correct?

### Choices

Choice (4) | Response | |
---|---|---|

a. | The family of regular languages are closed under both symmetric difference and nor. | |

b. | The family of regular languages are not closed under both symmetric difference and nor. | |

c. | The family of regular languages is closed under symmetric difference but not closed under nor. | |

d. | The family of regular languages is closed under nor but not closed under symmetric difference. |