Tree Traversals of a Forest
The tree traversals of a forest may be defined as the tree traversals of its corresponding binary tree. Routines for
Read More
Computer Science & Information Technology
GATE CSE Free Resources by MADE EASY – Notes, Papers & Expert Guidance
Get ready for GATE CSE with MADE EASY’s free resources. Access comprehensive notes, previous years’ question papers, and expert strategies to boost your preparation and succeed in Computer Science Engineering.
What is an operating system and its types?
Computer science is one of the most ever-evolving engineering disciplines that has seen rapid advancements, new technologies, and innovations. Computer
Read MoreTree – Abstract Data Type | MADE EASY
A Tree is a data structure similar to linked lists but instead of each node pointing simply to the next
Read MoreQueue and Its Operations
“A queue is an ordered list in which all insertions are done from one end called REAR and deletions are
Read MoreRecursion and Recursive Function
The stack is used to store and restore the recursive function and its argument(s). (i) Tail recursion (ii) Non-tail recursion
Read MoreSIMPLE REPRESENTATION OF A STACK
Given a stack S = (a[1], a[2],… a[n]) then we say that a1 is the bottom most element and element
Read MoreStack and Its Operations
“A stack is an ordered list in which all insertions and deletions are made at one end, called the top.”
Read MoreFILE ALLOCATION METHODS
The main problem is how to allocate space to a file so that disk space is utilized effectively and file
Read MoreFile Management System
File management system is a set of software modules. It provides services to the user and application programs concerning files.
Read MorePage Replacement in Operating Systems Explained
When there is a page fault, the referenced page must be loaded. If there is no available frame in memory
Read MorePage Faults in Operating Systems
Each page table entry has a valid bit; it indicates whether the corresponding page is currently in memory. If the
Read MoreVirtual Memory
Virtual memory is the separation of user logical memory from physical memory. This technique is implemented using both hardware and
Read MoreTwo Process Software Solution in OS Synchronization
Lock variable Entry section I Load Ri, m[lock] II. Comp Ri , #0 III. JNZ to step IIV. IVStore m[lock],
Read MoreConditions for Solving the Critical Section Problem
(i) Mutual Exclusion: No two processes may be simultaneously present inside the critical section at any point of time. To
Read More
Graph Searching: DFS and BFS Algorithms Explained
When we characterize the running time of a graph algorithm on a given graph G = (V, E), we usually
Read MoreCritical Section and Race Condition
Critical Section: The portion of program text where the shared variables or shared resources will be placed. Race Condition: It
Read MoreSynchronization
Threads (or processes) are concurrent if they exist at the same time. They are asynchronous if they need to synchronize
Read MoreKruskal Algorithm
Let G(V, E) be a connected, weighted graph. Kruskal’s algorithm is used to find a minimum-cost spanning tree (MCST) of
Read MoreUnderstanding Pseudocode
Line 1 performs the usual initialization of d and π values and line 2 initializes the set S to the
Read More