Assignment problem || नियतन समस्या ||paper-3 ||Semester-1 || by Ritesh sir
52:43
Simplex method||Linear programming problem||part-2 ||Example of LPP solving by simplex ||Ritesh sir
34:24
Paper-3 ||Semester-1|| Assignment problem with modified matrix ||how do assign zeroes||Ritesh sir
33:48
Lec-25|Theorem 5.15.4|G is connected graph then G is bipartite iff G has no odd cycle|Ritesh sir
44:54
Class 10th Maths|Sankhiyki Class 10th Maths|Introduction|सांख्यिकी कक्षा10 गणित|माध्य, माध्यक, बहुलक
52:12
11 EM & GM 12Stat Part 2 Probability Ex 1 4 Sum 8;1;2Ex 1 5 Sum 2
17:22
Lec-26|G is simple graph with k connected components.Then no.of edges can’t exceed (n-k)(n-k+1)/2
47:40
unit 1 Matrices class 3 (SGBAU PATTERN) BSC 1 SEMESTER 1
30:37