5079 + Mcqs in Experienced McqOptions

1.	The _________ are the substances which allow moisture to stay on their surfaces.
A.	Refrigerant
B.	Coolant
C.	Adsorbent
D.	Absorbent
Answer» D. Absorbent

Discussion

2.	________________ is the process by which the required amount of moisture is taken out from the air.
A.	Condensation
B.	Dehumidification
C.	Humidification
D.	Absorption
Answer» C. Humidification

Discussion

3.	_____________ is the process by which the required amount of moisture is added in the air.
A.	Dehumidification
B.	Humidification
C.	Absorption
D.	Condensation
Answer» C. Absorption

Discussion

4.	In winter, it becomes necessary to supplied slightly _________ air to the inside of the building.
A.	Cool
B.	Heated
C.	Humid
D.	Dehumidified
Answer» C. Humid

Discussion

5.	Combination system consist of supply system and __________ system.
A.	Plenum
B.	Air conditioning
C.	Exhaust
D.	Natural
Answer» D. Natural

Discussion

6.	MySQL works with spatial values in 3 formats.
A.	True
B.	False
Answer» B. False

Discussion

7.	MEMORY tables do not support BLOB and TEXT indexes.
A.	True
B.	False
Answer» B. False

Discussion

8.	The maximum size in bytes of a row in MySQL is __________
A.	65534
B.	65535
C.	65536
D.	65537
Answer» C. 65536

Discussion

9.	The maximum non zero value for FLOAT is ___________
A.	3.402823466E+38
B.	3.402823466E+37
C.	3.402823466E+39
D.	3.402823466E+35
Answer» B. 3.402823466E+37

Discussion

10.	What are the lattice coefficients corresponding to the FIR filter with system function H(z)= 1+(13/24)z-1+(5/8)z-2+(1/3)z-3?
A.	(1/2,1/4,1/3)
B.	(1,1/2,1/3)
C.	(1/4,1/2,1/3)
D.	None of the mentioned
Answer» D. None of the mentioned

Discussion

11.	If a three stage lattice filter with coefficients K1=1/4, K2=1/2 K3=1/3, then what are the FIR filter coefficients for the direct form structure?
A.	(1,8/24,5/8,1/3)
B.	(1,5/8,13/24,1/3)
C.	(1/4,13/24,5/8,1/3)
D.	(1,13/24,5/8,1/3)
Answer» E.

Discussion

12.	The constants K1 and K2 of the lattice structure are called as reflection coefficients.
A.	True
B.	False
Answer» B. False

Discussion

13.	What is the value of the coefficient α2(1) in the case of FIR filter represented in direct form structure with m=2 in terms of K1 and K2?
A.	K1(K2)
B.	K1(1-K2)
C.	K1(1+K2)
D.	None of the mentioned
Answer» D. None of the mentioned

Discussion

14.	The FIR filter whose direct form structure is as shown below is a prediction error filter.
A.	True
B.	False
Answer» B. False

Discussion

15.	What is the unit sample response of the mth filter?
A.	hm(0)=0 and hm(k)=αm(k), k=1,2…m
B.	hm(k)=αm(k), k=0,1,2…m(αm(0)≠1)
C.	hm(0)=1 and hm(k)=αm(k), k=1,2…m
D.	none of the mentioned
Answer» D. none of the mentioned

Discussion

16.	If we consider a sequence of FIR filer with system function Hm(z)=Am(z), then what is the definition of the polynomial Am(z)?
A.	\(1+\sum_{k=0}^m α_m (k)z^{-k}\)
B.	\(1+\sum_{k=1}^m α_m (k)z^{-k}\)
C.	\(1+\sum_{k=1}^m α_m (k)z^k \)
D.	\(\sum_{k=0}^m α_m (k)z^{-k}\)
Answer» C. \(1+\sum_{k=1}^m α_m (k)z^k \)

Discussion

17.	Which of the following is the application of lattice filter?
A.	Digital speech processing
B.	Adaptive filter
C.	Electroencephalogram
D.	All of the mentioned
Answer» E.

Discussion

18.	How many types of recovery control techniques:
A.	2
B.	3
C.	4
D.	5
Answer» B. 3

Discussion

19.	Which is refers to a stalemate situation due to which no further progress is possible as computer await response of each other:
A.	Concurrency
B.	Deadlock
C.	Backup
D.	Recovery
Answer» C. Backup

Discussion

20.	The general equation for PDMA is aiΦi+biΦi+2+ci Φi+1+diΦi-1+eiΦi-2=fi. Which of the following is incorrect? (Note: ‘N’ is the number of unknowns).
A.	e2=0
B.	cN-1=0
C.	e1=0
D.	cN=0
Answer» C. e1=0

Discussion

21.	TDMA and PDMA are particularly suitable for _____________
A.	Cartesian grid problems
B.	Curvilinear grid problems
C.	Unstructured grid problems
D.	Structured grid problems
Answer» E.

Discussion

22.	Consider the global matrix AΦ=b. If my coefficient matrix A is the same for different b vectors, which of these methods is economic?
A.	Gauss elimination
B.	TDMA
C.	LU decomposition
D.	PDMA
Answer» D. PDMA

Discussion

23.	The number of operations for LU decomposition method is ____________ the number of operations for the Gauss elimination method.
A.	twice
B.	half of
C.	one-third of
D.	thrice
Answer» B. half of

Discussion

24.	Which of these is true for the LU decomposition method?
A.	LΦ=Ub
B.	LUΦ=b
C.	Φ=LUb
D.	UΦ=Lb
Answer» C. Φ=LUb

Discussion

25.	If N is the number of unknowns, the number of operations required for backward substitution is ____________
A.	\(\frac{N^3}{3}\)
B.	\(\frac{N^3}{2}\)
C.	\(\frac{N^2}{2}\)
D.	\(\frac{N^2}{3}\)
Answer» D. \(\frac{N^2}{3}\)

Discussion

26.	Which of these formulae is used in the backward substitution step of Gauss-elimination method?Note: The global matrix isAΦ=bi → row number.j → column number.N→ Number of unknowns.
A.	\(\Phi_i=\frac{b_i-\sum_{j=i+1}^N a_{ij}\phi_j}{A_{ii}} \)
B.	\(\Phi_i=\frac{b_i-A_{ij}\phi_j}{A_{ii}} \)
C.	\(\Phi_i=\frac{\sum_{j=i+1}^NA_{ij}\phi_j}{A_{ii}} \)
D.	\(\Phi_i=b_i-\frac{\sum_{j=i+1}^NA_{ij}\phi_j}{A_{ii}} \)
Answer» B. \(\Phi_i=\frac{b_i-A_{ij}\phi_j}{A_{ii}} \)

Discussion

27.	After the forward elimination step of the Gauss elimination method, the coefficient matrix is reduced to ____________
A.	a lower triangular matrix
B.	an upper triangular matrix
C.	a diagonal matrix
D.	a banded matrix
Answer» C. a diagonal matrix

Discussion

28.	Which of these direct methods is suitable only for banded matrices?
A.	Gauss elimination
B.	LU decomposition
C.	PDMA
D.	LU decomposition by Gauss elimination
Answer» D. LU decomposition by Gauss elimination

Discussion

29.	The coefficient matrix in the global matrix format of the algebraic equations is a ______________
A.	sparse matrix
B.	dense matrix
C.	diagonal matrix
D.	symmetric matrix
Answer» B. dense matrix

