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 : The dual of a Boolean expression is obtained by interchanging (A) Boolean sums and Boolean products (B) Boolean sums and Boolean products or interchanging 0's and 1's (C) Boolean sums and Boolean products and interchanging 0's & 1's (D) Interchanging 0's and 1's
Last Answer : (C) Boolean sums and Boolean products and interchanging 0's & 1's
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 : Could someone explain this Critical angle >sin^-1 (n1/n0) in words?
Last Answer : This Link gives a nice explanation. Let me know if you have any questions.
Description : Given the following statements : S1 : SLR uses follow information to guide reductions. In case of LR and LALR parsers, the look-aheads are associated with the items and they make use of the left context available to ... (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 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 : Computers normally solve problem by breaking them down into a series of yes-or-no decisions represented by 1s and 0s. What is the name of the logic that allows computers to assign numerical values that fail ... 0 and 1? a) Human logic b) Fuzzy logic c) Boolean logic d) Operational logic
Last Answer : b) Fuzzy logic
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 : If all the production rules have single non - terminal symbol on the left side, the grammar defined is : (A) context free grammar (B) context sensitive grammar (C) unrestricted grammar (D) phrase grammar
Last Answer : (A) context free grammar
Description : The language of all non-null strings of a’s can be defined by a context free grammar as follow : S→a S|S a| a The word a3 can be generated by ................ different trees. (A) Two (B) Three (C) Four (D) Five
Last Answer : (C) Four Explanation:
Description : When did Alan Turing prove that a machine capable of processing a stream 1s and 0s of would be capable of solving any problem.?
Last Answer : 1942
Description : Micro-program consists of a set of microinstructions which are strings of 0s and 1s. a) True b) False
Last Answer : Answer: a Explanation: The computer understands only binary language. So, the microprogram should have instructions which are in the form of 0s and 1s. Each output line of the micro-program corresponds to one control signal
Description : Complement the subtrahend by converting all annddall a. 1’s to 0’s b. 0’s to 1’s ce. Both d. None of these
Last Answer : ce. Both
Description : A computer system recognizes only: a) Software b) 0s and 1s c) Modem Signals d) ASCII e) None of These
Last Answer : b) 0s and 1s
Description : A microprogram written as string of 0's and 1's is a a. symbolic microinstruction b. binary microinstruction c. symbolic microprogram d. binary microprogram
Last Answer : b. binary microinstruction
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 : 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.
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 : Consider the formula in image processing RD = 1 - (1/CR) Where CR = n1/n2 CR is called as compression ratio n1 and n2 denotes the number of information carrying units in two datasets that represent ... . (A) Data Compression (B) Data Redundancy (C) Data Relation (D) Data Representation
Last Answer : (B) Data Redundancy
Description : Which of the following is used to determine the specificity of requirements ? (A) n1/n2 (B) n2/n1 (C) n1+n2 (D) n1–n2 Where n1 is the number of requirements for which all reviewers have identical interpretations, n2 is number of requirements in a specification.
Last Answer : (A) n1/n2
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 statements s1 and s2 are given as: s1: Context sensitive languages are closed under intersection, concatenation, substitution and inverse homomorphism. s2: Context free languages are closed under complementation, ... is not correct and s2 is correct. (D) Both s1 and s2 are not correct.
Last Answer : (B) s1 is correct and s2 is not correct.
Description : In quantum chemistry, a nodal surface: w) gives 99 percent contour surface for an orbital x) exists for a 1s orbital y) has quantum number l = 1 z) is an orbital surface on which the probability density is zero
Last Answer : ANSWER: Z -- IS AN ORBITAL SURFACE ON WHICH THE PROBABILITY DENSITY IS ZERO
Description : According to six-tenths-factor rule, if the cost of a given unit at one capacity is known, then the cost of similar unit with '' times the capacity of the first unit is approximately equal to __________ times the cost of the initial unit. (A) n (B) n0.6 (C) n0.4 (D) √n
Last Answer : (B) n0.6
Description : Which of the following is the most efficient to perform arithmetic operations on the numbers? (A) Sign-magnitude (B) 1’s complement (C) 2’s complement (D) 9’s complement
Last Answer : (C) 2’s complement
Description : Given a grammar : S1→Sc, S→SA|A, A→aSb|ab, there is a rightmost derivation S1=>Sc =>SAC=>SaSbc. Thus, SaSbc is a right sentential form, and its handle is (A) SaS (B) be (C) Sbe (D) aSb
Last Answer : (D) aSb
Description : Given the production rules of a grammar G1 as S1→AB | aaB A→a | Aa B→b and the production rules of a grammar G2 as S2→aS2bS2 | bS2aS2 | λ Which of the following is correct statement? ( ... G1 is not ambiguous and G2 is ambiguous. (D) G1 is not ambiguous and G2 is not ambiguous.
Last Answer : (B) G1 is ambiguous and G2 is ambiguous.
Description : Which of the following statement is not true? a) The union and concatenation of two context-free languages is context-free b) The reverse of a context-free language is context-free, but the ... it can be described by a regular grammar d) The intersection two context-free languages is context-free
Last Answer : d) The intersection two context-free languages is context-free
Description : Which of the following statement is not true? a) The union and concatenation of two context-free languages is context-free b) The reverse of a context-free language is context-free, but ... a regular language is always context-free e) The intersection two context-free languages is context-free
Last Answer : e) The intersection two context-free languages is context-free
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 : 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, ... in the input stream and Reduce step that applies a completed grammar rule to form a single tree.
Last Answer : (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.
Description : Which of the following is FALSE ? (A) The grammar S ⟶ aSb|bSa|SS|∈, where S is the only non-terminal symbol and ∈ is the null string, is ambiguous. (B) SLR is powerful than LALR. (C) An LL(1) parser is a top-down parser. (D) YACC tool is an LALR(1) parser generator.
Last Answer : (B) SLR is powerful than LALR.
Description : A context diagram is used A) as the first step in developing a detailed DFD of a system B) in systems analysis of very complex systems C) as an aid to system design D) as an aid to programmer
Last Answer : A) as the first step in developing a detailed DFD of a system
Description : A context diagram A) Describes the context of a system B) is a DFD which gives an overview of the system C) is a detailed description of a system D) is not used in drawing a detailed DFD
Last Answer : B) is a DFD which gives an overview of the system
Description : High level knowledge which relates to the use of sentences in different contexts and how the context affect the meaning of the sentences? (A) Morphological (B) Syntactic (C) Semantic (D) Pragmatic
Last Answer : (D) Pragmatic
Description : The family of context sensitive languages is ................. under union and ................. under reversal. (A) closed, not closed (B) not closed, not closed (C) closed, closed (D) not closed, closed
Last Answer : (C) closed, closed
Description : Which of the following statement(s) is/are FALSE in the context of Relational DBMS ? I. Views in a database system are important because they help with access control by allowing users to see only a particular subset of the data ... (B) III and IV only (C) I, II and III only (D) II, III and IV only
Last Answer : (D) II, III and IV only
Description : Consider three CPU intensive processes P1, P2, P3 which require 20, 10 and 30 units of time, arrive at times 1, 3 and 7 respectively. Suppose operating system is implementing Shortest Remaining Time first (preemptive scheduling) ... end of Ready queue are not counted). (A) 3 (B) 2 (C) 4 (D) 5
Last Answer : (A) 3
Description : Which of the following statements is false? (1) Every context-sensitive language is recursive. (2) The set of all languages that are not recursively enumerable is countable. (3) The family ... under union. (4) The families of recursively enumerable and recursive languages are closed under reversal.
Last Answer : The set of all languages that are not recursively enumerable is countable.
Description : The inverse Square Law is concerned with intensity of radiation using type D film of 200mm target to film distance, the exposure time was 0.25s. What would be the exposure for the same situation with 400mm target to film distance? M07********** A. 0.5s B. 1.0s C. 2.0s D. 0.25s E. 0.125s
Last Answer : B. 1.0s
Description : The coefficient of fluctuation of speed of Flywheel is given by 1. (N1-N2)/N 2. (N1+N2)/N 3. (N1-N2) x N
Last Answer : 1. (N1-N2)/N
Description : The Snell’s law is given by a) N1 sin θi = N2 sin θt b) N2 sin θi = N1 sin θt c) sin θi = sin θt d) N1 cos θi = N2 cos θt
Last Answer : a) N1 sin θi = N2 sin θt
Description : According to the Snell's law if an electromagnetic wave is incident in a medium (refractive index n1) on another medium (refractive index m2); (A) The angle of incidence is equal to the angle of refraction (B) The angle of ... r) is given by sin i (C) Both (a) and (b) (D) Neither (a) nor (b)
Last Answer : Answer: Option B
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 : 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 : How well do you know your Nike 6.0's?
Last Answer : Here’s a link to the pictures since it didnt work the way I wanted it to. http://img80.imageshack.us/img80/1021/p1010264j.jpg http://img686.imageshack.us/img686/5636/p1010269n.jpg
Description : Python: Replace all NaN elements in a Pandas DataFrame with 0s. -Web-Development
Last Answer : answer:
Description : How many 0s are there in 1 googol?
Last Answer : A googol = 10¹â°â° so there are 100 zeros.
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 : 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