Mth603 Final term preparation | current + Past paper |Lecture 19 to 45 formula's |subjective part
CS codecreation
Mth603 Final term preparation | current + Past paper |Lecture 19 to 45 formula's |subjective part
40:39
MTH603 Lectures 37-38: Runge-Kutta Method |vu short lecture |final term preparation
CS codecreation
MTH603 Lectures 37-38: Runge-Kutta Method |vu short lecture |final term preparation
31:37
MTH603 Lecture 36: Euler's Method |vu short lecture |final term preparation
CS codecreation
MTH603 Lecture 36: Euler's Method |vu short lecture |final term preparation
28:27
MTH603 Lecture 35: Taylor Series | ordinary differential equation | vu short lecture
CS codecreation
MTH603 Lecture 35: Taylor Series | ordinary differential equation | vu short lecture
26:18
MTH603 Lectures 33-34: Trapezoidal & Simpson's Rules Examples Solved | vu short lecture
CS codecreation
MTH603 Lectures 33-34: Trapezoidal & Simpson's Rules Examples Solved | vu short lecture
27:29
MTH603 Lectures 31-32: Trapezoidal Rule & Simpson's Rules 1/3 and Simpson's 3/8 Rule|short lectures
CS codecreation
MTH603 Lectures 31-32: Trapezoidal Rule & Simpson's Rules 1/3 and Simpson's 3/8 Rule|short lectures
20:53
MTH603 Lectures 29-30: Richardson Extrapolation Method|vu short lecture |final term preparation
CS codecreation
MTH603 Lectures 29-30: Richardson Extrapolation Method|vu short lecture |final term preparation
30:43
MTH603 Lecture 28: Differentiation using Difference Operators|final term preparation
CS codecreation
MTH603 Lecture 28: Differentiation using Difference Operators|final term preparation
11:51
MTH603 Lectures 26-27: Interpolation in Two Dimensions|final term preparation |vu short lecture
CS codecreation
MTH603 Lectures 26-27: Interpolation in Two Dimensions|final term preparation |vu short lecture
23:18
MTH603 Lectures 24-25: Divided Differences Explained with examples |vu short lecture
CS codecreation
MTH603 Lectures 24-25: Divided Differences Explained with examples |vu short lecture
21:58
MTH603 Lecture 23: Lagrange's Formula Explained and solved examples |final term preparation
CS codecreation
MTH603 Lecture 23: Lagrange's Formula Explained and solved examples |final term preparation
16:36
CS402 Lecture 39 and 40: CFG to CNG with examples |vu short lecture | final term preparation
CS codecreation
CS402 Lecture 39 and 40: CFG to CNG with examples |vu short lecture | final term preparation
24:40
CS402 Lecture 38: Pushdown Automata (PDA) Explained | vu short lecture
CS codecreation
CS402 Lecture 38: Pushdown Automata (PDA) Explained | vu short lecture
22:31
CS402 Lecture 37: Basics - Tape, Start, Accept, Reject, and Read| final term preparation
CS codecreation
CS402 Lecture 37: Basics - Tape, Start, Accept, Reject, and Read| final term preparation
18:13
CS402 Lecture 36: Chomsky Normal Form (CNF) Explained |vu short lecture |final term preparation
CS codecreation
CS402 Lecture 36: Chomsky Normal Form (CNF) Explained |vu short lecture |final term preparation
24:20
CS402 Lecture 35: Null and Unit Productions Explained | final term preparation in easy way
CS codecreation
CS402 Lecture 35: Null and Unit Productions Explained | final term preparation in easy way
26:11
CS402 Lecture 34: Palindrome and Total Language Tree Explained | final term preparation
CS codecreation
CS402 Lecture 34: Palindrome and Total Language Tree Explained | final term preparation
17:54
CS402 Lecture 33: Polish Notation Explained|vu short lecture | final term preparation
CS codecreation
CS402 Lecture 33: Polish Notation Explained|vu short lecture | final term preparation
26:36
CS402 Lecture 32: Context-Free Grammars (CFG) Examples | parsing tree
CS codecreation
CS402 Lecture 32: Context-Free Grammars (CFG) Examples | parsing tree
27:33
CS402 Lecture 31: Context-Free Grammars (CFG) Explained | vu short lecture
CS codecreation
CS402 Lecture 31: Context-Free Grammars (CFG) Explained | vu short lecture
24:03
CS621 Assignment 2 Solution: Parallel and distributed Computing Spring 2025|vu assignment solution
CS codecreation
CS621 Assignment 2 Solution: Parallel and distributed Computing Spring 2025|vu assignment solution
5:20
CS402 Assignment 2 Solution: Theory of Automata | Spring 2025| vs cs402 assignment solution
CS codecreation
CS402 Assignment 2 Solution: Theory of Automata | Spring 2025| vs cs402 assignment solution
7:37
CS302P Assignment 2 Solution | Spring 2025| vu cs302p correct assignment solution
CS codecreation
CS302P Assignment 2 Solution | Spring 2025| vu cs302p correct assignment solution
18:17
CS302 Assignment 2 Solution | Virtual University |Complete Solution with detail
CS codecreation
CS302 Assignment 2 Solution | Virtual University |Complete Solution with detail
12:47
CS304 Assignment 2 Solution: Object-Oriented Programming Spring 2025|vu cs304 assignment2 solution
CS codecreation
CS304 Assignment 2 Solution: Object-Oriented Programming Spring 2025|vu cs304 assignment2 solution
5:38
MTH603 Lectures 21-22: Newton's Forward and Backward Differences Formula|vu short lecture
CS codecreation
MTH603 Lectures 21-22: Newton's Forward and Backward Differences Formula|vu short lecture
25:47
CS304P Assignment 2 Solution: Object-Oriented Programming Practical | Spring 2025
CS codecreation
CS304P Assignment 2 Solution: Object-Oriented Programming Practical | Spring 2025
7:04
CS202 Assignment 2 Solution: Front-End Development Essentials | Spring 2025|vu assignment 2
CS codecreation
CS202 Assignment 2 Solution: Front-End Development Essentials | Spring 2025|vu assignment 2
6:22
MTH603 Lectures 19-20: Interpolation, Extrapolation, and Finite Differences Operators|vu lecture
CS codecreation
MTH603 Lectures 19-20: Interpolation, Extrapolation, and Finite Differences Operators|vu lecture
19:49
CS402 Lecture 29: Decidability Explained | Theory of Automata|vu short lecture
CS codecreation
CS402 Lecture 29: Decidability Explained | Theory of Automata|vu short lecture
22:41
How to Create a Microsoft Teams Account or Shift from Skype to MS Teams
CS codecreation
How to Create a Microsoft Teams Account or Shift from Skype to MS Teams
7:47
CS402 Lecture 28: Pseudo Theorem Explained | Theory of Automata
CS codecreation
CS402 Lecture 28: Pseudo Theorem Explained | Theory of Automata
26:34
CS201 Assignment #2 Solution & Cisco Certification Insights | Get Ahead in C++
CS codecreation
CS201 Assignment #2 Solution & Cisco Certification Insights | Get Ahead in C++
7:03
CS402 Lecture 27: Myhill-Nerode Theorem Explained | Regular Languages | vu short lecture
CS codecreation
CS402 Lecture 27: Myhill-Nerode Theorem Explained | Regular Languages | vu short lecture
19:59
CS402 Lecture 26: Pumping Lemma - A Powerful Tool for Proving Non-Regular Languages
CS codecreation
CS402 Lecture 26: Pumping Lemma - A Powerful Tool for Proving Non-Regular Languages
16:31
CS402 Theory of Automata |Lecture 25|vu short lecture for final term preparation
CS codecreation
CS402 Theory of Automata |Lecture 25|vu short lecture for final term preparation
34:37
CS202 Midterm  Preparation | Get Ready to Ace Your Exam! 💻|vu midterm exam
CS codecreation
CS202 Midterm  Preparation | Get Ready to Ace Your Exam! 💻|vu midterm exam
25:21
CS402 Midterm  Preparation | Get Ready to Ace Your Exam! 💻
CS codecreation
CS402 Midterm  Preparation | Get Ready to Ace Your Exam! 💻
3:53
CS302 Midterm Preparation | Study Smarter, Not Harder 📚
CS codecreation
CS302 Midterm Preparation | Study Smarter, Not Harder 📚
27:31
MTH603 Assignment #1 Solution | Complete Solution with Explanation
CS codecreation
MTH603 Assignment #1 Solution | Complete Solution with Explanation
11:27
MTH603, Assignment #1, Solution, Mathematics, Step-by-step solution 2025
CS codecreation
MTH603, Assignment #1, Solution, Mathematics, Step-by-step solution 2025
9:29
CS506 GDB Solution | Grand Discussion Board Solution"
CS codecreation
CS506 GDB Solution | Grand Discussion Board Solution"
4:34
MTH603 Assignment #1 Complete Solution | Easy to Understand
CS codecreation
MTH603 Assignment #1 Complete Solution | Easy to Understand
14:28
CS402 Assignment 1 Solution Spring 2025 | Complete Solution with Explanation
CS codecreation
CS402 Assignment 1 Solution Spring 2025 | Complete Solution with Explanation
10:41
CS302p Assignment 1 Solution Spring 2025 | Complete Solution with Explanation
CS codecreation
CS302p Assignment 1 Solution Spring 2025 | Complete Solution with Explanation
18:43
"CS302 Assignment 1 Solution Spring 2025 | Complete Solution with Explanation
CS codecreation
"CS302 Assignment 1 Solution Spring 2025 | Complete Solution with Explanation
12:51
CS202 Assignment 1 Solution Spring 2025 | Complete Solution with Explanation
CS codecreation
CS202 Assignment 1 Solution Spring 2025 | Complete Solution with Explanation
5:55
CS610 Assignment 1 Solution Spring 2025 | Complete Solution with Explanation
CS codecreation
CS610 Assignment 1 Solution Spring 2025 | Complete Solution with Explanation
12:08
CS506 Assignment 1 Solution Spring 2025 | Complete Solution with Explanation
CS codecreation
CS506 Assignment 1 Solution Spring 2025 | Complete Solution with Explanation
13:46
CS420 Assignment 1 Solution Spring 2025 | Complete Solution with Explanation
CS codecreation
CS420 Assignment 1 Solution Spring 2025 | Complete Solution with Explanation
5:48
CS601 Assignment 1 Solution Spring 2025 | Complete Solution with Explanation"
CS codecreation
CS601 Assignment 1 Solution Spring 2025 | Complete Solution with Explanation"
3:35
MTH603 Lecture 15: Eigen Value Problem | Numerical Analysis|vu short lecture
CS codecreation
MTH603 Lecture 15: Eigen Value Problem | Numerical Analysis|vu short lecture
15:17
"MTH603 Lecture 13: Relaxation Method for Solving Linear Systems | Numerical Analysis
CS codecreation
"MTH603 Lecture 13: Relaxation Method for Solving Linear Systems | Numerical Analysis
18:24
MTH603 Lecture 12: Gauss-Seidel Method for Solving Linear Systems | Numerical Analysis
CS codecreation
MTH603 Lecture 12: Gauss-Seidel Method for Solving Linear Systems | Numerical Analysis
18:08
MTH603 Lecture 11: Jacobi's Method for Solving Linear Systems | Numerical Analysis
CS codecreation
MTH603 Lecture 11: Jacobi's Method for Solving Linear Systems | Numerical Analysis
14:22
MTH603 Lecture 10: Gauss-Jordan Method for Solving Linear Systems |Crout method| Numerical Analysis
CS codecreation
MTH603 Lecture 10: Gauss-Jordan Method for Solving Linear Systems |Crout method| Numerical Analysis
16:34
MTH603 Lecture 9: Solution of Linear Systems of equations and Matrix inversion| Numerical Analysis
CS codecreation
MTH603 Lecture 9: Solution of Linear Systems of equations and Matrix inversion| Numerical Analysis
18:39
How to download handout & Books from LMS|vu handout & books download
CS codecreation
How to download handout & Books from LMS|vu handout & books download
2:10
MTH603 Lecture 8: Muller Method for Root Finding | Numerical Analysis|vu short lectures
CS codecreation
MTH603 Lecture 8: Muller Method for Root Finding | Numerical Analysis|vu short lectures
14:32
how to download ppt slides from LMS| how to Extract ppt slides download from vulms
CS codecreation
how to download ppt slides from LMS| how to Extract ppt slides download from vulms
1:45
MTH603 Lecture 7: Secant Method for Root Finding | Numerical Analysis
CS codecreation
MTH603 Lecture 7: Secant Method for Root Finding | Numerical Analysis
31:18
Course selection mistake |Common mistakes in course selection | disadvantages of wrong selection
CS codecreation
Course selection mistake |Common mistakes in course selection | disadvantages of wrong selection
4:54
Mth603 lecture #6 |Newton-Raphson Method for Root Finding |vu short lecture
CS codecreation
Mth603 lecture #6 |Newton-Raphson Method for Root Finding |vu short lecture
31:19
Mth603 lecture #5 |Method of Iteration for Solving Equations
CS codecreation
Mth603 lecture #5 |Method of Iteration for Solving Equations
24:18
Mth603 lecture #4 |Regula Falsi Method for Root Finding|
CS codecreation
Mth603 lecture #4 |Regula Falsi Method for Root Finding|
22:20
Mth603 lecture #3 | Bisection Method for Root Finding
CS codecreation
Mth603 lecture #3 | Bisection Method for Root Finding
19:05
Mth603 lecture #2| Types of errors |Numerical Analysis
CS codecreation
Mth603 lecture #2| Types of errors |Numerical Analysis
21:29
Mth603 lecture 1 | Numerical Analysis |introduction
CS codecreation
Mth603 lecture 1 | Numerical Analysis |introduction
21:07
CS402 lecture No 24 |Regular Language with examples
CS codecreation
CS402 lecture No 24 |Regular Language with examples
20:00
CS402 lecture 23 | Mealy Machine in term of sequential circuit
CS codecreation
CS402 lecture 23 | Mealy Machine in term of sequential circuit
17:52
CS402 lecture 22 Equivalent Machines| & Moore Equivalent to Mealy | Mealy equivalent to moore
CS codecreation
CS402 lecture 22 Equivalent Machines| & Moore Equivalent to Mealy | Mealy equivalent to moore
19:54
CS402 short lecture 21| Theory of Automata |Mealy Machine with Examples
CS codecreation
CS402 short lecture 21| Theory of Automata |Mealy Machine with Examples
20:13
CS402 Theory of Automata |Moore Machine | moore machine example
CS codecreation
CS402 Theory of Automata |Moore Machine | moore machine example
13:12
CS402 Lecture 19 |Memory Required to Recognize Language
CS codecreation
CS402 Lecture 19 |Memory Required to Recognize Language
16:19
NFA Corresponding to FAs Methods | Lecture 18 | CS402 | Theory of Automata"
CS codecreation
NFA Corresponding to FAs Methods | Lecture 18 | CS402 | Theory of Automata"
19:45
CS402 Lecture 17 NFA to FA & Union of 2 FAs
CS codecreation
CS402 Lecture 17 NFA to FA & Union of 2 FAs
16:58
CS402 Theory of Automata |Lecture 16 NFA to FA Conversion
CS codecreation
CS402 Theory of Automata |Lecture 16 NFA to FA Conversion
18:28
CS402 Lecture 15: NFA, DFA & Differences between NFA & DFA
CS codecreation
CS402 Lecture 15: NFA, DFA & Differences between NFA & DFA
17:50
CS402 Theory of Automata | Lecture 14: Kleene's Theorem (Part 3) - Closure of 2 FAs with Examples
CS codecreation
CS402 Theory of Automata | Lecture 14: Kleene's Theorem (Part 3) - Closure of 2 FAs with Examples
22:25
CS402 Lecture 13: Kleene's Theorem (Part 3, Method 2) - Concatenation of Two FAs
CS codecreation
CS402 Lecture 13: Kleene's Theorem (Part 3, Method 2) - Concatenation of Two FAs
22:13
CS402 Lecture 12: Kleene's Theorem (Part 1 & Part 3) with Examples
CS codecreation
CS402 Lecture 12: Kleene's Theorem (Part 1 & Part 3) with Examples
26:12
CS402 Theory of Automata | Lecture 11: Kleene's Theorem (Part 2) with Examples
CS codecreation
CS402 Theory of Automata | Lecture 11: Kleene's Theorem (Part 2) with Examples
17:45
CS402 Theory of Automata | Generalized Transition Graph (GTG) with Examples
CS codecreation
CS402 Theory of Automata | Generalized Transition Graph (GTG) with Examples
9:15
CS402 Theory of Automata | Lecture 8,9: Transition Graph (TG) & Generalized Transition Graph (GTG)"
CS codecreation
CS402 Theory of Automata | Lecture 8,9: Transition Graph (TG) & Generalized Transition Graph (GTG)"
22:26
CS402 Theory of Automata | Lecture 5,6: Even/Even Language, DFA & Transition Graph
CS codecreation
CS402 Theory of Automata | Lecture 5,6: Even/Even Language, DFA & Transition Graph
34:41
CS402 Theory of Automata lecture No 1| Introduction|vu short lecture 1
CS codecreation
CS402 Theory of Automata lecture No 1| Introduction|vu short lecture 1
18:53
CS402 Theory of Automata | Lecture 4,5: Even/Even Language, Regular Language & FA
CS codecreation
CS402 Theory of Automata | Lecture 4,5: Even/Even Language, Regular Language & FA
16:20
CS402 Theory of Automata | Lecture 2,3: Kleene Star & Kleene Plus with Examples
CS codecreation
CS402 Theory of Automata | Lecture 2,3: Kleene Star & Kleene Plus with Examples
20:33