Discussion

30.	Rec-DFA = { \| M is a DFA and M recognizes input w}.Fill in the blank:Rec-DFA is ___________a) Undecidableb) Decidablec) Non finited) None of the mentionedAnswer: bExplanation: Under decidablity of regular language properties we have the following lemma which states that A DFA which recognizes an input w is decidable.5. Which among the following are semi decidable?a) Empty-DFAb) Rec-NFAc) Infinite-DFAd) All of the mentionedAnswer: d Explanation: All are the properties of regular languages and all are decidable languages.advertisement// var adpushup = adpushup \|\| {}; adpushup.que = adpushup.que \|\| []; adpushup.que.push(function() { adpushup.triggerAd("fdd9bf87-4faf-4493-82b4-e5538b31931a"); });//6. The language accepted by a turing machine is called ____________a) Recursive Ennumerableb) Recursivec) Both (a) and (b)d) None of the mentionedAnswer: cExplanation: The language accepted by Turing machines are called recursively ennumerable (RE), and the subset of RE languages that are accepted by a turing machine that always halts are called recursive.7. Decidable can be taken as a synonym to:a) recursiveb) non recursivec) recognizabled) none of the mentionedAnswer: aExplanation: We can refer to languages as ‘recursive’ and problems as ‘decidable’. If a language is not recursive , then we call the problem expressed by that language undecidable.advertisement// var adpushup = adpushup \|\| {}; adpushup.que = adpushup.que \|\| []; adpushup.que.push(function() { adpushup.triggerAd("21eae76a-c83f-42b0-aec5-01d590a53f37"); });//8. The problems which have no algorithm, regardless of whether or not they are accepted by a turing machine that fails to halts on some input are referred as:a) Decidableb) Undecidablec) Computabled) None of the mentionedAnswer: bExplanation: The problems that can be solved by a turing machine can divided into two classes:a) Those that have an algorithmb) Intractable problems: Those that are only solved by a turing machine that may run forever on inputs they do not accept.9. An algorithm is called efficient if it runs in ____________ time on a serial computer.a) polynomialb) non polynomialc) logarithmicd) none of the mentionedAnswer: aExplanation: Example: Runtimes of efficient algorithmsO(n), O(nlogn), O(n3log2n)Runtimes of inefficient algorithmsO(2n), O(n!)advertisement// var adpushup = adpushup \|\| {}; adpushup.que = adpushup.que \|\| []; adpushup.que.push(function() { adpushup.triggerAd("90f55663-effd-4105-b1e7-29d86b526544"); });//10. A problem is called __________ if its has an efficient algorithm for itself.a) tractableb) intractablec) computationald) none of the mentionedAnswer: aExplanation: A problem is called intractable iff there is an efficient (i.e. polynomial time) algorithm that solves it. A problem is called intractable iff there exists no efficient algorithm that solves it.11. A formal language is recursive if :a) a total turing machine existsb) a turing machine that halts for every inputc) turing machine rejects if the input does not belong to the languaged) all of the mentionedAnswer: dExplanation: A formal language is called recursive if it is a recursive subset of the set of all possible finite sequences over the alphabet of the language.12. Recursive languages are also known as:a) decidableb) undecidablec) sometimes decidabled) none of the mentionedAnswer: aExplanation: A language is recursive if there exists a turing machine such that it halts i.e. accepts if the input belongs to the language else rejects. It is better called Turing decidable language.13. The class of recursive language is known as:a) Rb) RCc) RLd) All of the mentionedAnswer: aExplanation: R is the set of all recursive languages, a class of decision problems solvable by turing machines. Although, R is also used for the class RP.14. Which of the following was not a part of Chomsky hierarchy ?
A.	Undecidableb) Decidablec) Non finited) None of the mentionedAnswer: bExplanation: Under decidablity of regular language properties we have the following lemma which states that A DFA which recognizes an input w is decidable.5. Which among the following are semi decidable?a) Empty-DFAb) Rec-NFAc) Infinite-DFAd) All of the mentionedAnswer: d Explanation: All are the properties of regular languages and all are decidable languages.advertisement// var adpushup = adpushup \|\| {}; adpushup.que = adpushup.que \|\| []; adpushup.que.push(function() { adpushup.triggerAd("fdd9bf87-4faf-4493-82b4-e5538b31931a"); });//6. The language accepted by a turing machine is called ____________a) Recursive Ennumerableb) Recursivec) Both (a) and (b)d) None of the mentionedAnswer: cExplanation: The language accepted by Turing machines are called recursively ennumerable (RE), and the subset of RE languages that are accepted by a turing machine that always halts are called recursive.7. Decidable can be taken as a synonym to:a) recursiveb) non recursivec) recognizabled) none of the mentionedAnswer: aExplanation: We can refer to languages as ‘recursive’ and problems as ‘decidable’. If a language is not recursive , then we call the problem expressed by that language undecidable.advertisement// var adpushup = adpushup \|\| {}; adpushup.que = adpushup.que \|\| []; adpushup.que.push(function() { adpushup.triggerAd("21eae76a-c83f-42b0-aec5-01d590a53f37"); });//8. The problems which have no algorithm, regardless of whether or not they are accepted by a turing machine that fails to halts on some input are referred as:a) Decidableb) Undecidablec) Computabled) None of the mentionedAnswer: bExplanation: The problems that can be solved by a turing machine can divided into two classes:a) Those that have an algorithmb) Intractable problems: Those that are only solved by a turing machine that may run forever on inputs they do not accept.9. An algorithm is called efficient if it runs in ____________ time on a serial computer.a) polynomialb) non polynomialc) logarithmicd) none of the mentionedAnswer: aExplanation: Example: Runtimes of efficient algorithmsO(n), O(nlogn), O(n3log2n)Runtimes of inefficient algorithmsO(2n), O(n!)advertisement// var adpushup = adpushup \|\| {}; adpushup.que = adpushup.que \|\| []; adpushup.que.push(function() { adpushup.triggerAd("90f55663-effd-4105-b1e7-29d86b526544"); });//10. A problem is called __________ if its has an efficient algorithm for itself.a) tractableb) intractablec) computationald) none of the mentionedAnswer: aExplanation: A problem is called intractable iff there is an efficient (i.e. polynomial time) algorithm that solves it. A problem is called intractable iff there exists no efficient algorithm that solves it.11. A formal language is recursive if :a) a total turing machine existsb) a turing machine that halts for every inputc) turing machine rejects if the input does not belong to the languaged) all of the mentionedAnswer: dExplanation: A formal language is called recursive if it is a recursive subset of the set of all possible finite sequences over the alphabet of the language.12. Recursive languages are also known as:a) decidableb) undecidablec) sometimes decidabled) none of the mentionedAnswer: aExplanation: A language is recursive if there exists a turing machine such that it halts i.e. accepts if the input belongs to the language else rejects. It is better called Turing decidable language.13. The class of recursive language is known as:a) Rb) RCc) RLd) All of the mentionedAnswer: aExplanation: R is the set of all recursive languages, a class of decision problems solvable by turing machines. Although, R is also used for the class RP.14. Which of the following was not a part of Chomsky hierarchy ?a) Context sensitive grammar
B.	Decidablec) Non finited) None of the mentionedAnswer: bExplanation: Under decidablity of regular language properties we have the following lemma which states that A DFA which recognizes an input w is decidable.5. Which among the following are semi decidable?a) Empty-DFAb) Rec-NFAc) Infinite-DFAd) All of the mentionedAnswer: d Explanation: All are the properties of regular languages and all are decidable languages.advertisement// var adpushup = adpushup \|\| {}; adpushup.que = adpushup.que \|\| []; adpushup.que.push(function() { adpushup.triggerAd("fdd9bf87-4faf-4493-82b4-e5538b31931a"); });//6. The language accepted by a turing machine is called ____________a) Recursive Ennumerableb) Recursivec) Both (a) and (b)d) None of the mentionedAnswer: cExplanation: The language accepted by Turing machines are called recursively ennumerable (RE), and the subset of RE languages that are accepted by a turing machine that always halts are called recursive.7. Decidable can be taken as a synonym to:a) recursiveb) non recursivec) recognizabled) none of the mentionedAnswer: aExplanation: We can refer to languages as ‘recursive’ and problems as ‘decidable’. If a language is not recursive , then we call the problem expressed by that language undecidable.advertisement// var adpushup = adpushup \|\| {}; adpushup.que = adpushup.que \|\| []; adpushup.que.push(function() { adpushup.triggerAd("21eae76a-c83f-42b0-aec5-01d590a53f37"); });//8. The problems which have no algorithm, regardless of whether or not they are accepted by a turing machine that fails to halts on some input are referred as:a) Decidableb) Undecidablec) Computabled) None of the mentionedAnswer: bExplanation: The problems that can be solved by a turing machine can divided into two classes:a) Those that have an algorithmb) Intractable problems: Those that are only solved by a turing machine that may run forever on inputs they do not accept.9. An algorithm is called efficient if it runs in ____________ time on a serial computer.a) polynomialb) non polynomialc) logarithmicd) none of the mentionedAnswer: aExplanation: Example: Runtimes of efficient algorithmsO(n), O(nlogn), O(n3log2n)Runtimes of inefficient algorithmsO(2n), O(n!)advertisement// var adpushup = adpushup \|\| {}; adpushup.que = adpushup.que \|\| []; adpushup.que.push(function() { adpushup.triggerAd("90f55663-effd-4105-b1e7-29d86b526544"); });//10. A problem is called __________ if its has an efficient algorithm for itself.a) tractableb) intractablec) computationald) none of the mentionedAnswer: aExplanation: A problem is called intractable iff there is an efficient (i.e. polynomial time) algorithm that solves it. A problem is called intractable iff there exists no efficient algorithm that solves it.11. A formal language is recursive if :a) a total turing machine existsb) a turing machine that halts for every inputc) turing machine rejects if the input does not belong to the languaged) all of the mentionedAnswer: dExplanation: A formal language is called recursive if it is a recursive subset of the set of all possible finite sequences over the alphabet of the language.12. Recursive languages are also known as:a) decidableb) undecidablec) sometimes decidabled) none of the mentionedAnswer: aExplanation: A language is recursive if there exists a turing machine such that it halts i.e. accepts if the input belongs to the language else rejects. It is better called Turing decidable language.13. The class of recursive language is known as:a) Rb) RCc) RLd) All of the mentionedAnswer: aExplanation: R is the set of all recursive languages, a class of decision problems solvable by turing machines. Although, R is also used for the class RP.14. Which of the following was not a part of Chomsky hierarchy ?a) Context sensitive grammarb) Unrestricted grammar
C.	Non finited) None of the mentionedAnswer: bExplanation: Under decidablity of regular language properties we have the following lemma which states that A DFA which recognizes an input w is decidable.5. Which among the following are semi decidable?a) Empty-DFAb) Rec-NFAc) Infinite-DFAd) All of the mentionedAnswer: d Explanation: All are the properties of regular languages and all are decidable languages.advertisement// var adpushup = adpushup \|\| {}; adpushup.que = adpushup.que \|\| []; adpushup.que.push(function() { adpushup.triggerAd("fdd9bf87-4faf-4493-82b4-e5538b31931a"); });//6. The language accepted by a turing machine is called ____________a) Recursive Ennumerableb) Recursivec) Both (a) and (b)d) None of the mentionedAnswer: cExplanation: The language accepted by Turing machines are called recursively ennumerable (RE), and the subset of RE languages that are accepted by a turing machine that always halts are called recursive.7. Decidable can be taken as a synonym to:a) recursiveb) non recursivec) recognizabled) none of the mentionedAnswer: aExplanation: We can refer to languages as ‘recursive’ and problems as ‘decidable’. If a language is not recursive , then we call the problem expressed by that language undecidable.advertisement// var adpushup = adpushup \|\| {}; adpushup.que = adpushup.que \|\| []; adpushup.que.push(function() { adpushup.triggerAd("21eae76a-c83f-42b0-aec5-01d590a53f37"); });//8. The problems which have no algorithm, regardless of whether or not they are accepted by a turing machine that fails to halts on some input are referred as:a) Decidableb) Undecidablec) Computabled) None of the mentionedAnswer: bExplanation: The problems that can be solved by a turing machine can divided into two classes:a) Those that have an algorithmb) Intractable problems: Those that are only solved by a turing machine that may run forever on inputs they do not accept.9. An algorithm is called efficient if it runs in ____________ time on a serial computer.a) polynomialb) non polynomialc) logarithmicd) none of the mentionedAnswer: aExplanation: Example: Runtimes of efficient algorithmsO(n), O(nlogn), O(n3log2n)Runtimes of inefficient algorithmsO(2n), O(n!)advertisement// var adpushup = adpushup \|\| {}; adpushup.que = adpushup.que \|\| []; adpushup.que.push(function() { adpushup.triggerAd("90f55663-effd-4105-b1e7-29d86b526544"); });//10. A problem is called __________ if its has an efficient algorithm for itself.a) tractableb) intractablec) computationald) none of the mentionedAnswer: aExplanation: A problem is called intractable iff there is an efficient (i.e. polynomial time) algorithm that solves it. A problem is called intractable iff there exists no efficient algorithm that solves it.11. A formal language is recursive if :a) a total turing machine existsb) a turing machine that halts for every inputc) turing machine rejects if the input does not belong to the languaged) all of the mentionedAnswer: dExplanation: A formal language is called recursive if it is a recursive subset of the set of all possible finite sequences over the alphabet of the language.12. Recursive languages are also known as:a) decidableb) undecidablec) sometimes decidabled) none of the mentionedAnswer: aExplanation: A language is recursive if there exists a turing machine such that it halts i.e. accepts if the input belongs to the language else rejects. It is better called Turing decidable language.13. The class of recursive language is known as:a) Rb) RCc) RLd) All of the mentionedAnswer: aExplanation: R is the set of all recursive languages, a class of decision problems solvable by turing machines. Although, R is also used for the class RP.14. Which of the following was not a part of Chomsky hierarchy ?a) Context sensitive grammarb) Unrestricted grammarc) Recursive grammar
D.	None of the mentionedAnswer: bExplanation: Under decidablity of regular language properties we have the following lemma which states that A DFA which recognizes an input w is decidable.5. Which among the following are semi decidable?a) Empty-DFAb) Rec-NFAc) Infinite-DFAd) All of the mentionedAnswer: d Explanation: All are the properties of regular languages and all are decidable languages.advertisement// var adpushup = adpushup \|\| {}; adpushup.que = adpushup.que \|\| []; adpushup.que.push(function() { adpushup.triggerAd("fdd9bf87-4faf-4493-82b4-e5538b31931a"); });//6. The language accepted by a turing machine is called ____________a) Recursive Ennumerableb) Recursivec) Both (a) and (b)d) None of the mentionedAnswer: cExplanation: The language accepted by Turing machines are called recursively ennumerable (RE), and the subset of RE languages that are accepted by a turing machine that always halts are called recursive.7. Decidable can be taken as a synonym to:a) recursiveb) non recursivec) recognizabled) none of the mentionedAnswer: aExplanation: We can refer to languages as ‘recursive’ and problems as ‘decidable’. If a language is not recursive , then we call the problem expressed by that language undecidable.advertisement// var adpushup = adpushup \|\| {}; adpushup.que = adpushup.que \|\| []; adpushup.que.push(function() { adpushup.triggerAd("21eae76a-c83f-42b0-aec5-01d590a53f37"); });//8. The problems which have no algorithm, regardless of whether or not they are accepted by a turing machine that fails to halts on some input are referred as:a) Decidableb) Undecidablec) Computabled) None of the mentionedAnswer: bExplanation: The problems that can be solved by a turing machine can divided into two classes:a) Those that have an algorithmb) Intractable problems: Those that are only solved by a turing machine that may run forever on inputs they do not accept.9. An algorithm is called efficient if it runs in ____________ time on a serial computer.a) polynomialb) non polynomialc) logarithmicd) none of the mentionedAnswer: aExplanation: Example: Runtimes of efficient algorithmsO(n), O(nlogn), O(n3log2n)Runtimes of inefficient algorithmsO(2n), O(n!)advertisement// var adpushup = adpushup \|\| {}; adpushup.que = adpushup.que \|\| []; adpushup.que.push(function() { adpushup.triggerAd("90f55663-effd-4105-b1e7-29d86b526544"); });//10. A problem is called __________ if its has an efficient algorithm for itself.a) tractableb) intractablec) computationald) none of the mentionedAnswer: aExplanation: A problem is called intractable iff there is an efficient (i.e. polynomial tim
E.	algorithm that solves it. A problem is called intractable iff there exists no efficient algorithm that solves it.11. A formal language is recursive if :a) a total turing machine existsb) a turing machine that halts for every inputc) turing machine rejects if the input does not belong to the languaged) all of the mentionedAnswer: dExplanation: A formal language is called recursive if it is a recursive subset of the set of all possible finite sequences over the alphabet of the language.12. Recursive languages are also known as:a) decidableb) undecidablec) sometimes decidabled) none of the mentionedAnswer: aExplanation: A language is recursive if there exists a turing machine such that it halts i.e. accepts if the input belongs to the language else rejects. It is better called Turing decidable language.13. The class of recursive language is known as:a) Rb) RCc) RLd) All of the mentionedAnswer: aExplanation: R is the set of all recursive languages, a class of decision problems solvable by turing machines. Although, R is also used for the class RP.14. Which of the following was not a part of Chomsky hierarchy ?a) Context sensitive grammarb) Unrestricted grammarc) Recursive grammard) None of the mentionedAnswer: cExplanation: All recursive languages are recursively enumerable. All regular, context free and context sensitive languages are recursive.Sanfoundry Global Education & Learning Series – Automata Theory.To practice all areas of Automata Theory for Experienced people, here is complete set of 1000+ Multiple Choice Questions and Answers.Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with latest contests, videos, internships and jobs!Telegram \| Youtube \| LinkedIn \| Instagram \| Facebook \| Twitter \| PinterestYoutube \| LinkedIn \| Instagram \| Facebook \| Twitter \| Pinterest« Prev - Automata Theory Questions and Answers – The Diagonalization Languages» Next - Automata Theory Questions and Answers – Rice’s Theorem, Properties and PCP
Answer» C. Non finited) None of the mentionedAnswer: bExplanation: Under decidablity of regular language properties we have the following lemma which states that A DFA which recognizes an input w is decidable.5. Which among the following are semi decidable?a) Empty-DFAb) Rec-NFAc) Infinite-DFAd) All of the mentionedAnswer: d Explanation: All are the properties of regular languages and all are decidable languages.advertisement// var adpushup = adpushup \|\| {}; adpushup.que = adpushup.que \|\| []; adpushup.que.push(function() { adpushup.triggerAd("fdd9bf87-4faf-4493-82b4-e5538b31931a"); });//6. The language accepted by a turing machine is called ____________a) Recursive Ennumerableb) Recursivec) Both (a) and (b)d) None of the mentionedAnswer: cExplanation: The language accepted by Turing machines are called recursively ennumerable (RE), and the subset of RE languages that are accepted by a turing machine that always halts are called recursive.7. Decidable can be taken as a synonym to:a) recursiveb) non recursivec) recognizabled) none of the mentionedAnswer: aExplanation: We can refer to languages as ‘recursive’ and problems as ‘decidable’. If a language is not recursive , then we call the problem expressed by that language undecidable.advertisement// var adpushup = adpushup \|\| {}; adpushup.que = adpushup.que \|\| []; adpushup.que.push(function() { adpushup.triggerAd("21eae76a-c83f-42b0-aec5-01d590a53f37"); });//8. The problems which have no algorithm, regardless of whether or not they are accepted by a turing machine that fails to halts on some input are referred as:a) Decidableb) Undecidablec) Computabled) None of the mentionedAnswer: bExplanation: The problems that can be solved by a turing machine can divided into two classes:a) Those that have an algorithmb) Intractable problems: Those that are only solved by a turing machine that may run forever on inputs they do not accept.9. An algorithm is called efficient if it runs in ____________ time on a serial computer.a) polynomialb) non polynomialc) logarithmicd) none of the mentionedAnswer: aExplanation: Example: Runtimes of efficient algorithmsO(n), O(nlogn), O(n3log2n)Runtimes of inefficient algorithmsO(2n), O(n!)advertisement// var adpushup = adpushup \|\| {}; adpushup.que = adpushup.que \|\| []; adpushup.que.push(function() { adpushup.triggerAd("90f55663-effd-4105-b1e7-29d86b526544"); });//10. A problem is called __________ if its has an efficient algorithm for itself.a) tractableb) intractablec) computationald) none of the mentionedAnswer: aExplanation: A problem is called intractable iff there is an efficient (i.e. polynomial time) algorithm that solves it. A problem is called intractable iff there exists no efficient algorithm that solves it.11. A formal language is recursive if :a) a total turing machine existsb) a turing machine that halts for every inputc) turing machine rejects if the input does not belong to the languaged) all of the mentionedAnswer: dExplanation: A formal language is called recursive if it is a recursive subset of the set of all possible finite sequences over the alphabet of the language.12. Recursive languages are also known as:a) decidableb) undecidablec) sometimes decidabled) none of the mentionedAnswer: aExplanation: A language is recursive if there exists a turing machine such that it halts i.e. accepts if the input belongs to the language else rejects. It is better called Turing decidable language.13. The class of recursive language is known as:a) Rb) RCc) RLd) All of the mentionedAnswer: aExplanation: R is the set of all recursive languages, a class of decision problems solvable by turing machines. Although, R is also used for the class RP.14. Which of the following was not a part of Chomsky hierarchy ?a) Context sensitive grammarb) Unrestricted grammarc) Recursive grammar

