MADE EASY Study Material | Free ESE, GATE & Engineering Notes

What are Analog Circuits?

Electronics and Communication Engineering What are Analog Circuits? Analog Circuits form one of the fundamental pillars of Electronics and Electrical

Highway Engineering is a core discipline of Civil Engineering that covers the planning, design, construction, operation, and maintenance of roads

All the digital systems designed and analyzed so far are based upon combinational logic, where the output levels at any

SCR is the oldest and first member of the thyristor family. It is called SCR because, silicon is used for

Convert from Decimal to Any Base Let’s think about what you do to obtain each digit. As an example, let’s

The numeric system we use daily is the decimal system, but this system is not convenient for machines since the

Turing Machine recognizes the recursive enumerable language. Turing Machine is more powerful than any other automata such as finite automata,

Strength of Material – CE (Civil Engineering) Strength of material is a branch of applied mechanics that deals with the

Computer science is an ever-evolving field that offers candidates academic success and a bright career, provided they build a strong

A CFG G = (V, T, P, S) is in Greibach Normal Form (GNF) if its all productions are of

Any context free grammar G = (V, T, S, P) with λ ∉ L(G) has an equivalent grammar in Chomsky

In CFGs that are not linear, a derivation way involve sentential forms with more than one variable. In such cases,

Definition A context-free grammar G is a quadruple (V, T, P, S), where: V is the set of non-terminals. (Non-terminals

One day of describing regular language of via the notation of regular expressions. This notation involves a combination of strings

Electrical Engineering What is Power Systems? Among all forms of energy, electrical energy holds the highest importance because it can

If for every input symbol of an alphabet there is an exactly one transition from every state of finite automata

Finite Automata Finite Automaton (FA) is also called as Finite State machine (FSM). Finite Automaton has no temporary storage hence

A syntax directed definition is a context-free grammar in which Each grammar symbol X is associated with two finite sets

LL(1) Parsing means that the grammar allows a deterministic parser that operates from left to right, produces leftmost derivation, using