Haiku Error Messages:
Sponsored Links
This presentation is the property of its rightful owner.
1 / 22

Haiku Error Messages: PowerPoint PPT Presentation


  • 48 Views
  • Uploaded on
  • Presentation posted in: General

Haiku Error Messages:      Chaos reigns within.         Stop, reflect, and reboot.          Order shall return.          Yesterday it worked          Today it is not working          Windows is like that.

Download Presentation

Haiku Error Messages:

An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -

Presentation Transcript


Haiku Error Messages:

     Chaos reigns within.         Stop, reflect, and reboot.         Order shall return.

         Yesterday it worked         Today it is not working         Windows is like that.

         Windows XP crashed.         The Blue Screen of Death.         No one hears your screams.


Device Management

III. File Management

D. something

1. smaller some


Device Management

main

sub


E. Access Methods

Logical Level

How are records locatedwithin a file?


method to use depends upon file’s intended application

fixed length records vs.variable length records


Fixed length record - all records in file are same size

Class ID NumberSexLast Name

4 char 9 int1char20 char


Variable length record - records in file are diff sizes

Name BirthplacePersonal Mission Statement

5-10 char 10 - 20 char0 - 100 char


fixed length records =easy to implement,but may waste space

variable length records =difficult to implement, but no wasted space


1. Sequential Access

Records are logicallyordered within the file

Records are accessed oneafter the other in order


1. Sequential Access

analogy - phone book

but must search it in order


2. Random Access

Records are locateddirectly within the file

Hashing algorithmdetermines the record’slogical address


2. Random Access

analogy - phone book

open book to exactly theright page and put yourfinger on exactly the rightrecord


it’s not magic, it’s an algorithm

Hashing Algorithm:

key field value modulofile’s prime numberyields logical address


Hashing Algorithm ex:

45 (key field value) modulo11 (file’s prime number)yields[4] r1 (logical address)


Logical Record #File

Key Field (eg ID number)

0

1

2

3

4

5

6

7

8

9

10

Zeb - 45 - $0.02

45

Hashing Algorithm

45 % 11 = 1


Logical Record #File

Key Field (eg ID number)

0

1

2

3

4

5

6

7

8

9

10

Zeb - 45 - $0.02

15

Zeke - 15 - $5.00

Hashing Algorithm

15 % 11 = 4


Logical Record #File

Key Field (eg ID number)

0

1

2

3

4

5

6

7

8

9

10

Zeb - 45 - $0.02

58

Martha - 58 - $25

Zeke - 15 - $5.00

Hashing Algorithm

58 % 11 = 3


Logical Record #File

Key Field (eg ID number)

0

1

2

3

4

5

6

7

8

9

10

Zeb - 45 - $0.02

32

Martha - 58 - $25

Zeke - 15 - $5.00

Hashing Algorithm

32 % 11 = 10

Mable - 32 - $50


Logical Record #File

Key Field (eg ID number)

0

1

2

3

4

5

6

7

8

9

10

Zeb - 45 - $0.02

47

hash clash

Martha - 58 - $25

Zeke - 15 - $5.00

Hashing Algorithm

47 % 11 = 3

Mable - 32 - $50


3. Indexed Access

features of both

add an index “layer” ontop of the file


B-tree Index

37

33

Logical Record #File

0

1

2

3

4

5

6

7

8

9

10

21

33

21

19

18

18

Zerub, 19, $1.98

17

10

10

8

9

8

6


  • Login