Discussion

31.	Which aong the following are undecidable theories?
A.	The first order theory of boolean algebra
B.	The first order theory of Euclidean geomentry
C.	The first order theory of hyperbolic geometry
D.	The first order theory of the natural number with addition, multiplication, and equality
Answer» E.

Discussion

32.	A language L is said to be ____________ if there is a turing machine M such that L(M)=L and M halts at every point.
A.	Turing acceptable
B.	decidable
C.	undecidable
D.	none of the mentioned
Answer» C. undecidable

Discussion

33.	The decision problem is the function from string to ______________
A.	char
B.	int
C.	boolean
D.	none of the mentioned
Answer» D. none of the mentioned

Discussion

34.	There are 7 ODE solvers in MATLAB.
A.	True
B.	False
Answer» C.

Discussion

35.	The ode45 takes the function as ___________
A.	Simple input argument
B.	String argument
C.	Input argument
D.	Function argument
Answer» C. Input argument

Discussion

36.	The ode 23 solver is for higher accuracy.
A.	True
B.	False
Answer» C.

Discussion

37.	What is the error in the following code?
A.	No error
B.	Arguments as strings
C.	23 is not given within a pair of inverted commas
D.	There is no command as diffView Answer
Answer» C. 23 is not given within a pair of inverted commas

