1 / 7

Kuis 2

Kuis 2. Algoritma & Struktur Data Oleh : Nur Hayatin, S.ST. Persiapan. Total waktu : 50 menit Close book. Soal 1 : 10 menit. Telusuri tree (gambar 1) dengan pre-order. Telusuri tree (gambar 2) dengan post-order . Telusuri tree (gambar 1) dengan in-order.

lana
Download Presentation

Kuis 2

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Kuis 2 Algoritma & Struktur Data Oleh : Nur Hayatin, S.ST

  2. Persiapan • Total waktu : 50 menit • Close book

  3. Soal 1 : 10 menit • Telusuri tree (gambar 1) dengan pre-order. • Telusuri tree (gambar 2) dengan post-order. • Telusuri tree (gambar 1) dengan in-order. • Telusuri tree (gambar 2) dengan level order. Gambar 2 Gambar 1

  4. Soal 2 : 12 menit Gambarkan binary search tree (BST) dari perintah berikut : • insert 17, insert 5, insert 8, insert 32, insert 4, delete 8 • insert 10, insert 45,insert 21, insert 48, insert 1,delete 21 • insert 7, insert 9, insert 26, insert 37, insert 30, delete 26 • insert 45, insert 50, insert 41, insert 57, insert 58, delete 50

  5. Soal 3 : 15 menit Graph 1 Graph 2 • Telusuri graph 1 dengan DFS (start : A) • Telusuri graph 1 dengan BFS (start : A) • Telusuri graph 2 dengan DFS (start : B) 4. Telusuri graph 2 dengan BFS (start : B)

  6. Soal 4 (13 menit) • Urutkan (deret 1) dengan algoritma insertion. • Urutkan (deret 2) dengan algoritma selection. • Urutkan (deret 1) dengan algoritma bubble. • Urutkan (deret 2) dengan algoritma insertion. Catatan: Pengurutan secara ascending Deret 1 : 7 4 5 9 8 1 Deret 2 : 8 7 6 5 4 3

  7. Silahkan Dikumpulkan

More Related