Skip to main content

Direct and indirect speech tricks and shortcuts.

 Hello, today i will give you some shortcut and tricks about the direct and indirect speed so lets start.

STEP 1: Direct speech and its part:

STEP 2: Learn by using some examples:


 STEP 3: Some general rules: 


STEP 4: Some important word transformation: 

STEP 5: Explanation by examples:

 STEP 6: Some important key points:


STEP 7: Examples with some words transformation:

 

 

STEP 8: Special case:


STEP 9: Transformation of different kinds of sentence:




STEP 10: Some final examples:


😄


Labels:

Popular posts from this blog

Group {Algebra} (B.Sc. Mathematics NEP Notes)

Group Semi group A semigroup is an algebraic structure consisting of a non-empty set equipped with a binary operation (an operation that takes two elements from the set and produces another element in the set) that is associative. In other words, for all elements a, b, and c in the set, the operation satisfies the associative property: (a * b) * c = a * (b * c) In a semigroup, there is no requirement for an identity element or inverses, as is the case in groups. Quasi group Let G be any non-empty set and * is a binary operation than the structure is called Groupoid or quasi group if the binary operation in the set G satisfy the commutative property. a*b = b*a A groupoid with identity element is called Loop. Monoid A monoid is an algebraic structure that consists of a non-empty set, a binary operation A monoid is defined by the following Properties: Associativity:  The binary operation is associative, meaning that for all elements a, b, and c in the set M, the...
Read more

Ring {Algebra} (B.Sc. Mathematics NEP Notes)

  Ring RING     A  ring is algebraic structure (R, '+' , '.') that consists of a set equipped with two binary operations, usually called addition and multiplication. The definition of a ring includes the following properties: Additive Closure:  The set R is closed under addition, meaning that if you add any two elements from the set R, the result is also in the set R. Additive Associativity:  Addition is an associative, meaning that for any elements a, b, and c in the set R s.t. (a+b)+c=a+(b+c) Additive Inverse:  For every element  a  in the set R, there exists an additive inverse (usually denoted as  -a ) in the set R such that a+(-a)=0 and (-a)+a=0. Additive Identity:  There exists an additive identity element (usually denoted as 0) in the set R, such that for any element  a  in the set R, a+0=a and 0+a=a. Commutative:  The commutative law for addition states that for any elements a and b in a set R s.t....
Read more