Discussion

38.	What is the co-efficient of the output of the code?
A.	0
B.	90!/39!
C.	90!/50!
D.	ErrorView Answer
Answer» D. ErrorView Answer

Discussion

39.	The output of the following code will be _____________
A.	Error
B.	t2
C.	t
D.	t2+CView Answer
Answer» B. t2

Discussion

40.	While solving a differential equation, MATLAB will show us the ___________
A.	General Solution
B.	Particular Solution
C.	Complementary function
D.	Depends on the equation
Answer» C. Complementary function

Discussion

41.	In the ubiquitin ligase enzyme complex, the ubiquitin molecule is attached to which of its component?
A.	E4
B.	E1
C.	E3
D.	E2
Answer» E.

Discussion

42.	The second and further ubiquitin molecules are added by which of the following enzymes to make the polyubiquitin chain?
A.	E3
B.	E2
C.	E2-E3 complex
D.	E1- ubiquitin complex
Answer» E.

Discussion

43.	The first ubiquitin molecule is linked to the lysine of substrate proteins by which of the following enzymes?
A.	E1
B.	E1-Ubiquitin complex
C.	E2
D.	E2-E3 complex
Answer» E.

Discussion

44.	Which property of lysine makes it a good candidate for linking of polyubiquitin chain?
A.	Its hydrophobicity
B.	Its electronegativity
C.	Carboxyl group in the side chain
D.	Amino group in the side chain
Answer» E.

