Skip to content

Category Archives: GATE CS

A compiler is a piece of software that translates high-level programming language source code into machine code. It translates code written in one programming language… Read More
Pre-requisites:  States of a Process in Operating Systems,  Two-State Process Model in Operating System In this article, we’ll be discussing a three-state process model in… Read More
Prerequisite: Thread in Operating System Thread Id is a long positive integer that is created when the thread was created. During the entire lifecycle of… Read More
The handle is the substring that matches the body of a production whose reduction represents one step along with the reverse of a Rightmost derivation.… Read More
Tokens and terminals are similar words and are often used interchangeably. But there is a conceptual difference between both terms, the differences are discussed in… Read More
Paging is a concept for storage management in operating systems that retrieve processes from secondary storage and store them in main memory as pages. The… Read More
User Mode: When a Program is booted up on an Operating system let’s say windows, then it launches the program in user mode. And when… Read More
Directory implementation in the operating system can be done using Singly Linked List and Hash table. The efficiency, reliability, and performance of a file system… Read More
Pre-requisites:  States of a Process in Operating Systems Two-State Process Model in Operating System A process is a program under execution that consists of a… Read More
Recursion and induction belong to the branch of Mathematics, these terms are used interchangeably. But there are some differences between these terms.  Recursion is a… Read More
Binary Decision Diagram (BDD) is an effective way to represent the Switching function. It is a Data-Structure used to represent a Boolean Function and can… Read More
Pre-requisite: States of a Process in Operating Systems The process in an operating system passes from different states starting from its formation to its completion.… Read More
Prerequisite: Designing Finite Automata DFA (Deterministic Finite Automata or Acceptor) is a finite state machine that accepts or rejects strings of symbols. DFA accepts the… Read More
Code Optimization Technique is an approach to enhance the performance of the code by either eliminating or rearranging the code lines. Code Optimization techniques are… Read More
Prerequisite : Rings  Ring Homomorphism :A set  with any two binary operations on set   let denoted by  and  is called ring denoted as  , if  is abelian group, and  is semigroup,… Read More

Start Your Coding Journey Now!