Sequential Circuits
All the digital systems designed and analyzed so far are based upon combinational logic, where the output levels at any
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.
CONVERSION AMONG RADICES
Convert from Decimal to Any Base Let’s think about what you do to obtain each digit. As an example, let’s
Read MoreRadix Number System
The numeric system we use daily is the decimal system, but this system is not convenient for machines since the
Read MoreTuring Machine
Turing Machine recognizes the recursive enumerable language. Turing Machine is more powerful than any other automata such as finite automata,
Read More
What is Computer Organization and Architecture? – Computer Science
Computer science is an ever-evolving field that offers candidates academic success and a bright career, provided they build a strong
Read MoreGreibach Normal Form (GNF)
A CFG G = (V, T, P, S) is in Greibach Normal Form (GNF) if its all productions are of
Read MoreChomsky Normal Form (CNF)
Any context free grammar G = (V, T, S, P) with λ ∉ L(G) has an equivalent grammar in Chomsky
Read MoreLeftmost and Rightmost Derivations
In CFGs that are not linear, a derivation way involve sentential forms with more than one variable. In such cases,
Read MoreContext Free Grammar
Definition A context-free grammar G is a quadruple (V, T, P, S), where: V is the set of non-terminals. (Non-terminals
Read MoreRegular Expressions
One day of describing regular language of via the notation of regular expressions. This notation involves a combination of strings
Read MoreDETERMINISTIC FINITE AUTOMATA (DFA)
If for every input symbol of an alphabet there is an exactly one transition from every state of finite automata
Read MoreFinite Automata
Finite Automata Finite Automaton (FA) is also called as Finite State machine (FSM). Finite Automaton has no temporary storage hence
Read MoreSyntax Directed Definition
A syntax directed definition is a context-free grammar in which Each grammar symbol X is associated with two finite sets
Read MoreSyntax Analysis Parser
In the syntax analysis phase, a compiler verifies whether or not the tokens generated by the lexical analyzer are grouped
Read MoreTokens, Patterns and Lexemes
A token is a pair consisting of a token name and an optional attribute value. The token name is an
Read MoreLexical Analysis
As the first phase of compiler, the main task of the lexical analyzer is to read the input characters of
Read MoreCompiler Program
Compiler A compiler is a program that reads a program written in one language the source language-and translates into an
Read MoreBinary Trees and Types
Binary Tree A binary tree is the one where each node has atmost 2 children. A binary tree is a
Read More