Article Categories
- All Categories
-
Data Structure
-
Networking
-
RDBMS
-
Operating System
-
Java
-
MS Excel
-
iOS
-
HTML
-
CSS
-
Android
-
Python
-
C Programming
-
C++
-
C#
-
MongoDB
-
MySQL
-
Javascript
-
PHP
-
Economics & Finance
Data Structure Articles
Page 84 of 164
Extracting last element of a Priority Queue without traversing
Introduction The Priority Queue in C++ is not similar to the normal Queue in the data structure, it has one difference: all its elements have priorities. We can extract its elements by traversing in the Queue. But, here in this tutorial, we are trying a method for extracting the last element of the Priority Queue without traversing. Let’s start… What is Priority Queue? In data structure, the abstract data type is the priority queue. It is a queue where all its elements have some associated priorities. All its elements are removed based on their priorities. Higher priority data are ...
Read MoreCan we use Simple Queue instead of Priority queue to implement Dijkstra's Algorithm?
Introduction Dijkstra’s Algorithm is used to find the shortest possible distance between two objects. To implement this algorithm we mostly use Priority Queue. In this tutorial, we will find the answer to whether can we use a simple queue to implement Dijkstra’s algorithm instead of a Priority Queue. What is a Priority Queue and A Queue? A queue is a linear array of data. It represents the Queue of real life. A simple Queue uses FIFO (First In First Out) approach for its deQueue and enQueue operations. A priority Queue is a type of Queue that deQueue its elements with ...
Read MoreDifference Between Array-Based Queue and List-Based Queue
Introduction A queue is a linear data structure that inserts and removes queue elements in a particular order. We can implement a queue in C++ by using arrays and a linked list. Both queue implementations have their benefits and uses. In this tutorial, we will differentiate the array-based Queues and List Based Queues. What is a Queue? A Queue is a series of elements that uses the FIFO principle for the insertion and deletion of its elements. A queue in Computer Science resembles the queue of real life where the one who enters first in the queue, will be removed ...
Read MoreCatalog Information Used in Cost Functions
Introduction When it comes to creating cost functions, catalog information is a crucial piece of data that can be used to optimize the performance of a model. In this article, we will explore how catalog information can be used in cost functions, the different types of catalog information available, and how to implement this in your code. What is Catalog Information? Catalog information refers to data that describes the products or items that are being sold by a company. This information can include things like product names, descriptions, pricing, and images. This data is often stored in a database and ...
Read MoreWhat are Structured and Unstructured Data?
Introduction In machine learning, the data and its quality are one of the most critical parameters affecting the performance and other parameters while training and deploying the machine learning model. It is assumed that if good-quality data is provided to a poorly performing machine learning algorithm, there is a high chance of better performance than ever from the algorithm and vice versa. In this article, we will discuss the two common types of data: structured and unstructured data. Here we will discuss their definitions and the core intuition behind them, followed by some other meaningful discussion. Knowledge about these key ...
Read MoreKth Largest Element in an Array
From a set of data, this algorithm will find the largest element to kth largest element of the array.This problem can be solved easily by sorting the array. We can sort them either in ascending order or in descending order. Solving it in descending order, we can get first k elements to find our result.Input and OutputInput: The elements of an array: {1, 23, 12, 9, 30, 2, 50, 63, 87, 12, 45, 21}, K = 4 Output: 4 largest elements are 87 63 50 45AlgorithmkthLargestElement(array, n, k)Input: The array, number of elements in the array, place k.Output: Display largest ...
Read MoreWhat Are Restricted Boltzmann Machines?
Introduction The Restricted Boltzmann Machine, developed by Geoffrey Hinton in 1985, is indeed a network of symmetrically interconnected systems that functions like neurons and makes stochastic judgments. After the Netflix Competition, where RBM walt is a type of unsupervised utilized as an information retrieval strategy to forecast ratings and reviews for movies and outperform most of its competition, this deep learning model gained a lot of notoriety. It is helpful for collaborative filtering, feature learning, dimensionality reduction, regression, classification, and feature learning. Let’s understand what are restricted Boltzmann Machines in depth. Restricted Boltzmann Machine Restricted Boltzmann Machines have stochastic two-layered ...
Read MoreDifference Between E-R Model and Relational Model in DBMS
In Database Management Systems (DBMS), the ways of designing databases at physical, logical, and view levels are referred to as Data Models. There are two popular data models− the ER Model and the Relational Model. The fundamental difference between the ER Model and the Relational Model is that the ER Model is an entityspecific data model, while the relational model is a table specific model. Read this article to find out more about the ER Model and the Relational Model and how they are different from each other. What is ER Model? ER Model, short for Entity Relationship Model, is ...
Read MoreDifference Between Direct and Indirect Addressing Modes
There are two types of addressing modes, namely, direct addressing mode and indirect addressing mode. In direct addressing mode, the actual address of the data is mentioned in the instructions itself. On the other hand, indirect addressing mode contains the effective address of the memory location where the actual address of the data resides. Read this article to find out more about direct and indirect addressing modes and how they are different from each other. Let's start with a basic introduction of these two types of addressing modes. What is Direct Addressing Mode? The Direct addressing mode is one that ...
Read MoreDifference Between Classification and Regression
In data mining, there are two major predication problems, namely, classification and regression. The most basic difference between classification and regression is that classification algorithms are used to analyze discrete values, whereas regression algorithms analyze continuous real values. The output variable must be either continuous nature or real value. The output variable in classification has to be a discrete value. In contrast, the output variable in regression must be either continuous in nature or real values. In this article, we will discuss all the important differences between classification and regression. Let's start with some basics of Classification and Regression so ...
Read More