Posts

Showing posts from July 22, 2021

New Post

Hidden Markov Model (HMM)

Image
Hidden Markov Model (HMM)  VIDEO LINK:  https://youtu.be/YIGCWNG8BIA A Hidden Markov Model (HMM) is a statistical model in which the system has hidden states that cannot be directly observed, but produce observable outputs. It is based on the Markov property, meaning the next state depends only on the current state. Video Chapters: HMM in Artificial Intelligence 00:00 Introduction 00:31 Statistical Model 00:54 HMM Examples 02:30 HMM 03:10 HMM Components 05:23 Viterbi Algorithm 06:23 HMM Applications 06:38 HMM Problems 07:28 HMM in Handwriting Recognition 11:20 Conclusion  HMM COMPONENTS A Hidden Markov Model (HMM) is a statistical model in which the system has hidden states that cannot be directly observed, but produce observable outputs. It is based on the Markov property, meaning the next state depends only on the current state. An HMM consists of states, observations, transition probabilities, emission probabilities, and initial probabilities. It is commonly used in a...

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