Algoritma Analizi Dersi Projesi
Arkadaşalr haberin devamında algoritma anlizi 2 dersinin projesi bulunmatadır. Herkese kolay gelsin
Project Assignment I


Tree Structures

Create a sequential file of 50 records in which each record has at least six 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 tree structures affect retrieval performance. This program simulates a fixed amount of storage so that you can then determine which method 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 it to storage address slots.

2 - Insert your 50 data records into an AVL tree. Retrieve each record once and report the average number of probes. Print the contents of the stored file.

3 - Insert your 50 data records into an IPR tree. Retrieve each record once and report the average number of probes. Print the contents of the stored file.

4 - Repeat question 3 for a k-balanced IPR tree where k is a variable. Try 5 different k values, and calculate the average number of probes for each one. Plot your results.

5 - Insert your 50 data records into a B-Tree of order two. Retrieve each record once and report the average number of probes. Print the contents of the stored file.

6 - Delete 10 sequential records from the middle of the file in question 5, one by one. After each deletion, calculate the average number of probes for retrieval. Print your results.

7 - Insert your 50 data records into a B#- Tree of order two. Retrieve each record once and report the average number of probes. Print the contents of the stored file.

8 - Insert your 50 records into a B+-Tree of order two and data pages holding up to four records. Retrieve each record once and report the average number of probes. Print the contents of the stored file.

9 - Using the outcome of question 8, reach sequentially a block of 10 records. Print the records.

10 - Create clear, easy to read, computer generated chart or table of your results.

For Groups of size 1: 1,3,4,5,6.
For Groups of size 2: 1,3,4,5,6,8,9,10.
For Groups of size 3: All questions.

Project Assignment I.doc
Del.icio.us
Digg
Facebook
Furl
Google
Blink
Simpy
Spurl
Y! MyWeb