Text

Ajar Algoritma Dan Sruktur Data

---

KATA PENGANTAR ............................................................................. ii\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nDAFTAR ISI........................................................................................ iv\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nKEGIATAN BELAJAR 1 PENGENALAN PEMROGRAMAN BERORIENTASI\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nOBJEK ................................................................................................ 1\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nDESKRIPSI, KOMPETENSI DAN PETA KONSEP PEMBELAJARAN\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nA. PENGERTIAN PEMROGRAMAN BERORIENTASI OBJEK.................2\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nB. SEJARAH DAN EVOLUSI PEMROGRAMAN BERORIENTASI OBJEK.3\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nC. KONSEP DASAR PEMROGRAMAN BERORIENTASI OBJEK.............5\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nD. PRINSIP-PRINSIP PEMROGRAMAN BERORIENTASI OBJEK ...........6\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nE. KEUNTUNGAN PEMROGRAMAN BERORIENTASI OBJEK ..............8\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nF. PEMROGRAMAN BERORIENTASI OBJEK DALAM ALGORITMA\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nDAN STRUKTUR DATA.................................................................10\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nG. RANGKUMAN .............................................................................11\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nH. TES FORMATIF ............................................................................12\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nI. LATIHAN......................................................................................13\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nKEGIATAN BELAJAR 2 STRUKTUR DATA LINKED LIST .......................... 14\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nDESKRIPSI, KOMPETENSI DAN PETA KONSEP PEMBELAJARAN\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nA. DASAR-DASAR LINKED LIST.........................................................15\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nB. OPERASI DASAR LINKED LIST ......................................................17\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nC. PENCARIAN DAN AKSES ELEMEN ...............................................20\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nD. MANIPULASI LINKED LIST ...........................................................22\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nE. APLIKASI LINKED LIST DALAM PEMROGRAMAN ........................23\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nF. ANALISIS KINERJA LINKED LIST ...................................................27\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nG. RANGKUMAN .............................................................................28\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nH. TES FORMATIF ............................................................................29\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nBUKU AJAR ALGORITMA DAN STRUKTUR DATA v\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nI. LATIHAN......................................................................................31\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nKEGIATAN BELAJAR 3 STACK (TUMPUKAN) & QUEUE (ANTRIAN)...... 32\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nDESKRIPSI, KOMPETENSI DAN PETA KONSEP PEMBELAJARAN\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nA. KONSEP DASAR STACK................................................................33\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nB. KARAKTERISTIK STACK................................................................36\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nC. APLIKASI STACK...........................................................................37\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nD. KONSEP DASAR QUEUE ..............................................................41\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nF. CIRCULAR QUEUE DENGAN ARRAY ............................................46\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nG. RANGKUMAN .............................................................................50\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nH. TES FORMATIF ............................................................................51\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nI. LATIHAN......................................................................................51\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nKEGIATAN BELAJAR 4 STRUKTUR DATA TREE DAN BINARY TREE ....... 52\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nDESKRIPSI, KOMPETENSI DAN PETA KONSEP PEMBELAJARAN\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nA. PENGANTAR TREE.......................................................................53\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nB. BINARY TREE...............................................................................57\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nC. RANGKUMAN .............................................................................64\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nD. TES FORMATIF ............................................................................65\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nE. LATIHAN......................................................................................67\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nKEGIATAN BELAJAR 5 PENGANTAR GRAF: REPRESENTASI GRAF DAN\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nPENELUSURAN GRAF (DEPTH FIRST BREATH FIRST SEARCH) .............. 68\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nDESKRIPSI, KOMPETENSI DAN PETA KONSEP PEMBELAJARAN\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nA. PENGERTIAN DAN SEJARAH .......................................................69\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nB. DEFINISI GRAF.............................................................................71\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nC. JENIS JENIS GRAF ........................................................................73\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nD. DEPTH-FIRST SEARCH (DFS)........................................................78\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nE. BREADTH FIRST SEARCH (BFS)....................................................80\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nF. RANGKUMAN .............................................................................81\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nBUKU AJAR ALGORITMA DAN STRUKTUR DATA vi\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nG. TES FORMATIF ............................................................................82\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nH. LATIHAN......................................................................................82\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nKEGIATAN BELAJAR 6 MINIMUM SPANNING TREE (MST).................. 83\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nDESKRIPSI, KOMPETENSI DAN PETA KONSEP PEMBELAJARAN\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nA. PENGERTIAN MINIMUM SPANNIG TREE (MST) .........................84\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nB. FUNGSI MINIMUM SPANNING TREE DALAM TEORI GRAF.........85\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nC. MANFAAT DAN FUNGSI PENERAPAN SPANNING TREE DALAM\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nBERBAGAI BIDANG .....................................................................86\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nD. ALGORITMA PRIM ......................................................................88\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nE. ALGORITMA SOLIN .....................................................................90\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nF. ALGORITMA KRUSKAL ................................................................93\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nG. RANGKUMAN .............................................................................95\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nH. TES FORMATIF ............................................................................96\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nI. LATIHAN......................................................................................97\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nKEGIATAN BELAJAR 7 GEOMETRI ALGORITHM ................................. 98\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nDESKRIPSI, KOMPETENSI DAN PETA KONSEP PEMBELAJARAN\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nA. PENGENALAN GEOMETRI KOMPUTASIONAL .............................99\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nB. PENGERTIAN DAN KONSEP ALGORITMA GEOMETRI ...............100\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nC. REPRESENTASI TITIK, GARIS, POLIGON.....................................102\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nD. CONVEX HULL ...........................................................................103\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nE. CONVEX HULL DENGAN DIVIDE AND CONQUER......................107\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nF. IDE DIVIDE AND CONQUER.......................................................108\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nG. RANGKUMAN ...........................................................................111\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nH. TES FORMATIF ..........................................................................112\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nI. LATIHAN....................................................................................113\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\n\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nBUKU AJAR ALGORITMA DAN STRUKTUR DATA vii\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nDAFTAR PUSTAKA .......................................................................... 114\\\\\\\\\\\\\\\\r\\\\\\\\\\\\\\\\nTENTANG PENULIS ......................................................................... 121

---

Availability

Detail Information

Series Title

-

Call Number

005.1 Erk a

Publisher

Kota Jambi : PT. Sonpedia Publishing Indonesia., 2024

Collation

xii, 125hlm.: 23×15,5cm

Language

Indonesia

ISBN/ISSN

978-623-8483-85-3

Classification

005.1

Content Type

-

Media Type

-

Carrier Type

-

Edition

-

Subject(s)

Algoritma
Struktur Data
Pemrograman Komputer

Specific Detail Info

-

Statement of Responsibility

-

Other version/related

File Attachment

Comments

---

You must be logged in to post a comment