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 not correct. (B) S1 is not correct and S2 is correct. (C) S1 is correct and S2 is not correct. (D) S1 is correct and S2 is correct.

Question

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 not correct. (B) S1 is not correct and S2 is correct. (C) S1 is correct and S2 is not correct. (D) S1 is correct and S2 is correct.

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 not correct.

(B) S1 is not correct and S2 is correct.

(C) S1 is correct and S2 is not correct.

(D) S1 is correct and S2 is correct.

asked Feb 9, 2021 by anonymous

1 Answer

Related questions

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, substitution and homomorphism. Which of the following is correct statement? (A) Both s1 and s2 are correct. (B) s1 is correct and s2 is not correct. (C) s1 is not correct and s2 is correct. (D) Both s1 and s2 are not correct.

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.

Which is the correct statement(s) for Non Recursive predictive parser? S1: First(α) = {t | α => * t β for some string β } => *tβ S2: Follow(X) = { a | S => * αXa β for some strings α and β } (A) Both statements S1 and S2 are incorrect. (B) S1 is incorrect and S2 is correct. (C) S1 is correct and S2 is incorrect. (D) Both statements S1 and S2 are correct.

Description : Which is the correct statement(s) for Non Recursive predictive parser? S1: First(α) = {t | α => * t β for some string β } => *tβ S2: Follow(X) = { a | S => * αXa β for some strings ... and S2 is correct. (C) S1 is correct and S2 is incorrect. (D) Both statements S1 and S2 are correct.

Last Answer : (D) Both statements S1 and S2 are correct.

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 of recursively enumerable languages is closed under union. (4) The families of recursively enumerable and recursive languages are closed under reversal.

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.

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 correct and S2 is not correct. (B) S1 is not correct and S2 is correct. (C) S1 is correct and S2 is not correct. (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.

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 the parser. S2 : LR grammar is a larger sub-class of context free grammar as compared to that SLR and LALR grammars. Which of the following is true ? (A) S1 is not correct and S2 is not correct. (B) S1 is not correct and S2 is correct. (C) S1 is correct and S2 is not correct. (D) S1 is correct and S2 is correct.

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.

Given the following statements: S1 : The grammars S→asb | bsa | ss | a and S→asb | bsa | a are not equivalent. S2: The grammars S→ss | sss | asb | bsa | λ and S→ss | asb | bsa | λ are equivalent. Which of the following is true? (A) S1 is correct and S2 is not correct. (B) Both S1 and S2 are correct (C) S1 is not correct and S2 is correct (D) Both S1 and S2 are not correct.

Description : Given the following statements: S1 : The grammars S→asb | bsa | ss | a and S→asb | bsa | a are not equivalent. S2: The grammars S→ss | sss | asb | bsa | λ and S→ss | asb | bsa | λ are equivalent. ... and S2 are correct (C) S1 is not correct and S2 is correct (D) Both S1 and S2 are not correct.

Last Answer : (A) S1 is correct and S2 is not correct.

Given the following two statements: S1: If L1 and L2 are recursively enumerable languages over ∑, then L1⋃L2 and L1⋂L2 are also recursively enumerable. S2: The set of recursively enumerable languages is countable. Which of the following is correct? (A) S1 is correct and S2 is not correct (B) S1 is not correct and S2 is correct (C) Both S1 and S2 are not correct (D) Both S1 and S2 are correct

Description : Given the following two statements: S1: If L1 and L2 are recursively enumerable languages over ∑, then L1⋃L2 and L1⋂L2 are also recursively enumerable. S2: The set of recursively enumerable languages is countable. ... correct (C) Both S1 and S2 are not correct (D) Both S1 and S2 are correct

Last Answer : (D) Both S1 and S2 are correct

If = = in the system of equations a 1 x + b 1 y + c 1 = 0 and a 2 x + b 2 y + c 2 = 0 Statement 1 : This is the condition for inconsistent equations Statement 2 : There exists infinitely many solutions Statement 3 : The equations satisfying the condition are parallel Which of the above statements are true ? e) S1 only f) S1 and S2 g) S1 and S3 h) S2 only Answer: (d) S2 o

Description : If = = in the system of equations a 1 x + b 1 y + c 1 = 0 and a 2 x + b 2 y + c 2 = 0 Statement 1 : This is the condition for inconsistent equations Statement 2 : There exists infinitely many solutions ... statements are true ? e) S1 only f) S1 and S2 g) S1 and S3 h) S2 only Answer: (d) S2 o

