AKTU New Session (2024-25) SIMPLE AND EASY EXPLANATION + HANDWRITTEN NOTES PDF [ TOPIC | eee Regular Expressions and Languages: Regular Expressions, Transition Graph, Kleen’s Theorem, Finite Automata and Regular Expression- Arden’s theorem, Algebraic Method Using Arden’s Theorem, Regular and Non-Regular Languages Closure properties of Regular Languages, Pigeonhole Principle, Pumping Lemma, Application of Pumping Lemma, Decidlability- Decision properties, Finite Automata and Regular Languages Theory of Automata and Formal Languages Basic Concepts and Automata Theory: Introduction to Theory of Computation- Automata, Computability and Complexity, Alphabet, Symbol, String, Formal Languages, Deterministic Finite Automaton (DFA)- Definition, Representation, Acceptability of a String and Language, Non Deterministic Finite Automaton (NFA, Equivalence of OFA and NFA, NFA with €-Transition, Equivalence of NFA's with and without €-Transition, Finite Automata with output- Moore Machine, Mealy Machine, Equivalence of Moore and Mealy Machine, Minimization of Finite Automata. Regular Expressions and Languages: Regular Expressions, Transition Graph, Kleen’s Theorem, Finite Automata and Regular Expression- Arden's theorem, Algebraic Method Using Arden’s Theorem, Regular and Non-Regular Languages: Closure properties of Regular Languages, Pigeonhole Principle, Pumping Lemma, Application of Pumping Lemma, Decidability- Decision properties, Finite Automata and Regular Languages Regular and Non-Regular Grammars: Context Free Grammar|CFG)-Definition, Derivations, Languages, Derivation Trees and Ambiguity, Regular Grammars-Right Linear and Left Linear grammars, Conversion of FA into CFG and Regular grammar into FA, Simplification of CFG, Normal Forms- Chomsky Normal Form(CNF), Greibach Normal Form (GNF), Chomsky Hierarchy, Programming problems based on the properties of CFGs. ush Down Automata and Properties of Context Free Languages: Nondeterministic Pushdown ‘Automata (NPDA)- Definition, Moves, A Language Accepted by NPDA, Deterministic Pushdown Automata(DPDA) and Deterministic Context free Languages{DCFL}, Pushdown Automata for Context Free Languages, Context Free grammars for Pushdown Automata, Two stack Pushdown Automata, Pumping Lemma for CFL, Closure properties of CFL, Decision Problems of CFt, Programming problems based on the properties of Fs Turing Machines and Recursive Function Theory: Basic Tring Machine Mode, Representation of Turing Machines, Language Acceptability of Turing Machines, Techniques for Turing Machine Construction, Modification of Turing Machine, Turing Machine as Computer of Integer Functions, Unwversal Turing machine, Linear Bounded Automata, church's Thess, Recursive and Recursively Enumerable language, Halting Problem, Post's Correspondance Problem, Introduction to Recursive Function TheoryEngineering Express UNIT - 2 #Regular expressions and languages Regular expression | The language accepted by a finite automata can be easily described by simple expression called regular expression, or regular language. eee 2 It is the most effective way to represent any language. 3 A regular expression can also be described as a seguence of ____ pattern that defines a string. et 4 Regular expression are used to match character combination in _ String. ___|| Contain three operations __$ String searching algorithm use this pattern to find the _____ operations on a string, = Se eee eee Eee Eee I} Union.) EEE EEE oe 2 Concatenation.(.)_ 3 Kleene closure(’) Note” Positive closer.C+) snes | Special operators. _ — 1 a*= §€, a, a0, a0 a, - lat= fa, aa, a0 a, -- Primitive regular expression. I) @ = Is a regular expression represented by the language= f? 2) €_=Is a regular expression represented by the language=Ce?Engineering Express €@ 3) a Z=lIs a regular expression represented by the language=ta? 4) Union of two regular expression is represented or written as RI + R2, For example,= RI =a R2=b Union= (RI + R2)=at+b= fa,b? S) Concatenation of two regular expression is written as RI.R2_. For example,= Rl =a R2: S Concatenation.=(RI,R2)=a,b=fab? 6) Kleene Closure Offer regular expression is written as. R.E= = £6, a, aa, a0 a, ----F at EEE : oA __Value of “= £0,1,2,3------ epeceeet Some algebraic laws for. Regular expression | i) Associativelaw a —L+M=Mee =see |__ii) ___Covnmutative law _____(L+M)+N=L+(M+N) (LM)N=L(MN) aaa |__ iii) oe iv) Annihilators low OL=lO=06 vw) Distributive law. L(M+N)=LM+LN L+(M.N)=L+M . L+N vi) __Idempotent law. L+L=LEngineering Express | wi) Laws involving closuer C’) Lier 2) =€ 3. O=E 4, L'=L*+ € SUL. 6.L L=L ALLE bt _8.£+ RR =R=RR 9. CLM) L=LCML) 10. (L+M)'= (LM)'=(L'+M)* | question!: Find the regular expression whose length of string is | equal to.2 Solution: L=faa,ab,ba,bb} over © = fa, _b}. |_____Thus, Regular expression: UNION of L= aa + ab + b a +bb eres ee _ =a (a+b) +b (a +b) | zs ORE = (a +b) (Ca +b) __If length of string is J=? If length of string is 3=? zea | Solution: L= faa, ab, b a, bb, aaa, bb b, aba, b ab, ------- = fa, bi. Thus, regular expression; UNION of L = (aa + ab + ba + bb) + aa a +b bb + aba tb ab +--- = (a+b) +b) a+b) _Question2: Find the regular expression whose length is at least 2 ||__ 3 over ¥ ||Engineering Express | Question3: Find the regular expression whose length is at most two. | Solution: length= £0,1,2? = f€, a, b, aa, bb, ab, b a? over & = fa, bf. R. E= €+ a+ b+ aat+ bb+ ab+ ba =€+(a+b) +b) +b) 2e+(atb) fe + (a+b) | Question 4: Find the regular expression whose length is even. Solution: length= £0,2,4,6....3 L = f€, aa, bb, ab, b a, aaaa, ....? over £ = fa, bj. nee eee R.E= (a+b) (a+b) Ba R.E= (a +b) (a +b) Ca + b) (a +b) RE = (+b) (a+b) | Question S: Write a regular expression for the language where string | starts with 0 and_ends with one over == §0,1?, = | Solution: L= £01,001,000),011, Olll 2 eae w= £0_1? RE = 000 +1) Question 6: Write a regular expression for the language where string begins or ends with 00 and II, Solution: R, E = [(00 + Il) CO+I) J] + [(0+1) (C00 + I)] Question 7; Write a regular Expression for the language. That contain at least two 0's Solution: (1 +0) OF 00+0)' orl OF 00 +90)Engineering Express Question 8: Write a regular Expression for the language. That contain only string in language ie L=fabba? Solution: R, E= abba Practice questions Question |: Find a regular expression whose length is odd. _ Question 2: Find a regular expression whose length is divided by 3. Question 3: Find the regular expression where number of a’s is exactly two over. == fa, bf. Question 4: Find a regular expression where_a string ends with B. ends with different symbol.Engineering Express Practice questions Question 1; Find a regular expression whose length is odd. Solution: length= £1,3,5,2....3 L = f€, aaa, bbb, aba, baa, aaaaa, ....f over £ = fa, bi. *=0, R. E= (a+b) "=I, R. E= (a + b) (a +b) (a +b) RE = (a+b) a+b) +b) ie) Question 2: Find a regular expression whose length is divided by 3. Solution: length= £3,6,9...3 a oe R.E= (Ca + b) (a + b) Ca + b)) Question 3: Find the regular expression where number of a’s is _exac 0 over. & = fa, bf, SHEE cE Solution; w= a _a_ Length = faa, aba, babab, wu. 3 R, E= (a+b) a+b) (a+b) a Question 4; Find a regular expression where a string ends with B, Solution; w= __b Length = fb, ab, aa_b, bb b, ......3 R. E= (a+b) 'b Question S: Find the regular situation where string Starts with or ends with different symbol. Solution: w= (a _b) (b_ a) Length= fab, ba, aab, baa, ..... 3 R. E=a (ath) b+b (a+b) aEngineering Express __#Transition Graph Basic symbols and their position graph to note. 2 g=__ =>. 2) a= = initial state final state Mae pe ee il EERE eg eee ee ape S)_a= §€, a, aa, aa a, ----? Question 1; Construct FA equivalent RE |) SEIREnIREEEERAEEEEEEEE, | Solution ; Regular expression = a. b Finite automata transition diagram b d a —~ 7 : Ss Practice question | Question 2: Construct FA equivalent to RE.Cab + ba)’Engineering Express i _Kleene’s Theorem(R, Eto FA) This theorem state that any regular language can be accepted by || _FA, Or the language accepted by any FA is regular language, Or For any regular expression r that represents language.L(r) There is a finite automaton that accepts same language. Say RI and R2 be 2 regular expression then. 1) rb + 12 is a regular expression too , whose correspoding language is L(rlJUL (r2) — 2) _rhr2_is a regular expres. too , whose correspoding ___language is L(rl). Lb Cr2) cee ot |__3) rl Is a regular expression_to_whos corresponding language is | Gad Pee See ae | Question: Construct FA equivalent to RE. (0 + 1)'(00 + ID) (0 + 1) | Solution: step | eee bia NO 1 eee ———+ ——— Step 2 O, e_ 90,)) +1) ——— —+ Sanne: P = i O,) step 3 oe eee Ee eee ee eee _0) cat Question: Construct FA equivalent to RE 0! [ ( (10 ) + I) + 0}!Engineering Express Cfor pratice) Question: Construct FA equivalent to RE 10 + (0 + 11001 Cfor pratice) HFA TO RE BY 2 METHODS Ardens’s Theorem Ardens's Theorem “This theorem state that. If P_and Q are two regular expression. Over &, and If P does not contain, €, then The following equation in R given by oe R= Qi + BPW 0) eos Has_a unique solution, that_is, as RS GP esses Gi)__ ae | That_means, whenever we get any equation _in the form of R= | Then we directly replace by R = QP. So here first we will also prove that it is the unigue solution of this equation, || Chy replacing with eqn Gi)) After replacing R by R= QP we get, R=Q+ QP P Taking Q as common, R= QE + P P) R= QP As we know that €+ RR= R Hence proved. Thus _, R= QP is the solution of the equation (i) prove that R= QP Is the solution of this equation, And then we will|Engineering Express €@ | Chy replacing with eqn Ci) Using eqn Ci), R= Q+RP R= Q + (Q + RP)P " R= Q+ QP + RP? R= Q + QP +(Q + RP)P? __ R= Q + QP+ QP? + RP? If we substitute the value of R recursively ___R=Q+QP+QP?+ QP?+-- R=QC+ P+ P?+ P3+--- oo dl FA to RE by Arden's Theorem _ Step I: Transition diagram should not have Epsilon transition. | Step 2: Must have only one single initial state. Step. 3: Vertices are suppose, QI, G2, G3sssss...gn, where qi fs the final ||__ state Step 4 Wij j Denotes the regular expression fepresentind : set of labels of edges from qi to qj Step S: Write a eguations for each state and check their incoming edges. Step 6: Take the final state and simplify the equation for the same final state in the form of Arden’s Theorem expression.Engineering Express 2) Question |; Derive regular expression for the following finite _automata, es a,b edges. A= €, Bb+ Ca------ g Solution: Step |: Write the equation for each state and check their incoming B= Aa c= Ab = D= Da+ Db+Bat+Ch | Sep 2; Take the final state and simplify the equation from the __||__ | same final state in the form of Aren’s theorem A= € Bb+ Ca B= Aa J A= € + Aab + Abo (a || A= € + Afab + ba? If we compare this eqn with R= Q+RP then R= QP Therefor , A= €. fab + ba? A= (ab + ba)”Engineering Express Question |; Derive the regular expression from the following finite automata , ( for practice) NS 0 > 0 CG Question 2: : Derive the regular expression from the following finite automata . ( for practice) be ae = a @2 a Algebraic method using Adren’s theorem. Some bosic identities of regular expression. 2 = RE o=0 Eo peeee eee ae ee) eo O+r=r e @r=1r0=0 ae S22 eee __© € =€and O+r=r @ r+r=r St. 5 SF er.rernrer e (Jer ef+nrer © (P.Q) P=PCQP) 2 (P+Q) (P+Q) (P+Q) © (P+Q).r=P.r+Q.r and 1.(P+Q)=r.P+r.Q e If R=Q+RP, then the unique solution is : R=QP , ie ARDEN’S THEOREMEngineering Express : Prove +001) + (+00 CO+101)" CO+10'1)._ = (010 +10'1).) |_ Solution: taking L.H.S +00 1)C €+(0+10 1) (0+10 1) ___ftaking common (1+00'1)? +00 DCe+(o+lo pe (o+10'1)) I 1(¢+00) (€+(0+10 1)" (0+101)) ttal aking common WM} | 10" (e+ CO+10 1) CO+I01)) Eby t+ er arp Let CO+I0I)=R, ) bby e+ etnrear ie 0 CO+10 I) = RS IL Question for practice gp SSeS Se | Prove that the RE, R2Ce + I'CONC'COIIY.)’ all describ e same_ ___|_set_of strings ______ Practice question = | questi ion I; Construct FA equivalent to RE(ab+ bay oe || sotution: RE= (ab + ba) go — 8B — 4Engineering Express LL S2eHeE ie q FA ivalen + + _Solution: I, [CC10.)'+ MN) + OF Step |: eee OU eee ee ee |_Step2:_, Oo Pd Perera Is J He € € Hee II | itu a (C10) + NT _ Step3: 0 | 0 | | _eoOUl soi ee eg | eee fant MW 10} | Step3: oT oe! Pe ans — ort sa = te oeEngineering Express | | i _Solution: ni: Fy i + + stepl:__, —_10+C0+11)0"1_, 0 |_Step 2: ee eco re a \ oe — et ct _ 0 € EEE 0Engineering Express | question 4: Deri ! ion f following fini _automata . ( for practice) aA eA ; c 0 Solution: A=A0+C0+" BEAM BI+C) C=B0 oo eSebstituting this iC ie Be PERE ree Pe ee eee eee See eee eee | B=AI+B(/+01) I BeAlC+01) || Substituting this B in C EEE C= AIM+01) 0 Substituting this C in A A=A0+AI(/+01) 00+" A="+A(0+I(1+01) 00] A=[0+1(1+01) 007Engineering Express Ne ic Fol _automata_. ( for practice) b a ©? a b a Solution: : gl= gla+g2b+ * g2=Glatg2b+g3a G3 = G2a Substituting value of g3 in 42 g2 = glatq2b +g2aa G2 = glatg2(btaa) _ TET freee — PPE gieag a ipee@@DeEee EERE CPE PEE eee ERE EEE te gl= Gla+ glaCb+aa) b+ “* Substituting this g2 in gl gl= *+ gla+ glaCb+aa) b qgl= *+ glla+ a(b+aa) b ] gl= [a+ a(b+aa) b] Substituting this gl in q2 g2=(a+ a(b+aa) b] a(b+aa) Substituting this g2 in g3 93=[a+ a(b+oa)'bY'aCb+aa)'aEngineering Express Question 6: Prove that the R.E , R=(e + ICO) C'Col))* all describ e same set of strings Solution: R=(e +! COI) CLO) )* R= €+ PP, where P=!'COll) R= P [Since Basic Identity, €+ PP'=, €+ PP=P] R= (1*(oll)")* = (PQ) '=(P+Q)' [Basic Identity] Thus, R=C1+C01))" Hence it describes the same set of strings “method. Steps required to find the regular expression for any given DFA by state elimination method_are_as fallows:- Stepl:- = Initial_state_should not_have any incoming_ fae 8 = “S'o-O Step2:- Final state should not have any outgoing edge, Step3:- Other than the initial state and the final state, delete or eliminate other states one by one.Engineering Express Questionl:- Derive a regular expression from the following finite automata, a —©OE=O | Solution:-Stepl:-Initial state has no incoming edges, thus no chnage || __ Step2:-Final state has no outgoing edges, thus no change. Step3:- Thus, the final regular expression: (a+b+c) _Question2;- Derive a regular expression from the following finite automata. a i —O-9-— b Solution;-Stepl:-Initial state has no incoming edges, thus no chnage Step3:- Other than the initial state and the final state, delete the state numbers B as it is in other state, ___Step2;-Final state has no outgoing edges, thus no change. Step4:- Thus, the final regular expression: (a.b’.c) a.b*c oO Question 3:- Derive a regular expression from the following finite automata. b fre d oO aEngineering Express Solution:- Stepl:- Initial state has incoming edge, Thus the resultant FA, Step2;:- Final state has no outgoing edges. thus the resultant faith i oe Step3:- Other than the initial state and the final state delete or eliminate other states one by one. ae Eliminating A c b Bd oes ame ab BCc+ab)*.d =O Step4:- Thus, the final regular expression: B(c+ab)*.d # Practice questions Questionl:- Derive a regular expression from the following finite automata. 0 0Engineering Express 2) | _Question2;- Derive a regular expression from the following finite automata, o; reat) a,b A oe) Question 3:- Derive a regular expression from the following finite automata. a ab ab b ay ao == F _#Closure Properties Closure properties on regular language are defined as certain operations on regular language, which are guaranteed to produce regular language. _2.Closure refers to some operations on a language, resulting ina | new language that is of same ‘type’ as originally operated on, That_|| is regular, — ee || Properties are:- |. Kleene Closure 2. Positive closure 3. Complement 4. Concatenation S. Union 6. Intersection ?.Reverse or transpose | 8. Set Difference 9, Homomorphism 10. Inverse HomomorphismEngineering Express « Kleene closure:- If LI is a regular language, it’s kleene closure || LI’ will also be Regular Example = _LI=(aUb) L1=(aUb)* Positive closure:~ If LI is a regular language, it’s Positive closure LI* will also be Regular et Example = _LI=(aUb) L1=(aUb)* a Et ¢ Complement:-If L(G) is a regular language , its complement __ UG) will also be regular. Complement of a language can be ___||___ possible strings, 7 Boe |_____ found by subtracting string which_are in L(G)From all ___||__ Example =1. LG)= ba’ ln>3? UG = farInc=3} = £0,2,4,6,8, 10.3 a L’=length equal to odd = TAS 7A Miad HH a ¢ Union:- If LI and if L2 are 2 regular languages, their union ||___LI VD L2 will Also be regular. Example = Ll=(a"/n>0? L2=fb"/n>0? Union L3=LI UV L2 =a" Ub’ /n>03is also regular « Intersection:- If LI and if L2 are two. Regular languages, the intersection, LI L2 will also be regularEngineering Express €@ Example = Ll=fa" b’/n>03 L2=f a” b’ Ub’ a”/n>0 and m>0? Intersection L3= LI \L2 =fa" b" /n>0 and m>0}is also regular « Concatenation:- If Li and if L2 are two. Regular languages, the concatenation. L1.L2 will also be regular __ Example= _ LI={a"/n>0? a L2=fb"/n>0? _concatination L3=LI . L2 =a". b’ /n>0 and m>03is also regular © Reverse or transpose:- If a language L is a regular language ____then it’s transpose or reverse should be a regular language. We| _____ follow the following steps, __ see! 1. Transition diagram should only one final state, 2. We interchange final state as initial and initial state as || __ final_state. So = ___3. We reverse the direction of the edges between the states for Eg. if we have aes “—¢))" ge About diagram having only one final state, so we can Zs directly interchange final state as initial state and initial state as final state. Q_ab LA\ a,b fae ae L®= (a+b) *ba*Engineering Express 2) « Set difference: If LI and if L2 are two, Regular languages, the concatenation, L=LI-L2 will also be regular Example = Ll=a"+b(a+b)* L2=b'a(atb)" Set difference L=L)-L2 =L! 0 L2’ is also regular ___» Homomorphism:-A homomorphism on an alphabet is a function || _ that gives a sting for each symbol in that alphabet. __Example=_h(0)=ab; h()=bb ae If L=f 00,113 then h(L) = fabab,abbb? _____ Therefore h(L_) is a homomorphic language for the_ language L. e Inverse Homomorphisrn:- Let_h be a homomorphism and L _language whose alphabet _is the_output language of h_____ ____ The inverse homomorphism: h-I(L)=fwlh(w) is in Lb}? | __Example= let h(0)=a, h(I)=ab & L=fabab? eco __Thus h-I(L)=€0101,22,201,012 3 ee. #To identify laguage is regular or note ___ | Basic questions Note:- e Lif power =! = always regular] e Lif there are different power= always regular] (when condition is finite= always regular ] e [same powers= not regular]] Questionl:- Identify whether the following language are regular or not. L= {a"|n>=0} Solution:-_[note: if power =] = always regular] Thus £a"|n>=03? is acceptable by finite automataEngineering Express Question2;- Identify whether the following language are regular or not. L= farb”|n,m>=13 Solution:-_[note: if there are different power= always regular] Thus f0"b"|n,m>=I?is acceptable by finite automata || __ Question 3:- Identify whether the following language are regular or not. L= fa’b"|n<=2077 eat Solution:-_[note: when condition is finite= always regular] _ Thus §0"b"|n<=207?is acceptable by finite automata __As there exists a finite value of n Question4:- Identify whether the following language are regular or not. L= farb"|n>=I? _Solution:-_[note: same powers= not regular] Thus fa’b"|n>=13 not a regular language as not finite value exists | Pumping lemmaCit’s a negative test) saesnees a Pumping lemma _is used to prove that_a language is not foe! Eee oe Language eet _Finite Infinite ee Always regular Regular or may non- regular can’t Defined Pumping lemma state that, if L is a regular language then the L has Pumping length ‘v’ ie , no of state in FA, such that any string ‘w’ where |W|>=n may be divided in 3parts w=xyz2 such that th following conditions must be true .Engineering Express Steps required to satisfy the pummping lemma are as follows:- | Stepl:- let n be the no of states the corresponding automata ___|| Step2:- sele should bell. using pumping lemma W=xy2 |. ly] not egual to“ Hee 2. Ixyl<=p Step3:- find the suitable integer | such that xyz not belongs to L _ This contradicts our assumption L is non regular _Questionl:- Using pumping lemma proof that the following language is not regular, L=fa” b? n>03 Solution = | Stepl;-let ‘L’ be regular language and_a pumping length be ‘p’ _ Step2;-let choose a string w=a'b’ and divide the string into 3 parts xy and 2 || Step3:- let us assume that p =7 , thon w=aaaaaaabbbbbbb [7a’s and 7b’s ]_ 3 y 2 Case2:- let ‘y’ be in ‘b’ part: w=aaaaaaabbb bbbb Casel:- let ‘y’ be in ‘a’ part: w= aaaaa aa bbbbbbb <7 oe — x y 2Engineering Express | Case3;- let ‘y’ be in both ‘a’ and ‘b’ part: w=aaaaaaabb bbbbb —— x y z Step4;- let i=2/0 Caseli- thus xy2: | =aaaaa aa bbhbbbbb a‘.b’ (not valid to string) Case2:- thus xyz: W=aaaaaaa bbb bbbb = 0. b*=07b"= Cnot valid to string) Case3:- thus xyz; W=aaaaaaabb bbbbb W= 0°.a°,b?.a’.b?.b5= a%b* | regular See EEE EEE 7 Practice Questions Question |:- Show that L-fa?|P is prime? is not regular || Question2;- Show that L={0'l' | i>=I? is not regular _ Question 3:- Show that L= {a?"|n>1? is not regular Applications of pumping lemma. This theorem can be used to prove that certain sets are not regular. The general steps in its applications are. Stepl:- Assume L is a regular,et _n be the no of states the corresponding automataEngineering Express | Step2:- select a string W such that th length of W should belW]>=p, using pumping lemma W=xy2 1. lyl not egual to “ 2. |xyl<=p Step3:- find the suitable integer | such that xy2 not belongs to L This contradicts our assumption L is non regular Pigeonhole principle. |, It stated that if n pigeons are assigned to m pigeon holes, ____then_at least one pigeonhole_contains two or more Ee |___pigeons.Cm FA Accept then Wc Ll, ie Wis a memmber of L “~——» Accept then W € _L, ie W is not a memmber of L » Equality:-f LI= L2 or Ll + +12) ____| Two finite state automata Ml and M2 is set to. be copia if _ they accept the same language. Minimize the finite state _automata and the Minimal, dfa will be unigue. “ue Fh= MINIMIZATION= ‘MI, if MI=M2 then Li=L2 L2= FA= MINIMIZATION=M2, otherwise LI # L2Engineering E simplifying Engineering Education Are you drowning Fear not! Welcome to engineering concepts? Struggling to decipher cryptic n Engineering Express, where we decode the mysteries of engineering subjects for you. x” What We Offer Clear Explanations: Our notes breck down intricate topics into bit easy-to-wnderstand language. No jargon, no headaches! Real Connections: Ever wondered how those abstract formulas opply in the real world? We've got you covered with relatable examples Maximize Your Marks: Our mission? Boost your exam scores. Kuth ‘our straightforward notes, you'l! be well prepared to conquer any engineering challenge Follow us on social media: YouTube - <://uavw youtiibe.com/@ Engineerin sub confirmation WhatsApp - https://chat .whatsapp.com/H!6tpUl2SmQ 306vleD2DIu Instagram - https://www.instagram.com/engineeringexpress2 312/ Telegram - https://t.me/engineeringexpressofficial Join the Engineering Express community today and unlock the power of simplified learning! @ @