06:36
Problem Class: P and NP
38:13
SL III Practical No 6 video 1
53:15
Unit No 1 Analysis of Recursive Algorithm and Homogeneous Equations
49:09
Unit No 2 Divide and Conquer 1
43:05
Unit No 2 Greedy Method 1
53:16
Unit No 2 Greedy Method 2 1
01:15:15
Unit No 2 Greedy Method 2
21:24
Unit No 2 Greedy Method Fractional Knapsack
12:06
Unit No 2 Greedy Method Job Sequencing
13:20
Unit No 3 Dynamic Programming
31:34
Unit No 3 Dynamic Programming TSP
02:55
Unit No 3 Dynamic Programming Multistage Graph 1
37:15
Unit No 3 Dynamic Programming Multistage Graph 2
10:09
Unit No 3 Dynamic Programming Knapsack Problem 1
11:28
Unit No 3 Dynamic Programming Knapsack Problem 2
08:43
Unit No 3 Dynamic Programming Knapsack Problem 3
18:33
Unit No 3 Dynamic Programming Knapsack Problem Example 1
19:44
Unit No 3 Dynamic Programming Knapsack Problem Example 2
29:32
Unit No 3 Dynamic Programming Bellman Ford Part 1
07:07
Unit No 3 Dynamic Programming Bellman Ford Part 2
26:29
Unit No 3 Dynamic Programming OBST Part 2
05:21
Unit No 3 Dynamic Programming OBST Part 3
08:18
Unit No 3 Dynamic Programming OBST Part 4
49:28
Unit No 4 Backtracking 0/1 Knapsack Problem
47:37
Unit No 4 Backtracking Bound Function and Hamiltonian Cycle
46:40
Unit No 4 Backtracking Algorithm Hamiltonian Cycle and Graph Coloring
50:11
Unit No 4 Backtracking Sum of Subsets
36:00
Unit No 5 Branch and Bound Introduction 1
40:21
Unit No 5 Branch and Bound Introduction 2
45:50
Unit No 5 Branch and Bound LC B&B
32:24
Unit No 5 Branch and Bound FIFO and LC Branch and Bound
53:56
Unit No 5 TSP using BB Part 1
53:49
Unit No 5 TSP using BB Part 2
32:24
Unit No 5 FIFO Branch and Bound Algorithm
11:56
Unit No 6 Nondeterministic Algorithm Part 1
25:55
Unit No 6 Nondeterministic Algorithm Part 2
24:56
Unit 6 Computational Complexity
08:29
Regular Expression Introduction
12:15
Rules of Regular Expression
09:55
Regular Expression Construction
09:28
Limitation of Finite State Machine
13:38
Mealy Machine Example 1
10:01
Mealy Machine Definition
09:59
Mealy Machine Example 2
14:51
Conversion of Mealy Machine to Moore Machine
12:37
Moore Machine Definition
10:55
Moore Machine Example
08:27
Moore Machine to Mealy Machine
22:48
Minimization of DFA
13:19
NFA to DFA Direct Method
11:55
NFA Vs DFA
32:42
Conversion of NFA to DFA
17:33
NFA with e moves
16:44
NFA with e moves to NFA without e moves
11:35
NFA without e moves to DFA
21:57
FSM for Divisibility by 3 Tester
11:04
Deterministic Finite Automata Example 1
10:12
Deterministic Finite Automata Example 2
09:48
Nondeterministic Finite Automata Introduction
10:20
Nondeterministic Finite Automata Example
X
About
Tags