These are Theory of Computation Week 1 Assignment 1 Nptel Answers
Q1. Any NFA having n states can be converted to a DFA having at most (select the smallest possible value)
2n
3n
2n
n2
Answer: 2n
Q2. Consider the language L={w∣the number of 1’s in w is divisible by 3} over the binary alphabet {0,1}.What is the minimum number of states required for a DFA that accepts L ? 1 2 3 4
These are Theory of Computation Week 1 Assignment 1 Nptel Answers
Q9. The block of code displayed here is meant for the ball, how many loops are there in total? One Two Three Four
Answer: One
Q10. The block of code displayed here is meant for the ball, if the value beside repeat would have been 1 instead of 2, Select all the statements that explain the situation. The Ball would not have returned to Cat. Removing the loop from the code would have made no difference in the result. The Ball would not have left its original position. The code would throw an error
Answer: The Ball would not have returned to Cat Removing the loop from the code would have made no difference in the result.
