#2 Data Mining Functionalities |DM|

Dysfunctions Of Groups & Teams, Effective teamwork in OB |L 40||OB|

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

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

Teams in Modern Workspace - Functions & Types in OB |L 41||OB|

Job Design For High Performance - Techniques in OB |L 42||OB|

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

Empowerment - definition and Types of empowerment in OB |L 36||OB|

Goal Setting For High Performance - Techniques in OB |L 43||OB|

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

Branch and Bound - Method, Example, Applications|DAA|

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

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

Dynamics Of Informal Groups - Roles and Rules in Informal Groups|L 39||OB|

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

Quality Of Work Life, Work Life Balance - Methods, Benefits |L 44||OB|

Groups VS Teams, Types of Groups & Teams in OB |L 37||OB|

Nature Of Groups, Stages Of Group Formation in OB |L 38||OB|

Divide and Conquer Algorithm - General Method |Lec-5|DAA|

4. Asymptotic Notations - Big Oh, Omega, Theta, Little Oh Notation |DAA|

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

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

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

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

Power & Politics - Power and Types of power with examples in OB |L 35||OB|