Skip to content

Category Archives: GATE CS

The Recursion Tree Method is a way of solving recurrence relations. In this method, a recurrence relation is converted into recursive trees. Each node represents… Read More
LR parsers :It is an efficient bottom up syntax analysis technique that can be used to parse large classes of  context-free grammar  is called LR(k)… Read More
Overview :An approximation algorithm is a way of dealing with NP-completeness for an optimization problem. The goal of the approximation algorithm is to come close… Read More
Introduction :A Graph G consists of vertices & edges. The edges are lines or arcs that connect any two nodes in the graph, and the… Read More
1. Heap :A heap is a tree based data structure in which tree should be almost complete. It is of two types i.e. max and… Read More
Introduction :The most basic form of logic is propositional logic. Propositions, which have no variables, are the only assertions that are considered. Because there are… Read More
Fully Functional Dependency :If X and Y are an attribute set of a relation , Y is fully functional dependent on X, if Y is… Read More
LALR Parser :LALR Parser is lookahead LR parser. It is  the most powerful parser which can handle large classes of grammar. The size of CLR… Read More
A compiler is a software program that transforms a program or code written in a high-level programming language into a low-level machine-readable language. When we… Read More
RISC processors :They are processors that use a small instruction set and simple addressing mode so that their instructions can be executed much faster within… Read More
Prerequisite : LR Parser. The LR parser is an efficient bottom up syntax analysis technique that can be used to large class of context-free grammar.This… Read More
Prerequisite : LR Parser LR parsers :It is an efficient bottom up syntax analysis technique that can be used to parse a large classes of… Read More
In this article, we will discuss the overview of the Graph and will focus on a scenario wherein a weighted graph, Is zero allowed as… Read More
Surds :Let x is a rational number(i.e. can be expressed in p/q form where q ≠ 0) and n is any positive integer such that… Read More
Introduction :As instructions are a part of the program which are stored inside the memory, so every time the processor requires to execute an instruction,… Read More

Start Your Coding Journey Now!