## Introduction to Big O Notation in Data Structure

Updated on 21-Dec-2022 17:56:23
Introduction One of the most essential mathematical notations in computer science for determining an algorithm's effectiveness is the Big O notation. The length of time, memory, other resources, as well as a change in input size required to run an algorithm can all be used to evaluate how effective it is. Data structure's Big O Notation provides information about an algorithm's performance under various conditions. In other words, it provides the worst-case complexity or upper-bound runtime of an algorithm. Big O Notation in Data Structure A change in input size can affect how well an algorithm performs. Asymptotic notations, such ... Read More

## What is the difference between Business Intelligence and Predictive Analytics?

Updated on 19-Nov-2021 07:10:22

## Difference Between Bubble Sort and Selection Sort

Updated on 23-Mar-2021 08:34:49
In this post, we will understand the difference between Bubble Sort and Selection SortBubble SortIt is a simple sorting algorithm.It iterates through the list, and compares adjacent pairs of elements to sort them.Based on the adjacent elements, swaps are made.It is efficient in comparison to selection sort.It is slower in comparison to selection sort.It uses item exchanging to swap elements.The elements are repeatedly swapped until all the elements are in the right order.Following is the Bubble Sort AlgorithmAlgorithmbegin BubbleSort(list)    for all elements of list       if list[i] > list[i+1]          swap(list[i], list[i+1]) end if ... Read More

## Explain the Difference Between Linear and Non-linear Data Structure

Updated on 23-Mar-2021 07:11:07
In this post, we will understand the difference between linear data structure and non-linear data structure.Linear Data StructureThe elements of such a structure are arranged sequentially.Every element can be accessed by traversing through the linear structure.All the elements of a linear structure are at a single level, i.e there is no hierarchy.They are easy to implement and use.They utilize more memory, hence they are not very memory-friendly.The time complexity of linear data structure usually increases when the size of the structure increases.Examples include- list, array, stackThe below shows an example of a list in Python.my_list = [45, 42, 12, 34, ... Read More

## Difference Between Top-down and Bottom-up Parsing

Updated on 02-Mar-2021 05:20:41
In this post, we will understand the differences between top down and bottom-up parsing −Top-down parsing and bottom-up parsing are different techniques to parse a tree to reach the beginning of the tree. This can be done in two different methods, which have been discussed below.Top-down ParsingIt is a parsing technique that looks at the highest level of the parse tree initially, and then works its way down to the parse tree.It does this using the rules of grammar.It uses left most derivation.This parsing method tries to determine the left most derivations for an input string.Here, the parsing is done ... Read More

## Difference Between Procedural and Non-procedural Language

Updated on 07-Dec-2022 06:00:56
Both Procedural and Non-procedural Languages are widely used in the development of applications and other computer software. Both these types of languages have different approaches on the basis of which we can differentiate them. In this article, we will discuss the important differences between procedural and non-procedural programming languages. Let's start with some basics of procedural and nonprocedural language. What is a Procedural Language? Procedural languages are command-driven or statement-oriented programming languages. A program written using a procedural programming language includes a sequence of statements, and the implementation of each statement generates the interpreter to modify the value of one ... Read More

## Difference Between Aggregation and Association

Updated on 02-Mar-2021 05:19:14
In this post, we will understand the differences between aggregation and association.AssociationIt can be understood as an organization of people that have a common purpose. It also indicates that they consist of a formal structure. It represents a binary relationship between the two objects that describe some kind of activity.It is a relationship between multiple objects.An example would be how consuming healthy food is related not just to a healthy weight, but to good skin, good hair, strength and being active.Association is a relationship between two classes where one class uses the other class.It is not flexible in natureThis indicates ... Read More

## Difference Between Full Virtualization and Paravirtualization

Updated on 02-Mar-2021 05:17:13
In this post, we will understand the differences between full virtualization and paravirtualizationFull VirtualizationThis process was introduced by IBM in the year 1966. It is considered to be the first software solution for server virtualization. It uses binary translation and a direct approach method.In this, the guest OS is fully isolated using the virtual machine from the virtualization layer and hardware.Examples of full virtualization include Microsoft and Parallels systems.The virtual machine permits the execution of the instructions in addition to running the unmodified OS in a completely isolated method.It is considered to be less secure in comparison to paravirtualization.It uses ... Read More

## Difference Between Flood-fill and Boundary-fill Algorithm

Updated on 02-Mar-2021 05:11:06
In this post, we will understand the differences between flood fill algorithm and boundary fill algorithm. They are area-filling algorithms, and they can be differentiated based on whether a random pixel has the region's original colour or not.Flood-fill algorithmIt is also known as seed fill algorithm.It calculates the area that is connected to a given node with respect to a multi-dimensional array.It works by filling up or recolouring a specific area that contains different colours in the inside part, and hence, the boundary of the image.It is represented by a picture that has a neighbourhood which has borders and has ... Read More

## Difference Between Greedy Method and Dynamic Programming

Updated on 02-Mar-2021 05:04:41
In this post, we will understand the differences between the greedy algorithm and dynamic programming methods.Greedy algorithmIt is an algorithmic paradigm that builds up on a solution in parts, step by step. The next step is chosen such that it gives the most obvious and immediate benefit.Problems that involve choosing local optimal values will help in choosing the global optimal values/solution to the problem. Such ate the problems associated with greedy algorithm.There is no surety that a greedy algorithm would lead to an optimal solution.An optimal choice is made at every stage of the problem, i.e the local optimal solution.It ... Read More