Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
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 More
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 More
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 More
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 More
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 More
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 More
The queue is a linear data structure that inserts elements from the back and removes elements from the starting end of the queue. A priority queue is an extended version of the normal queue with priorities for each element. In this tutorial, we learn about the queue and priority queue in Java with individual implementation. Difference between Priority Queue and Queue in Java Area Priority Queue Queue Definition A priority queue is the queue in which each of its elements has some priorities. The elements from the queue are removed based on their priorities. Queue is ... Read More
We can control the print preview page’s header, footer, and margin just with the help of CSS, and even achieve the desired layout and orientation of the paged media. We will be using @page directive to achieve our results. While previewing a print page in the browser, we see some extra page information, like page title, page preview date and time, and the page number in the preview, all present in the page’s header and footer. We also see some extra margin applied to the page preview media. Syntax @media print { @page { ... Read More
We can create a printable webpage, and control the styling in the print preview of a page using the CSS media query print property, @media print. @media print is a CSS media query that allows us to add page styling to the print preview page of any webpage. Using this, we can create a printable webpage by specifying the “visibility” of an HTML element to “visible” or “hidden” under the given media query, We can also add any other styling we want to have in the print preview screen to the @media print query. Syntax @media print { ... Read More
We can create a basic pricing table using just HTML and CSS. A pricing table can be a useful feature to implement in different websites where the purchase of commodities is involved, for example, an e-commerce web application, or travel websites. Let’s learn to create a such table with the help of the example below − Example We will first create an HTML layout of the table in the following index.html file, and then add stylings to it. How to Create Pricing Table using HTML and CSS? ... Read More