Last Answer : h) S2 only

If = = in the system of equations a 1 x + b 1 y + c 1 = 0 and a 2 x + b 2 y + c 2 = 0 Statement 1 : This is the condition for inconsistent equations Statement 2 : There exists infinitely many solutions Statement 3 : The equations satisfying the condition are parallel Which of the above statements are true ? a) S1 only b) S1 and S2 c) S1 and S3 d) S2 only

Description : If = = in the system of equations a 1 x + b 1 y + c 1 = 0 and a 2 x + b 2 y + c 2 = 0 Statement 1 : This is the condition for inconsistent equations Statement 2 : There exists infinitely many ... parallel Which of the above statements are true ? a) S1 only b) S1 and S2 c) S1 and S3 d) S2 only

Last Answer : d) S2 only

Given the following statements : S1 : The subgraph-isomorphism problem takes two graphs G1 and G2 and asks whether G1 is a subgraph of G2. S2 : The set-partition problem takes as input a set S of numbers and asks whether the numbers can be partitioned into two sets A Image Which of the following is true ? (A) S1 is NP problem and S2 is P problem. (B) S1 is NP problem and S2 is NP problem. (C) S1 is P problem and S2 is P problem. (D) S1 is P problem and S2 is NP problem.

Description : Given the following statements : S1 : The subgraph-isomorphism problem takes two graphs G1 and G2 and asks whether G1 is a subgraph of G2. S2 : The set-partition problem takes as input a set S of numbers and ... S1 is P problem and S2 is P problem. (D) S1 is P problem and S2 is NP problem.

Last Answer : (B) S1 is NP problem and S2 is NP problem.

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 value, the other problem has no feasible solution S3: If either the primal or dual problem has a finite optimal solution, the other one also possesses the same, and the optimal value of the objective functions of the two problems are equal. Which of the following is true? (A) S1 and S2 (B) S1 and S3 (B) S2 and S3 (D) S1, S2 and S2

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

Consider the following statements for priority queue: S1: It is a data structure in which the intrinsic ordering of the elements does determine the result of its basic operations. S2: The elements of a priority queue may be complex structures that are ordered on one or several fields. Which of the following is correct? (A) Both S1 and S2 are incorrect. (B) S1 is correct and S2 is incorrect. (C) SI is incorrect and S2 is correct. (D) Both S1 and S2 are correct.

Description : Consider the following statements for priority queue: S1: It is a data structure in which the intrinsic ordering of the elements does determine the result of its basic operations. S2: The elements of a priority queue ... . (C) SI is incorrect and S2 is correct. (D) Both S1 and S2 are correct.

Last Answer : (D) Both S1 and S2 are correct.

Consider the following statements : S1: A queue can be implemented using two stacks. S2: A stack can be implemented using two queues. Which of the following is correct ? (A) S1 is correct and S2 is not correct. (B) S1 is not correct and S2 is correct. (C) Both S1 and S2 are correct. (D) Both S1 and S2 are not correct.

