![[ICO]](/icons/blank.gif){kind=icon}
![[PARENTDIR]](/icons/back.gif){kind=icon}
![[TXT]](/icons/text.gif){kind=icon}
![[ ]](/icons/unknown.gif){kind=icon}
![[IMG]](/icons/image2.gif){kind=icon}
![[ ]](/icons/layout.gif){kind=icon}
![[DIR]](/icons/folder.gif){kind=icon}
| Name | Last modified | Size | Description |
|---|---|---|---|---|
| Parent Directory | - | ||
| ujian.htm | 2026-04-30 02:45 | 196 | |
| tugas.htm | 2026-04-30 02:45 | 360 | |
| ta.htm | 2026-04-30 02:44 | 77K | |
| stmik04-05.htm | 2026-04-30 02:44 | 340 | |
| stmik.htm | 2026-04-30 02:44 | 2.0K | |
| silabus.DOC | 2026-04-30 02:44 | 37K | |
| maze_xlarge.txt | 2026-04-30 02:45 | 1.7K | |
| maze_small.txt | 2026-04-30 02:45 | 131 | |
| maze_med.txt | 2026-04-30 02:44 | 462 | |
| maze_large.txt | 2026-04-30 02:44 | 1.0K | |
| informasi umum.htm | 2026-04-30 02:45 | 2.6K | |
| blesepa.gif | 2026-04-30 02:44 | 292 | |
| blegtext.gif | 2026-04-30 02:45 | 530 | |
| bahan kuliah.htm | 2026-04-30 02:44 | 3.7K | |
| UTS Angkatan 2003.doc | 2026-04-30 02:44 | 50K | |
| UAS Angkatan 2003.doc | 2026-04-30 02:45 | 36K | |
| Tugas Pemrograman 2.doc | 2026-04-30 02:45 | 220K | |
| Tugas Pemrograman 1.doc | 2026-04-30 02:44 | 580K | |
| Thumbs.db | 2026-04-30 02:44 | 7.0K | |
| String Matching.ppt | 2026-04-30 02:45 | 129K | |
| StringMatching-3.ppt | 2026-04-30 02:45 | 122K | |
| StringMatching-2.pdf | 2026-04-30 02:45 | 72K | |
| Strategi Sukses di Kampus.ppt | 2026-04-30 02:45 | 9.0M | |
| SolusiUTS2018.pdf | 2026-04-30 02:45 | 401K | |
| Program Dinamis.ppt | 2026-04-30 02:44 | 440K | |
| Program Dinamis (Bagian 2).ppt | 2026-04-30 02:44 | 119K | |
| Phonetic_string_Matching.pdf | 2026-04-30 02:45 | 53K | |
| Pengantar Strategi Algoritmik.ppt | 2026-04-30 02:44 | 313K | |
| Penerapan BFS dan DFS pada Pencarian Solusi.ppt | 2026-04-30 02:44 | 640K | |
| NilaiStmik2005_files/ | 2026-04-30 02:44 | - | |
| NilaiStmik2005.htm | 2026-04-30 02:45 | 11K | |
| Makalah/ | 2026-04-30 02:45 | - | |
| Makalah.htm | 2026-04-30 02:45 | 10K | |
| Jaringan.vsd | 2026-04-30 02:44 | 69K | |
| Format_makalah_IF2251.doc | 2026-04-30 02:44 | 49K | |
| Cara belajar.ppt | 2026-04-30 02:44 | 55K | |
| Algoritma Traversal di dalam Graf.ppt | 2026-04-30 02:44 | 1.2M | |
| Algoritma Runut-balik.ppt | 2026-04-30 02:44 | 745K | |
| Algoritma Runut-balik (Bagian 2).ppt | 2026-04-30 02:44 | 223K | |
| Algoritma Greedy.ppt | 2026-04-30 02:44 | 386K | |
| Algoritma Greedy (lanjutan).ppt | 2026-04-30 02:44 | 573K | |
| Algoritma Divide and Conquer.ppt | 2026-04-30 02:45 | 672K | |
| Algoritma Divide and Conquer (lanjutan).ppt | 2026-04-30 02:44 | 881K | |
| Algoritma Brute Force Bagian 2.ppt | 2026-04-30 02:44 | 277K | |
| Algoritma Brute Force Bagian 1.ppt | 2026-04-30 02:45 | 237K | |
| Algoritma Branch and Bound (bagian 2).ppt | 2026-04-30 02:45 | 175K | |
| Algoritma Branch and Bound (bagian 1).ppt | 2026-04-30 02:45 | 765K | |
| Algoritma Branch and Bound (Bagian 2).DOC | 2026-04-30 02:45 | 178K | |
| 2025-2026/ | 2026-05-20 06:29 | - | |
| 2024-2025/ | 2026-04-30 02:44 | - | |
| 2023-2024/ | 2026-04-30 02:45 | - | |
| 2022-2023/ | 2026-04-30 02:44 | - | |
| 2021-2022/ | 2026-04-30 02:45 | - | |
| 2020-2021/ | 2026-04-30 02:45 | - | |
| 2019-2020/ | 2026-04-30 02:44 | - | |
| 2018-2019/ | 2026-04-30 02:45 | - | |
| 2017-2018/ | 2026-04-30 02:45 | - | |
| 2016-2017/ | 2026-04-30 02:45 | - | |
| 2015-2016/ | 2026-04-30 02:44 | - | |
| 2014-2015/ | 2026-04-30 02:44 | - | |
| 2013-2014/ | 2026-04-30 02:45 | - | |
| 2013-2014-genap/ | 2026-04-30 02:44 | - | |
| 2012-2013/ | 2026-04-30 02:44 | - | |
| 2011-2012/ | 2026-04-30 02:45 | - | |
| 2010-2011/ | 2026-04-30 02:45 | - | |
| 2009-2010/ | 2026-04-30 02:44 | - | |
| 2007-2008/ | 2026-04-30 02:44 | - | |
| 2006-2007/ | 2026-04-30 02:45 | - | |
| 2005-2006/ | 2026-04-30 02:44 | - | |