Posts

inheritance types and definition

Inheritance March 09, 2021  C++ Inheritance In C++, inheritance is a process in which one object acquires all the properties and behaviors of its parent object automatically. In such way, you can reuse, extend or modify the attributes and behaviors which are defined in other class. In C++, the class which inherits the members of another class is called derived class and the class whose members are inherited is called base class. The derived class is the specialized class for the base class. Advantage of C++ Inheritance Code reusability: Now you can reuse the members of your parent class. So, there is no need to define the member again. So less code is required in the class. Types Of Inheritance C++ supports five types of inheritance: Single inheritance Multiple inheritance Hierarchical inheritance  Multilevel inheritance Hybrid inheritance C++ Inheritance Derived Classes A Derived class is defined as the class derived from the base class. The Syntax of Derived class: class derived_clas

canonical form

Image
Canonical Forms :          Two dual canonicali  of min terms " and a "product of max terms."             The term "Sum of Products" (SoP or SOP) is widely used for the  canonical form  that is a dis junction (OR) of min terms.               The  SOP  (Sum of Product) and   POS  (Product of Sum) arethe methods for deducing a particular logic function. ...                      The prior difference between the  SOP and POS  is that the  SOP contains the OR of the multiple product terms. Conversely,  POS produces a logical expression comprised of the AND of the multiple OR terms.        SOP Vs POS       CANONICAL FORMS OF SUM OF PRODUCT :                 Canonical  SoP form  means  Canonical  form  of Sum of Products.  In this  form , each  product  term contains all literals. So, these  product  terms are nothing but the min terms.Hence,  canonical  SoP  form  is also called as  sum  of min terms  form .       CANONICAL FORM OF PRODUCT OF SUM          

Boolean algebra

Image
BOOLEAN ALGEBRA  Boolean algebra was introduced by  George Boole  in his first book  The Mathematical Analysis of Logic  (1847), and set forth more fully in his  An Investigation of the Laws of Thought  (1854). [2]  According to  Huntington , the term "Boolean algebra" was first suggested by  Sheffer  in 1913, [3]  although  Charles Sanders Peirce  gave the title "A Boolean Algebra with One Constant" to the first chapter of his "The Simplest Mathematics" in 1880. [4]  Boolean algebra has been fundamental in the development of  digital electronics , and is provided for in all modern programming languages. It is also used in  set theory  and  statistics . [5 Truth Tables for the Laws of Boolean Definition of Boolean algebra:   Boolean algebra is a six-tuple consisting of a set A, equipped with two binary operations ∧ (called "meet" or "and"), ∨ (called "join" or "or"), a unary operation ¬ (called "comp

LOGIC GATES

Image
Logic Gates.   Logic gates Digital systems are said to be constructed by using logic gates. These gates are the AND, OR, NOT, NAND, NOR, EXOR and EXNOR gate Basic Gates:           *AND GATE           *OR GATE           *NOT GATE     Universal Gates:           *NOR GATE           *NAND GATE Exclusive Gates:           *EXOR GATE           *EXNOR GATE AND GATE: Logic diagram Truth Table The  AND gate  is a basic digital  logic gate  that implements  logical conjunction  - it behaves according to the  truth table  to the right. A HIGH output (1) results only if all the inputs to the AND gate are HIGH (1). If none or not all inputs to the AND gate are HIGH, LOW output results. The function can be extended to any number of inputs.       OR Gate: Logic diagram Truth Table     The  OR gate  is a digital  logic gate  that implements  logical disjunction  – it behaves according to the adjacent  truth table . A HIGH output (1) results if one or both the inputs to the gate are HIGH (1). If neither

BINARY ARTHMETIC

Image
Binary Arithmetic Binary arithmetic is used in digital systems mainly because the numbers (decimal and floating-point numbers) are stored in binary format in most computer systems. All arithmetic operations such as addition, subtraction, multiplication, and division are done in binary representation of numbers. It is necessary to understand the binary number representation to figure out binary arithmetic in digital computers.      * Binary Addition      * Binary Subtraction      * Binary Multiplication      * Binary Division Binary Addition:           It is a key for binary subtraction, multiplication, division. There are four rules of binary addition. fourth case, a binary addition is creating a sum of (1 + 1 = 10) i.e. 0 is written in the given column and a carry of 1 over to the next column. Example − Addition Binary Subtraction: Subtraction and Borrow, these two words will be used very frequently for the binary subtraction. There are four rules of binary subtraction. Ex

NUMBER CONVERSION

Image
Number conversion Binary conversion to other conversion Binary to decimal binary to hexa decimal binary to octal  decimal to other conversion Decimal to binary .  decimal to hexa decimal  decimal to octal  octal to other conversion  Octal to decimal   octal to binary octal to hexa decimal  hexa decimal to other conversion  Hexa decimal to decimal hexa decimal to binary hexa decimal to octal

madurai

Image