Description : Consider the following statements : S1: A queue can be implemented using two stacks. S2: A stack can be implemented using two queues. Which of the following is correct ? (A) S1 is correct and S2 is not correct. ( ... S2 is correct. (C) Both S1 and S2 are correct. (D) Both S1 and S2 are not correct.

Last Answer : (C) Both S1 and S2 are correct.

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 element (s2) if δ(q, λ, b) is not empty then δ(q, c, b) must be empty for every c ∈ Σ (A) only s1 (B) only s2 (C) both s1 and s2 (D) neither s1 nor s2

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

Consider the following statements S1 and S2 : S1 : A hard handover is one in which the channel in the source cell is retained and used for a while in parallel with the channel in the target cell. S2 : A soft handover is one in which the channel in the source cell is released and only then the channel in the target cell is engaged. (A) S1 is true and S2 is not true. (B) S1 is not true and S2 is true. (C) Both S1 and S2 are true. (D) Both S1 and S2 are not true.

Description : Consider the following statements S1 and S2 : S1 : A hard handover is one in which the channel in the source cell is retained and used for a while in parallel with the channel in the target cell. S2 : A soft handover ... and S2 is true. (C) Both S1 and S2 are true. (D) Both S1 and S2 are not true.

Last Answer : (D) Both S1 and S2 are not true.

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

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

Consider following schedules involving two transactions: S1: r1(X); r1(Y); r2(X); r2(Y); w2(Y); w1(X) S2: r1(X); r2(X); r2(Y); w2(Y); r1(Y); w1(X) Which of the following statement is true? (1) Both S1 and S2 are conflict serializable. (2) S1 is conflict serializable and S2 is not conflict serializable. (3) S1 is not conflict serializable and S2 is conflict serializable. (4) Both S1 and S2 are not conflict serializable.

Description : Consider following schedules involving two transactions: S1: r1(X); r1(Y); r2(X); r2(Y); w2(Y); w1(X) S2: r1(X); r2(X); r2(Y); w2(Y); r1(Y); w1(X) Which of the following ... . (3) S1 is not conflict serializable and S2 is conflict serializable. (4) Both S1 and S2 are not conflict serializable.

Last Answer : S1 is not conflict serializable and S2 is conflict serializable.

Which of the following statement(s) is/are true with respect to software architecture? S1: Coupling is a measure of how well the things grouped together in a module belong together logically. S2: Cohesion is a measure of the degree of interaction between software modules. S3: If coupling is low and cohesion is high then it is easier to change one module without affecting others. (1) Only S1 and S2 (2) Only S3 (3) All of S1, S2 and S3 (4) Only S1

Description : Which of the following statement(s) is/are true with respect to software architecture? S1: Coupling is a measure of how well the things grouped together in a module belong together logically. S2: Cohesion is a measure of the ... ) Only S1 and S2 (2) Only S3 (3) All of S1, S2 and S3 (4) Only S1

Last Answer : Answer: 2

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 options is correct? (1) Both (A) and (B) are false. (2) Both (A) and (B) are true. (3) (A) is true, (B) is false. (4) (A) is false, (B) is true.

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.

The symmetric difference of two sets S1 and S2 is defined as S1ΘS2 = {x|xϵS1 or xϵS2, but x is not in both S1 and S2} The nor of two languages is defined as nor (L1,L2) = {w|w ∉ L1 and w|w ∉ L2} Which of the following is correct? (A) The family of regular languages is closed under symmetric difference but not closed under nor. (B) The family of regular languages is closed under nor but not closed under symmetric difference. (C) The family of regular languages are closed under both symmetric difference and nor. (D) The family of regular languages are not closed under both symmetric difference and nor.

Description : The symmetric difference of two sets S1 and S2 is defined as S1ΘS2 = {x|xϵS1 or xϵS2, but x is not in both S1 and S2} The nor of two languages is defined as nor (L1,L2) = ... symmetric difference and nor. (D) The family of regular languages are not closed under both symmetric difference and nor.

Last Answer : (C) The family of regular languages are closed under both symmetric difference and nor.

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 finite-state machine. Which of the above statement(s) is/are correct? (1) Only l (2) Only ll (3) Both I and II (4) Neither I nor Il

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

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|λ

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|λ

Given the following Series S1 and S2: Write the command to find the sum of series S1 and S2 -Technology

Description : Given the following Series S1 and S2: Write the command to find the sum of series S1 and S2 -Technology

Last Answer : print(S1+S2)

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 not context free language. (2) Both L1 and L2 are context free language. (3) L1 is context free language, L2 is not context free language. (4) L1 is not context free language, L2 is context free language.

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.

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

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

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

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

A context free grammar for L={w|n0(w)>n1(w)} is given by: (A) S→0|0S|1SS (B) S→0S|1S|0SS|1SS|0|1 (C) S→0|0S|1SS|S1S|SS1 (D) S→0S|1S|0|1

Description : A context free grammar for L={w|n0(w)>n1(w)} is given by: (A) S→0|0S|1SS (B) S→0S|1S|0SS|1SS|0|1 (C) S→0|0S|1SS|S1S|SS1 (D) S→0S|1S|0|1

Last Answer : (C) S→0|0S|1SS|S1S|SS1

Which of the following statements is true? (1) The sentence S is a logical consequence of S1,..., Sn if and only if S1˄S2˄........˄Sn→S is satisfiable. (2) The sentence S is a logical consequence of S1,..., Sn if and only if S1˄S2˄........˄Sn→S is valid. (3) The sentence S is a logical consequence of S1,..., Sn if and only if S1˄S2˄........˄Sn˄¬S is consistent. (4) The sentence S is a logical consequence of S1,..., Sn if and only if S1˄S2˄........˄Sn˄S is inconsistent.

