### Conditional Probability – Application of Bayes’s Rule

In the previous lesson(Introduction to Bayes’ Rule), we saw how Bayes’ Rule can be applied to medical diagnosis. So in this chapter, we would see how Bayes’ Rule applies to …

Read More
Skip to content
# Computer Science

### Conditional Probability – Application of Bayes’s Rule

### Conditional Probability – Introduction to Bayes’ Rule

### Conditional Probability – Law of Total Probability

### Conditional Probability – Multiplication Law

### Conditional Probability – Basics

### Skip Lists and How They Work

### Perfect Hashing – How it Works

### Linear Probing, Quadratic Probing and Double Hashing

### Hashing With Open Addressing

### Universal Hashing – An Clear Explanation

In the previous lesson(Introduction to Bayes’ Rule), we saw how Bayes’ Rule can be applied to medical diagnosis. So in this chapter, we would see how Bayes’ Rule applies to …

Read MoreBayes Rule is based on Conditional Probability which we have been discussing in the previous 3 lessons. Conditional Probability – Basics Conditional Probability – Multiplication Law Conditional Probability – Law …

Read MoreIn this lesson, we would examine Law of Total Probability. We looked Multiplication Law previously. I would state this law. Then give an explanation. Finally we would apply it to …

Read MoreIn this short lesson we would understand how to use the Multiplication Law in Conditional Probability. You may want to review Basics of Conditional Probability. The Multiplication Law helps us …

Read MoreI assume you have a basic knowledge of Probability. For example, if there a 3 red ball and 2 blue balls in a bag and someone picks on ball at …

Read MoreA skip list is an efficient data structure that arranges the elements in a list in such a way that the search and update takes O(nlogn) time on average. n …

Read MoreThis is used when the keys stored in the hash table are expected to be static. In this case perfect hashing guarantees excellent average as well as worst-case performance. This …

Read MoreThe three terms that make up the title of this article are the three common techniques used for computing hash sequences. That is what are are going to cover today …

Read MoreToday we are going to examine Open Addressing. Recall that the two methods of resolving collisions in a hash table are: Hashing with Chaining Open-Addressing We would cover the following: Introduction …

Read MoreWe would cover the following topics on Universal Hashing Introduction to Universal Hashing What is Universal Hashing How Universal hashing Works The Theorem and Proof 1. Introduction to Universal …

Read More