348 subscribers
29 photos
10 files
312 links
In this group I will share the notes of my class. I will also share the links of my upcoming Classes.
Download Telegram
Thanks Unacademy For giving me this wonderful Teacher's Day Gift.

Happy Teacher's Day.

#unacademy #gatecse
Playlist - Algorithm - Time Complexity Gate Previous Year Questions (Last 33 Years)
Link:-https://youtube.com/playlist?list=PLGCwejjh3yDqTpnTKrrwqzcB8HpcMYSev
Playlist - Algorithm - Sorting Gate Previous Year Questions (Last 33 Years)
Link:-https://youtube.com/playlist?list=PLGCwejjh3yDqzULaxPB9JrAn1P6gkbo-1
Subject - Theory of Computation

Topic 1 - 111 Theory of Computation | Intoduction to Regular Expression | Example | Operator in Expression

Link:-https://youtu.be/4ZiXGgYDZNU

Topic 2 - 112 Theory of Computation | Give Regular Expression from the Given Regular Language | Example
Link:- https://youtu.be/NNkmI6sQfX0

Topic 3 - 113 Theory of Computation | Identities for Regular Expression | Gate & ISRO Question | Example
Link:-https://youtu.be/5ssnZ-WmI2U
Subject - Theory of Computation

Topic 1 - 114 Theory of Computation | CMI 2017 Question | The Regular Expression (a *+ b) * equivalent to which
Link:-https://youtu.be/TbIiYw_ix2w

Topic 2 - 115 Theory of Computation | Gate 1992 Question | Choose the correct alternatives (more than one may be Correct)
Link:- https://youtu.be/Wvt5ZdAdORU

Topic 3 - 116 Theory of Computation | Conversion of Regular Expression to Finite Automata | Conclusion
Link:- https://youtu.be/sbDI9oRBvo4

Topic 4 - 117 Theory of Computation | Conversion of FA to Regular Expression by State Elimination Method
Link:- https://youtu.be/MQTTSGuK9xQ

Topic 5 - 118 Theory of Computation | Conversion of Finite Automata to Regular Expression | Examples
Link:-https://youtu.be/iZbvFauyni8

Topic 6 - 119 Theory of Computation | Short - Cut method on Conversion of Finite Automata to Regular Expression
Link:- https://youtu.be/u5kLT4Nh3jU
Subject - Theory of Computation

Topic 1 - 120 Theory of Computation | Arden's Theorem to find Regular Expressions of Finite Automata | Examples
Link:-https://youtu.be/QUdDZyh14mY

Topic 2 - 121 Theory of Computation | Arden's Theorem | Conversion of Finite Automata to Regular Expressions
Link:-https://youtu.be/S1vqnCHffik

Topic 3 - 122 Theory od Computation | Gate 2006 IT Question | Another Form of Arden Theorem | Finite Automata
Link:-https://youtu.be/FdObdbrHNOg
Subject - Theory of Computation

Topic 123 - Theory of Computation | Regular Expression for Even number of a's and Even number of b's | Example
Link:-https://youtu.be/SRN5Vx2nPOg

Topic 124 - Theory of Computation | Pumping Lemma for Regular Language | ISRO & Gate Question on Pumping Lemma
Link:-https://youtu.be/QxLPZdMwZQ4

Topic 125 - Theory of Computation | Finding the Minimum Pumping Length for Regular Language L = 10 *1
Link:-https://youtu.be/rIhAkjgPdx8

Topic 126 - Theory of Computation | Finding the Minimum Pumping Length for Regular Language L = 0 * 101*
Link:-https://youtu.be/QMQaqYCm0Ps

Topic 127 - Theory of Computation | Finding the Minimum Pumping Length for Regular Language L = {a}
Link:-https://youtu.be/AVsUTQUwYCw

Topic 128 - Theory of Computation | Finding the Minimum Pumping Length for Regular Language L = {}
Link:-https://youtu.be/Ddoregutx6U

Topic 129 - Theory of Computation | Minimum Pumping Length for Regular Language L = {aa, aba, bbaa} & L = 0 * 1*
Link:-https://youtu.be/k8FxURCspsk
Subject - Theory of Computation

Topic 132 - Theory of Computation | Pumping Length for Regular Language L = 10 *1/3+0 *101 */3 | Pumping Lemma
Link:-https://youtu.be/CA5pZ3Rp-9s

Topic 133 - Theory of Computation | Check Whether a Language is Regular or Not | Gate Previous Year Questions
Link:-https://youtu.be/7BY4hc4RAtU

Topic 134 - Theory of Computation | Grammar | Construction of Grammar | Grammar Questions | Palindrome
Link:-https://youtu.be/7P3JVMtS86s

Topic 135 - Theory of Computation | Regular Grammar | Type 3 Grammar | Representation of Regular Grammar
Link:-https://youtu.be/Xgbc0GxPeww

Topic 136 - Theory of Computation | Conversion of Finite Automata to Regular Grammar & Vice Versa | LLG, RLG
Link:-https://youtu.be/gk162gteS28

Topic 137 - Theory of Computation | Context Free Grammar | Types of Context Free - Grammar | Examples
Link:-https://youtu.be/PJkfMNxTAPQ
Subject - Theory of Computation

Topic 138 - Theory of Computation | Simplification of Context Free Grammar | Removal of Null and Unit Production | Useless Symbol
Link:-https://youtu.be/al2u1O-dsPA

Topic 139 - Theory of Computation | Check Whether L is Regular or Not | Regular Grammar | Regular Language
Link:-https://youtu.be/oP8WlG47BPk

Topic 140 - Theory of Computation | Check Whether L is Regular or Not | L = {a^n b^m | (n+m) is Even}
Link:-https://youtu.be/NSyQqIu9RCY