Eat Sleep Code Repeat
Projective Geometry in Computer vision is an important concept. Projective geometry provides the mathematical formalism to describe the geometry of cameras and associated transformations, enable the manipulations of 2D projections of 3D objects. The definition of Projective Geometry in Wikipedia given HERE. Just like an English Grammar has First, Second and Third Person Perspectives, Computer … Read more
In order to design a good database Functional Dependencies in Database is an important concept. In order to ensure the integrity of data and a good performance of a database functional dependencies plays an important role. Definition of Functional Dependency on Wikipedia HERE. Suppose we have a relation in database where there are only two … Read more
In today’s post, we will learn how to make a Relational model from ER Diagram. ER diagram is just a conceptual picture of a database (Definition of ER Diagram HERE). It is one of the important tasks of the programmer to convert that diagram into tables while coding a database. Let’s say we have to … Read more
Conceptual Database Design with ER Model is one of the most important topic in Databases. Whenever a programmer wants to develop a database the ER Model is the basic thing he starts with. ER Model Def. ER Model shows relations between the objects/entities in a database. Wikipedia definition of ER Model HERE. There are three … Read more
In a Divide and Conquer Paradigm we divide the bigger problem into smaller sub problems and call the function recursively to solve the sub problems. Divide and Conquer method is more appropriate for those problems that have polynomial time solutions. Some of the Divide and Conquer Algorithms are Insertion sort, bubble sort, etc. Read this … Read more
In this post we are going to talk about Directed Acyclic Graphs Examples and Topological order in a graph. Directed Acyclic Graphs? Def. A Directed Acyclic Graph is is a directed Graph which contain no directed cycles. Definition of Directed Graphs HERE. Lemma. If a graph is Directed Acyclic then G has a node with no … Read more
Strong Connectivity is a thing we use only in directed graphs. Definition of Directed Graphs HERE Def Nodes a and b in a graph are mutually reachable if there is both a path from a to b and also a path from b to a. If all the nodes in the graph are mutually reachable … Read more
Before defining What is Edge Detection in Computer Vision? Let’s first define what is a Digital Image? A Digital Image is the representation of a continuous image f(x,y) by a 2-D array of discrete samples. Wikipedia definition of a Digital Image HERE Have you ever thought how the size of an image is calculated? The … Read more
It appears in a lot of Machine Learning interviews that, What is the KNN algorithm in Machine Learning? Today we are going to discuss it in depth. Read the full post to get a basic understanding of the KNN algorithm. Suppose we have a test Input X and we have to classify this X into … Read more
Today we are going out to Sort Numbers in Python without sort Function. There is a similar Kata in Codewars to Sort only odd Numbers without sort Function in Python. The link of the similar Kata (sorting only odd numbers) is given HERE Task: You will be given an array of numbers. You have to sort the … Read more