DSpace JSPUI
DSpace preserves and enables easy and open access to all types of digital content including text, images, moving images, mpegs and data sets
Learn More
Please use this identifier to cite or link to this item:
http://umt-ir.umt.edu.my:8080/handle/123456789/4562| Title: | Kajian perbandingan kekompleksan masa capaian carian secara linear, binari dan ternari algoritma |
| Authors: | Fairuz Fauzi |
| Keywords: | LP 7 FST 5 2003 Fairuz Fauzi Laporan Projek FST 2003 |
| Issue Date: | 2003 |
| Publisher: | Terengganu: Kolej Universiti Sains dan Teknologi Malaysia |
| Abstract: | Kajian ini bertujuan manganalisis algoritma yang paling sesuai untuk taburan data tertentu |
| URI: | http://hdl.handle.net/123456789/4562 |
| Appears in Collections: | Fakulti Sains dan Teknologi |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| LP 7 FST 5 2003 FullText.pdf Restricted Access | 47.86 MB | Adobe PDF | View/Open Request a copy | |
| LP 7 FST 5 2003 Abstract.pdf | 4.87 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.