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 by Diksha Patro
99 articles
mindepth and maxdepth in Linux find() command for limiting search to a specific directory
The find command in Linux is used to search for files and directories within a directory structure. The mindepth and maxdepth options allow you to control the search depth, limiting results to specific directory levels. mindepth specifies the minimum depth level from which the search should start, while maxdepth defines the maximum depth level the search should reach. These options help you target specific areas within complex directory hierarchies. Understanding Depth Levels Maxdepth − Limits how deep the search goes into subdirectories. A depth of 0 means only the starting directory itself, 1 includes immediate subdirectories, and so ...
Read MoreMove cmd command
The move command in Microsoft Windows Command Prompt is a powerful utility for relocating files and folders from one location to another. This built-in command provides an efficient way to organize and manage your file system directly from the command line interface. The basic syntax of the move command follows this pattern: the command itself, followed by the source file or directory path, and then the destination path. When executed, it transfers the specified file or folder to the new location, removing it from the original position. How It Works The move command operates by transferring files ...
Read MoreMS-DOS Operating System
MS-DOS (Microsoft Disk Operating System) is a command-line operating system developed by Microsoft that first launched in 1981. It quickly became the dominant OS for IBM-compatible personal computers throughout the 1980s and early 1990s, serving as the foundation for the personal computing revolution. Unlike modern operating systems with graphical interfaces, MS-DOS uses a command-line interface (CLI) where users interact with the system by typing text commands at a prompt. This simple approach made it ideal for the limited hardware capabilities of early personal computers while providing essential file management, disk operations, and program execution capabilities. MS-DOS Architecture ...
Read MoreMultilevel Feedback Queue Scheduling (MLFQ) CPU Scheduling
Multilevel Feedback Queue (MLFQ) is a CPU scheduling algorithm that maintains multiple ready queues, each with different priority levels and time quantum values. New processes start at the highest priority queue, and based on their behavior, they may be promoted or demoted between queues. This adaptive approach balances the needs of both interactive and CPU-intensive processes. Multilevel Feedback Queue Structure Queue 0 (Highest Priority) Time Quantum: 1 Queue 1 (Medium Priority) ...
Read MoreMultiprocessor and Multicore Organization
There are two methods for creating systems of computers with multiple processors or processor cores: multiprocessor organization and multicore organization. Both strategies aim to boost a computer's processing power by enabling it to handle several tasks simultaneously. Several separate processors linked by a communication network make up a multiprocessor system. Each processor can carry out a unique set of instructions and has separate local memory. The throughput of the entire system can be increased by these processors working on several tasks concurrently. In contrast, multicore systems achieve similar goals using multiple cores within a single processor chip. What ...
Read MoreMutual exclusion in a distributed system
Mutual exclusion in distributed systems is a fundamental principle that prevents concurrent processes or nodes from simultaneously accessing shared resources or critical sections. When multiple processes attempt to access the same resource concurrently, it can lead to race conditions, data corruption, and system inconsistencies. Unlike centralized systems, distributed systems lack shared memory and face challenges such as network delays, communication failures, and node failures. These factors make implementing mutual exclusion significantly more complex, requiring specialized algorithms and protocols to ensure proper coordination between distributed nodes. Approaches to Mutual Exclusion There are two main approaches to achieving mutual ...
Read MoreN process Peterson algorithm
The N-process Peterson algorithm addresses the critical section problem for multiple processes, extending beyond Peterson's original two-process solution. While Peterson's classic algorithm handles mutual exclusion between two processes, scaling it to N processes requires more sophisticated approaches like Lamport's Bakery Algorithm. How the N-Process Algorithm Works The N-process extension uses a ticket-based system where processes obtain numbered tickets to determine their order of access to the critical section. Here's how it operates: Each process wanting to enter the critical section gets a unique ticket number by incrementing a shared counter The process sets a "choosing" flag ...
Read MoreNot Recently Used (NRU) page replacement algorithm
The Not Recently Used (NRU) page replacement algorithm is a fundamental memory management technique used by operating systems to efficiently manage page replacement in virtual memory systems. Its primary goal is to identify and remove pages from memory that have not been accessed recently, making room for new pages when physical memory becomes full. How NRU Algorithm Works NRU uses two hardware bits associated with each page − a reference bit (R) and a modified bit (M). The reference bit is set when the page is accessed (read or written), and the modified bit is set when the ...
Read MoreLongest Remaining Time First (LRTF) CPU Scheduling Program
Longest Remaining Time First (LRTF) is a preemptive CPU scheduling algorithm that selects the process with the longest remaining burst time to execute next. Unlike Shortest Remaining Time First (SRTF), LRTF prioritizes processes that will take the most time to complete, making it a variant of the Longest Job First (LJF) algorithm. How LRTF Works The scheduler maintains a ready queue and continuously selects the process with the maximum remaining execution time. When a new process arrives, the scheduler compares its burst time with the currently executing process and may preempt if the new process has a longer ...
Read MoreN-Step-SCAN disk scheduling
N-Step-SCAN (also called N-Step-LOOK) is a disk scheduling algorithm that improves upon the traditional SCAN algorithm by introducing a parameter N that limits the number of requests processed in one direction before changing direction. Unlike SCAN, which continues moving in one direction until no more requests exist in that direction, N-Step-SCAN processes exactly N requests before reversing direction. This approach provides better control over disk arm movement and can reduce starvation compared to pure SCAN scheduling. How N-Step-SCAN Works The algorithm operates by maintaining the current disk arm position and processing requests in batches of size N ...
Read More