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? (A) G1 is ambiguous and G2 is not ambiguous. (B) G1 is ambiguous and G2 is ambiguous. (C) G1 is not ambiguous and G2 is ambiguous. (D) G1 is not ambiguous and G2 is not ambiguous.

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?

(A) G1 is ambiguous and G2 is not ambiguous.

(B) G1 is ambiguous and G2 is ambiguous.

(C) G1 is not ambiguous and G2 is ambiguous.

(D) G1 is not ambiguous and G2 is not ambiguous.


by

1 Answer

Answer :

(B) G1 is ambiguous and G2 is ambiguous.
by

Related questions

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

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 

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) ≤ nb(v) where v is any prefix of w} (C) L = {w∈{a, b}* | na(w) ≠ nb(w) and na(v) ≥ nb(v) where v is any prefix of w} (D) L = {w∈{a, b}* | na(w) ≠ nb(w) and na(v) ≤ nb(v) where v is any prefix of w}

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} 

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

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 + aa + aaa) + a*bbbbb* + (a + b)*ab(a + b)* (D) (λ + a + aa + aaa)b* + a*bbbbb* + (a + b)*ba(a + b)*

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)*

The equivalent production rules corresponding to the production rules S→Sα1|Sα2|β1|β2 is (A) S→β1 | β2, A→α1A | α2A | λ (B) S→β1 | β2 | β1A | β2A, A→α1A | α2A (C) S→β1 | β2, A→α1A | α2A (D) S→β1 | β2 | β1A | β2A, A→α1A | α2A | λ

Description : The equivalent production rules corresponding to the production rules S→Sα1|Sα2|β1|β2 is (A) S→β1 | β2, A→α1A | α2A | λ (B) S→β1 | β2 | β1A | β2A,  A→α1A | α2A (C) S→β1 | β2, A→α1A | α2A (D) S→β1 | β2 | β1A | β2A,  A→α1A | α2A | λ

Last Answer : (D) S→β1 | β2 | β1A | β2A,  A→α1A | α2A | λ

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.

The correct sequence of phases of cell cycle is (a) G1 → S → G2 → M (b) M → G1 → G2 → S (c) G1 → G2 → S → M (d) S → G1 → G2 → M.

Description : The correct sequence of phases of cell cycle is (a) G1 → S → G2 → M (b) M → G1 → G2 → S (c) G1 → G2 → S → M (d) S → G1 → G2 → M.

Last Answer : (a) G1 → S → G2 → M

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

Events occurring during the G1, S, and G2 stages of interphase. -Biology

Description : Events occurring during the G1, S, and G2 stages of interphase. -Biology

Last Answer : answer:

In mammalian cell cycle, synthesis of DNA occurs during (A) S phase (B) G1 phase (C) Mitotic Phase (D) G2 phase

Description : In mammalian cell cycle, synthesis of DNA occurs during (A) S phase (B) G1 phase (C) Mitotic Phase (D) G2 phase

Last Answer : Answer : A

Most abundant Ig G subclass in the serum is (A) Ig G1 (B) Ig G2 (C) Ig G3 (D) Ig G4

Description : Most abundant Ig G subclass in the serum is (A) Ig G1 (B) Ig G2 (C) Ig G3 (D) Ig G4

Last Answer : Answer : A

DNA replication occur in which stage of cell division? (a) G1 phase (b) G2 phase (c) S phase (d) M phase

Description : DNA replication occur in which stage of cell division? (a) G1 phase (b) G2 phase (c) S phase (d) M phase

Last Answer : (c) S phase

In a somatic cell cycle, DNA synthesis takes place in (a) G1 phase (b) prophase of mitosis (c) S-phase (d) G2 phase.

Description : In a somatic cell cycle, DNA synthesis takes place in (a) G1 phase (b) prophase of mitosis (c) S-phase (d) G2 phase.

Last Answer : (c) S-phase

Which typical stage is known for DNA replication? (a) S-phase (b) G2-phase (c) metaphase (d) G1-phase

Description : Which typical stage is known for DNA replication? (a) S-phase (b) G2-phase (c) metaphase (d) G1-phase

Last Answer : (a) S-phase

In which stage of cell cycle, DNA replication occurs? (a) G1-phase (b) S-phase (c) G2-phase (d) M-phase

Description : In which stage of cell cycle, DNA replication occurs? (a) G1-phase (b) S-phase (c) G2-phase (d) M-phase

Last Answer : (b) S-phase

In the somatic cell cycle (a) in G1 phase DNA content is double the amount of DNA present in the original cell (b) DNA replication takes place in S phase (c) a short interphase is followed by a long mitotic phase (d) G2 phase follows mitotic phase.

Description : In the somatic cell cycle (a) in G1 phase DNA content is double the amount of DNA present in the original cell (b) DNA replication takes place in S phase (c) a short interphase is followed by a long mitotic phase (d) G2 phase follows mitotic phase.

