Minimal deterministic finite automaton for the language L={ 0n | n≥0, n≠4 } will have: (A) 1 final state among 5 states (B) 4 final states among 5 states (C) 1 final state among 6 states (D) 5 final states among 6 states
Description : Let L be the language generated by regular expression 0*10* and accepted by the deterministic finite automata M. Consider the relation RM defined by M. As all states are reachable from the start state, RM has ................ equivalence classes. (A) 2 (B) 4 (C) 5 (D) 6
Last Answer : (D) 6
Description : Given a Non-deterministic Finite Automation (NFA) with states p and r as initial and final states respectively transition table as given below The minimum number of states required in Deterministic Finite Automation (DFA) equivalent to NFA is (A) 5 (B) 4 (C) 3 (D) 2
Last Answer : (C) 3
Description : The Greibach normal form grammar for the language L={an bn+1|n≥0} is (A) S→a SB, B→bB|λ (B) S→a SB, B→bB|b (C) S→a SB|b, B→b (D) S→a Sb|b
Last Answer : (C) S→a SB|b, B→b
Description : The context free grammar for the language L = {an bm | n≤m+3, n≥0, m≥0} is (A) S→aaaA; A→aAb|B, B→Bb|λ (B) S→aaaA|λ, A→aAb|B, B→Bb|λ (C) S→aaaA|aaA|λ, A→aAb|B, B→Bb|λ (D) S→aaaA|aaA|aA|λ, A→aAb|B, B→Bb|λ
Last Answer : (D) S→aaaA|aaA|aA|λ, A→aAb|B, B→Bb|λ
Description : Which of the following pairs have different expressive power? (1) Single-tape-turing machine and multi-dimensional turing machine. (2) Multi-tape turing machine and multi-dimensional ... non-deterministic pushdown automata. (4) Deterministic finite automata and Non-deterministic finite automata.
Last Answer : Deterministic push down automata and non-deterministic pushdown automata.
Description : Given the following two statements: A. L = {w|na(w) = nb(w)} is deterministic context free language, but not linear B. L = {an bn} U {an b2n} is linear, but not deterministic context free language. Which of the following ... are true. (3) (A) is true, (B) is false. (4) (A) is false, (B) is true.
Last Answer : Both (A) and (B) are true.
Description : Given the following two languages: L1 = {anbn|n≥0, n≠100} L2 = {w ϵ {a,b,c}*| na(w) = nb(w) = nc(w)} Which of the following options is correct? (1) Both L1 and L2 are ... context free language, L2 is not context free language. (4) L1 is not context free language, L2 is context free language.
Last Answer : L1 is context free language, L2 is not context free language.
Description : Consider the following statements related to compiler construction: I. Lexical Analysis is specified by context-free grammars and implemented by pushdown automata. II. Syntax Analysis is specified by regular expressions and implemented by ... Only l (2) Only ll (3) Both I and II (4) Neither I nor Il
Last Answer : Answer: 4
Description : There are exactly ................ different finite automata with three states x, y and z over the alphabet {a, b} where x is always the start state. (A) 64 (B) 256 (C) 1024 (D) 5832
Last Answer : Answer: D
Description : In ……………… system the interaction between various subsystems cannot be defined with certainty A) Open System B) Closed System C) Deterministic System D) Probabilistic System
Last Answer : D) Probabilistic System
Description : ………… is a good example of deterministic system. A) Life cycle B) Computer Program C) Software Program D) None of the above
Last Answer : B) Computer Program
Description : A pushdown automation M = (Q, Σ, Γ, δ, q0, z, F) is set to be deterministic subject to which of the following condition(s), for every q ∈ Q, a ∈ Σ ∪ {λ} and b ∈ Γ (s1) δ(q, a, b) contains at most one ... ) must be empty for every c ∈ Σ (A) only s1 (B) only s2 (C) both s1 and s2 (D) neither s1 nor s2
Last Answer : (C) both s1 and s2
Description : State true or false i) A candidate key is a minimal super key. ii) A candidate key can also refer to as surrogate key. A) i-true, ii-false B) i-false, ii-true C) i-true, ii-true D) i-false, ii-false
Last Answer : C) i-true, ii-true
Description : If f(x, y) is a digital image, then x, y and amplitude values of f are (A) Finite (B) Infinite (C) Neither finite nor infinite (D) None of the above
Last Answer : (A) Finite
Description : Given the following statements with respect to linear programming problem: S1: The dual of the dual linear programming problem is again the primal problem S2: If either the primal or the dual problem has an unbounded objective function ... S1 and S2 (B) S1 and S3 (B) S2 and S3 (D) S1, S2 and S2
Last Answer : (D) S1, S2 and S2
Description : Let A and B be sets in a finite universal set U. Given the following: |A - B|, |AÅB|, |A|+|B| and |AÈB| Which of the following is in order of increasing size ? (A) |A - B| ≤ |AÅB| ≤ |A| + |B| ≤ |AÈB| (B) |AÅB| ≤ |A ... |AÅB| ≤ |A| + |B| ≤ |A - B| ≤ |AÈB| (D) |A - B| ≤ |AÅB| ≤ |AÈB| ≤ |A| + |B|
Last Answer : (D) |A – B| ≤ |AÅB| ≤ |AÈB| ≤ |A| + |B|
Description : A ................. complete subgraph and a ................. subset of vertices of a graph G=(V,E) are a clique and a vertex cover respectively. (A) minimal, maximal (B) minimal, minimal (C) maximal, maximal (D) maximal, minimal
Last Answer : (D) maximal, minimal
Description : P and Q both are dealers of cars. The price of a car is Rs 56,000. P gives a discount of 10% on whole, while Q gives a discount of 12% on the first Rs 40,000 and 8% 0n the rest Rs 16000. What is the difference between their selling prices?
Last Answer : discount offer by by P= 10 % of 56000 = Rs. 5600 total discount offer by Q= 12% of 40,000+8% of 16000 =4800+1280=Rs. 6080 required difference= 6080-5600= Rs.480
Description : If one finds the automaton they created to be a nuisance would they have exclusive right to terminate it?
Last Answer : answer:Like we’ve already discussed: If you cause something that is sentient and sapient to die, that is murder. If you couldn’t do it to your children, you can’t do it to your android.
Description : How do you rid yourself of your sentient automaton?
Last Answer : Because I love them, I would connect them all to a supercomputer and run the ultimate torture program, forever.
Description : The grammar with production rules S → aSb |SS|λ generates language L given by: (A) L = {w∈{a, b}* | na(w) = nb(w) and na(v) ≥ nb(v) where v is any prefix of w} (B) L = {w∈{a, b}* | na(w) = nb(w) and na(v ... (D) L = {w∈{a, b}* | na(w) ≠ nb(w) and na(v) ≤ nb(v) where v is any prefix of w}
Last Answer : (A) L = {w∈{a, b}* | na(w) = nb(w) and na(v) ≥ nb(v) where v is any prefix of w}
Description : Given L1 = L(a*baa*) and L2 = L(ab*) The regular expression corresponding to language L3 = L1/L2 (right quotient) is given by (A) a*b (B) a*baa* (C) a*ba* (D) None of the above
Last Answer : (C) a*ba*
Description : Given the following statements: S1: Every context-sensitive language L is recursive. S2: There exists a recursive language that is not context sensitive. Which statement is correct? (A) S1 is not correct and S2 is ... (C) S1 is correct and S2 is not correct. (D) S1 is correct and S2 is correct.
Last Answer : (D) S1 is correct and S2 is correct.
Description : Given the following statements : S1 : If L is a regular language then the language {uv | uϵL, vϵLR} is also regular. S2 : L = {wwR} is regular language. Which of the following is true ? (A) S1 is not ... S2 is correct. (C) S1 is correct and S2 is not correct. (D) S1 is correct and S2 is correct.
Last Answer : (C) S1 is correct and S2 is not correct.
Description : The transition function for the language L = {w|na(w) and nb(w) are both odd} is given by: δ(q0, a)=q1 ; δ(q0, b)=q2 δ(q1, a)=q0 ; δ(q1, b)=q3 δ(q2, a)=q3 ; δ(q2, b ... the automata are: (A) q0 and q0 respectively (B) q0 and q1 respectively (C) q0 and q2 respectively (D) q0 and q3 respectively
Last Answer : (D) q0 and q3 respectively
Description : The regular expression corresponding to the language L where L={x∈{0,1}* | x ends with 1 and does not contain substring 00 } is: (A) (1 + 01)* (10 + 01) (B) (1 + 01)* 01 (C) (1 + 01)* (1 + 01) (D) (10 + 01)* 01
Last Answer : (C) (1 + 01)* (1 + 01)
Description : The regular expression for the complement of the language L = {anbm|n≥4, m≤3} is: (A) (λ + a + aa + aaa)b* + a*bbbb* + (a + b)*ba(a + b)* (B) (λ + a + aa + aaa)b* + a*bbbbb* + (a + b)*ab(a + b)* (C) (λ + a ... *bbbbb* + (a + b)*ab(a + b)* (D) (λ + a + aa + aaa)b* + a*bbbbb* + (a + b)*ba(a + b)*
Last Answer : (D) (λ + a + aa + aaa)b* + a*bbbbb* + (a + b)*ba(a + b)*
Description : A 60-year-old man was diagnosed last year with adenocarcinoma of the lung, and a 4 cm mass lesion was treated with a right lower lobectomy. He now has an ... 2) Membranous glomerulonephritis 3) Minimal change glomerulonephritis 4) Nodular glomerulosclerosis 5) Rapidly progressive glomerulonephritis
Last Answer : Answers-2 Most cases of membranous GN are idiopathic, but in some patients there is a history of an infection or a malignancy (usually lung) with antigenemia.
Description : Which of the following are the principles tasks of the linker? I. Resolve external references among separately compiled program units. II. Translate assembly language to machine code. III. Relocate code and data relative to the beginning of ... (A) I and II (B) I and III (C) II and III (D) I and IV
Last Answer : (B) I and III
Description : State true or false. i) init() is called after start() in applet ii) applets are used for networking iii) inheritance is a part of Java Foundation Classes iv) final does not prevent inheritance A) i-true, ii- ... C) i-true, ii-true, iii-true, iv-true D) i-true, ii-false, iii-false, iv-false
Last Answer : B) i-false, ii-false, iii-false, iv-false
Description : State true or false for Java Program. i) Data members of an interface are by default final ii) An abstract class has implementations of all methods defined inside it. A) i-false, ii-false B) i-false, ii-true C) i-true, ii-false D) i-true, ii-true
Last Answer : C) i-true, ii-false
Description : State True or False. 1. Term of reference is the final output of Feasibility Study 2. Design specification report is the final output of System Analysis A) 1-true, 2-true B) 1-false, 2-true C) 1-true, 2-false D) 1-false, 2-false
Last Answer : A) 1-true, 2-true
Description : A specialty product 1. requires minimal effort to purchase 2. is purchased frequently 3. requires purchase planning, and the buyer will not accept substitutes 4. is generally less expensive ... items in the same product class 5. prompts the purchaser to make comparisons among alternatives
Last Answer : requires purchase planning, and the buyer will not accept substitutes
Description : A specialty product A)requires minimal effort to purchase. B)is purchased frequently. C)requires purchase planning, and the buyer will not accept substitutes. D)is generally less expensive than ... items in the same product class. E)prompts the purchaser to make comparisons among alternatives.
Last Answer : C)requires purchase planning, and the buyer will not accept substitutes.
Description : What is a finite set of rules that specifies a language? a) Signs b) Communication c) Grammar d) Phrase
Last Answer : c) Grammar
Description : What is the use of final keyword?
Last Answer : A: Final can be used in three scenarios: a) final before a variable makes it a constant. b) final before a function declaration prevents it from being overridden. c) final before a class declaration prevents it from being inherited.
Description : If a variable is declared final, it must include ...................... value. A) integer B) no C) initial D) float
Last Answer : C) initial
Description : Using which keyword we can access value of the instance variables and class variables of that class inside the method of that class itself. A) super B) final C) this D) either super or this
Last Answer : C) this
Description : The output of problem definition stage is …………….. A) Master Development Plan B) Terms of reference C) Feasibility report D) Final product
Last Answer : B) Terms of reference
Description : What steps shall be required to rotate an object about the point P1 (as shown in fig.1) and its placement such that what was at P1 is now reduced and is at P2 (as shown in fig.2). I. Translate P1 to origin II. ... (A) I,II and III (B) II,III and IV (C) I,III and IV (D) All of the above
Last Answer : Answer: Marks given to all
Description : What are the final values of Q1 and Q0 after 4 clock cycles, if initial values are 00 in the sequential circuit shown below: (A) 11 (B) 10 (C) 01 (D) 00
Last Answer : (D) 00
Description : Software safety is quality assurance activity that focuses on hazards that (A) affect the reliability of a software component (B) may cause an entire system to fail. (C) may result from user input errors. (D) prevent profitable marketing of the final product
Last Answer : (B) may cause an entire system to fail.
Description : There are three processes P1, P2 and P3 sharing a semaphore for synchronising a variable. Initial value of semaphore is one. Assume that negative value of semaphore tells us how many processes are waiting in queue. Processes access ... The final value of semaphore will be: (1) 0 (2) 1 (3) -1 (4) -2
Last Answer : Answer: 1
Description : Suppose list Example is [‘h’,’e’,’l’,’l’,’o’], what is len(list Example)? a) 5 b) 4 c) None d) Error
Last Answer : a) 5
Description : An ideal gas of volume 1liter and pressure 10 bar undergoes a quasistatic adiabatic expansion until the pressure drops to 1 bar. Assume γ to be 1.4 what is the final volume? a. 3.18 l b. 4.18 l c. 5.18 l d. 6.18 l
Last Answer : 5.18 l
Description : Which of the following commands is used to display the directory attributes rather than its contents? A. ls -l -d B. ls -l C. ls -x D. ls -F E. None of the above
Last Answer : A. ls -l -d
Description : Which command is used to change protection mode of files starting with the string emp and ending with 1,2, or 3? A. chmod u+x emp[l-3] B. chmod 777 emp* C. chmod u+r ??? emp D. chmod 222 emp? E. None of the above
Last Answer : A. chmod u+x emp[l-3]
Description : What is the output when we execute list(“hello”)? a) [‘h’, ‘e’, ‘l’, ‘l’, ‘o’]. b) [‘hello’]. c) [‘llo’]. d) [‘olleh’].
Last Answer : a) [‘h’, ‘e’, ‘l’, ‘l’, ‘o’].
Description : For every context free grammar (G) there exists an algorithm that passes any w ∈ L(G) in number of steps proportional to (A) ln|w| (B) |w| (C) |w|2 (D) |w|3
Last Answer : (D) |w|3
Description : A data file of 1,00,000 characters contains only the characters g-l, with the frequencies as indicated in table: using the variable-length code by Huffman codes, the file can be encoded with (A) 2,52,000 bits (B) 2,64,000 bits (C) 2,46,000 bits (D) 2,24,000 bits
Last Answer : (D) 2,24,000 bits