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

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
by

1 Answer

Answer :

(C) both s1 and s2
by

Related questions

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.

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

A fuzzy set A on R is ................. iff A(λx1 + (1 – λ)x2) ≥ min [A(x1), A(x2)] for all x1, x2 ∈ R and all λ ∈ [0, 1], where min denotes the minimum operator. (A) Support (B) α-cut (C) Convex (D) Concave

Description : A fuzzy set A on R is ................. iff A(λx1 + (1 – λ)x2) ≥ min [A(x1), A(x2)] for all x1, x2 ∈ R and all λ ∈ [0, 1], where min denotes the minimum operator. (A) Support (B) α-cut (C) Convex (D) Concave 

Last Answer : (C) Convex 

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)=q0 δ(q3, a)=q2 ; δ(q3, b)=q1

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

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 turing machine. (3) Deterministic push down automata and non-deterministic pushdown automata. (4) Deterministic finite automata and Non-deterministic finite automata.

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.

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

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

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.

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.

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. 

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.

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

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.

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.

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.

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.

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 a Non-deterministic Finite Automation (NFA) with states p and r as initial and final states respectively transition table as given below Image The minimum number of states required in Deterministic Finite Automation (DFA) equivalent to NFA is (A) 5 (B) 4 (C) 3 (D) 2

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 

What is the specific weight of water at standard condition? (Formula: γ = ρg / k)  a. 1000 kgm/m3  b. 9.8066 m/s2  c. 1000 kgf/m3  d. None of the above

Description : What is the specific weight of water at standard condition? (Formula: γ = ρg / k)  a. 1000 kgm/m3  b. 9.8066 m/s2  c. 1000 kgf/m3  d. None of the above

Last Answer : 1000 kgf/m3

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

Consider the table Student(stuid, name, course, marks). Which one of the following two queries is correct to find the highest marks student in course 5? Q.1. Select S.stuid From student S Where not exists (select * from student e where e course='5' and e marks ≥ s marks) Q.2. Select S.stuid From student S Where s.marks > any (select distinct marks from student S where s.couse = 5) (A) Q.1 (B) Q.2 (C) Both Q.1 and Q.2 (D) Neither Q.1 nor Q.2

Description : Consider the table Student(stuid, name, course, marks). Which one of the following two queries is correct to find the highest marks student in course 5? Q.1. Select S.stuid From student S Where not exists (select * from student ... ) Q.1 (B) Q.2 (C) Both Q.1 and Q.2 (D) Neither Q.1 nor Q.2

Last Answer : (B) Q.2 Explanation: First query gives stuid of students whose marks are greater than all students taking course 5. Second query gives stuid of students whose marks are greater than any student taking ... comparison is between maximum of marks by any student in course 5. So the answer is option D.

