Knapsack Problem (0-1) Menggunakan Metode Pendekatan Dynamic Programming (DP) vs Recursion By Brute-Force Algorithm Or Exhaustive Search

Detail Tugas Akhir

Knapsack Problem (0-1) Menggunakan Metode Pendekatan Dynamic Programming (DP) vs Recursion By Brute-Force Algorithm Or Exhaustive Search

Akar, Genesis (2023) Knapsack Problem (0-1) Menggunakan Metode Pendekatan Dynamic Programming (DP) vs Recursion By Brute-Force Algorithm Or Exhaustive Search. Skripsi thesis, Sanata Dharma University.

Berkas Tugas Akhir

PDF

Text (Full)
195314008_full.pdf
Restricted to Registered users only

Akses terbatas: khusus pengguna terdaftar Ukuran File (1MB)

PDF

Text (Abstract)
195314008.pdf

Ukuran File (155kB)

Informasi Item

Item Type	Thesis (Skripsi)
Subjects	T Technology > TB Information Technology
Divisions	Faculty of Science and Technology > Department of Informatics Engineering
Date Deposited	09 Aug 2023 02:26
Last Modified	09 Aug 2023 02:26
URI	https://repository.usd.ac.id/id/eprint/47770

Actions (login required)

: View Item

Repositori USDPerpustakaan Universitas Sanata Dharma

Sekretariat 0274-880137 Ext: 1538 628112652539 library@usd.ac.id

Telusur

Layanan

Informasi

Kampus 2Jl. Affandi, Mrican, Caturtunggal, Kec. Depok, Kabupaten Sleman, Daerah Istimewa Yogyakarta 55281
PelayananSenin–Jumat, 07.30–21.00 WIB
Sabtu, 08.00–12.30 WIB
Libur kampus tutup.