1. © 2006 Pearson Education Chapter 12: Data Structures Presentation slides for Java Software Solutions for AP* Computer Science A 2nd Edition by John Lewis, William Loftus, and Cara Cocking Java Software Solutions is published by Addison-Wesley Presentation slides are copyright 2006 by John Lewis, William Loftus, and Cara Cocking. All rights reserved. Instructors using the textbook may use and modify these slides for pedagogical purposes. *AP is a registered trademark of The College Entrance Examination Board which was not involved in the production of, and does not endorse, this product.

2. © 2006 Pearson Education 2 Linear Data Structures  Now we can now explore some convenient techniques for organizing and managing information  Chapter 9 focuses on: collections Abstract Data Types (ADTs) dynamic structures and linked lists queues and stacks

3. © 2006 Pearson Education 3 Collections  A collection is an object that serves as a repository for other objects  A collection usually provides services such as adding, removing, and otherwise managing the elements it contains  Sometimes the elements in a collection are ordered, sometimes they are not  Sometimes collections are homogeneous, sometimes the are heterogeneous

4. © 2006 Pearson Education 4 Abstract Data Types  Collections can be implemented in many different ways  An abstract data type (ADT) is an organized collection of information and a set of operations used to manage that information  The set of operations defines the interface to the ADT  As long as the ADT fulfills the promises of the interface, it doesn't really matter how the ADT is implemented  Objects are a perfect programming mechanism to create ADTs because their internal details are encapsulated

5. © 2006 Pearson Education 5 Abstraction  Our data structures should be abstractions  That is, they should hide unneeded details  We want to separate the interface of the structure from its underlying implementation  This helps manage complexity and makes it possible to change the implementation without changing the interface

6. © 2006 Pearson Education 6 Collection Classes  The Java standard library contains several classes that represent collections, often referred to as the Java Collections API  Their underlying implementation is implied in the class names such as ArrayList and LinkedList  Several interfaces are used to define operations on the collections, such as List, Set, Map, and Queue

7. © 2006 Pearson Education 7 Generics  The Java Collection classes are implemented as generic types  We give the type of object a collection will hold when we create the collection, like this: LinkedList myStringList = new LinkedList (); LinkedList myBookList = new LinkedList ();  If no type is given, the collection is defined as containing references to the Object class

8. © 2006 Pearson Education 8 Static vs. Dynamic Structures  A static data structure has a fixed size  This meaning is different from the meaning of the static modifier  Arrays are static; once you define the number of elements it can hold, the number doesn’t change  A dynamic data structure grows and shrinks at execution time as required by its contents  A dynamic data structure is implemented using links

9. © 2006 Pearson Education 9 Object References  Recall that an object reference is a variable that stores the address of an object  A reference also can be called a pointer  References often are depicted graphically: student John Smith 40725 3.58

10. © 2006 Pearson Education 10 References as Links  Object references can be used to create links between objects  Suppose a Student class contains a reference to another Student object John Smith 40725 3.57 Jane Jones 58821 3.72

11. © 2006 Pearson Education 11 References as Links  References can be used to create a variety of linked structures, such as a linked list: studentList

12. © 2006 Pearson Education 12 Intermediate Nodes  The objects being stored should not be concerned with the details of the data structure in which they may be stored  For example, the Student class should not have to store a link to the next Student object in the list  Instead, we can use a separate node class with two parts: 1) a reference to an independent object and 2) a link to the next node in the list  The internal representation becomes a linked list of nodes  See ListNode.java (pg 517) ListNode.java

13. © 2006 Pearson Education 13 Magazine Collection  Let’s explore an example of a collection of Magazine objects  The collection is managed by the MagazineList class, which contains a linked list of ListNode objects  The data portion of each ListNode is a Magazine object  See ListNode.java (page 517) ListNode.java  See MagazineRack.java (page 521) MagazineRack.java  See MagazineList.java (page 522) MagazineList.java  See Magazine.java (page 524) Magazine.java

14. © 2006 Pearson Education 14 Inserting a Node  A method called insert could be defined to add a node anywhere in the list, to keep it sorted, for example  Inserting at the front of a linked list is a special case

15. © 2006 Pearson Education 15 Inserting a Node  When inserting a node in the middle of a linked list, we must first find the spot to insert it  Let current refer to the node before the spot where the new node will be inserted

16. © 2006 Pearson Education 16 Deleting a Node  A method called delete could be defined to remove a node from the list  Again the front of the list is a special case:  Deleting from the middle of the list:

17. © 2006 Pearson Education 17 Other Dynamic List Representations  It may be convenient to implement as list as a doubly linked list, with next and previous references list

18. © 2006 Pearson Education 18 Other Dynamic List Implementations  It may be convenient to use a separate header node, with a count and references to both the front and rear of the list count: 4 front rear list

19. © 2006 Pearson Education 19 Other Dynamic List Implementations  A linked list can be circularly linked in which case the last node in the list points to the first node in the list  If the linked list is doubly linked, the first node in the list also points to the last node in the list  The representation should facilitate the intended operations and should make them easy to implement

20. © 2006 Pearson Education 20 Queues  A queue is similar to a list but adds items only to the rear of the list and removes them only from the front  It is called a FIFO data structure: First-In, First-Out  Analogy: a line of people at a bank teller’s window enqueue dequeue

21. © 2006 Pearson Education 21 Queues  We can define the operations for a queue enqueue - add an item to the rear of the queue dequeue (or serve) - remove an item from the front of the queue isEmpty - returns true if the queue is empty  Queues often are helpful in simulations or any situation in which items get “backed up” while awaiting processing  Java provides a Queue interface, which the LinkedList class implements: Queue q = new LinkedList ();

22. © 2006 Pearson Education 22 Priority Queues  In a priority queue, some elements get to “cut in line”  The enqueue and isEmpty operations behave the same as with normal queues  The dequeue operation removes the element with the highest priority  See AfterSchoolTasks.java (page 530) AfterSchoolTasks.java  See Task.java (page 531) Task.java

23. © 2006 Pearson Education 23 Stacks  A stack ADT is also linear, like a list or a queue  Items are added and removed from only one end of a stack  It is therefore LIFO: Last-In, First-Out  Analogies: a stack of plates in a cupboard, a stack of bills to be paid, or a stack of hay bales in a barn

24. © 2006 Pearson Education 24 Stacks  Stacks often are drawn vertically: poppush

25. © 2006 Pearson Education 25 Stacks  Some stack operations: push - add an item to the top of the stack pop - remove an item from the top of the stack peek - retrieves the top item without removing it isEmpty - returns true if the stack is empty  A stack can be represented by a singly-linked list; it doesn’t matter whether the references point from the top toward the bottom or vice versa  A stack can be represented by an array

26. © 2006 Pearson Education 26 Stacks  The Stack class is part of the Java Collections API and thus is a generic class Stack strStack = new Stack ();  See Decode.java (page 533) Decode.java  See ArrayStack.java (page 534) ArrayStack.java

27. © 2006 Pearson Education 27 Summary  Chapter 9 has focused on: collections Abstract Data Types (ADTs) dynamic structures and linked lists queues and stacks