Posts

Showing posts from July 22, 2021

New Post

Bermuda Triangle Optimizer

Image
VIDEO LINK The Bermuda Triangle Optimizer (BTO) is a nature-inspired algorithm that simulates a gravity-like pull in the Bermuda Triangle to find optimal solutions. Learn Bermuda Triangle Optimizer (BTO) Step-By-Step using Examples. Video Chapters: Bermuda Triangle Optimizer (BTO) 00:00 Introduction 00:34 About the Bermuda Triangle 02:06 Bermuda Triangle Optimizer  05:44 BTO STEPS 09:30 BTO Advantages 10:17 BTO Limitations 10:42 BTO Applications 11:07 Conclusion Bermuda Triangle Optimizer || Step-By-Step || ~xRay Pixy Video Link:  https://youtu.be/bBnsd7BBttg #optimization #algorithm #metaheuristic #robotics #deeplearning #ArtificialIntelligence #MachineLearning #computervision #research #projects #thesis #Python #optimizationproblem #optimizationalgorithms 

Chemical Reaction Optimization Algorithm step-by-step with example ~xRay...

Image
Chemical Reaction Optimization Algorithm Chemical Reaction Optimization algorithm is a population-based metaheuristic algorithm. Chemical Reaction Optimization algorithm is inspired by Chemical reactions. Chemical Reaction Optimization algorithm is developed by Albert Y.S. Lam and Victor O.K. Li. In this algorithm, Molecular structure (sum all characteristics) is used to compute the solution. Chemical Reaction Optimization algorithm is used to solve optimization problems. Chemistry Basic Fundamentals:  Atom / Molecule / Chemical Bonding / Molecular Structure / Molecule Energy / Chemical Reations/ Elementary Reactions  Atom:   According to Dalton (in 1808), an atom is the smallest part of an element that exists as the smallest entity. 3 important fundamental particles of an atom are Proton, Electron, and Neutron. For Example Oxygen (O), Nitrogen (N), Hydrogen (H), etc. Molecule: A molecule  is composed of 2 or more atoms held together by chemical bonds. The molec...

BARC Previous Year Question Papers Solved

  BARC Computer Science and Information Technology Previous Year Question  Solved  1.) The worst-case time complexity of Quick Sort is: O(nlogn) O(n) O(n^2) None Answer: O(n^2) Explanation : Quicksort is based on the divide and conquers paradigm. Quicksort expected average running time is O(nlogn) 2.) In C programming operator '&' is used to represent: Logical AND Bitwise AND Logical OR Bitwise OR Answer: B itwise AND Explanation : logical AND (&&), bitwise AND (&), Logical OR (||), Bitwise OR(|) 3.) When a static variable is initialized: Answer: First time when a loop is executed. Explanation : Static variables only execute once. 4.) What is the maximum height of the AVL tree with 7 nodes? Assume that height of the tree with a single node is 0. Answer:  3 . 5.) Data structure used in the recursive algorithm is: Answer:  Stack
More posts