Last Answer : (b) DNA replication takes place in S phase

During which phase(s) of cell cycle, amount of DNA in a cell remains at 4C level if the initial amount is denoted as 2C? (a) G0 and G1 (b) G1 and S (c) Only G2 (d) G2 and M

Description : During which phase(s) of cell cycle, amount of DNA in a cell remains at 4C level if the initial amount is denoted as 2C? (a) G0 and G1 (b) G1 and S (c) Only G2 (d) G2 and M

Last Answer : (c) Only G2

When cell has stalled DNA replication fork, which checkpoint should be predominantly activated? (a) G1/S (b) G2/M (c) M (d) Both G2/M and M

Description : When cell has stalled DNA replication fork, which checkpoint should be predominantly activated? (a) G1/S (b) G2/M (c) M (d) Both G2/M and M

Last Answer : b) G2/M

During cell growth, DNA synthesis takes place on (a) S-phase (b) G1-phase (c) G2-phase (d) M phase.

Description : During cell growth, DNA synthesis takes place on (a) S-phase (b) G1-phase (c) G2-phase (d) M phase.

Last Answer : (a) S-phase

Some dividing cells exit the cell cycle and enter vegetative inactive stage. This is called quiescent stage (G0). This process occurs at the end of (a) M phase (b) G1 phase (c) S phase (d) G2 phase.

Description : Some dividing cells exit the cell cycle and enter vegetative inactive stage. This is called quiescent stage (G0). This process occurs at the end of (a) M phase (b) G1 phase (c) S phase (d) G2 phase.

Last Answer : (b) G1 phase

The maximum distance of the apex of a vertical curve of length L from the point of intersection of two grades + g1%, and - g2% (g1 > g2), is (A) L(g - g (B) L(g - g (C) L(g g (D) L(g - g

Description : The maximum distance of the apex of a vertical curve of length L from the point of intersection of two grades + g1%, and - g2% (g1 > g2), is (A) L(g - g (B) L(g - g (C) L(g g (D) L(g - g

Last Answer : Answer: Option C

During which phase of the cell cycle are normal components of the cell synthesized and assembled? a) the M phase b) the G1 phase c) the S phase d) the G2 phase

Description : During which phase of the cell cycle are normal components of the cell synthesized and assembled? a) the M phase b) the G1 phase c) the S phase d) the G2 phase

Last Answer : ANSWER: B -- THE G1 PHASE 

Two synchronous generators G1, G2 are operating in parallel and are equally sharing KVAR (Lag) component

Description : Two synchronous generators G1, G2 are operating in parallel and are equally sharing KVAR (Lag) component of load. To shift part of KVAR from G2 to G1, while keeping terminal voltage fixed, the following action must be done

Last Answer : Two synchronous generators G1, G2 are operating in parallel and are equally sharing KVAR (Lag) component of load. To shift part of KVAR from G2 to G1, while keeping terminal voltage fixed, the following action must be done Raise If1 and lower If2

Three elements having conductance G1 , G2 and G3 are connected in parallel. Their combined conductance will be

Last Answer : Three elements having conductance G1 , G2 and G3 are connected in parallel. Their combined conductance will be  G1 + G2 +G3

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

The one guideline to be followed while designing the database is A) A database design may be ambiguous. B) Unrelated data should be in the same table so that updating the data will be easy. C) It should avoid/reduce the redundancy. D) An entity should not have attributes.

Description : The one guideline to be followed while designing the database is A) A database design may be ambiguous. B) Unrelated data should be in the same table so that updating the data will be easy. C) It should avoid/reduce the redundancy. D) An entity should not have attributes.

Last Answer : C) It should avoid/reduce the redundancy.

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 

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

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

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 

The violation of the rules of a disjunctive syllogism commits the fallacy of ________. A) Illicit major B) Illicit minor C) Improper disjunction D) Ambiguous major

Description : The violation of the rules of a disjunctive syllogism commits the fallacy of ________. A) Illicit major B) Illicit minor C) Improper disjunction D) Ambiguous major

Last Answer : C) Improper disjunction

Identify the correct statement with regard to G1 phase (Gap 1) of interphase. (a) DNA synthesis or replication takes place. (b) Reorganisation of all cell components takes place. (c) Cell is metabolically active, grows but does not replicate its DNA. (d) Nuclear division takes place.

Description : Identify the correct statement with regard to G1 phase (Gap 1) of interphase. (a) DNA synthesis or replication takes place. (b) Reorganisation of all cell components takes place. (c) Cell is metabolically active, grows but does not replicate its DNA. (d) Nuclear division takes place.

Last Answer : (c) Cell is metabolically active, grows but does not

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

