# NPTEL Theory of Computation Assignment 1 Answer

NPTEL Theory of Computation Assignment 1 Answer – Here All The Questions and Answers Provided to Help All The Students and NPTEL Candidate as a Reference Purpose, It is Mandetory to Submit Your Weekly Assignment By Your Own Understand Level.

Are you looking for the Assignment Answers to NPTEL Theory of Computation Assignment 1 Answer? If Yes You are in Our Great Place to Getting Your Solution, This Post Should be help you with the Assignment answer to the National Programme on Technology Enhanced Learning (NPTEL) Course “NPTEL Theory of Computation Assignment 1 Answer”

## NPTEL Theory of Computation Assignment

This is an introductory course on Theory of Computation intended for undergraduate students in computer science. In this course we will introduce various models of computation and study their power and limitations. We will also explore the properties of the corresponding language classes defined by these models and the relations between them. We will assume the student is comfortable in analytical reasoning and has preferably done a course on Data Structures and Algorithms.

INTENDED AUDIENCE: Computer Science undergraduate students.

PRE-REQUISITES: It is recommended that the candidate has done a course in Data Structures and Algorithms.

INDUSTRY SUPPORT: Content will be updated soon

This course can have Associate in Nursing unproctored programming communication conjointly excluding the Proctored communication, please check announcement section for date and time. The programming communication can have a weightage of twenty fifth towards the ultimate score.

Final score = Assignment score + Unproctored programming exam score + Proctored Exam score
• Assignment score = 25% of average of best 8 assignments out of the total 12 assignments given in the course.
• ( All assignments in a particular week will be counted towards final scoring – quizzes and programming assignments).
• Unproctored programming exam score = 25% of the average scores obtained as part of Unproctored programming exam – out of 100
• Proctored Exam score =50% of the proctored certification exam score out of 100
YOU WILL BE ELIGIBLE FOR A CERTIFICATE ONLY IF ASSIGNMENT SCORE >=10/25 AND
UNPROCTORED PROGRAMMING EXAM SCORE >=10/25 AND PROCTORED EXAM SCORE >= 20/50.
If any one of the 3 criteria is not met, you will not be eligible for the certificate even if the Final score >= 40/100.

## BELOW YOU CAN GET YOUR NPTEL NPTEL Theory of Computation Assignment 1 Answer 2022? :

1 point

L1L1 and L2L2 are regular languages.

Define L3=L1{L¯¯¯¯2L¯¯¯¯1}L3=L1∩{L¯2∪L¯1} and L4=L1{L¯¯¯¯2L¯¯¯¯1}L4=L1∪{L¯2∩L¯1}.
Which of the following statements is correct?

Ans – c

1 point
Consider the following NFA:

Which of the following is the correct description of language recognized by the NFA?

Ans –  a
1 point
Let Σ={a,b}Σ={a,b}.
Which of the following is the correct description of language recognized by the DFA below?

Set of nonempty strings which contains either ‘aa’ or ‘bb’.

Ans –  d

1 point

Which state in the following DFA should be made the initial state to make it accept the language L={w{0,1}|wL={w∈{0,1}∗|w has even no of 1’s and odd number of 0’s}}?

Ans –  b
1 point

What is the language accepted by the following NFA?

The set of strings ending with abababab.

Ans –  a

1 point
Let L{0,1}L⊆{0,1}∗. Which of the following is true?

If L is regular, all subsets of L are regular.

Ans –  b
1 point

Cardinality of the language recognized by below NFA is?

Ans –  d
1 point

Consider the following DFA :

Which of the following language is accepted by the DFA?

Set of all nonempty strings containing either aaaa or bbbb.

Ans –  b
1 point
Consider the following two NFAs A1A1 and A2A2.

Which one of the following is true?

Ans –  c
1 point

If L={ab,aa,baa}L={ab,aa,baa}, which of the following strings is notnot in LL∗?

Ans –  c
Yhaa You have done it but next? if YOU Want to your Others NPTEL Big Data Computing Assignment 1 Answer Then Follow US HERE and Join Telegram.