Materi ASD, Algoritma dan Struktur Data semester dua

monggo di download

11. Queue dan Priority Queue

7. Stack dengan Array

11. Queue dan Priority Queue

6.1. Matrix

14. avl tree

13. Heap Tree

12.1 Tree

dari Kelas Sebelah

kulah 6.0

Kuliah 1-2

Kuliah 2-1 (class)

Kuliah 2-2 (class)

Kuliah 3-0 (Konsep ADT)

Kuliah 3-1 (Stack dgn Array)

Kuliah 3-2 (App Stack dgn Array)

Kuliah 4-1 (Single Linked List)

Kuliah 4-2 (Double Linked List)

Kuliah 4-3 (Circular Linked List)

Kuliah 4-4 (Stack dgn Linked List)

Kuliah 5-1 (Antrian)

Kuliah 5-2 (Antrian Berprioritas-Heap Tree)

Kuliah 6-1 (Tree , BT, CBT) Kuliah 6-3 (AVL Tree)

Kuliah 6-3b (B-Tree) Kuliah 6-4 (Red Black Tree)

Kuliah 7-1 (Graph – Pengantar)

Kuliah 7-2 (Graph – DFS & BFS)

Kuliah 7-3 (Graph – Topological Sort)

Kuliah 7-4 (Graph – Studi Kasus)

Kuliah 8-1 (Sorting – 1)

Kuliah 8-1 (Sorting – 2)

Kuliah 9-1 (Searching)

informatika Brawijaya

ptiik, haniforep, informatika

About Sam

Mahasiswa di Jurusan Teknik Informatika Univ Brawijaya