Discussion

45.	Which of the following proteins does not move quickly through the pore of proteasome?
A.	Abnormal proteins
B.	Misfolded proteins
C.	Unfolded proteins
D.	Very stable proteins
Answer» E.

Discussion

46.	Which of the following proteins is also known as unfoldases?
A.	ACC proteins
B.	ABC proteins
C.	AAU proteins
D.	AAA proteins
Answer» E.

Discussion

47.	The threading reaction which unfolds the target proteins as they move through the cap is not driven by ATP hydrolysis.
A.	True
B.	False
Answer» C.

Discussion

48.	Each proteasome consists of a central hollow cylinder, known as the 20S core proteasome.
A.	False
B.	True
Answer» C.

Discussion

49.	Each end of the cylinder of the proteasome is normally associated with a large protein complex, the 19S cap.
A.	False
B.	True
Answer» C.

Discussion

50.	Which of the following recognizes the degradation signals on the abnormal proteins?
A.	E4 molecules
B.	E1 molecules
C.	E2 molecules
D.	E3 molecules
Answer» E.

Discussion

30.	Rec-DFA = { \| M is a DFA and M recognizes input w}.Fill in the blank:Rec-DFA is ___________a) Undecidableb) Decidablec) Non finited) None of the mentionedAnswer: bExplanation: Under decidablity of regular language properties we have the following lemma which states that A DFA which recognizes an input w is decidable.5. Which among the following are semi decidable?a) Empty-DFAb) Rec-NFAc) Infinite-DFAd) All of the mentionedAnswer: d Explanation: All are the properties of regular languages and all are decidable languages.advertisement// var adpushup = adpushup \|\| {}; adpushup.que = adpushup.que \|\| []; adpushup.que.push(function() { adpushup.triggerAd("fdd9bf87-4faf-4493-82b4-e5538b31931a"); });//6. The language accepted by a turing machine is called ____________a) Recursive Ennumerableb) Recursivec) Both (a) and (b)d) None of the mentionedAnswer: cExplanation: The language accepted by Turing machines are called recursively ennumerable (RE), and the subset of RE languages that are accepted by a turing machine that always halts are called recursive.7. Decidable can be taken as a synonym to:a) recursiveb) non recursivec) recognizabled) none of the mentionedAnswer: aExplanation: We can refer to languages as ‘recursive’ and problems as ‘decidable’. If a language is not recursive , then we call the problem expressed by that language undecidable.advertisement// var adpushup = adpushup \|\| {}; adpushup.que = adpushup.que \|\| []; adpushup.que.push(function() { adpushup.triggerAd("21eae76a-c83f-42b0-aec5-01d590a53f37"); });//8. The problems which have no algorithm, regardless of whether or not they are accepted by a turing machine that fails to halts on some input are referred as:a) Decidableb) Undecidablec) Computabled) None of the mentionedAnswer: bExplanation: The problems that can be solved by a turing machine can divided into two classes:a) Those that have an algorithmb) Intractable problems: Those that are only solved by a turing machine that may run forever on inputs they do not accept.9. An algorithm is called efficient if it runs in ____________ time on a serial computer.a) polynomialb) non polynomialc) logarithmicd) none of the mentionedAnswer: aExplanation: Example: Runtimes of efficient algorithmsO(n), O(nlogn), O(n3log2n)Runtimes of inefficient algorithmsO(2n), O(n!)advertisement// var adpushup = adpushup \|\| {}; adpushup.que = adpushup.que \|\| []; adpushup.que.push(function() { adpushup.triggerAd("90f55663-effd-4105-b1e7-29d86b526544"); });//10. A problem is called __________ if its has an efficient algorithm for itself.a) tractableb) intractablec) computationald) none of the mentionedAnswer: aExplanation: A problem is called intractable iff there is an efficient (i.e. polynomial time) algorithm that solves it. A problem is called intractable iff there exists no efficient algorithm that solves it.11. A formal language is recursive if :a) a total turing machine existsb) a turing machine that halts for every inputc) turing machine rejects if the input does not belong to the languaged) all of the mentionedAnswer: dExplanation: A formal language is called recursive if it is a recursive subset of the set of all possible finite sequences over the alphabet of the language.12. Recursive languages are also known as:a) decidableb) undecidablec) sometimes decidabled) none of the mentionedAnswer: aExplanation: A language is recursive if there exists a turing machine such that it halts i.e. accepts if the input belongs to the language else rejects. It is better called Turing decidable language.13. The class of recursive language is known as:a) Rb) RCc) RLd) All of the mentionedAnswer: aExplanation: R is the set of all recursive languages, a class of decision problems solvable by turing machines. Although, R is also used for the class RP.14. Which of the following was not a part of Chomsky hierarchy ?
A.	Undecidableb) Decidablec) Non finited) None of the mentionedAnswer: bExplanation: Under decidablity of regular language properties we have the following lemma which states that A DFA which recognizes an input w is decidable.5. Which among the following are semi decidable?a) Empty-DFAb) Rec-NFAc) Infinite-DFAd) All of the mentionedAnswer: d Explanation: All are the properties of regular languages and all are decidable languages.advertisement// var adpushup = adpushup \|\| {}; adpushup.que = adpushup.que \|\| []; adpushup.que.push(function() { adpushup.triggerAd("fdd9bf87-4faf-4493-82b4-e5538b31931a"); });//6. The language accepted by a turing machine is called ____________a) Recursive Ennumerableb) Recursivec) Both (a) and (b)d) None of the mentionedAnswer: cExplanation: The language accepted by Turing machines are called recursively ennumerable (RE), and the subset of RE languages that are accepted by a turing machine that always halts are called recursive.7. Decidable can be taken as a synonym to:a) recursiveb) non recursivec) recognizabled) none of the mentionedAnswer: aExplanation: We can refer to languages as ‘recursive’ and problems as ‘decidable’. If a language is not recursive , then we call the problem expressed by that language undecidable.advertisement// var adpushup = adpushup \|\| {}; adpushup.que = adpushup.que \|\| []; adpushup.que.push(function() { adpushup.triggerAd("21eae76a-c83f-42b0-aec5-01d590a53f37"); });//8. The problems which have no algorithm, regardless of whether or not they are accepted by a turing machine that fails to halts on some input are referred as:a) Decidableb) Undecidablec) Computabled) None of the mentionedAnswer: bExplanation: The problems that can be solved by a turing machine can divided into two classes:a) Those that have an algorithmb) Intractable problems: Those that are only solved by a turing machine that may run forever on inputs they do not accept.9. An algorithm is called efficient if it runs in ____________ time on a serial computer.a) polynomialb) non polynomialc) logarithmicd) none of the mentionedAnswer: aExplanation: Example: Runtimes of efficient algorithmsO(n), O(nlogn), O(n3log2n)Runtimes of inefficient algorithmsO(2n), O(n!)advertisement// var adpushup = adpushup \|\| {}; adpushup.que = adpushup.que \|\| []; adpushup.que.push(function() { adpushup.triggerAd("90f55663-effd-4105-b1e7-29d86b526544"); });//10. A problem is called __________ if its has an efficient algorithm for itself.a) tractableb) intractablec) computationald) none of the mentionedAnswer: aExplanation: A problem is called intractable iff there is an efficient (i.e. polynomial time) algorithm that solves it. A problem is called intractable iff there exists no efficient algorithm that solves it.11. A formal language is recursive if :a) a total turing machine existsb) a turing machine that halts for every inputc) turing machine rejects if the input does not belong to the languaged) all of the mentionedAnswer: dExplanation: A formal language is called recursive if it is a recursive subset of the set of all possible finite sequences over the alphabet of the language.12. Recursive languages are also known as:a) decidableb) undecidablec) sometimes decidabled) none of the mentionedAnswer: aExplanation: A language is recursive if there exists a turing machine such that it halts i.e. accepts if the input belongs to the language else rejects. It is better called Turing decidable language.13. The class of recursive language is known as:a) Rb) RCc) RLd) All of the mentionedAnswer: aExplanation: R is the set of all recursive languages, a class of decision problems solvable by turing machines. Although, R is also used for the class RP.14. Which of the following was not a part of Chomsky hierarchy ?a) Context sensitive grammar
B.	Decidablec) Non finited) None of the mentionedAnswer: bExplanation: Under decidablity of regular language properties we have the following lemma which states that A DFA which recognizes an input w is decidable.5. Which among the following are semi decidable?a) Empty-DFAb) Rec-NFAc) Infinite-DFAd) All of the mentionedAnswer: d Explanation: All are the properties of regular languages and all are decidable languages.advertisement// var adpushup = adpushup \|\| {}; adpushup.que = adpushup.que \|\| []; adpushup.que.push(function() { adpushup.triggerAd("fdd9bf87-4faf-4493-82b4-e5538b31931a"); });//6. The language accepted by a turing machine is called ____________a) Recursive Ennumerableb) Recursivec) Both (a) and (b)d) None of the mentionedAnswer: cExplanation: The language accepted by Turing machines are called recursively ennumerable (RE), and the subset of RE languages that are accepted by a turing machine that always halts are called recursive.7. Decidable can be taken as a synonym to:a) recursiveb) non recursivec) recognizabled) none of the mentionedAnswer: aExplanation: We can refer to languages as ‘recursive’ and problems as ‘decidable’. If a language is not recursive , then we call the problem expressed by that language undecidable.advertisement// var adpushup = adpushup \|\| {}; adpushup.que = adpushup.que \|\| []; adpushup.que.push(function() { adpushup.triggerAd("21eae76a-c83f-42b0-aec5-01d590a53f37"); });//8. The problems which have no algorithm, regardless of whether or not they are accepted by a turing machine that fails to halts on some input are referred as:a) Decidableb) Undecidablec) Computabled) None of the mentionedAnswer: bExplanation: The problems that can be solved by a turing machine can divided into two classes:a) Those that have an algorithmb) Intractable problems: Those that are only solved by a turing machine that may run forever on inputs they do not accept.9. An algorithm is called efficient if it runs in ____________ time on a serial computer.a) polynomialb) non polynomialc) logarithmicd) none of the mentionedAnswer: aExplanation: Example: Runtimes of efficient algorithmsO(n), O(nlogn), O(n3log2n)Runtimes of inefficient algorithmsO(2n), O(n!)advertisement// var adpushup = adpushup \|\| {}; adpushup.que = adpushup.que \|\| []; adpushup.que.push(function() { adpushup.triggerAd("90f55663-effd-4105-b1e7-29d86b526544"); });//10. A problem is called __________ if its has an efficient algorithm for itself.a) tractableb) intractablec) computationald) none of the mentionedAnswer: aExplanation: A problem is called intractable iff there is an efficient (i.e. polynomial time) algorithm that solves it. A problem is called intractable iff there exists no efficient algorithm that solves it.11. A formal language is recursive if :a) a total turing machine existsb) a turing machine that halts for every inputc) turing machine rejects if the input does not belong to the languaged) all of the mentionedAnswer: dExplanation: A formal language is called recursive if it is a recursive subset of the set of all possible finite sequences over the alphabet of the language.12. Recursive languages are also known as:a) decidableb) undecidablec) sometimes decidabled) none of the mentionedAnswer: aExplanation: A language is recursive if there exists a turing machine such that it halts i.e. accepts if the input belongs to the language else rejects. It is better called Turing decidable language.13. The class of recursive language is known as:a) Rb) RCc) RLd) All of the mentionedAnswer: aExplanation: R is the set of all recursive languages, a class of decision problems solvable by turing machines. Although, R is also used for the class RP.14. Which of the following was not a part of Chomsky hierarchy ?a) Context sensitive grammarb) Unrestricted grammar
C.	Non finited) None of the mentionedAnswer: bExplanation: Under decidablity of regular language properties we have the following lemma which states that A DFA which recognizes an input w is decidable.5. Which among the following are semi decidable?a) Empty-DFAb) Rec-NFAc) Infinite-DFAd) All of the mentionedAnswer: d Explanation: All are the properties of regular languages and all are decidable languages.advertisement// var adpushup = adpushup \|\| {}; adpushup.que = adpushup.que \|\| []; adpushup.que.push(function() { adpushup.triggerAd("fdd9bf87-4faf-4493-82b4-e5538b31931a"); });//6. The language accepted by a turing machine is called ____________a) Recursive Ennumerableb) Recursivec) Both (a) and (b)d) None of the mentionedAnswer: cExplanation: The language accepted by Turing machines are called recursively ennumerable (RE), and the subset of RE languages that are accepted by a turing machine that always halts are called recursive.7. Decidable can be taken as a synonym to:a) recursiveb) non recursivec) recognizabled) none of the mentionedAnswer: aExplanation: We can refer to languages as ‘recursive’ and problems as ‘decidable’. If a language is not recursive , then we call the problem expressed by that language undecidable.advertisement// var adpushup = adpushup \|\| {}; adpushup.que = adpushup.que \|\| []; adpushup.que.push(function() { adpushup.triggerAd("21eae76a-c83f-42b0-aec5-01d590a53f37"); });//8. The problems which have no algorithm, regardless of whether or not they are accepted by a turing machine that fails to halts on some input are referred as:a) Decidableb) Undecidablec) Computabled) None of the mentionedAnswer: bExplanation: The problems that can be solved by a turing machine can divided into two classes:a) Those that have an algorithmb) Intractable problems: Those that are only solved by a turing machine that may run forever on inputs they do not accept.9. An algorithm is called efficient if it runs in ____________ time on a serial computer.a) polynomialb) non polynomialc) logarithmicd) none of the mentionedAnswer: aExplanation: Example: Runtimes of efficient algorithmsO(n), O(nlogn), O(n3log2n)Runtimes of inefficient algorithmsO(2n), O(n!)advertisement// var adpushup = adpushup \|\| {}; adpushup.que = adpushup.que \|\| []; adpushup.que.push(function() { adpushup.triggerAd("90f55663-effd-4105-b1e7-29d86b526544"); });//10. A problem is called __________ if its has an efficient algorithm for itself.a) tractableb) intractablec) computationald) none of the mentionedAnswer: aExplanation: A problem is called intractable iff there is an efficient (i.e. polynomial time) algorithm that solves it. A problem is called intractable iff there exists no efficient algorithm that solves it.11. A formal language is recursive if :a) a total turing machine existsb) a turing machine that halts for every inputc) turing machine rejects if the input does not belong to the languaged) all of the mentionedAnswer: dExplanation: A formal language is called recursive if it is a recursive subset of the set of all possible finite sequences over the alphabet of the language.12. Recursive languages are also known as:a) decidableb) undecidablec) sometimes decidabled) none of the mentionedAnswer: aExplanation: A language is recursive if there exists a turing machine such that it halts i.e. accepts if the input belongs to the language else rejects. It is better called Turing decidable language.13. The class of recursive language is known as:a) Rb) RCc) RLd) All of the mentionedAnswer: aExplanation: R is the set of all recursive languages, a class of decision problems solvable by turing machines. Although, R is also used for the class RP.14. Which of the following was not a part of Chomsky hierarchy ?a) Context sensitive grammarb) Unrestricted grammarc) Recursive grammar
D.	None of the mentionedAnswer: bExplanation: Under decidablity of regular language properties we have the following lemma which states that A DFA which recognizes an input w is decidable.5. Which among the following are semi decidable?a) Empty-DFAb) Rec-NFAc) Infinite-DFAd) All of the mentionedAnswer: d Explanation: All are the properties of regular languages and all are decidable languages.advertisement// var adpushup = adpushup \|\| {}; adpushup.que = adpushup.que \|\| []; adpushup.que.push(function() { adpushup.triggerAd("fdd9bf87-4faf-4493-82b4-e5538b31931a"); });//6. The language accepted by a turing machine is called ____________a) Recursive Ennumerableb) Recursivec) Both (a) and (b)d) None of the mentionedAnswer: cExplanation: The language accepted by Turing machines are called recursively ennumerable (RE), and the subset of RE languages that are accepted by a turing machine that always halts are called recursive.7. Decidable can be taken as a synonym to:a) recursiveb) non recursivec) recognizabled) none of the mentionedAnswer: aExplanation: We can refer to languages as ‘recursive’ and problems as ‘decidable’. If a language is not recursive , then we call the problem expressed by that language undecidable.advertisement// var adpushup = adpushup \|\| {}; adpushup.que = adpushup.que \|\| []; adpushup.que.push(function() { adpushup.triggerAd("21eae76a-c83f-42b0-aec5-01d590a53f37"); });//8. The problems which have no algorithm, regardless of whether or not they are accepted by a turing machine that fails to halts on some input are referred as:a) Decidableb) Undecidablec) Computabled) None of the mentionedAnswer: bExplanation: The problems that can be solved by a turing machine can divided into two classes:a) Those that have an algorithmb) Intractable problems: Those that are only solved by a turing machine that may run forever on inputs they do not accept.9. An algorithm is called efficient if it runs in ____________ time on a serial computer.a) polynomialb) non polynomialc) logarithmicd) none of the mentionedAnswer: aExplanation: Example: Runtimes of efficient algorithmsO(n), O(nlogn), O(n3log2n)Runtimes of inefficient algorithmsO(2n), O(n!)advertisement// var adpushup = adpushup \|\| {}; adpushup.que = adpushup.que \|\| []; adpushup.que.push(function() { adpushup.triggerAd("90f55663-effd-4105-b1e7-29d86b526544"); });//10. A problem is called __________ if its has an efficient algorithm for itself.a) tractableb) intractablec) computationald) none of the mentionedAnswer: aExplanation: A problem is called intractable iff there is an efficient (i.e. polynomial tim
E.	algorithm that solves it. A problem is called intractable iff there exists no efficient algorithm that solves it.11. A formal language is recursive if :a) a total turing machine existsb) a turing machine that halts for every inputc) turing machine rejects if the input does not belong to the languaged) all of the mentionedAnswer: dExplanation: A formal language is called recursive if it is a recursive subset of the set of all possible finite sequences over the alphabet of the language.12. Recursive languages are also known as:a) decidableb) undecidablec) sometimes decidabled) none of the mentionedAnswer: aExplanation: A language is recursive if there exists a turing machine such that it halts i.e. accepts if the input belongs to the language else rejects. It is better called Turing decidable language.13. The class of recursive language is known as:a) Rb) RCc) RLd) All of the mentionedAnswer: aExplanation: R is the set of all recursive languages, a class of decision problems solvable by turing machines. Although, R is also used for the class RP.14. Which of the following was not a part of Chomsky hierarchy ?a) Context sensitive grammarb) Unrestricted grammarc) Recursive grammard) None of the mentionedAnswer: cExplanation: All recursive languages are recursively enumerable. All regular, context free and context sensitive languages are recursive.Sanfoundry Global Education & Learning Series – Automata Theory.To practice all areas of Automata Theory for Experienced people, here is complete set of 1000+ Multiple Choice Questions and Answers.Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with latest contests, videos, internships and jobs!Telegram \| Youtube \| LinkedIn \| Instagram \| Facebook \| Twitter \| PinterestYoutube \| LinkedIn \| Instagram \| Facebook \| Twitter \| Pinterest« Prev - Automata Theory Questions and Answers – The Diagonalization Languages» Next - Automata Theory Questions and Answers – Rice’s Theorem, Properties and PCP
Answer» C. Non finited) None of the mentionedAnswer: bExplanation: Under decidablity of regular language properties we have the following lemma which states that A DFA which recognizes an input w is decidable.5. Which among the following are semi decidable?a) Empty-DFAb) Rec-NFAc) Infinite-DFAd) All of the mentionedAnswer: d Explanation: All are the properties of regular languages and all are decidable languages.advertisement// var adpushup = adpushup \|\| {}; adpushup.que = adpushup.que \|\| []; adpushup.que.push(function() { adpushup.triggerAd("fdd9bf87-4faf-4493-82b4-e5538b31931a"); });//6. The language accepted by a turing machine is called ____________a) Recursive Ennumerableb) Recursivec) Both (a) and (b)d) None of the mentionedAnswer: cExplanation: The language accepted by Turing machines are called recursively ennumerable (RE), and the subset of RE languages that are accepted by a turing machine that always halts are called recursive.7. Decidable can be taken as a synonym to:a) recursiveb) non recursivec) recognizabled) none of the mentionedAnswer: aExplanation: We can refer to languages as ‘recursive’ and problems as ‘decidable’. If a language is not recursive , then we call the problem expressed by that language undecidable.advertisement// var adpushup = adpushup \|\| {}; adpushup.que = adpushup.que \|\| []; adpushup.que.push(function() { adpushup.triggerAd("21eae76a-c83f-42b0-aec5-01d590a53f37"); });//8. The problems which have no algorithm, regardless of whether or not they are accepted by a turing machine that fails to halts on some input are referred as:a) Decidableb) Undecidablec) Computabled) None of the mentionedAnswer: bExplanation: The problems that can be solved by a turing machine can divided into two classes:a) Those that have an algorithmb) Intractable problems: Those that are only solved by a turing machine that may run forever on inputs they do not accept.9. An algorithm is called efficient if it runs in ____________ time on a serial computer.a) polynomialb) non polynomialc) logarithmicd) none of the mentionedAnswer: aExplanation: Example: Runtimes of efficient algorithmsO(n), O(nlogn), O(n3log2n)Runtimes of inefficient algorithmsO(2n), O(n!)advertisement// var adpushup = adpushup \|\| {}; adpushup.que = adpushup.que \|\| []; adpushup.que.push(function() { adpushup.triggerAd("90f55663-effd-4105-b1e7-29d86b526544"); });//10. A problem is called __________ if its has an efficient algorithm for itself.a) tractableb) intractablec) computationald) none of the mentionedAnswer: aExplanation: A problem is called intractable iff there is an efficient (i.e. polynomial time) algorithm that solves it. A problem is called intractable iff there exists no efficient algorithm that solves it.11. A formal language is recursive if :a) a total turing machine existsb) a turing machine that halts for every inputc) turing machine rejects if the input does not belong to the languaged) all of the mentionedAnswer: dExplanation: A formal language is called recursive if it is a recursive subset of the set of all possible finite sequences over the alphabet of the language.12. Recursive languages are also known as:a) decidableb) undecidablec) sometimes decidabled) none of the mentionedAnswer: aExplanation: A language is recursive if there exists a turing machine such that it halts i.e. accepts if the input belongs to the language else rejects. It is better called Turing decidable language.13. The class of recursive language is known as:a) Rb) RCc) RLd) All of the mentionedAnswer: aExplanation: R is the set of all recursive languages, a class of decision problems solvable by turing machines. Although, R is also used for the class RP.14. Which of the following was not a part of Chomsky hierarchy ?a) Context sensitive grammarb) Unrestricted grammarc) Recursive grammar