Description : Which of the following statements is true? (1) The sentence S is a logical consequence of S1,..., Sn if and only if S1˄S2˄........˄Sn→S is satisfiable. (2) The sentence S is a logical consequence of ... S is a logical consequence of S1,..., Sn if and only if S1˄S2˄........˄Sn˄S is inconsistent.

Last Answer : The sentence S is a logical consequence of S1,..., Sn if and only if S1˄S2˄........˄Sn→S is valid.

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 in the database. II. E-R diagrams are useful to logically model concepts. III. An update anomaly is when it is not possible to store information unless some other, unrelated information is stored as well. IV. SQL is a procedural language. (A) I and IV only (B) III and IV only (C) I, II and III only (D) II, III and IV only

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

If coils 'R1-R2-R3' at the receiver of figure 'B' shown in the illustration turned opposite of those in the transmitter by design, what corrective action should be taken? EL-0092 A. Reverse the 60 Hz supply connections to 'S1' and 'S2'. B. No action is needed. C. Interchange leads 'R1' and 'R3'. D. Interchange leads 'R2' and 'R3'.

Description : If coils 'R1-R2-R3' at the receiver of figure 'B' shown in the illustration turned opposite of those in the transmitter by design, what corrective action should be taken? EL-0092 A. Reverse the 60 Hz supply ... is needed. C. Interchange leads 'R1' and 'R3'. D. Interchange leads 'R2' and 'R3'.

Last Answer : Answer: B

The direction of rotation of the winch shown in the illustration is changed by reversing the _____________. EL-0102 A. direction of current through the shunt field B. polarity of voltage at 'S1' and 'S2' C. direction of current through the armature D. polarity of voltage at 'L1' and 'L2'

Description : The direction of rotation of the winch shown in the illustration is changed by reversing the _____________. EL-0102 A. direction of current through the shunt field B. polarity of voltage at 'S1' and 'S2' C. direction of current through the armature D. polarity of voltage at 'L1' and 'L2'

Last Answer : Answer: C

If coils 'R1-R2-R3' at the receiver of figure 'B' shown in the illustration were in 180 degree error with those of the transmitter, what corrective action should be taken? EL-0092 A. Reverse the 60 Hz connections to 'S1' and 'S2'. B. No action is needed as this is proper operation. C. Interchange leads 'R1' and 'R3'. D. Interchange leads 'R2' and 'R3'.

Description : If coils 'R1-R2-R3' at the receiver of figure 'B' shown in the illustration were in 180 degree error with those of the transmitter, what corrective action should be taken? EL-0092 A. Reverse the 60 Hz ... is proper operation. C. Interchange leads 'R1' and 'R3'. D. Interchange leads 'R2' and 'R3'.

Last Answer : Answer: A

If coil 'R1-R2' at the receiver of figure 'A' shown in the illustration were in 180 degree error with respect to that of the transmitter, what corrective action should be taken? EL-0092 A. No action is necessary as this is proper operation. B. Reverse the 60 Hz supply connections at 'R1' and 'R2'. C. Interchange connections 'S1' and 'S2'. D. Interchange connections 'S1' and 'S3'.

Description : If coil 'R1-R2' at the receiver of figure 'A' shown in the illustration were in 180 degree error with respect to that of the transmitter, what corrective action should be taken? EL-0092 A. No action is ... and 'R2'. C. Interchange connections 'S1' and 'S2'. D. Interchange connections 'S1' and 'S3'.

Last Answer : Answer: B

If coils 'R1-R2-R3' at the receiver of figure 'B' shown in the illustration turned opposite of those in the transmitter, what corrective action should be taken to have both turn in the same direction? EL-0092 A. Reverse the 60 Hz supply connections to 'S1' and 'S2'. B. No action is needed. C. Interchange leads 'R1' and 'R3'. D. Interchange leads 'R2' and 'R3'.

Description : If coils 'R1-R2-R3' at the receiver of figure 'B' shown in the illustration turned opposite of those in the transmitter, what corrective action should be taken to have both turn in the same direction? EL-0092 A ... is needed. C. Interchange leads 'R1' and 'R3'. D. Interchange leads 'R2' and 'R3'.

