![CSE ACADEMY](/img/default-banner.jpg)
- Видео 170
- Просмотров 85 288
CSE ACADEMY
Индия
Добавлен 9 авг 2018
Welcome to My RUclips channel CSE ACADEMY
Provide lectures series for COMPUTER SCIENCE AND ENGINEERING and INFORMATION TECHNOLOGY students for Academic as well as competitive exams like GATE
I will trying to provide the quality of education
Provide lectures series for COMPUTER SCIENCE AND ENGINEERING and INFORMATION TECHNOLOGY students for Academic as well as competitive exams like GATE
I will trying to provide the quality of education
Powerful Techniques: Analyzing Algorithms with Substitution Method|T(n)=T(n/2)+n|Algorithms|DAA
Powerful Techniques: Analyzing Algorithms with Substitution Method|T(n)=T(n-1)+n with Examples
Courses playlist
================
DESIGN AND ANALYSIS OF ALGORITHMS (DAA)| ALGORITHM: ruclips.net/p/PLS6nugESt9lJ2rluFZTYq8YnpRD1rm5Wf
1.FINITE AUTOMATA(FA): ruclips.net/p/PLS6nugESt9lJXt7UEXhQTyofeSrqQfPO3
DISCRETE MATHEMATICS: ruclips.net/p/PLS6nugESt9lLeVTXWMD_NXNVAKAC8RYDg
#cseacademy
#mastertheorem
#daabyahmadsir
#solvingrr
#ahmadsir
#gatecs
#engineering
#daa
Courses playlist
================
DESIGN AND ANALYSIS OF ALGORITHMS (DAA)| ALGORITHM: ruclips.net/p/PLS6nugESt9lJ2rluFZTYq8YnpRD1rm5Wf
1.FINITE AUTOMATA(FA): ruclips.net/p/PLS6nugESt9lJXt7UEXhQTyofeSrqQfPO3
DISCRETE MATHEMATICS: ruclips.net/p/PLS6nugESt9lLeVTXWMD_NXNVAKAC8RYDg
#cseacademy
#mastertheorem
#daabyahmadsir
#solvingrr
#ahmadsir
#gatecs
#engineering
#daa
Просмотров: 2
Видео
Powerful Techniques: Analyzing Algorithms with Substitution Method|T(n)=T(n-1)+n|Algorithms|DAA
Просмотров 194 часа назад
Powerful Techniques: Analyzing Algorithms with Substitution Method|T(n)=T(n-1) n with Examples Courses playlist DESIGN AND ANALYSIS OF ALGORITHMS (DAA)| ALGORITHM: ruclips.net/p/PLS6nugESt9lJ2rluFZTYq8YnpRD1rm5Wf 1.FINITE AUTOMATA(FA): ruclips.net/p/PLS6nugESt9lJXt7UEXhQTyofeSrqQfPO3 DISCRETE MATHEMATICS: ruclips.net/p/PLS6nugESt9lLeVTXWMD_NXNVAKAC8RYDg #cseacademy #mastertheorem #daabyahmadsir...
Master Theorem most important Questions| Recurrence Relations|Algorithms|DAA| Solved Problems
Просмотров 3212 часов назад
Master Theorem most important Questions Recurrence Relations Algorithms DAA Solved Problems Masters Theorem for Dividing Functions Explained All cases with Examples Courses playlist DESIGN AND ANALYSIS OF ALGORITHMS (DAA)| ALGORITHM: ruclips.net/p/PLS6nugESt9lJ2rluFZTYq8YnpRD1rm5Wf 1.FINITE AUTOMATA(FA): ruclips.net/p/PLS6nugESt9lJXt7UEXhQTyofeSrqQfPO3 DISCRETE MATHEMATICS: ruclips.net/p/PLS6nu...
Master theorem|Solving Recurrence Relation T(n)=7T(n/3)+n^2 |Design and Analysis of Algorithms
Просмотров 3916 часов назад
Masters Theorem for Dividing Functions Explained All cases with Examples Courses playlist DESIGN AND ANALYSIS OF ALGORITHMS (DAA)| ALGORITHM: ruclips.net/p/PLS6nugESt9lJ2rluFZTYq8YnpRD1rm5Wf 1.FINITE AUTOMATA(FA): ruclips.net/p/PLS6nugESt9lJXt7UEXhQTyofeSrqQfPO3 DISCRETE MATHEMATICS: ruclips.net/p/PLS6nugESt9lLeVTXWMD_NXNVAKAC8RYDg #cseacademy #mastertheorem #daabyahmadsir #solvingrr #ahmadsir ...
Master theorem|Solving Recurrence Relation T(n)=T(n/2)+n^2 |Design and Analysis of Algorithms
Просмотров 8019 часов назад
Masters Theorem for Dividing Functions Explained All cases with Examples Courses playlist DESIGN AND ANALYSIS OF ALGORITHMS (DAA)| ALGORITHM: ruclips.net/p/PLS6nugESt9lJ2rluFZTYq8YnpRD1rm5Wf 1.FINITE AUTOMATA(FA): ruclips.net/p/PLS6nugESt9lJXt7UEXhQTyofeSrqQfPO3 DISCRETE MATHEMATICS: ruclips.net/p/PLS6nugESt9lLeVTXWMD_NXNVAKAC8RYDg #cseacademy #mastertheorem #daabyahmadsir #solvingrr #ahmadsir ...
Masters Theorem in Algorithms for Dividing Function |Solving Recurrence Relation|T(n) =aT(n/b)+f(n)
Просмотров 53День назад
Masters Theorem for Dividing Functions Explained All cases with Examples Courses playlist DESIGN AND ANALYSIS OF ALGORITHMS (DAA)| ALGORITHM: ruclips.net/p/PLS6nugESt9lJ2rluFZTYq8YnpRD1rm5Wf 1.FINITE AUTOMATA(FA): ruclips.net/p/PLS6nugESt9lJXt7UEXhQTyofeSrqQfPO3 DISCRETE MATHEMATICS: ruclips.net/p/PLS6nugESt9lLeVTXWMD_NXNVAKAC8RYDg #cseacademy #mastertheorem #daabyahmadsir #solvingrr #ahmadsir ...
Design a PDA for a^nb^n CFL Language | Push down automata | Automata theory | TOC
Просмотров 41Месяц назад
Design a PDA which Accept Language L= a^nb^n in TOC Push down Automata (PDA) Topics Discussed: 1. Introduction to pushdown automata(PDA) 2. Difference between pushdown automata and finite state machine 3. Stack in pushdown automata 4. Push and pop operations in stack 5. Components of pushdown automata THEORY OF COMPUTATION (TOC): ruclips.net/p/PLS6nugESt9lL2Ty58dt59vjwqID4k8v2H #cseacademy #toc...
Design a PDA for a^nb^mc^n CFL Language | Push down automata | Automata theory | TOC
Просмотров 36Месяц назад
Design a PDA which Accept Language L= a^nb^mc^n in TOC Push down Automata (PDA) Topics Discussed: 1. Introduction to pushdown automata(PDA) 2. Difference between pushdown automata and finite state machine 3. Stack in pushdown automata 4. Push and pop operations in stack 5. Components of pushdown automata THEORY OF COMPUTATION (TOC): ruclips.net/p/PLS6nugESt9lL2Ty58dt59vjwqID4k8v2H #cseacademy #...
Design a PDA for a^nb^nc^m CFL Language | Push down automata | Automata theory | TOC
Просмотров 90Месяц назад
Design a PDA which Accept Language L= a^nb^nc^m in TOC Push down Automata (PDA) Topics Discussed: 1. Introduction to pushdown automata(PDA) 2. Difference between pushdown automata and finite state machine 3. Stack in pushdown automata 4. Push and pop operations in stack 5. Components of pushdown automata THEORY OF COMPUTATION (TOC): ruclips.net/p/PLS6nugESt9lL2Ty58dt59vjwqID4k8v2H #cseacademy #...
Design a PDA for a^nb^nb^mc^mCFL Language | Push down automata | Automata theory | TOC
Просмотров 602 месяца назад
Design a PDA which Accept Language L= a^nb^nc^md^m in TOC Push down Automata (PDA) Topics Discussed: 1. Introduction to pushdown automata(PDA) 2. Difference between pushdown automata and finite state machine 3. Stack in pushdown automata 4. Push and pop operations in stack 5. Components of pushdown automata THEORY OF COMPUTATION (TOC): ruclips.net/p/PLS6nugESt9lL2Ty58dt59vjwqID4k8v2H #cseacadem...
Design a PDA for a^nb^mc^md^n CFL Language |Push down automata|TOC|Automata Theory
Просмотров 562 месяца назад
Design a PDA which Accept Language L= a^nb^nc^md^m in TOC Push down Automata (PDA) Topics Discussed: 1. Introduction to pushdown automata(PDA) 2. Difference between pushdown automata and finite state machine 3. Stack in pushdown automata 4. Push and pop operations in stack 5. Components of pushdown automata THEORY OF COMPUTATION (TOC): ruclips.net/p/PLS6nugESt9lL2Ty58dt59vjwqID4k8v2H #cseacadem...
Design a PDA for a^nb^nc^md^m CFL Language |Push down automata|TOC|Automata Theory
Просмотров 812 месяца назад
Design a PDA which Accept Language L= a^nb^nc^md^m in TOC Push down Automata (PDA) Topics Discussed: 1. Introduction to pushdown automata(PDA) 2. Difference between pushdown automata and finite state machine 3. Stack in pushdown automata 4. Push and pop operations in stack 5. Components of pushdown automata THEORY OF COMPUTATION (TOC): ruclips.net/p/PLS6nugESt9lL2Ty58dt59vjwqID4k8v2H #cseacadem...
Get Symbol Table,Literal Table,Base Table and Generate Machine Code in ALP | Assembler |Program-3
Просмотров 1692 месяца назад
Get Symbol Table,Literal Table,Base Table and Generate Machine Code in ALP | Assembler |Program-3
Get Symbol Table,Literal Table,Base Table and Generate Machine Code in ALP | Assembler |Program-2
Просмотров 1722 месяца назад
Get Symbol Table,Literal Table,Base Table and Generate Machine Code in ALP | Assembler |Program-2
Get Symbol Table,Literal Table,Base Table and Generate Machine Code in ALP | Assembler |Program-1
Просмотров 4392 месяца назад
Get Symbol Table,Literal Table,Base Table and Generate Machine Code in ALP | Assembler |Program-1
Macro in System Programming| find MDT , MNT , ALA and Expanded Source Program fragment -2
Просмотров 1,3 тыс.2 месяца назад
Macro in System Programming| find MDT , MNT , ALA and Expanded Source Program fragment -2
Macro in System Programming|Macro processor | Definition| Solved example
Просмотров 2682 месяца назад
Macro in System Programming|Macro processor | Definition| Solved example
Design a pda which accept language L = a^nb^n in TOC | CFL | PDA | soled Example
Просмотров 3262 месяца назад
Design a pda which accept language L = a^nb^n in TOC | CFL | PDA | soled Example
Binary Search Tree in Data Structure | Construction of BST | solved Example
Просмотров 1483 месяца назад
Binary Search Tree in Data Structure | Construction of BST | solved Example
Combination in Discrete Mathematics|Permutation| Counting Technique| Solved Example
Просмотров 3033 месяца назад
Combination in Discrete Mathematics|Permutation| Counting Technique| Solved Example
Find Closed form of Sequences using Generating Function in Discrete Mathematics| solved Example-2
Просмотров 5553 месяца назад
Find Closed form of Sequences using Generating Function in Discrete Mathematics| solved Example-2
Find Closed form of Sequences using Generating Function in Discrete Mathematics| solved Example-1
Просмотров 6073 месяца назад
Find Closed form of Sequences using Generating Function in Discrete Mathematics| solved Example-1
How to solve Recurrence Relation in Discrete mathematics|Characteristics Roots|Solved Example-02
Просмотров 4513 месяца назад
How to solve Recurrence Relation in Discrete mathematics|Characteristics Roots|Solved Example-02
How to solve Recurrence Relation in Discrete mathematics|Characteristics Roots|Solved Example-01
Просмотров 6673 месяца назад
How to solve Recurrence Relation in Discrete mathematics|Characteristics Roots|Solved Example-01
Recurrence Relation in Discrete Mathematics| Characteristics Roots Method
Просмотров 3693 месяца назад
Recurrence Relation in Discrete Mathematics| Characteristics Roots Method
Design a Turing Machine (TM) to perform Proper subtraction of Unary Number |TOC| Solved Example
Просмотров 1393 месяца назад
Design a Turing Machine (TM) to perform Proper subtraction of Unary Number |TOC| Solved Example
Node Base in Graph Theory| Directed Graph | Reachability Set | Discreet Mathematics
Просмотров 1,5 тыс.3 месяца назад
Node Base in Graph Theory| Directed Graph | Reachability Set | Discreet Mathematics
Draw Directed Tree | Binary Tree | Discrete Mathematics | Solved Example
Просмотров 9113 месяца назад
Draw Directed Tree | Binary Tree | Discrete Mathematics | Solved Example
Binary Tree from Relation|Draw Rooted Tree in Discrete Mathematics| Example -2
Просмотров 3483 месяца назад
Binary Tree from Relation|Draw Rooted Tree in Discrete Mathematics| Example -2
Binary Tree from Relation|Draw Rooted Tree in Discrete Mathematics| Example -1
Просмотров 3463 месяца назад
Binary Tree from Relation|Draw Rooted Tree in Discrete Mathematics| Example -1
thanks
Thank you very much Sir! You teach far better than my Professor at the University.
NICE EXPLANATION
best SIR
multi talented solute ur work
nice Sir ! first time understand the MASTER THEORM
Sir i have seen many videos related to this topic but your video is the best
Thank you so much dear! Keep watching
Also share ur friends
Sir question nahi samajh me aa rha hai . convert the following NFA {p,q,r,s},{0,1},delta,p{p,s} into DFA where § is given by ... Sir please provide solution 🙏
§ Represented by Table (means Table bhe given hai jo transition ( § ) ko represent kr raha hai)
@@CSEACADEMY1 ok sir
amazing !
nice Sir! solute ur teacing
Thank you so much dear!
Sabse aasan tarike se samjhaen Hain . thanks sir.❤
Welcome
Amazing explanation.
Good
Sir please start python lecture series as soon as possible ❤
Sure
Nice explanation Sir ji🎉
Nice 🎉
Nice Sir
Nice
Sir didn't understood the sequence thing at last.
Can i use this for 4x4 (keys and frequency) rather than (key and probability)?
Yes use it
Nice video sir. Loved it
Very nice explanation Loved it Understood the concept of how to solve any recurrence relation. Tomorrow is my exam and now I understood the concept. Thank you
Thank you so much dear! n All the best for your exam!
sir iska aur videos upload kr dijiai
thank you sir
Most welcome
thanks sir
thank you sir
you are the best teacher for toc
Thank you so much!
thank you so much sir apki vjh se mujhai toc smjh ane lga
Welcome dear!
thank you so much sir app bhut acha smjhatai hai
sir you are an amazing teacher please do not stop giving us such valuable lectures😇
Thank you so much dear!
You have a real talent for storytelling. 📖
Nice!
Amazing video 🎉
Nice!❤
good explanation
Thank you so much dear! Keep watching, subscribe the channel n also share ur friends
thanks a lot
Thanks vai
SIR NOTES KA LINK ?
t.me/ahmadsircse
Nice sir!
❤❤❤❤❤❤❤❤
you are a dump guy. The purpose of your videos should be to give concepts not to give "Jughaad"
❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤
is this trick applicable for 3x3 matrix problem ?
Yes
❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤
❤❤❤❤❤
Nice explanation
Excellent sir 💯
sir one doubt , int MDT for MACRO XYZ , MEND after nested macro but in previous video of MACRO you said MEND write before writing Nested MACRO definition , which one is correct? where to write MEND for MACRO before nested MACRO definition after its definition ?
In MDT table normally start with Macro name upto MEND but in case inner macro write everything thing upto MEND
@@CSEACADEMY1 means Nested MACRO will be inside MDT of Outer macro ?
@@kunalpandhare6375 yes
@@CSEACADEMY1 Thank You So Much Sir, on 15 i have exam, your videos are really helpful 🫡
❤❤❤❤❤ good luck
Sir plz upload next video