- Видео 101
- Просмотров 470 476
Master Computer Science Subjects
Индия
Добавлен 26 сен 2012
Hello computer science students, whether you are doing bachelor's or master's or Engineering in computer science, My channel is the right destination for you to understand subjects in a simple manner. I have started this channel on November 10th of 2019.
I am Vimala Devi J, professor working for Cambridge Institute of Technology in Bengaluru.
----------------------------------------------------------------------
Please, do SUBSCRIBE, SHARE and LIKE my channel.
-----------------------------------------------------------------------
I am Vimala Devi J, professor working for Cambridge Institute of Technology in Bengaluru.
----------------------------------------------------------------------
Please, do SUBSCRIBE, SHARE and LIKE my channel.
-----------------------------------------------------------------------
FSM to Regex | ATC | 18cs54 | 17cs54 | 15cs56 | VTU model qp solved
FSM to Regex | ATC | 18cs54 | 17cs54 | 15cs56 | VTU model qp solved
Просмотров: 5 385
Видео
RE to NDFSM | Kleen's theorum part-1 | ATC | 18CS54 |17CS54 | 15CS56 | VTU model QP solved
Просмотров 4,5 тыс.3 года назад
Related Links: PDA design problems 1. PDA design for L = 0^2n 1^n ruclips.net/video/7fGn4YJZiOc/видео.html 2. PDA design for L = WCW^r ruclips.net/video/JoJ53SMPAq4/видео.html 3.PDA design for L = a^n b^n ruclips.net/video/VQ0nmWGbrow/видео.html Join my telegram channel in the following link t.me/MCSedu
TM design for L = 0n1n2n | ATc |18cs54 | 17cs54 |15cs56 | VTU QP solved
Просмотров 6 тыс.3 года назад
Related links: Introduction to Turing Machine 1. ruclips.net/video/Nc9NAGxVcTg/видео.html TM for L = {0n1n } 2. ruclips.net/video/PDommbdZIXo/видео.html TM for language of Palindromes ruclips.net/video/eBEIpWLEpA4/видео.html
CFG to CNF | ATC | 18cs54 | 17cs54 | 15cs56 | VTU Model qp solved
Просмотров 7 тыс.3 года назад
Related links: 1. ruclips.net/video/tec_O2332M4/видео.html 2.ruclips.net/video/Hz3nYnbUjoQ/видео.html 3. ruclips.net/video/1XNBgZEggeY/видео.html
Ambiguous Grammar | ATC | 18cs54 | 17cs54 | 15cs56 | VTU model qp solved
Просмотров 4,2 тыс.3 года назад
Related links: 1. ruclips.net/video/bw8poN3JMDg/видео.html Join my telegram channel in the following link t.me/MCSedu
Ambiguous Grammar | ATC |18CS54 | MODULE 02 | VTU Model QP solved
Просмотров 4,8 тыс.3 года назад
Related links 1. ruclips.net/video/bw8poN3JMDg/видео.html Join my telegram channel in the following link t.me/MCSedu
Context Free Grammar | ATC |18CS54 | MODULE 02 | VTU Model QP solved
Просмотров 9 тыс.3 года назад
Other related links 1. ruclips.net/video/EbQ37Cx1LGg/видео.html 2. ruclips.net/video/3VJI9qEIXSk/видео.html
FSM to Regex | ATC |18CS54 | MODULE 02 | VTU Model QP solved
Просмотров 15 тыс.3 года назад
FSM to Regex | ATC |18CS54 | MODULE 02 | VTU Model QP solved
Regular Expression | ATC | 15cs56 | 17cs54 | 18cs54 | VTU | Model QP solved
Просмотров 12 тыс.3 года назад
#18cs54 #17cs54 #15cs56 Other links for Regular Expression 1. ruclips.net/video/Im8ir375x3A/видео.html 2. ruclips.net/video/5PEC8kU_CeE/видео.html
Minimization of DFA | ATC | 18cs54 | VTU | Model QP solved
Просмотров 8 тыс.3 года назад
#17CS54 #18cs54 #15cs56 Other related links : 1. ruclips.net/video/Ih7-5-bWb_8/видео.html 2. ruclips.net/video/SXyYbJS5FhM/видео.html
Minimising DFSM | ATC |18cs54 | Module 1 | VTU | Model QP solved
Просмотров 15 тыс.3 года назад
Its a longer video and you can skip to the end of video for solution. Other related links : 1. ruclips.net/video/Ih7-5-bWb_8/видео.html 2. ruclips.net/video/SXyYbJS5FhM/видео.html
ATC| 18CS54 | Module 1|VTU| Model QP solved
Просмотров 13 тыс.3 года назад
#atc #vtu #18cs54 #17cs54 This channel will feature subjects such as theory of computation, system software and compiler design and many more in the discipline of Computer science and Engineering. The purpose of this channel is to make Engineering concepts simpler, understandable with in-depth explanation. Introduction to DFSM/DFA ruclips.net/video/oH3KNt44Tx0/видео.html
ATC |18CS54 | Module 1 |VTU |Model QP solved(CBCS Scheme)
Просмотров 16 тыс.3 года назад
#ATC #VTU #17CS54 #18CS54 #solvedqp This channel will feature subjects such as theory of computation, system software compiler design and many more in the discipline of Computer science and Engineering. The purpose of this channel is to make Engineering concepts simpler with in-depth explanation. 1. Basic concepts of automata theory(Answer for 1a question) ruclips.net/video/vTPylAwDb3o/видео.ht...
Conversion of NFA to DFA | ATC Module 1 | 18cs54 | 17cs54 | 15cs56 | VTU QP solved
Просмотров 6 тыс.4 года назад
#18cs54 #17cs54 #15cs56 This video explains how to convert NFSM to DFSM using lazy evaluation method. This topic appears in module 1 of ATC. This channel will feature subjects such as theory of computation, system software compiler design and many more in the discipline of Computer science and Engineering. The purpose of this channel is to make Engineering concepts simpler with in-depth explana...
Automata theory and Computability | DFA | Epsilon closure of NFA | Module-1| VTU QP solved
Просмотров 8 тыс.4 года назад
This channel will feature subjects such as theory of computation, system software compiler design and many more in the discipline of Computer science and Engineering. The purpose of this channel is to make Engineering concepts simpler with in-depth explanation. #atc #vtuqpsolved #nfatodfa #nfsmtodfsm
ATC | VTU syllabus | Convert epsilon NFA to DFA
Просмотров 2,2 тыс.4 года назад
ATC | VTU syllabus | Convert epsilon NFA to DFA
Compiler Design lecture- #37 | Three address code - Introduction
Просмотров 6194 года назад
Compiler Design lecture- #37 | Three address code - Introduction
Compiler design lecture-#36 |Syntax tree | Directed acyclic graph(DAG) | Three address code(3AC)
Просмотров 2,7 тыс.4 года назад
Compiler design lecture-#36 |Syntax tree | Directed acyclic graph(DAG) | Three address code(3AC)
Compiler Design lecture - # 35| Syntax tree |Directed Acyclic Graph | Three address code
Просмотров 3,9 тыс.4 года назад
Compiler Design lecture - # 35| Syntax tree |Directed Acyclic Graph | Three address code
Compiler design lecture - #34 | SDD for syntax tree | Parse tree Vs Syntax tree
Просмотров 9404 года назад
Compiler design lecture - #34 | SDD for syntax tree | Parse tree Vs Syntax tree
Compiler design lecture -33 | S-attributed and L-attributed Syntax directed translation
Просмотров 1,8 тыс.4 года назад
Compiler design lecture -33 | S-attributed and L-attributed Syntax directed translation
Compiler design lecture -32 |Syntax Directed Translation for TYPE structure|Basic&Derived data types
Просмотров 3874 года назад
Compiler design lecture -32 |Syntax Directed Translation for TYPE structure|Basic&Derived data types
Compiler design lecture - #31 | Syntax Directed Translation for DECLARATION STATEMENT (part 4)
Просмотров 8904 года назад
Compiler design lecture - #31 | Syntax Directed Translation for DECLARATION STATEMENT (part 4)
Compiler design lecture - #30 | Syntax directed translation for PREFIX Expression Grammar(part 3)
Просмотров 6714 года назад
Compiler design lecture - #30 | Syntax directed translation for PREFIX Expression Grammar(part 3)
Compiler design lecture - #29 | Syntax directed translation for Expression Grammar(part 2)
Просмотров 4044 года назад
Compiler design lecture - #29 | Syntax directed translation for Expression Grammar(part 2)
Compiler design lecture - #28 | Syntax directed translation for Expression Grammar
Просмотров 7384 года назад
Compiler design lecture - #28 | Syntax directed translation for Expression Grammar
Compiler design lecture -#27 | Syntax directed translation - introduction
Просмотров 6664 года назад
Compiler design lecture -#27 | Syntax directed translation - introduction
Relocating loaders | System Software -#15
Просмотров 9 тыс.4 года назад
Relocating loaders | System Software -#15
Mam but you told me that only anonymous grammar can be useful for passing a tree or top down parsing like that but you told me that the example program of after removing the left recursion the total equation you write that he employees a + b + c study epsilon ID that world equation you said that it is ambiguous if it is how ambiguous how can a parasitic can be built or it is suitable for top down parsing
Madam how did you write the equation got the final equation of example grammer after removing left recursion in it
What is the regular expression of identifier ma'am?
Ma'am is regular definition the regular expression itself?
No...regular defn is more of reg grammer
can you provide the pdf of you notes maam
finally understood it
Genuinely this is of great help. Thank you.
Glad it helped!
What a phenomenal explanation..
Thank you so much, clear and stright to the point
Sorry. Can you please explain how do I make the SRI(1) tabel? Thank you, I wish you the best!
5 minute
pe gat la cur si pe spate
3 pfururi
dior suavue tester te rog
39mii de eruo scuze
imi pare rau nu am a vurt
sorry i mean in ass when
incu-rcan-d
sorry mam venil*
internal pointer variable
yx
soorry prof vinata my fault i am learn lfac at schul bagamias pula in mata
hindi
baga mias pula e episllon nu dolar
Im a practicing software engineer who is trying to teach himself how to design languages. (For fun, mostly) shift reduce/reduce reduce errors have been my nemesis. This little walkthrough explains the problem clearly. Thank you!
mam how yu are determining formats ki eska 3 he eska 2 he
Thanks mam❤
Thanks mam ❤
Most welcome 😊
Thanks mam❤
thankyou mam😍
mam D 1 is not goes to B,F state. its goes to for A,G state
Nice explanation..❤
Mam, what if start state and final state are same for a problem
It can be...and the transitions are self loops
@@mastercomputersciencesubje3181 how to separate the sets in that case
Second problem you didn't check for S-> eCDf Actually we only have one alpha on RHS,so acc to rule 1 it is not LL(1).Right?
It's well and good ma'am.....But u need to fix your camera using a stand instead of holding it with your hand and shaking like this is not much good.... Try in a better way😊
Yeah...I know...ur suggestion is well accepted
This video would be more helpful if it was switched with the video before it since it helps explain a few rules that are needed in that one. And actually they are switched around in the playlist.
Thank you mam
Today came this question in qp, done correctly, thanku
Clear explanation thank you
Thank you mam
The explantion is soooo good thanks a lot mam
Thank you mam
Language of length<=9
Thanks a ton ma'am!!!!
Mam please attach ur worked sheets also for the further reference
Thanku mam.. It means a lot ❤❤
Ma'am in last step we can directly skip to unreachable step without doing unproductive??? Cuz there is no change in that when compared with last step
Ma'am can u plz post one more exam on this
Good Explanation mam 💯