MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 233 Mcqs, each offering curated multiple-choice questions to sharpen your Control Systems knowledge and support exam preparation. Choose a topic below to get started.
| 51. |
The number of strings of length 4 that are generated by the regular expression (0+1+|2+3+)*, where | is an alternation character and {+, *} are quantification characters, is: |
| A. | 08 |
| B. | 09 |
| C. | 10 |
| D. | 12 |
| Answer» D. 12 | |
| 52. |
The language L = { 0^i 2 1 ^i i>-0 } over the alphabet (0,1,2) is |
| A. | not recurcise |
| B. | is recursive and deterministic CFL |
| C. | is a regular language |
| D. | is not a deterministic CFL but a CFL |
| Answer» C. is a regular language | |
| 53. |
In multi-programmed systems, it is advantageous if some programs such as editors and compilers can be shared by several users. Which of the following must be true of multi-programmed systems in order that a single copy of a program can be shared by several users? I. The program is a macro II. The program is recursive III.The program is reentrant |
| A. | I only |
| B. | II only |
| C. | Ill only |
| D. | I, II and III |
| Answer» D. I, II and III | |
| 54. |
Consider the CFG with {S,A,B) as the non-terminal alphabet, {a,b) as the terminal alphabet, S as the start symbol and the following set of production rulesS --> aB S --> bAB --> b A --> aB --> bS A --> aSB --> aBB A --> bAAWhich of the following strings is generated by the grammar? |
| A. | aaaabb |
| B. | aabbbb |
| C. | aabbab |
| D. | abbbba |
| Answer» D. abbbba | |
| 55. |
Which of the following is true for the language {a^p} p is prine ? |
| A. | It is not accepted by a turing machine |
| B. | It is regular but not context free |
| C. | It is context free but not regular |
| D. | It is neither regular nor context free but accepted by a turing machine |
| Answer» E. | |
| 56. |
Consider the following decision problems:(P1) Does a given finite state machine accept a given string(P2) Does a given context free grammar generate an infinite number of stingsWhich of the following statements is true? |
| A. | Both (P1) and (P2) are decidable |
| B. | Neither (P1) nor (P2) are decidable |
| C. | Only (P1) is decidable |
| D. | Only (P2) is decidable |
| Answer» B. Neither (P1) nor (P2) are decidable | |
| 57. |
Let L1 be a regular language, L2 be a deterministic context-free language and L3 a recursively enumerable, but not recursive, language. Which one of the following statements is false? |
| A. | L1 n L2 is a deterministic CFL |
| B. | L3 n L1 is recursive |
| C. | L1 U L2 is context free |
| D. | L1 n L2 n L3 is recursively enumerable |
| Answer» C. L1 U L2 is context free | |
| 58. |
Which of the following statements are TRUE?I. There exist parsing algorithms for some programming languages whose complexities are less than O(n3).II. A programming language which allows recursion can be implemented with static storage allocation.III. No L-attributed definition can be evaluated in the framework of bottom-up parsing.IV. Code improving transformations can be performed at both source language and intermediate code level. |
| A. | I and II |
| B. | I and IV |
| C. | III and IV |
| D. | I, III and IV |
| Answer» C. III and IV | |
| 59. |
Consider the following Finite State AutomatonThe language accepted by this automaton is given by the regular expression |
| A. | b*ab*ab*ab |
| B. | (a+b)* |
| C. | b*a(a+b)* |
| D. | b*ab*ab |
| Answer» D. b*ab*ab | |
| 60. |
Consider the grammar defined by the following production rules, with twooperators ∗ and + S --> T * P T --> U | T * U P --> Q + P | Q Q --> Id U --> IdWhich one of the following is TRUE? |
| A. | + is left associative, while ∗ is right associative |
| B. | + is right associative, while ∗ is left associative |
| C. | Both + and ∗ are right associative |
| D. | Both + and ∗ are left associative |
| Answer» C. Both + and ∗ are right associative | |
| 61. |
Which of the following macros can put a micro assembler into an infinite loop?(i) .MACRO M1 X.IF EQ, X ;if X=0 thenM1 X + 1.ENDC.IF NE X ;IF X≠0 then.WORD X ;address (X) is storedhere.ENDC.ENDM(ii).MACRO M2 X.IF EQ XM2 X.ENDC.IF NE, X.WORD X+1.ENDC.ENDM |
| A. | (ii) only |
| B. | (i) only |
| C. | Both (i) and (ii) |
| D. | None of the above |
| Answer» B. (i) only | |
| 62. |
Shift-Reduce parsers perform the following: |
| A. | Shift step that advances in the input stream by K(K > 1) symbols and Reduce step that applies a completed grammar rule to some recent parse trees, joining them together as one tree with a new root symbol. |
| B. | Shift step that advances in the input stream by one symbol and Reduce step that applies a completed grammar rule to some recent parse trees, joining them together as one tree with a new root symbol. |
| C. | Shift step that advances in the input stream by K(K = 2) symbols and Reduce step that applies a completed grammar rule to form a single tree |
| D. | Shift step that does not advance in the input stream and Reduce step that applies a completed grammar rule to form a single tree. |
| Answer» C. Shift step that advances in the input stream by K(K = 2) symbols and Reduce step that applies a completed grammar rule to form a single tree | |
| 63. |
A lexical analyzer uses the following patterns to recognize three tokens T1, T2, and T3 over the alphabet {a,b,c}. T1: a?(b∣c)*a T2: b?(a∣c)*b T3: c?(b∣a)*c Note that ‘x?’ means 0 or 1 occurrence of the symbol x. Note also that the analyzer outputs the token that matches the longest possible prefix. If the string bbaacabc is processes by the analyzer, which one of the following is the sequence of tokens it outputs? |
| A. | T1T2T3 |
| B. | T1T1T3 |
| C. | T2T1T3 |
| D. | T3T3 |
| Answer» E. | |
| 64. |
From the given data below : a b b a a b b a a b which one of the following is not aword in the dictionary created by LZ-coding (the initial words are a, b)? |
| A. | a b |
| B. | b b |
| C. | b a |
| D. | b a a b |
| Answer» E. | |
| 65. |
Consider three decision problems P1, P2 and P3. It is known that P1 is decidable and P2 is undecidable. Which one of the following is TRUE? |
| A. | P3 is decidable if P1 is reducible to P3 |
| B. | P3 is undecidable if P3 is reducible to P2 |
| C. | P3 is undecidable if P2 is reducible to P3 |
| D. | P3 is decidable if P3 is reducible to P2's complement |
| Answer» D. P3 is decidable if P3 is reducible to P2's complement | |
| 66. |
Which of the following statement(s) regarding a linker software is/are true ? I A function of a linker is to combine several object modules into a single load module. II A function of a linker is to replace absolute references in an object module by symbolic references to locations in other modules. |
| A. | Only I |
| B. | Only II |
| C. | Both I and II |
| D. | Neither I nor II |
| Answer» B. Only II | |
| 67. |
The grammar whose productions are → if id then → if id then else → id := idis ambiguous becausea) the sentence if a then if b then c:= d has two parse treesb) the left most and right most derivations of the sentence if a then if b then c:= d give rise to different parse treesc) the sentence if a then if b then c:= d else c:= f has more than two parse treesd) the sentence if a then if b then c:= d else c:= f has two parse trees |
| A. | a |
| B. | b |
| C. | c |
| D. | d |
| Answer» E. | |
| 68. |
Consider the languages L1={0^{i}1^{j}|i != j}, L2={0^{i}1^{j}|i = j}, L3 = {0^{i}1^{j}|i = 2j+1}, L4 = {0^{i}1^{j}|i != 2j}. Which one of the following statements is true? |
| A. | Only L2 is context free |
| B. | Only L2 and L3 are context free |
| C. | Only L1 and L2 are context free |
| D. | All are context free |
| Answer» E. | |
| 69. |
Which one of the following languages over the alphabet {0,1} is described by theregular expression: (0+1)*0(0+1)*0(0+1)*? |
| A. | The set of all strings containing the substring 00. |
| B. | The set of all strings containing at most two 0’s. |
| C. | The set of all strings containing at least two 0’s. |
| D. | The set of all strings that begin and end with either 0 or 1. |
| Answer» D. The set of all strings that begin and end with either 0 or 1. | |
| 70. |
Consider the grammar S → (S) | a Let the number of states in SLR(1), LR(1) and LALR(1) parsers for the grammar be n1, n2 and n3 respectively. The following relationship holds good |
| A. | n1 < n2 < n3 |
| B. | n1 = n3 < n2 |
| C. | n1 = n2 = n3 |
| D. | n1 ≥ n3 ≥ n2 |
| Answer» C. n1 = n2 = n3 | |
| 71. |
Consider the languages: L1 ={a^n b^n c^m | n,m >01 and L2 ={a^n b^m c^m |n,m> o) Which one of the following statements is FALSE? |
| A. | L1 n L2 is a context-free language |
| B. | L1 u L2 is a context-free language |
| C. | L1 and L2 are context-free languages |
| D. | L1 n L2 is a context sensitive language |
| Answer» B. L1 u L2 is a context-free language | |
| 72. |
Which of the following are decidable ?1. whether the intersection of two regular language is infinite.2. whether a give context free language is regular3. whether two push down automata accept the same language.4. whether a given grammar is context free |
| A. | 1 and 2 |
| B. | 1 and 4 |
| C. | 2 and 3 |
| D. | 2 and 4 |
| Answer» C. 2 and 3 | |
| 73. |
If L and L' are recursively enumerable, then L is |
| A. | regular |
| B. | context free |
| C. | context sensitive |
| D. | recursive |
| Answer» E. | |
| 74. |
The number of tokens in the following C statement is printf("i=%d, &i=%x",i&i); |
| A. | 13 |
| B. | 6 |
| C. | 10 |
| D. | 9 |
| Answer» E. | |
| 75. |
Consider the following grammars(S1) :A --> aBCDB --> bc|cC --> d|∈D -> b(S2) :A --> aBCDB --> bc|∈C --> d|cD -> b(S3) :A --> aBCDB --> bc|∈C --> d|∈D -> b(S4) :A --> aBCDB --> bc|cC --> d|cD -> bWhich of the following grammar has same follow set for variable B? |
| A. | Only (S1), (S2) and (S3), (S4) |
| B. | Only (S1), (S3) and (S2), (S4) |
| C. | Only (S2), (S3) and (S1), (S4) |
| D. | None of the above |
| Answer» C. Only (S2), (S3) and (S1), (S4) | |
| 76. |
Consider the languages: GATE[2005]L1 = {wwR w €{0, 1} *1L2 ={w#ww € {O,1}*},where # is a special symbolL3 ={www € {0,1}*}Which one of the following is TRUE? |
| A. | L1 is a deterministic CFL |
| B. | L2 is a deterministic CFL |
| C. | L3 is a CFL, but not a deterministic CFL |
| D. | L3 is a deterministic CFL |
| Answer» C. L3 is a CFL, but not a deterministic CFL | |
| 77. |
Consider the following statements:(I) The output of a lexical analyzer is groups of characters.(II) Total number of tokens in printf("i=%d, &i=%x", i, &i); are 11.(III) Symbol table can be implementation by using array and hash table but not tree.Which of the following statement(s) is/are correct? |
| A. | Only (I) |
| B. | Only (II) and (III) |
| C. | All (I), (II), and (III) |
| D. | None of these |
| Answer» E. | |
| 78. |
The color mode where all the colors used in image is defined as a combination ofred,green and blue colors is |
| A. | CMYK |
| B. | Duotone |
| C. | LAB |
| D. | RGB |
| Answer» E. | |
| 79. |
Post production of Multimedia |
| A. | Story board |
| B. | Shooting |
| C. | Editing |
| D. | SpecialEffects |
| Answer» E. | |
| 80. |
Production of Multimedia |
| A. | Story board |
| B. | Shooting |
| C. | Editing |
| D. | Specialeffects |
| Answer» C. Editing | |
| 81. |
Pre production of Multimedia |
| A. | Story board |
| B. | Shooting |
| C. | Editing |
| D. | Specialeffects |
| Answer» B. Shooting | |
| 82. |
The tool which works like a real life paint brush and allows drawingsmooth strokes of color. |
| A. | Paint brush |
| B. | Airbrush |
| C. | History brush |
| D. | all of the above |
| Answer» C. History brush | |
| 83. |
Tool used to increase or decrease the magnification of an image |
| A. | Hand tool |
| B. | gradient tool |
| C. | lasso tool |
| D. | zoom tool |
| Answer» E. | |
| 84. |
Interactivity means |
| A. | sequential order |
| B. | scenes are already planned up one after the other |
| C. | has no user interface |
| D. | user control movements |
| Answer» E. | |
| 85. |
A movie contains? |
| A. | still images |
| B. | audio |
| C. | simulation |
| D. | video |
| Answer» E. | |
| 86. |
The following affects the resolution of a video EXCEPT: |
| A. | bit depth |
| B. | frame size |
| C. | aspect ratio |
| D. | none of these |
| Answer» B. frame size | |
| 87. |
To connect a digital video camera to a computer, we use thistype of cable: |
| A. | firewire |
| B. | usb |
| C. | livewire |
| D. | s video |
| Answer» C. livewire | |
| 88. |
LCD |
| A. | liquid crystal display |
| B. | lens camera display |
| C. | light control device |
| D. | linear control display |
| Answer» B. lens camera display | |
| 89. |
Photoshop file format |
| A. | jpeg |
| B. | psd |
| C. | odt |
| D. | doc |
| Answer» C. odt | |
| 90. |
A multimedia authoring software. |
| A. | pagemaker |
| B. | director |
| C. | excel |
| D. | none of the above |
| Answer» C. excel | |
| 91. |
The color inside a shape is the fill. The line around that fill iscalled the: |
| A. | stroke |
| B. | outline |
| C. | vector line |
| D. | out layer |
| Answer» B. outline | |
| 92. |
To bring external files into both Flash and Premiere, you wouldperform this function: |
| A. | import |
| B. | insert |
| C. | locate |
| D. | capture |
| Answer» B. insert | |
| 93. |
What is the ideal resolution of an image for Printing |
| A. | 72 dpi |
| B. | 300 dpi |
| C. | 100 dpi |
| D. | 250 dpi |
| Answer» C. 100 dpi | |
| 94. |
A linear presentation plays without user intervention, but this type of presentation DOES require user intervention tofunction: |
| A. | intermediary |
| B. | interactive |
| C. | interplayable |
| D. | interlinear |
| Answer» C. interplayable | |
| 95. |
Which of the following File Formats is a lossless File Format that was intended to replace GIF by adding extra features? |
| A. | jpeg |
| B. | gif |
| C. | png |
| D. | tiff |
| Answer» D. tiff | |
| 96. |
What are some examples of multimedia? |
| A. | video games, movies, and television |
| B. | television series |
| C. | computer-generated graphics |
| D. | digital pictures |
| Answer» B. television series | |
| 97. |
How does multimedia help school-age children? |
| A. | it replaces direct textbook reading |
| B. | it helps students learn in new and stimulating ways and allows them to apply their knowledge creatively |
| C. | it allows students to control all their learning |
| D. | it replaces teacher lectures |
| Answer» C. it allows students to control all their learning | |
| 98. |
What war inspired the United States to form a new way ofcommunicating, now commonly known as the Internet? |
| A. | the gulf war |
| B. | the vietnam war |
| C. | world war ii |
| D. | the cold war |
| Answer» D. the cold war | |
| 99. |
What is telemedicine? |
| A. | something that gives people access to the expertise ofspecialties in urban hospitals through the use of multimedia and computer networks |
| B. | a computer game that allows people to pretend to be doctors |
| C. | a database that lists and explains all known medicines |
| D. | an advertisement for the local grocery store\s pharmacy |
| Answer» B. a computer game that allows people to pretend to be doctors | |
| 100. |
What does ISP stand for? |
| A. | international service protocol |
| B. | internal services and protection |
| C. | internet service provider |
| D. | internet search program |
| Answer» D. internet search program | |