Yazar |
|
desmondv3
banlandı
Kayıt: 10.08.2008 |
|
Arkadaşlar Algoritma dersi 1. proje:
Project Assignment Part I
Collision Resolution
Create a sequential file of 50 records in which each record has at leastsix fields of which one is the primary key and the others are secondary keys. The purpose of this assignment is for you to observe how the different collision resolution techniques affect retrieval performance. This program simulates a fixed amount of storage so that you can then determine which collisionresolution is preferable for your data.
1 - Print the contents of the sequential data file you are using in the assignment. Indicate the primary, alphanumeric, key. (The key may consist of numerals or other data, but must be treated as alphanumeric data in converting itto storage address slots.
2 - Write a hashing function to convert an alphanumeric key into a storage address. If acceptable. use a hashing function of the form KEY mod P or a hybrid of it. Document it. Print the resulting address space slots resulting from your keys for EACH of the methods you implement below.
3 - Choose the smallest table size with a packing factor <= 85 percent using the hashing function defined above for each type of insertion.
4 - Insert your 50 data records into the table using LISCH. Retrieveeach record once and report the average number of probes. Print the contentsof the stored file.
5 - Insert your 50 data records into the table using BLISCH. Retrieveeach record once and report the average number of probes. Print the contentsof the stored file.
6 - Insert your 50 data records into the table using RLISCH. Retrieveeach record once and report the average number of probes. Print the contentsof the stored file.
7 - Insert your 50 data records into the table using LICH. Retrieveeach record once and report the average number of probes. Print the contentsof the stored file.
8 - Insert your 50 records into the table using EICH. Retrieveeach record once and report the average number of probes. Print the contentsof the stored file.
9 - Insert your 50 data records into the table using Linear Quotient. Retrieve each record once and report the average number of probes. Print the contents of the stored file.
10 - Insert your 50 data records into the table using Brent's Method. Retrieve each record once and report the average number of probes. Print the contents of the stored file.
11 - Insert your 50 records into the table using the binary treecollision resolution method. Retrieveeach record once and report the average number of probes. Print the contentsof the stored file.
12 - Insert your 50 records into the table with a bucket size of two using the binary tree collision resolution method. Retrieve each record once and report the average number of probes. Print the contents of the stored file.
13 - Insert your 50 data records into the table using Computed Chaining. Retrieveeach record once and report the average number of probes. Print the contentsof the stored file.
14 - Insert your 50 records into the table using LISCH with two chains.Retrieve each record once and report the average number of probes. Print thecontents of the stored file.
15 - Delete every 5th record (in the order of the sequential file) from the table created with LISCH with a single chain. After completing all of the deletions, reinsert the first half of the deleted records. Retrieve each recordonce and report the average number of probes. Print the contents of the storedfile.
16 - Create clear, easy to read, computer generated chart or table of your results.
For Groups of size 1: 1,2,3,4,11,12,13,14,15,16.
For Groups of size 2: 1,2,3,4,6,8,10,11,12,13,14,15,16.
For Groups of size 3: All questions.
http://www.dosya.tc/ProjectAssignmentPartI.doc.html
|
|
Yazar |
|
desmondv3
banlandı
Kayıt: 10.08.2008 |
|
Projeyi tek başına yapmak isteyenler 1,2,3,4,11,12,13,14,15,16. no.lu soruları
2 kişi yapmak isteyenler 1,2,3,4,6,8,10,11,12,13,14,15,16, no.lu soruları
3 kişi yapmak isteyenler ise tüm soruları cevaplayacaktır.
|
|
Yazar |
|
zangetsu
Kayıt: 16.03.2009 |
|
Proje süpermiş.Dersi almıyom ama bende yapacam.
-Ölüm Sadece Bir Baslangiçtir-
|
|
Yazar |
|
auzunun
Bursa
Kayıt: 15.01.2006 |
|
projenin son tarihi nedir bilen var mı?
Öldüremiyorsan, yaralama.
|
|
Yazar |
|
desmondv3
banlandı
Kayıt: 10.08.2008 |
|
auzunun yazdi | projenin son tarihi nedir bilen var mı? |
finallerden 2 hafta önce olması gerekli. kesin değil...
|
|
Yazar |
|
basser
Istanbul
Kayıt: 17.06.2006 |
|
merhaba;
arkadaşlar ödevi açıklayıcı yorum satırlarına ihtiyacım var sanırım :)
birisi soruları anlamamız için açıklayabilirmi?çok seviniriz
teşekkürlerr
Heavy Metal Bizimle Olsun****
|
|
|
|
-
Del.icio.us
-
Digg
-
Facebook
-
Furl
-
Google
-
Blink
-
Simpy
-
Spurl
-
Y! MyWeb
|
|
| | |