Explore topic-wise MCQs in Testing Subject.

The _________ are the substances which allow moisture to stay on their surfaces.

________________ is the process by which the required amount of moisture is taken out from the air.

_____________ is the process by which the required amount of moisture is added in the air.

In winter, it becomes necessary to supplied slightly _________ air to the inside of the building.

Combination system consist of supply system and __________ system.

MySQL works with spatial values in 3 formats.

MEMORY tables do not support BLOB and TEXT indexes.

The maximum size in bytes of a row in MySQL is __________

The maximum non zero value for FLOAT is ___________

What are the lattice coefficients corresponding to the FIR filter with system function H(z)= 1+(13/24)z-1+(5/8)z-2+(1/3)z-3?

If a three stage lattice filter with coefficients K1=1/4, K2=1/2 K3=1/3, then what are the FIR filter coefficients for the direct form structure?

The constants K1 and K2 of the lattice structure are called as reflection coefficients.

What is the value of the coefficient α2(1) in the case of FIR filter represented in direct form structure with m=2 in terms of K1 and K2?

The FIR filter whose direct form structure is as shown below is a prediction error filter.

What is the unit sample response of the mth filter?

If we consider a sequence of FIR filer with system function Hm(z)=Am(z), then what is the definition of the polynomial Am(z)?

