Theory of Computation This is an introductory course on the 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.
Theory of Computation is a MOOC course offered by IIT Madras on the NPTEL platform. We will also explore the properties of the corresponding language classes defined by these models and the relations between them. The course is developed by Prof. Raghunath Tewari is an Associate Professor in the Department of Computer Science and Engineering at IIT Kanpur. His research interests lie in the areas of computational complexity theory, algorithms, and graph theory.
CRITERIA TO GET A CERTIFICATE
Students have to score Average assignment score = 25% of the average of the best 6 assignments out of the total 8 assignments given in the course.
Exam score = 75% of the proctored certification exam score out of 100 Final scores = Average assignment score + Exam score
Students will be eligible for CERTIFICATE ONLY IF AVERAGE ASSIGNMENT SCORE >=10/25 AND EXAM SCORE >= 30/75. If any of the 2 criteria are not met, the student will not get the certificate even if the Final score >= 40/100.
Theory of Computation ASSIGNMENT WEEK 2 ANSWERS:-
Q1. Space-partitioning methods include techniques such as constructive solid geometry.
Answer:- upcoming.. will notify on telegram, click on below image for link
Q2. Quadric surfaces refers to those objects, which (or the surface of which) are described with degree 3 equations (i.e., cubic equations).
Answer:-
Q3. The idea of fitting a set of control points with several polynomials to generate curve is called _________.
Answer:-
Q4. De Casteljau algorithm used to generate ________.
Answer:-
Q5. Techniques that represent an object by representing the individual object surfaces are ____________.
Answer:-
Q6. Two sweep representation techniques used in computer graphics are Sweep surface and __________.
Answer:-
Q7. Mesh representation is one of the sub categories of _________.
Answer:-
Q8. Sphere is an example of quadratic surface.
Answer:-
Q9. __________ support local controllability.
Answer:-
Q10. The two types of continuing conditions are, (choose the correct options)
Answer:-
Theory of Computation ASSIGNMENT WEEK 1 ANSWERS:-
Q1. What is the set of final states in the following NFA?
Answer:- B
Q2. Which of the following is the correct description of language recognized by the DFA below?
Answer:- C
Q3. Which state in the following DFA should be made the initial state to make it accept the language L={w∈{0,1}∗|w has even no of 1’s and odd number of 0’s}?
Answer:- B
Q4. What is the language accepted by the following NFA?
Answer:- A
NOTE:- IF THERE IS ANY CHANGE IN ANSWERS OF NPTEL Theory of Computation assignment answers WILL UPDATE BEFORE LAST DATE AND NOTIFY ON TELEGRAM OR WHATSAPP. SO KINDLY JOIN US, CLICK ON BELOW IMAGE AND JOIN US.
Q5. Cardinality of the language recognized by below NFA is
Answer:- B
Q6. Consider the following finite state machine A
Answer:- C
Q7. Consider the following two NFAs A1 and A2
Answer:- B
Q8. If L={a,ba}, which of the following are in L∗?
Answer:- D
Also check :- Internship oppurtinites
Note:- We do not claim 100% surety of answers, these answers are based on our sole knowledge, and by posting these answers we are just trying to help students, so we urge do your assignment on your own.
