Gray Code | Binary to Gray Code and that to Binary Conversion

Binary to gray code conversion

     1. The M.S.B. of the gray code will be exactly equal to the first bit of the given binary number.

 

     2. Now the second bit of the code will be exclusive-or of the first and second bit of the given binary number, i.e if both the bits are same the result will be 0 and if they are different the result will be 1. 

     3. The third bit of gray code will be equal to the exclusive-or of the second and third bit of the given binary number. Thus the Binary to gray code conversion goes on. One example given below can make your idea clear on this type of conversion. 

Get Notes..

Computer Generation

We have study history subject in our school days in those time history was common for all student but in college level its get divided on behalf of time like Ancient, Middle and Modern history. The Topic computer generation is also dividing on time. We read what type of hardware was used on time to time in computers .So Generation is computer history based on hardware. There are five generation

First Computer

There is no easy answer to this question because of all the different classifications of computers. The first mechanical computer created by Charles Babbage doesn't really resemble what most would consider a computer today. Therefore, this document has been created with a listing of each of the computer firsts starting with the Difference Engine and leading up to the types of computers we use today. Keep in mind those early inventions that helped lead up to the computer such as the abacus, calculator, and tablet machines are not accounted for in this document.

Graph Tutorial

Bipartite Graph

A Graph G is divided into two finite Set U,V such that each vertex of U is connected to each vertex of V in  such a manner where no vertex is adjacent of same, i.e. U set vertex will not connected of any other vertex of U.

In bipartite graph it is necessary that each vertex must be connect with different color otherwise graph is not bipartite

Complete bipartite graph

In regular bipartite graph G(U,V) ,each Vertex U(n) and V(n) connected each other 

A complete bipartite graph is a graph whose vertices can be partitioned into two subsets V1 and V2 such that no edge has both endpoints in the same subset, and every possible edge that could connect vertices in different subsets is part of the graph. That is, it is a bipartite graph (V1, V2, E) such that for every two vertices v1  V1 and v2 V2, v1v2 is an edge in E

Database Model

Hierarchical  

A hierarchical database model is a data model in which the data is organized into a tree-like structure. The structure allows representing information using parent/child relationships: each parent can have many children, but each child has only one parent (also known as a 1-to-many relationship). All attributes of a specific record are listed under an entity type.

Example of a hierarchical model

In a database an entity type is the equivalent of a table. Each individual record is represented as a row, and each attribute as a column. Entity types are related to each other using 1:N mappings, also known as one-to-many relationships. This model is recognized as the first database model created by IBM in the 1960s.