figure:

37
Slide 7-1 Copyright © 2003 Pearson Education, Inc. Figure: Computer Science an overview EDITION 7 J. Glenn Brookshear

Upload: elizabeth-garner

Post on 31-Dec-2015

23 views

Category:

Documents


0 download

DESCRIPTION

Figure:. Computer Science an overview EDITION 7. J. Glenn Brookshear. C H A P T E R 7. Data Structures. Figure 7.1: Novels arranged by title but linked according to authorship. Figure 7.2: The array of Readings stored in memory starting at address x. - PowerPoint PPT Presentation

TRANSCRIPT

Slide 7-1 Copyright © 2003 Pearson Education, Inc.

Figure:

Computer Sciencean overview

EDITION 7

J. Glenn Brookshear

Slide 7-2 Copyright © 2003 Pearson Education, Inc.

C H A P T E R 7

Data Structures

Slide 7-3 Copyright © 2003 Pearson Education, Inc.

Figure 7.1: Novels arranged by title but linked according to authorship

Slide 7-4 Copyright © 2003 Pearson Education, Inc.

Figure 7.2: The array of Readings stored in memory starting at address x

Slide 7-5 Copyright © 2003 Pearson Education, Inc.

Figure 7.3: A two-dimensional array with four rows and five columns stored in row major order

Slide 7-6 Copyright © 2003 Pearson Education, Inc.

Figure 7.4: Names stored in memory as a contiguous list

Slide 7-7 Copyright © 2003 Pearson Education, Inc.

Figure 7.5: The structure of a linked list

Slide 7-8 Copyright © 2003 Pearson Education, Inc.

Figure 7.6: Deleting an entry from a linked list

Slide 7-9 Copyright © 2003 Pearson Education, Inc.

Figure 7.7: Inserting an entry into a linked list

Slide 7-10 Copyright © 2003 Pearson Education, Inc.

Figure 7.8: A procedure for printing a linked list

Slide 7-11 Copyright © 2003 Pearson Education, Inc.

Figure 7.9: Nested procedures terminating in the opposite order to that in which they were requested

Slide 7-12 Copyright © 2003 Pearson Education, Inc.

Figure 7.10: Using a stack to print a linked list in reverse order (continued)

Slide 7-13 Copyright © 2003 Pearson Education, Inc.

Figure 7.10: Using a stack to print a linked list in reverse order

Slide 7-14 Copyright © 2003 Pearson Education, Inc.

Figure 7.11: A procedure (using an auxiliary stack) for printing a linked list in reverse order

Slide 7-15 Copyright © 2003 Pearson Education, Inc.

Figure 7.12: A stack in memory

Slide 7-16 Copyright © 2003 Pearson Education, Inc.

Figure 7.13: A queue implemented with head and tail pointers

Slide 7-17 Copyright © 2003 Pearson Education, Inc.

Figure 7.14: A queue “crawling” through memory

Slide 7-18 Copyright © 2003 Pearson Education, Inc.

Figure 7.15: A circular queue (a) containing the letters F through O as actually stored in memory

Slide 7-19 Copyright © 2003 Pearson Education, Inc.

Figure 7.15: A circular queue (b) in its conceptual form in which the last cell in the block is “adjacent” to the first cell

Slide 7-20 Copyright © 2003 Pearson Education, Inc.

Figure 7.16: An example of an organization chart

Slide 7-21 Copyright © 2003 Pearson Education, Inc.

Figure 7.17: Tree terminology

Slide 7-22 Copyright © 2003 Pearson Education, Inc.

Figure 7.18: The structure of a node in a binary tree

Slide 7-23 Copyright © 2003 Pearson Education, Inc.

Figure 7.19: The conceptual and actual organiza-tion of a binary tree using a linked storage system

Slide 7-24 Copyright © 2003 Pearson Education, Inc.

Figure 7.20: A tree stored without pointers

Slide 7-25 Copyright © 2003 Pearson Education, Inc.

Figure 7.21: A sparse, unbalanced tree shown in its conceptual form and as it would be stored without pointers

Slide 7-26 Copyright © 2003 Pearson Education, Inc.

Figure 7.22: The letters A through M arranged in an ordered tree

Slide 7-27 Copyright © 2003 Pearson Education, Inc.

Figure 7.23: The binary search as it would appear if the list were implemented as a linked binary tree

Slide 7-28 Copyright © 2003 Pearson Education, Inc.

Figure 7.24: The successively smaller trees considered by the procedure in Figure 7.23 when searching for the letter J

Slide 7-29 Copyright © 2003 Pearson Education, Inc.

Figure 7.25: Printing a search tree in alphabetical order

Slide 7-30 Copyright © 2003 Pearson Education, Inc.

Figure 7.26: A procedure for printing the data in a binary tree

Slide 7-31 Copyright © 2003 Pearson Education, Inc.

Figure 7.27: Inserting the entry M into the list B, E, G, H, J, K, N, P stored as a tree (continued)

Slide 7-32 Copyright © 2003 Pearson Education, Inc.

Figure 7.27: Inserting the entry M into the list B, E, G, H, J, K, N, P stored as a tree

Slide 7-33 Copyright © 2003 Pearson Education, Inc.

Figure 7.28: A procedure for inserting a new entry in a list stored as a binary tree

Slide 7-34 Copyright © 2003 Pearson Education, Inc.

Figure 7.29: A stack of integers implemented in C++

Slide 7-35 Copyright © 2003 Pearson Education, Inc.

Figure 7.30: A stack of integers implemented in Java and C#

Slide 7-36 Copyright © 2003 Pearson Education, Inc.

Figure 7.31: Our first attempt at expanding the machine language in Appendix C to take advantage of pointers

Slide 7-37 Copyright © 2003 Pearson Education, Inc.

Figure 7.32: Loading a register from a memory cell that is located by means of a pointer stored in a register