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
Articles by Diksha Patro
Page 3 of 10
How to define a part of the text in an alternate voice or mood using HTML5?
In this article, we will discuss how to define a part of the text in an alternate voice or mood using HTML5. HTML5 provides a range of tags that allow web developers to structure the content of a web page in a more meaningful way. One important aspect of this is being able to emphasize certain words or phrases, like making them italic or bold. This helps the content look better and be easier to read for users. Approaches We have two different approaches to defining a part of the text in an alternate voice or mood using HTML5 including ...
Read MoreNumerical on LRU, FIFO
In this article, we will explore LRU(Least Recently Used Algorithm) and FIFO(First In First Out) numerical, their flowcharts and their use cases as well. Least Recently Used Algorithm Popular page replacement algorithms used in operating systems and cache management systems include the LRU (Least Recently Used) technique. By replacing the least recently used page in a cache when a new page needs to be loaded, it seeks to reduce the amount of page faults. Example − Let's assume we have a cache with a capacity of 3 pages and a sequence of page requests: 2, 3, 1, 4, 2, 1, 5, ...
Read MoreNumerical on Disk
Numerics are essential for understanding the complex facets of disc storage since they offer a hands-on, practical method to grasp fundamental ideas. We may investigate how disc capacity, performance, and utilization are estimated by delving into numerical examples, helping us to understand the fundamentals of efficient storage management. Example − Think of a cloud service provider, for instance, that provides its customers with access to file storage. The service provider stores customer files, including documents, photos, and multimedia content, on disc storage. The disc storage system is built to support high data throughput and offers reliable file access. In this article, ...
Read MoreNucleus Operating System
The Nucleus is an RTOS that was developed by Mentor Graphics Embedded Software Division, a Siemens Business that supports 32-bit and 64-bit embedded system platforms. The Nucleus operating system (OS) is mainly intended for use in real-time embedded systems in medical, aerospace, industrial, consumer, and Internet of Things (IoT) applications. In this article, we will explore Nucleus Operating System, its components, and features as well. Nucleus Operating System The Nucleus OS was initially introduced in 1993. The latest version, 3.x, offers various features, including 64-bit support, safety certification, power management, and a process model. It also supports heterogeneous computing ...
Read MoreNTFS Junction Points
The NTFS file system used by Windows operating systems includes NTFS (New Technology File System) junction points. In essence, junction points are a kind of symbolic link that lets you join one directory to another inside the same file system. In this article, we will explore NTFS Junction Points, it’s architecture diagram, their use cases, example code in C#, and their benefits as well. NTFS Junction Points The main purpose of junction points is to build directory-level links, which let you change the path's destination to another location on the same volume. This can be helpful in a variety ...
Read MoreLock Variable Synchronization Mechanism
Concurrent programming employs the notion of lock variable synchronization to make sure that several threads or processes can safely access shared resources without coming into race situations or inconsistent data. It offers a mechanism to manage the order in which threads or processes are executed, enabling them to have exclusive access to shared resources when required. In this article, we will explore the mechanism of lock variable synchronization, use cases, and an example code snippet in C as well. Lock Variable Synchronization Utilizing a shared variable, often known as a lock or mutex (short for mutual exclusion), to ...
Read MoreNot Recently Used (NRU) page replacement algorithm
Operating systems use the Not Recently Used (NRU) page replacement algorithm as a fundamental page replacement tactic to control memory. Its major goal is to locate and remove pages from memory that haven't been accessed in a while. In this article, we will be discussing the NRU page replacement algorithm, the classes in it, the steps involved, the use cases, and also its benefits. The NRU algorithm Classes Based on their usage or reference bit, pages are divided into four classes by the NRU algorithm − Class 0 − Since they were loaded into memory, pages cannot be referenced (accessed) ...
Read MoreNamed Pipe or FIFO with example C program
Introduction Named pipes, also referred to as FIFOs (First In, First Out), constitute essential IPC systems in software systems. They offer a quick and effective method for successfully transferring information between processes. Specialized kinds of files known as named pipes serve as a means for interaction among unconnected procedures that operate on an identical structure as well as on separate ones. First-in, first-out (FIFO) named pipes ensure that information composed to the line by a single procedure is read from the pipe by another course in the identical order. Therefore, They are particularly advantageous when processes must communicate independently without ...
Read MoreN-Step-SCAN disk scheduling
Introduction The disc scheduling method N-Step-SCAN (also called N-Step-LOOK) determines the sequence whereby disc requests for input/output are handled. It is a development for the SCAN (Elevator) method, which functions by moving the disc arm in a particular direction and responding to demands there as long as it receives no more inquiries or requests from that guidance, at which point it switches directions. The N-Step-SCAN algorithm adds an option, N, that specifies how many requests must be handled in a particular direction beforehand transforming. N-Step-SCAN support N demands in a particular direction, irrespective of whether or not there are still ...
Read MoreN process Peterson algorithm
Introduction A traditional approach to solving the critical section issue in programming simultaneously for both procedures is Peterson's algorithm. But since you said "N" processes, I presume you mean an altered Peterson's method that can manage over two procedures. Mutual exclusion is guaranteed by the initial Peterson's method for two distinct processes, yet it can't be immediately expanded to support N methods. Lamport's bakery algorithm, for example, is a deviation and an extra period of Peterson's algorithm which may be applied to N processes. The N process Peterson Algorithm Peterson's algorithm which can cope with N processes is called ...
Read More