Skip to content

Category Archives: GATE CS

Mathematical proof is an argument we give logically to validate a mathematical statement. In order to validate a statement, we consider two things: A statement… Read More
Tuple Relational Calculus is a non-procedural query language unlike relational algebra. Tuple Calculus provides only the description of the query but it does not provide… Read More
Probability refers to the extent of occurrence of events. When an event occurs like throwing a ball, picking a card from deck, etc., then the… Read More
Design a deterministic finite automata(DFA) for accepting the language L =For creating DFA for language, L = { a^n b^m ; n+m=even } use elementary… Read More
Caches are the faster memories that are built to deal with the Processor-Memory gap in data read operation, i.e. the time difference in a data… Read More
Prerequisite – Three address code in Compiler Loop optimization is the phase after the Intermediate Code Generation. The main intention of this phase is to… Read More
1. Independent Sets – A set of vertices I is called independent set if no two vertices in set I are adjacent to each other… Read More
RC5 is a symmetric key block encryption algorithm designed by Ron Rivest in 1994. It is notable for being simple, fast (on account of using… Read More
Prerequisite – Pushdown automata, Pushdown automata acceptance by final state Problem – Design a non deterministic PDA for accepting the language L = { |… Read More
Prerequisite – Pushdown automata, Pushdown automata acceptance by final state  Problem – Design a non deterministic PDA for accepting the language L = {[Tex]b^{2m}   [/Tex]: m>=1},… Read More
Prerequisite – Pushdown automata, Pushdown automata acceptance by final state  Problem – Design a non deterministic PDA for accepting the language L = {[Tex]b^n  [/Tex]| n>=1},… Read More
Prerequisite – Pushdown automata, Pushdown automata acceptance by final state Problem – Design a non deterministic PDA for accepting the language L = { |… Read More
SEQUENCE: It is a set of numbers in a definite order according to some definite rule (or rules). Each number of the set is called… Read More
Prerequisite – Pushdown automata, Pushdown automata acceptance by final state  Problem – – Design a non deterministic PDA for accepting the language L = {[Tex]b^m  [/Tex]|… Read More
A ring counter is a typical application of the Shift register. The ring counter is almost the same as the shift counter. The only change… Read More

Start Your Coding Journey Now!