Last Answer : Answer: C

If coil 'R1-R2' at the receiver of figure 'A' shown in the illustration turned opposite of that in the transmitter, what corrective action should be taken? EL-0092 A. No action is necessary as this is normal operation. B. Reverse 60 Hz supply connections to 'R1' and 'R2'. C. Interchange connections to 'S1' and 'S2'. D. Interchange connections to 'S1' and 'S3'.

Description : If coil 'R1-R2' at the receiver of figure 'A' shown in the illustration turned opposite of that in the transmitter, what corrective action should be taken? EL-0092 A. No action is necessary as this is ... . C. Interchange connections to 'S1' and 'S2'. D. Interchange connections to 'S1' and 'S3'.

Last Answer : Answer: D

If coil 'R1-R2' on the transmitter in figure 'A' shown in the illustration is turned 30 degrees clockwise, corresponding coil 'R1-R2' on the receiver should ____________. EL-0092 A. make coils 'S1-S2-S3' turn faster because of induced currents B. ring at the receiving station until the turning stops C. receive a higher voltage depending on the turns ratio D. align itself to the same position if free to move

Description : If coil 'R1-R2' on the transmitter in figure 'A' shown in the illustration is turned 30 degrees clockwise, corresponding coil 'R1-R2' on the receiver should ____________. EL-0092 A. make coils 'S1 ... a higher voltage depending on the turns ratio D. align itself to the same position if free to move

Last Answer : Answer: D

Derivation of Thiem's formula Q = 2 (s1 - s2)/2.3 log10 (r2/r1) is based on the assumption (A) The aquifer is homogeneous, isotropic and of infinite depth and area (B) The well is sunk through the full depth of the aquifer (C) The flow lines are radial and horizontal, and the flow is laminar (D) All the above

Description : Derivation of Thiem's formula Q = 2 (s1 - s2)/2.3 log10 (r2/r1) is based on the assumption (A) The aquifer is homogeneous, isotropic and of infinite depth and area (B) The well is sunk ... (C) The flow lines are radial and horizontal, and the flow is laminar (D) All the above

Last Answer : (D) All the above

