06:20

Validation Testing in Software Testing with Example |SE|

06:56

White Box Testing in Software Testing with Example |SE|

06:37

Black Box Testing in Software Testing with Example |SE|

14:01

Testing Strategies for Conventional Software - The Spiral Model and Types Of Testing |SE|

21:36

Generation Of Rotating Magnetic Field with Derivation, Proof, and Diagrams |BEE|

06:43

A Strategic Approach to Software Testing in Software Engineering |SE|

06:30

Performance Characteristics Of DC Shunt Machine with Diagrams and Graphs |BEE|

11:45

Working Principle of DC Generator in Electrical Machines with Diagram and Example |BEE|

07:28

Working Principle of DC Motor in Electrical Machines with Diagram and Example |BEE|

17:08

Construction of a DC Machine - DC Generator and DC Motor with Diagram and Parts |BEE|

09:32

31 Design Models in Design Engineering with Example |SE|

22:19

30 Design Concepts - 9 Principles in Design Engineering with Example |SE|

07:03

28 Design Process in Design Engineering with Example |SE|

06:12

29 Design Quality in Design Engineering with Example |SE|

06:19

27 Requirement Management - Steps, Techniques in Software Engineering with Example |SE|

07:16

26 Requirement Validation - Steps, Techniques in Software Engineering with Example |SE|

08:08

25 Requirement Elicitation and Analysis - Steps, Techniques, and Example |SE|

08:56

24 Feasibility Study - Steps, Techniques in Software Engineering with Example |SE|

04:15

23 Requirement Engineering Process with Example |SE|

19:02

22 Software Requirement Specification Document with Example |SE|

15:05

Graph Traversal Techniques - Depth First Search and Breadth First Search with Example |L-27||DAA|

06:52

21 System Requirements and Interface Specification with Example |SE|

07:07

20 User Requirements - with Example in Software Engineering |SE|

12:23

Tree Traversal Techniques - Inorder, Preorder, and Postorder with Example |L-26||DAA|

13:21

Single Source Shortest Path Problem with Example using Greedy Method |L-25||DAA|

15:25

Minimum Cost Spanning Tree with Example using Greedy Method |L-25||DAA|

11:37

Knapsack Problem with Example using Greedy Method |L-25||DAA|

09:14

Job Sequencing with Deadlines with Example using Greedy Method |L-24||DAA|

28:40

Reliability Design with Example using Dynamic Programming |L-22||DAA|

05:01

Greedy Method - General Method, Example, Applications |L-23||DAA|

20:36

Travelling Salesperson Problem with Example using Dynamic Programming |L-21||DAA|

09:54

All Pairs Shortest Path Algorithm with Example using Dynamic Programming Part 2 |L-20||DAA|

14:21

All Pairs Shortest Path Algorithm with Example using Dynamic Programming Part 1 |L-19||DAA|

16:40

0/1 Knapsack Algorithm with Example using Dynamic Programming |L-18||DAA|

22:16

Optimal Binary Search Tree Algorithm with Example using Dynamic Programming Part 2 |L-17||DAA|

21:11

Optimal Binary Search Tree Algorithm with Example using Dynamic Programming Part 1 |L-16||DAA|

14:37

Thevenin's Theorem in BEE, Concept and Example Problem |Lec 12||BEE|

11:46

Norton's Theorem in BEE, Concept and Example Problem |Lec 11||BEE|

11:19

Superposition Theorem in BEE, Concept and Example Problem |Lec 10| |BEE|

09:55

9. Kirchhoff Current Law ( KCL ) - Example Problem - 2|BEE|

17:14

8. Kirchhoff Current Law ( KCL ) - Example Problem - 1 |BEE|

11:39

7. Kirchhoff Current Law ( KCL ) - Theory, Sign Conventions, Example Problem |BEE|

10:51

Dynamic Programming - General Method, Example, Applications |L-15||DAA|

12:31

Graph Coloring Problem in Back Tracking - Method, Example |L-14||DAA|

10:58

N Queens Problem in Back Tracking - Method, Example |L-12||DAA|

11:33

Sum Of Subsets Problem in Back Tracking - Method, Example |L-13||DAA|

05:48

Back Tracking - General Method, Example, Applications |L-11||DAA|

10:15

Disjoint Set Operations - Simple Union & Find Algorithms |L-10||DAA|

09:04

Strassen's Matrix Multiplication - Concept, Algorithm, Time Complexity |L-9||DAA|

17:45

Merge Sort Algorithm - Concept, Code, Example, Time Complexity |L-8||DAA|

17:11

Quick Sort Algorithm - Concept, Code, Example, Time Complexity |L-7||DAA|

18:24

Binary Search Algorithm - Concept, Code, Example, Time Complexity |L-6||DAA|

10:21

NP Hard and NP Complete Problems, Non Deterministic Algorithms |DAA|

14:58

0/1 Knapsack - with FIFO Branch & Bound with Example Part -2 |DAA|

20:41

0/1 Knapsack - with FIFO Branch & Bound with Example Part -1 |DAA|

13:40

0/1 Knapsack - with Least Cost Branch & Bound with Example Part -2 |DAA|

19:09

0/1 Knapsack - with Least Cost Branch & Bound with Example Part -1 |DAA|

08:51

Leadership Theories - skills & activities of great leader in OB |L 48||OB|

08:27

Process Of Behavioural Modification - Steps Involved in OB |L 47||OB|

10:21

Behavioural Performance Management - Reinforcement & Punishment |L 46||OB|