Full Adder

Introduction Full adder is a combinational circuit that performs arithmetic addition of three bits. Full adder takes 3 input and produces 2 outputs. Let x, y, z be the inputs and S ( sum ), C ( carry ) be the outputs. Why we need only 2 outputs? The maximum value that can be obtained …

Full Adder Read More »

Infix to Prefix

In this article, we will discuss how to convert infix expression to prefix expression using stack. Infix Expression: Infix expressions are in form Operand Operator Operand. Example, a + b. Prefix Expression: Prefix expressions are in form Operator Operand Operand. Example, + a b. For example, Input Prefix Expression: A + ( B * C …

Infix to Prefix Read More »

CYK Algorithm

Cocke Younger Kasami ( CYK ) algorithm is a parsing algorithm for context-free grammar. CYK algorithm only operates on context-free grammar which is in CNF ( Chomsky Normal Form ). We must convert the context-free grammar to CNF before applying CYK algorithm. CYK algorithm is a bottom-up parsing approach. It is based on the dynamic …

CYK Algorithm Read More »

Set Associative Cache

Definition Set Associative Cache Mapping is a combination of direct mapping and associative cache mapping. In set-associative cache mapping, the cache is divided into multiple sets. Each set contains one or more lines. Each block in the main memory is direct-mapped to a particular set in the cache. But as we mentioned above, each set …

Set Associative Cache Read More »