1 / 4

CS-2852 Data Structures

In Week 5 of CS-2852, we focus on testing methodologies and stack data structures. Students will revisit return exams and lab assessments, with announcements for upcoming lab demos on February 3rd and 4th. The session will also cover package-level access, UML connectors for instance variables, and delve into definitions, examples, and implementations of linked lists and stack data structures. Emphasis will be laid on testing linked lists with iterators, providing a comprehensive understanding of these concepts.

hoshi
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 1 – Testing and Stacks • Return Exams & Labs • Package-level access • UML connectors for instance variables • Announcement: Lab Demos - 2/3 & 4 on Friday • Testing • Definitions, Example • (Not done) Testing LinkedList with Iterators • Stacks • Definition • Implementing with a LinkedList • Implementing with an ArrayList 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

More Related