APCS B

1
APCS B

• Unit 3-4 Data Structures and an introduction to
  Collections

2
Agenda/Objectves 10/13

• Unit3_Lecture.ppt(Slides 1-21)
• Collection definitions
• Priority Queues
• Lesson AB33 Priority Queues
• Read Lesson
• Complete Lab AB33.1 heapsort

3
Agenda/Objectves 10/15

• Unit3_Lecture.ppt(Slides 22-26)
• Hashing
• Lesson AB32 Hash Coded Data Storage
• Read Lesson
• Complete Lab AB32.1 hashing

4
Agenda/Objectves 10/17

• Lesson AB27 Java Lists and iterators
• You will learn to understand the List interface
  and some of its common methods.
• You will use the LinkedList class and iterators
  to program a mergelist algorithm.
• CompleteAB27.1 Lab - MergeList

5
Agenda/Objectves 10/21

• Lesson AB28 Sets and Maps
• You will be introduced to the Set and Map
  interfaces.
• You will learn about the TreeSet class that
  implements the Set interface.
• You will learn to create a simple TreeSet object,
  add elements to it, get its size, iterate over
  its elements, and print information about each of
  the elements.
• You will learn about the TreeMap class that
  implements the Map interface.
• You will learn to create a simple TreeMap object
  and establish a relationship between its keys
  and values.
• In Lab Assignment AB28.1, Email Directory, you
  will work from a template to create an e-mail
  directory that establishes a relationship between
  a users name key and e-mail address value.

6
Agenda/Objectves 10/21

• Lesson AB28 Sets and Maps
• Complete Lab AB28.1 Email Directory

7
Agenda/Objectves 10/23

• Lesson AB29 Linked Lists
• The student will write a program, with
  specifications provided, to build a linked list
  and traverse it.
• The student will use nodes to facilitate building
  a linked list.
• The student will code a method to insert data
  into a linear linked list in ordered fashion,
  based on a key field.
• The student will code a method to search for a
  specific value in an ordered linked list.
• The student will code a method to delete
  information from an ordered linked list.

8
Agenda/Objectves 10/23

• Lesson AB29 Linked Lists
• The student will understand the advantages and
  disadvantages between dynamic and static data
  structures.
•  
• The student will write definitions and code to
  create an ordered doubly-linked list.
•  
• The student will code an algorithm to delete
  nodes from a doubly-linked list.
•  
• The student will write code to print out a
  doubly-linked list both forwards and backwards.
• Complete Worksheet 29.1 and Lab29.1