Shift-Reduce parsers perform the following : (A) Shift step that advances in the input stream by K(K>1) symbols and Reduce step that applies a completed grammar rule to some recent parse trees, joining them together as one tree with a new root symbol. (B) Shift step that advances in the input stream by one symbol and Reduce step that applies a completed grammar rule to some recent parse trees, joining them together as one tree with a new root symbol. (C) Shift step that advances in the input stream by K(K = 2) symbols and Reduce step that applies a completed grammar rule to form a single tree. (D) Shift step that does not advance in the input stream and Reduce step that applies a completed grammar rule to form a single tree.

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.

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 below are three basic rules: I. Squash and Stretch II. Slow-in and Slow-out III. To stage the action properly These rules are applied in case of (A) Rendering (B) Morphing (C) Animation (D) All the above

Description : Given below are three basic rules: I. Squash and Stretch II. Slow-in and Slow-out III. To stage the action properly These rules are applied in case of (A) Rendering (B) Morphing (C) Animation (D) All the above

Last Answer : (C) Animation

Select the correct option. Column I Column II A. Synapsis aligns (i) Anaphase II homologous chromosomes B. Synthesis of (ii) Zygotene RNA and protein C. Action of enzyme (iii)G2-phase recombinase D. Centromeres do (iv) Anaphase I not separate but chromatids move towards opposite poles (v) Pachytene (a) A-(i), B-(ii), C-(v), D-(iv) (b) A-(ii), B-(iii), C-(iv), D-(v) (c) A-(ii), B-(i), C-(iii), D-(iv) (d) A-(ii), B-(iii), C-(v), D-(iv)

Description : Select the correct option. Column I Column II A. Synapsis aligns (i) Anaphase II homologous chromosomes B. Synthesis of (ii) Zygotene RNA and protein C. Action of enzyme (iii)G2-phase recombinase D. Centromeres do (iv) Anaphase I not ... ), C-(iii), D-(iv) (d) A-(ii), B-(iii), C-(v), D-(iv)

Last Answer : (d) A-(ii), B-(iii), C-(v), D-(iv)

Which of the following will not hamper effective communication in the class? Options: A) A An ambiguous statement B) A lengthy statement C) A precise statement D) A statement which allows the listener to draw his own conclusions

Description : Which of the following will not hamper effective communication in the class? Options: A) A An ambiguous statement B) A lengthy statement C) A precise statement D) A statement which allows the listener to draw his own conclusions

Last Answer : C) A precise statement 

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.

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. 

Electric field of an infinitely long conductor of charge density λ, is given by E = λ/(2πεh).aN. State True/False. a) True b) False

Description : Electric field of an infinitely long conductor of charge density λ, is given by E = λ/(2πεh).aN. State True/False. a) True b) False

Last Answer : a) True

The potential of a uniformly charged line with density λ is given by, λ/(2πε) ln(b/a). State True/False. a) True b) False

Description : The potential of a uniformly charged line with density λ is given by, λ/(2πε) ln(b/a). State True/False. a) True b) False

Last Answer : a) True

The condition of diffraction from a crystal is given by (A) nλ = 2d Sin θ (B) λ = d Sin 2θ (C) λ = 2d Sin 2θ (D) nλ = d Sin θ

Description : The condition of diffraction from a crystal is given by (A) nλ = 2d Sin θ (B) λ = d Sin 2θ (C) λ = 2d Sin 2θ (D) nλ = d Sin θ

Last Answer : (A) nλ = 2d Sin θ

Resolving power of grating is given by A. λ/2 B. λ/dλ C. dλ/λ D. none of these

Description : Resolving power of grating is given by A. λ/2 B. λ/dλ C. dλ/λ D. none of these

Last Answer : B. λ/dλ

The line through the points (4, 3) and (2, 5) cuts off intercepts of lengths λ and μ on the axes. Which one of the following is correct ? -Maths 9th

Description : The line through the points (4, 3) and (2, 5) cuts off intercepts of lengths λ and μ on the axes. Which one of the following is correct ? -Maths 9th

Last Answer : (c) a, b, c are in H.P. only for all m As the points A(a, ma), B[b, (m + 1)b] and C[c, (m + 2)c] are collinear. Area of Δ ABC should be equal to zero.⇒ \(rac{1}{2}\)[x1(y2 - y3) + x2(y3 - y1) + ... - bc = 0 ⇒ ab + bc = 2ac ⇒ b = \(rac{2ac}{a+c}\)∴ a, b, c are harmonic progression (H.P.) for all m.

Who were the first humans to identify language forms and develop rules in grammar?

Description : Who were the first humans to identify language forms and develop rules in grammar?

Last Answer : Language and language structures pre-date history. (One cannot have a hsitory to share without a way to communicate it). And there are disaprate structures and rules that arose ... groups and regions developed in isolation. Similarities only arose through trade and interaction with neighbors.

A valid XML document that follows all grammar rules is well_formed document. -Technology

Description : A valid XML document that follows all grammar rules is well_formed document. -Technology

Last Answer : True A well-formed XML document means that the document has the correct XML syntax and follows proper grammar rules.