1 / 8

CS-2852 Data Structures

In this week’s CS-2852 class, we explore data structures including stacks and queues, focusing on their implementation in Java. We'll discuss the principles behind LIFO (Last In First Out) for stacks and FIFO (First In First Out) for queues. The lab will feature demonstrations scheduled for Friday, along with testing procedures for Linked Lists and Iterators. Join us as we delve into coding techniques and best practices for these essential data structures, enhancing your understanding of Java and its application in data management.

kory
Télécharger la présentation

CS-2852 Data Structures

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. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. CS-2852Data Structures • Week 5, Class 2 – Testing and Stacks • Announcement: Lab Demos - 2/3 & 4 on Friday • Testing • Definitions, Example • (tentative) Testing LinkedList with Iterators • Stacks • LIFO • Implementing with an ArrayList • Queue • FIFO CS-2852 Dr. Josiah Yoder Slide style: Dr. Hornick

  2. /*package*/ access • Adapted from Oracle’s Java tutorial http://docs.oracle.com/javase/tutorial/java/javaOO/accesscontrol.html

  3. UML Connectors for Instance Variables B extends A D implements C L is an inner class of K E contains F, non-exclusively G contains H, exclusively I contains J CS-2852 Dr. Josiah Yoder Slide style: Dr. Hornick

  4. Multiplicity M contains exactly one N O contains any number of P Q contains at least one R In each case, the outer class has a private reference to the contained class called “h” CS-2852 Dr. Josiah Yoder Slide style: Dr. Hornick

  5. Which to use? • In general, do we prefer the methods that throw exceptions, or the methods that return values? • To answer this question • Think about it by yourself (30 seconds) • Talk to your neighbor (45 seconds) • Volunteer an answer (>0 seconds) CS-2852 Dr. Josiah Yoder Slide style: Dr. Hornick

  6. FIFO and LIFO • FIFO • First In • First Out • Queue or stack? • To answer this question • Think about it by yourself • Talk to your neighbor • Volunteer an answer • LIFO • Last In • First Out • Queue or stack? • (30 seconds) • (30 seconds) • (>0 seconds) CS-2852 Dr. Josiah Yoder Slide style: Dr. Hornick

  7. Implementation • Adapter Class • A class that wraps another class to meet a particular interface. • Linked List • Not ArrayList • Because … • But with an array, we can • Circular queue CS-2852 Dr. Josiah Yoder Slide style: Dr. Hornick

  8. Circular Queue CS-2852 Dr. Josiah Yoder Slide style: Dr. Hornick

More Related