Huffman Compression and Huffman Tree

Hi folks

We used ASCII code for represent character inside of computer. there are two types of ASCII 7 bit and 8bit.8bit ASCII is known as extended ASCII.

In 7 bit ASCII if represent text  following manner 

ABCDACDCAB     (Each character takes 7 bit)

Total Bit   = No. of character * 7

Total Bit   =  10*7

Total Bit   = 70

If consider frequency of character then we’ll find

Frequency of A = 3

Frequency of B = 2

Frequency of C = 3

Frequency of D = 2

In 7 bit ASCII we can represent 127 characters but it’s not always necessary that each character appeared in string as in our example string. There is only four characters which are repeated  so if we used 3 bit for code then we’ll save some bit

i.e. A=000

      B=001

      C=100

      D=101

Now total bit required 10*3 which is 30 instead of 70.

Database Key

Database is a repository of any organization data. It takes data save it and provides many types of sophisticated services for record insert, update, delete, backup and many more. Here I am interested to explain many types of key.

Database : Database is a collection of related table.

Table : A Table is a collection of related records.

Record : A record is a collection of related fields

Field : A fields or attribute is a smallest individual unit of table.

NULL : NULL is a systematic approach treat blank value which is not available current but might be appear in future.

Key : Key is use to identified a record between records set.

How to make Gmail Signature and confidential Message

What is Gmail Signature

A signature is a bit of text (such as your contact information or a favorite quote) that’s automatically inserted at the bottom of every message you send. Here's a sample signature:

Functional Dependency and Normalization

Purpose of Normalization

Normalization is a technique for producing a set of suitable relations that support the data requirements of an enterprise.

Characteristics of a suitable set of relations include:

- the minimal number of attributes necessary to support the data requirements of the enterprise;
- attributes with a close logical relationship are found in the same relation;
- minimal redundancy with each attribute represented only once with the important exception of attributes that form all or part of foreign keys.