Each question carries 3 marks and 1 mark negative for each wrong answer
quicz time is 10 min
TOC subject test
0 of 10 questions completed
Questions:
- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
- 10
Information
Subject wise test TOC
You have already completed the Test before. Hence you can not start it again.
Test is loading...
You must sign in or sign up to start the Test.
You have to finish following quiz, to start this Test:
Your results are here!! for" TOC subject test "
0 of 10 questions answered correctly
Your time:
Time has elapsed
Your Final Score is : 0
You have attempted : 0
Number of Correct Questions : 0 and scored 0
Number of Incorrect Questions : 0 and Negative marks 0
| Average score |
|
| Your score |
|
-
Assistant professor
You have attempted: 0
Number of Correct Questions: 0 and scored 0
Number of Incorrect Questions: 0 and Negative marks 0
- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
- 10
- Answered
- Review
-
Question 1 of 10
1. Question
3 pointsS1- Automata theory is also known as the Theory of Computation.
S2- Turing machine is not automata but part of Theory of Computation. -
Question 2 of 10
2. Question
3 pointsS1-High level languages are always machine understandable.
S2-low level languages are human understandable. -
Question 3 of 10
3. Question
3 pointsWhich of the following is true about Alphabet?
-
Question 4 of 10
4. Question
3 pointsS1-A string is a finite sequence of symbols from some alphabet.
S2-A string is generally denoted by w, and its length by |w|.
S3-Empty string is the string with zero occurrences of symbols, represented as ε -
Question 5 of 10
5. Question
3 pointsL1 = { set of strings of length 2 } ⅀={x,y}
L2= { xy, yx, xx, yy } -
Question 6 of 10
6. Question
3 pointswhich of the following is false?
-
Question 7 of 10
7. Question
3 pointsS1-finite automata recognise finite languages only
S2-Push down automata can recognise all infinite languages and finite languages as well. -
Question 8 of 10
8. Question
3 points
Which is false about this automaton? -
Question 9 of 10
9. Question
3 pointsA Turing machine M decides the language L ⊆ {0,1}*. Which one of the following statements is correct?
-
Question 10 of 10
10. Question
3 pointsGrammar: S → 0S1 | 01 which of the following is false about this grammar?