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
Articles on Trending Technologies
Technical articles with clear explanations and examples
Difference Between SEO and SMO
Both SEO and SMO are the methods used for driving traffic to a website, but they are quite different from each other. SEO (Search Engine Optimization) is a technique to enhance traffic on a site on the search engine result pages, whereas SMO (Social Media Optimization) is a technique to make the social media content visible to more users. Read this article to learn more about SEO and SMO and how they are different from each other. What is SEO? SEO is a technique to increase the ranking of a website on the search engine result pages. SEO is basically ...
Read MoreDifference between SEO and SEM
SEO and SEM both are the techniques to increase the visibility and traffic on a website, however both are quite different from each other. The most basic difference between the two is that SEO focuses on enhancing the organic traffic on a website, while SEM uses different strategies to increase traffic like SEO, paid promotion, etc. Read this article to learn more about SEO and SEM and how they are different from each other. What is Search Engine Optimization (SEO)? Search Engine Optimization (SEO) is a way to increase the visibility of a website by nonpaid forms of advertising. It ...
Read MoreDifference Between Semaphore and Mutex
In operating systems, semaphore and mutex are two kernel resources that are used to provide synchronization services. A semaphore is an integer variable, while a mutex is an object. Read this article to learn more about semaphore and mutex and how they are different from each other. What is Semaphore? Semaphore is a signalling mechanism. It is basically an integer variable. A semaphore uses two operations, namely wait and signal for process synchronization. Therefore, the wait and signal operations can modify a semaphore. There are two types of semaphores namely, Counting Semaphore and Binary Semaphore. Counting Semaphore is the type ...
Read MoreDifference between Row oriented and column oriented database
There are two ways of organizing data in a DBMS − one is row-oriented database and another is column-oriented database. The basic difference between the two is that a row-oriented database stores the data tables by rows, whereas a column-oriented database stores the data tables by columns. Read this article to learn more about row-oriented database and column-oriented database and how they are different from each other. What is Row-Oriented Database? A Roworiented database is a traditional database like Oracle, MySQL, etc. It stores data tables by rows and the common method of storing a table is to serialize each ...
Read MoreReverse a Stack using Queue
Introduction Both Queue and Stack are linear data structures and are used to store data. Stack uses the LIFO principle to insert and delete its elements. A Queue uses the FIFO principle. In this tutorial, we will learn how to reverse a stack using Queue. Reversing means the last element of the Stack comes to first place and so on. What is Stack? The stack in the data structure is inspired by the stack in real life. It uses LIFO (Last In First Out) logic, which means the element that enters last in the Stack will be removed first. In ...
Read MoreHow to Manage Full Circular Queue Event in C++?
Introduction Circular Queue is an improvement over a linear queue and it was introduced to address the memory wastage problem in the linear queue. A circular queue uses the FIFO principle for the insertion and removal of the elements from it. In this tutorial, we will discuss the operations of the circular queue and how to manage it. What is Circular Queue? A circular queue is another kind of queue in a data structure, whose front and rear ends are connected with each other. It is also known as Circular Buffer. Its operations are similar to the linear queue, so ...
Read MoreHow to implement size-limited Queue that holds last N elements in Java?
Introduction A queue is an interface in Java. It is used to insert elements at one end and remove them from another end. It uses the FIFO principle for its processing. The queue extends the Collection framework and is defined in the Java.util interface. In this tutorial, we will understand the implementation of size limited queue in Java. What is Size Limited Queue in Java? A size-limited queue is a queue with a fixed size of N. It cannot hold elements more than its size. If you try to push more data, it will remove elements from its front ...
Read MoreExtracting 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 MoreHow to Automatically Close Alerts using Twitter Bootstrap?
We can automatically close the Bootstrap Alert component by using the “close” method and “hide” class provided by Twitter bootstrap. Twitter Bootstrap Alert component is used to display an alert with a message to the user, often in response to a user action or an event. Approach 1: Using Close Method In this approach, we will use the “close” method provided by bootstrap to close the component, and we will use the setTimeout() browser API to achieve this after 5 seconds. Syntax $(alertComponent).alert(‘close’) Here, “alertComponent” is the Bootstrap Alert component, and we are calling the “close” method on this ...
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 More