 Overview 

     Variations: Monte Carlo and Las Vegas Algorithms 

     Usefulness & Limitations 

     1 real life example where randomized algorithm is  

      used 

 Boruvka’s MST Algorithm 

     Overview of MST 

     Overview of Boruvka’s algorithm 

     Specialty of the algorithm 

     Overview of parallel implementation of the  

       algorithm 

     Overview of NPC Problems 

     Overview of TSP (Travelling Salesman Problem) 

     An approximate solution to the problem 

     Performance of the solution based on test data 

     Overview of Noetic Science 

     Overview of Mind Computing 

     Some exemplary scientific projects proving mind  

      power 

     Feasibility of Mind Computing 

     Overview of RNG 

     Usefulness of RNG 

     Hardware and Software solutions 

     Performance analysis of the solutions 

     Overview of DP 

     Overview of Knapsack Problem 

     Variations of Knapsack Problem 

     DP solution and its performance 

     Approximate s0lution for the NPC version 

     Overview 

     Details of Steps 

     Usefulness 

     Cryptanalysis of Skipjack 

                                                             Thank You