Which of the following is the application of lattice filter?

How many types of recovery control techniques:

Which is refers to a stalemate situation due to which no further progress is possible as computer await response of each other:

The general equation for PDMA is aiΦi+biΦi+2+ci Φi+1+diΦi-1+eiΦi-2=fi. Which of the following is incorrect? (Note: ‘N’ is the number of unknowns).

TDMA and PDMA are particularly suitable for _____________

Consider the global matrix AΦ=b. If my coefficient matrix A is the same for different b vectors, which of these methods is economic?

The number of operations for LU decomposition method is ____________ the number of operations for the Gauss elimination method.

Which of these is true for the LU decomposition method?

If N is the number of unknowns, the number of operations required for backward substitution is ____________

Which of these formulae is used in the backward substitution step of Gauss-elimination method?Note: The global matrix isAΦ=bi → row number.j → column number.N→ Number of unknowns.

After the forward elimination step of the Gauss elimination method, the coefficient matrix is reduced to ____________

Which of these direct methods is suitable only for banded matrices?

The coefficient matrix in the global matrix format of the algebraic equations is a ______________

Which aong the following are undecidable theories?

A language L is said to be ____________ if there is a turing machine M such that L(M)=L and M halts at every point.

The decision problem is the function from string to ______________

There are 7 ODE solvers in MATLAB.

The ode45 takes the function as ___________

The ode 23 solver is for higher accuracy.

What is the error in the following code?

What is the co-efficient of the output of the code?

The output of the following code will be _____________

While solving a differential equation, MATLAB will show us the ___________

In the ubiquitin ligase enzyme complex, the ubiquitin molecule is attached to which of its component?

The second and further ubiquitin molecules are added by which of the following enzymes to make the polyubiquitin chain?

The first ubiquitin molecule is linked to the lysine of substrate proteins by which of the following enzymes?

Which property of lysine makes it a good candidate for linking of polyubiquitin chain?

Which of the following proteins does not move quickly through the pore of proteasome?

Which of the following proteins is also known as unfoldases?

The threading reaction which unfolds the target proteins as they move through the cap is not driven by ATP hydrolysis.

Each proteasome consists of a central hollow cylinder, known as the 20S core proteasome.

Each end of the cylinder of the proteasome is normally associated with a large protein complex, the 19S cap.

Which of the following recognizes the degradation signals on the abnormal proteins?