Posts

Showing posts from April 10, 2020

New Post

Nash Equilibrium In Game Theory ~xRay Pixy

Image
 Video Link  CLICK HERE... Learn Nash Equilibrium In Game Theory Step-By-Step Using Examples. Video Chapters: Nash Equilibrium  00:00 Introduction 00:19 Topics Covered 00:33 Nash Equilibrium  01:55 Example 1  02:30 Example 2 04:46 Game Core Elements 06:41 Types of Game Strategies 06:55  Prisoner’s Dilemma  07:17  Prisoner’s Dilemma Example 3 09:16 Dominated Strategy  10:56 Applications 11:34 Conclusion The Nash Equilibrium is a concept in game theory that describes a situation where no player can benefit by changing their strategy while the other players keep their strategies unchanged.  No player can increase their payoff by changing their choice alone while others keep theirs the same. Example : If Chrysler, Ford, and GM each choose their production levels so that no company can make more money by changing their choice, it’s a Nash Equilibrium Prisoner’s Dilemma : Two criminals are arrested and interrogated separately. Each has two ...

Operator Precedence & Operators Associativity

Image
Operator Precedence  in C++ Operator precedence determines which operator is performed first in an expression with more than one operator.  In C++, we use the Operator Precedence rule to solve the problem like this- (5 + 8 * 3). Precedence Determine the order in which the operators are performed. An operator with Higher Precedence is evaluated before the operator with lower precedence. https://youtu.be/5_3IN1NHa9k Video: Operator Precedence in C++ Operator Associativity Chart Multiply (*) operator has higher precedence than addition operator (+). Questions for your Practice 1.) 7 + 3 * 2                                             Ans.  13 2.) 10 + 20 * 30 Ans.  610 3.) 100 / 10 * 10 Ans.  100 4.) 100 + 200 / 10 – 3 * 10                Ans.  90 5. ) 10 /...

Loop Optimization Techniques in Compiler Design

Image
LOOP Optimization Rules Every Programmer must follow before the optimization of any source code.  1.) Loop transformation technique.  2.) Help to reduce optimize the execution time of a program. 3.) Basically, remove the iterations.  4.) Loop Unrolling increase the program speed by eliminating loop control instructions. Loop Optimization is a Machine Independent Technique. We can do Code optimization in the loops of the program. In loop optimization, code optimization is performed on inner loops. Methods of Loop Optimization 1.) Code Motion 2.) Loop Invariant Method 3.) Loop Jamming 4.) Loop Unrolling 5.) Strength Reduction Code Motion: Technique that moves the code outside the loop. Loop Jamming: Combining two or more loops in a single loop. Code Strength: Expressions that consumes CPU time and memory should replace with cheaper expressions. Replace Expensive Expressions (i.e., *) with cheaper ones (i.e., +) Vidoe:  ht...
More posts