CS8501 TC 2marks 16marks, THEORY OF COMPUTATION Question Bank, TC Short Answers 5th Sem

0

CS8501 TC 2marks

Anna University Regulation 2017 COMPUTER SCIENCE ENGINEERING CS8501 TC 2marks & 16marks for all 5 units are provided below. CS8501 TC Short answers, Question Bank for THEORY OF COMPUTATION Engineering are listed down for students to make perfect utilization and score maximum marks with our study materials.

CS8501 TC THEORY OF COMPUTATION

1. Define hypothesis.
The formal proof can be using deductive proof and inductive proof. The deductive proof consists of sequence of statements given with logical reasoning in order to prove the first or initial statement. The initial statement is called hypothesis.
2. Define inductive proof.
It is a recursive kind of proof which consists of sequence of parameterized statements that use the statement itself with lower values of its parameter.
3. Define Set, Infinite and Finite Set.
Set is Collection of various objects. These objects are called the elements of the set.
Eg : A = { a, e, i, o, u }
Infinite Set is a collection of all elements which are infinite in number.
Eg: A = { a | a is always even number }
Finite Set is a collection of finite number of elements.
Eg : A = { a, e, i, o, u }
4. Give some examples for additional forms of proof.
1. Proofs about sets
2. Proofs by contradiction
3. Proofs by counter examples

5. Define Finite Automation.
A finite automata is a collection of 5 tuples (Q, Σ. δ, q0, F ) where Q is a finite set of states, which is non empty.
Σ is a input alphabet, indicates input set. δ is a transition function or a function defined for going to next state.
q0 is an initial state (q0 in Q) F is a set of final states.
Two types :
Deterministic Finite Automation (DFA)
Non-Deterministic Finite Automation. (NFA)

6. Define Deterministic Finite Automation.
– The finite automata is called DFA if there is only one path for a specific input from current state to next state.
– A finite automata is a collection of 5 tuples (Q, Σ. δ, q0, F )
where Q is a finite set of states, which is non empty.
Σ is a input alphabet, indicates input set.
δ is a transition function or a function defined for going to next state.
q0 is an initial state (q0 in Q) F is a set of final states.

CS8501 TC Unit 1 2marks & 16marks – Download Here

CS8501 TC Unit 2 2marks & 16marks – Download Here

CS8501 TC Unit 3 2marks & 16marks – Download Here

CS8501 TC Unit 4 2marks & 16marks – Download Here

CS8501 TC All Units 2marks & 16marks – Download Here

If you require any other notes/study materials, you can comment in the below section.

Related Links

For CS8501 TC Previous Year Question Papers – Click here

For CS8501 TC Important Questions/Answer Key – Click here

For CS8501 TC Lecture Handwritten Notes – Click here

Search Terms

CS8501 TC 2marks

Anna University 5th Sem COMPUTER SCIENCE ENGINEERING TC 2marks 16 marks

CS8501 THEORY OF COMPUTATION Engineering question bank free download

Anna University COMPUTER SCIENCE ENGINEERING TC short answers Regulation 2017

CS8501 2marks, TC Unit wise short answers – COMPUTER SCIENCE ENGINEERING 5th Semester

Share.

Comments are closed.