The simplified function in product of sums of Boolean function F(W, X, Y, Z) = Σ(0, 1, 2, 5, 8, 9, 10) is (A) (W' + X') (Y' + Z') (X' + Z) (B) (W' + X') (Y' + Z') (X' + Z') (C) (W' + X') (Y' + Z) (X' + Z) (D) (W' + X') (Y + Z') (X' + Z)

Description : The simplified function in product of sums of Boolean function F(W, X, Y, Z) = Σ(0, 1, 2, 5, 8, 9, 10) is (A) (W' + X') (Y' + Z') (X' + Z) (B) (W' + X') (Y' + Z') (X' + Z') (C) (W' + X') (Y' + Z) (X' + Z) (D) (W' + X') (Y + Z') (X' + Z)

Last Answer : (A) (W' + X') (Y' + Z') (X' + Z)

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

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

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.

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.

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

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

A vertex cover of an undirected graph G(V, E) is a subset V1 ⊆ V vertices such that (A) Each pair of vertices in V1 is connected by an edge (B) If (u, v) ∈ E then u ∈ V1 and v ∈ V1 (C) If (u, v) ∈ E then u ∈ V1 or v ∈ V1 (D) All pairs of vertices in V1 are not connected by an edge

Description : A vertex cover of an undirected graph G(V, E) is a subset V1 ⊆ V vertices such that (A) Each pair of vertices in V1 is connected by an edge (B) If (u, v) ∈ E then u ∈ V1 and v ∈ V1 (C) If (u, v) ∈ E then u ∈ V1 or v ∈ V1 (D) All pairs of vertices in V1 are not connected by an edge

Last Answer : (C) If (u, v) ∈ E then u ∈ V1 or v ∈ V1

What are the final values of Q1 and Q0 after 4 clock cycles, if initial values are 00 in the sequential circuit shown below: Image (A) 11 (B) 10 (C) 01 (D) 00

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

After termination of the synthesis of RNA molecule, the core enzymes separate from the DNA template. The core enzymes then recognize a promoter at which the synthesis of a new RNA molecule commences, with the assistance of (A) Rho (ρ) factor (B) δ factor (C) β factor (D) σ factor

Description : After termination of the synthesis of RNA molecule, the core enzymes separate from the DNA template. The core enzymes then recognize a promoter at which the synthesis of a new RNA molecule commences, with the assistance of (A) Rho (ρ) factor (B) δ factor (C) β factor (D) σ factor

Last Answer : Answer : D

A system undergoes a change from a given initial state to a given final state either by an irreversible process or by a reversible process, then (where, Δ S1 and Δ SR are the entropy changes of the system for the irreversible and reversible processes respectively) (A) Δ S1is always < Δ SR (B) Δ S1is sometimes > Δ SR (C) Δ S1is always > Δ SR (D) Δ S1is always = Δ SR

Description : A system undergoes a change from a given initial state to a given final state either by an irreversible process or by a reversible process, then (where, Δ S1 and Δ SR are the entropy changes of the system for the ... S1is sometimes > Δ SR (C) Δ S1is always > Δ SR (D) Δ S1is always = Δ SR

Last Answer : (C) Δ S1is always > Δ SR

Which of the following statement(s) is/are TRUE with regard to software testing? I. Regression testing technique ensures that the software product runs correctly after the changes during maintenance. II. Equivalence partitioning is a white-box testing technique that divides the input domain of a program into classes of data from which test cases can be derived. (1) only I (2) only II (3) both I and II (4) neither I nor II

Description : Which of the following statement(s) is/are TRUE with regard to software testing? I. Regression testing technique ensures that the software product runs correctly after the changes during maintenance. II. Equivalence partitioning is a ... (1) only I (2) only II (3) both I and II (4) neither I nor II

Last Answer : (1) only I 

Which of the following statement(s) with regard to an abstract class in JAVA is/are TRUE? I. An abstract class is one that is not used to create objects. II. An abstract class is designed only to act as a base class to be inherited by other classes. (1) Only l (2) Only II (3) Neither I nor II (4) Both l and II

Description : Which of the following statement(s) with regard to an abstract class in JAVA is/are TRUE? I. An abstract class is one that is not used to create objects. II. An abstract class is designed only to act as a base class ... by other classes. (1) Only l (2) Only II (3) Neither I nor II (4) Both l and II

Last Answer : Both l and II

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. (1) Only I (2) Only II (3) Both I and II (4) Neither I nor Il

Description : 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 ... modules. (1) Only I (2) Only II (3) Both I and II (4) Neither I nor Il

Last Answer : Answer: 1

If the queue is implemented with a linked list, keeping track of a front pointer and a rear pointer, which of these pointers will change during an insertion into a non-empty queue? (A) Neither of the pointers change (B) Only front pointer changes (C) Only rear pointer changes (D) Both of the pointers changes

Description : If the queue is implemented with a linked list, keeping track of a front pointer and a rear pointer, which of these pointers will change during an insertion into a non-empty queue? (A) Neither of ... (B) Only front pointer changes (C) Only rear pointer changes (D) Both of the pointers changes

Last Answer : (C) Only rear pointer changes

The number of strings of length 4 that are generated by the regular expression (0|∈) 1+2* (3|∈), where | is an alternation character, {+, *} are quantification characters, and ∈ is the null string, is: (A) 08 (B) 10 (C) 11 (D) 12

Description : The number of strings of length 4 that are generated by the regular expression (0|∈) 1+2* (3|∈), where | is an alternation character, {+, *} are quantification characters, and ∈ is the null string, is: (A) 08 (B) 10 (C) 11 (D) 12

Last Answer : (D) 12

Let `S={x in R: x ge 0 and 2|(sqrt(x)-3|+sqrt(x)(sqrt(x)-6)+6=0}` then S (1) is an empty set (2) contains exactly one element (3) contains exact;y two

Description : Let `S={x in R: x ge 0 and 2|(sqrt(x)-3|+sqrt(x)(sqrt(x)-6)+6=0}` then S (1) is an empty set (2) contains exactly one element (3) contains exact;y two

Last Answer : Let `S={x in R: x ge 0 and 2|(sqrt(x)-3|+sqrt(x)(sqrt(x)-6)+6=0}` then S ... four elements C. is an empty set. D. contains exactly one elements

Let `S={x in R: x ge 0 and 2|(sqrt(x)-3|+sqrt(x)(sqrt(x)-6)+6=0}` then S (1) is an empty set (2) contains exactly one element (3) contains exact;y two

Description : Let `S={x in R: x ge 0 and 2|(sqrt(x)-3|+sqrt(x)(sqrt(x)-6)+6=0}` then S (1) is an empty set (2) contains exactly one element (3) contains exact;y two

Last Answer : Let `S={x in R: x ge 0 and 2|(sqrt(x)-3|+sqrt(x)(sqrt(x)-6)+6=0}` then S ... four elements C. is an empty set. D. contains exactly one elements

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

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

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

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

[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

Termination of the synthesis of the RNA molecule is signaled by a sequence in the template strand of the DNA molecule, a signal that is recognized by a termination protein, the (A) Rho (ρ) factor (B) σ factor (C) δ factor (D) ε factor

Description : Termination of the synthesis of the RNA molecule is signaled by a sequence in the template strand of the DNA molecule, a signal that is recognized by a termination protein, the (A) Rho (ρ) factor (B) σ factor (C) δ factor (D) ε factor

Last Answer : Answer : A

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.

Symbols for principal stresses are a. Firstly σ, τ & γ b. Secondly σ 1 , σ 2 & σ 3

Description : Symbols for principal stresses are a. Firstly σ, τ & γ b. Secondly σ 1 , σ 2 & σ 3

Last Answer : b. Secondly σ 1 , σ 2 & σ 3