S1 and S2 are the draw downs in an observation well at times t1 and t2 after pumping. For discharge Q and coefficient of transmissibility T, the relationship, is (A) S2 - S1 = (2.3Q/ ) log10 (t2/t1) (B) S2 - S1 = (2.3Q/4 ) log10 (t2/t1) (C) S2 - S1 = (2.3Q/4 ) loge (t2/t1) (D) S2 - S1 = (2.3Q/4 ) loge (t1/t2

Description : S1 and S2 are the draw downs in an observation well at times t1 and t2 after pumping. For discharge Q and coefficient of transmissibility T, the relationship, is (A) S2 - S1 = (2.3Q/ ) log10 (t2/t1) (B) S2 - S1 ... - S1 = (2.3Q/4 ) loge (t2/t1) (D) S2 - S1 = (2.3Q/4 ) loge (t1/t2

Last Answer : (B) S2 - S1 = (2.3Q/4 ) log10 (t2/t1)

the derivation of Thiem's formula, Q = (S1 - S2)/[2.3 log10( / )] the following assumption is not applicable (A) The aquifer is homogeneous and isotropic (B) Flow lines are radial and horizontal (C) The slope of the water surface is too small (D) The well has been sunk up to the surface of the unconfined aquifer

Description : the derivation of Thiem's formula, Q = (S1 - S2)/[2.3 log10( / )] the following assumption is not applicable (A) The aquifer is homogeneous and isotropic (B) Flow lines are radial and ... the water surface is too small (D) The well has been sunk up to the surface of the unconfined aquifer

Last Answer : Answer: Option D

With the inputs shown below, what will be the output of S1, S2, and C2?

Description : With the inputs shown below, what will be the output of S1, S2, and C2?

Last Answer : MSD of the sum.

S1 : A man who possesses a strong will and firm determination finds all difficulties solved. S2 : _________________________________ S3 : _________________________________ S4 : _________________________________ S5 : It is therefore, the man who labours hard with a strong resolution and an unshaken will, who achieves success and makes his fortune. P : Such a man goes on working hard and even if he fails he is never downcast. Q : In turn failures make him all the more determined and resolute and he persists in his task till he attains the desired success. R : To him there are a thousand ways open to steer clear of all dangers and difficulties

Description : S1 : A man who possesses a strong will and firm determination finds all difficulties solved. S2 : _________________________________ S3 : _________________________________ S4 : _________________________________ S5 : It ... there are a thousand ways open to steer clear of all dangers and difficulties

Last Answer : (1) RPQ

32 With S2 closed and S1 open, the current waveform in the delta winding will be [GATE 2009] A. a sinusoidal at fundamental frequency B. flat-topped with third harmonic C. only third-harmonic D. none of these

Description : 32 With S2 closed and S1 open, the current waveform in the delta winding will be [GATE 2009] A. a sinusoidal at fundamental frequency B. flat-topped with third harmonic C. only third-harmonic D. none of these

Last Answer : C. Only third harmonic

[31] With both S1 and S2 open, the core flux waveform will be [GATE 2009] A. a sinusoidal at fundamental frequency B. flat-topped with third harmonic C. peaky with third-harmonic D. none of these

Description : [31] With both S1 and S2 open, the core flux waveform will be [GATE 2009] A. a sinusoidal at fundamental frequency B. flat-topped with third harmonic C. peaky with third-harmonic D. none of these

Last Answer : B. Flat topped with third harmonic

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

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

If S1 is total number of modules defined in the program architecture, S3 is the number of modules whose correct function depends on prior processing then the number of modules not dependent on prior processing is: (A) 1 + S3/S1 (B) 1 - S3/S1 (C) 1 + S1/S3 (D) 1 - S1/S3

Description : If S1 is total number of modules defined in the program architecture, S3 is the number of modules whose correct function depends on prior processing then the number of modules not dependent on prior processing is: (A) 1 + S3/S1 (B) 1 - S3/S1 (C) 1 + S1/S3 (D) 1 - S1/S3

Last Answer : (B) 1 - S3/S1

............... is often used to prove the correctness of a recursive function. (A) Diagonalization (B) Communitivity (C) Mathematical Induction (D) Matrix Multiplication

Description : ............... is often used to prove the correctness of a recursive function. (A) Diagonalization (B) Communitivity (C) Mathematical Induction (D) Matrix Multiplication

Last Answer : (C) Mathematical Induction

In general, in a recursive and non-recursive implementation of a problem (program): (A) Both time and space complexities are better in recursive than in nonrecursive program (B) Both time and space complexities are better in non-recursive than in recursive program (C) Time complexity is better in recursive version but space complexity is better in non-recursive version of the program (D) Space complexity is better in recursive version but time complexity is better in non-recursive version of the program

Description : In general, in a recursive and non-recursive implementation of a problem (program): (A) Both time and space complexities are better in recursive than in nonrecursive program (B) Both time and ... is better in recursive version but time complexity is better in non-recursive version of the program

Last Answer : Answer: B

A recursive function h, is defined as follows: h(m)=k, if m=0 = 1, if m=1 = 2h(m-1) + 4h(m-2), if m≥2 If the value of h(4) is 88 then the value of k is: (1) 0 (2) 1 (3) 2 (4) -1

Description : A recursive function h, is defined as follows: h(m)=k, if m=0 = 1, if m=1 = 2h(m-1) + 4h(m-2), if m≥2 If the value of h(4) is 88 then the value of k is: (1) 0 (2) 1 (3) 2 (4) -1

Last Answer : (3) 2

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

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:

Given the following statements: (a) To implement Abstract Data Type, a programming language require a syntactic unit to encapsulate type definition. (b) To implement ADT, a programming language requires some primitive operations that are built in the language processor. (c) C++, Ada, Java 5.0, C#2005 provide support for parameterised ADT. Which one of the following options is correct? (A) (a), (b) and (c) are false. (B) (a) and (b) are true; (c) are false. (C) (a) is true; (b) and (c) are false. (D) (a), (b) and (c) are true.

Description : Given the following statements: (a) To implement Abstract Data Type, a programming language require a syntactic unit to encapsulate type definition. (b) To implement ADT, a programming language requires some primitive operations that are ... (b) and (c) are false. (D) (a), (b) and (c) are true.

Last Answer : (D) (a), (b) and (c) are true.

anonymous · Answer 1 · 2021-02-09T11:28:51+0000

Answer :

(D) S1 is correct and S2 is correct.

answered Feb 9, 2021 by anonymous

Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

Answer :

Please log in or register to add a comment.

Related questions