SUMMARY

Here is my summary from this semester of what I have learned since first session until today.

•        Pointer in C has a name and a value associated with it, and when a variable is declared, a specific block of memory within the computer is allocated to hold the value (the size depends of the data type).

Pointer Concept.

 

So after the Introduction to Data Struct materials done, we continue to Linked List II materials, there are three general points we will discuss

1. Single Linked List

2. Double Linked List

3. Circular Doubly Linked List

Because Single and Double Linked List have been discuss before, we only discuss third point.

So circular Doubly Linked List is combination between Single and Double, also there is something new that each of Head or Tail is pointing to zero.

also there is a Insertion and Deletion:

Insertion:

There is nothing condition to pay attention when inserting.

Deletion:

There is four condition that we should attention with that node to be delete...

1. is the only Linked List

2. is the Head

3. is the Tail

4. is not a head or tail.

Linked List Concept:

Double Concept:

Circular Concept:

                                           

In this materials we will learn:

1. Stack Concept

2. Infix, Prefix, Postfix Notation

3. Queue Concept

4. Circular Concept

5. Priority Concept

Lets start:

1. Stack Concept.

So in this concept, the data stored in ordered manner. so lets say you have so many different plate, and you want to stored it in cabinets for plates, unfortunately the cabinets for plates is very small, so the solution is you stuck all the plate by insert one by one to the place.

so when you want to take the plate, than the last plate you put on, will be the first plate you take. or ussually its called LIFO (Last in First Out)

2. Infix, Prefix, Postfix Notation

This method have a same concept where each of it is inserting a data, the difference just where it written,

Prefix: Operator is written before operands

Infix: Operator is written between operands

Postfix:Operator is written after operands

3. Queue Concept

Queu Concept is a method that stores data in manners. or ussually the data were stored in FIFO(First In First Out)

4. Circular Concept

Circulare concept, based on the name, circular, the data that stored were like circle that if R reach maxn than set R to zero, do it to L.

5.Priority Concept

It is the concept that an abstract data type in each of it is assigned to priority.

1. Hashing Tabel

Hashing adalah teknik menyimpan dan mengambil kunci dengan tepat dengan mengubah string karakter menjadi nilai panjang yang biasanya lebih pendek atau dengan sebuah identitas khusus yang mewakili.

Hashing digunakan untuk mengindeks dan mengambil item dalam database karena lebih cepat menemukan item menggunakan kunci hash yang lebih singkat daripada nilai aslinya. Atau dapat dikatakan sebagai konsep mendistribusikan kunci di array yang biasa disebut hash tabel.

2. Hash Tabel

Hash Tabel adalah tabel dari array dimana menyimpan nilai asli string. index nya adalah hashed key saat nilainya string asli.

Ukuran dari Hash Tabel sendiri biasanya berupa beberapa urutan besarnya lebih rendah dari jumlah total string yang mungkin, sehingga beberapa string memungkinkan memiliki kunci hash yang sama.

terdapat 26⁷(8,031,810,176) panjang nilainya.

FUNGSI HASH

• Mid-Square

Kuadratkan string / identifier dan kemudian gunakan jumlah bit yang sesuai dari tengah kotak untuk mendapatkan hash-key.

• Division

Membagi nilai string atau identifier menggunakan operator modulo.

• Folding

Partisi string / identifier menjadi beberapa bagian lalu tambahkan bagian bersama-sama untuk mendapatkan kunci hash.

• Digit Extraction

Digit yang ditentukan sebelumnya dari nomor yang diberikan maka dianggap sebagai alamat hash.

• Rotating Hash

Fungsi ini hanya membalikkan nilai dari depan ke belakang menjadi belakang kedepan.

3. Tree

Tree adalah non linear data struktur yang mewakili hubungan hirarki antara objek data. beberapa hubungan pohon dapat diamati dalam struktur direktori atau hirarki organisasi. Node dipohon tidak perlu disimpan secara berdekatan dan dapat disimpan dimana saja dan dihubungkan oleh printer.

4. Binary Tree

Binary tree terbuat dari node dimana setiap node berisi kiri pointer dan kanan pointer. Pointer root menunjuk ke paling atas di pohon. pointer kiri dan kanan menunjuk ke subtree yang lebih kecil dari kedua sisis dengan rekursif.

Binary Seacrh Tree.

Is supports faster searching rapid sorting and easy insertion and deletion.

How Binary Tree Concept Work:

1.     Begin at Root

2.     If the root contains X then search terminates successfully

3.     If X is less than root’s key search recursively on the left sub tree, otherwise search recursively on right sub tree.