1 / 7

Discussion Topics for CS-2852: Data Structures and Future Lectures

In this document, we explore key topics for future discussions in CS-2852, focusing on data structures and algorithms. We cover essential concepts such as Big-O notation and its implications, the Java Collections Framework for efficient data handling, and UML connectors for understanding class relationships. Dr. Josiah Yoder emphasizes the importance of these foundational topics in software development. The materials include links to additional resources and slides for better understanding, making it a valuable resource for both students and educators.

rosie
Télécharger la présentation

Discussion Topics for CS-2852: Data Structures and Future Lectures

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 • Scraps – Stuff I’d like to discuss in class that might appear in future lectures. CS-2852 Dr. Josiah Yoder Slide style: Dr. Hornick

  2. Big-O for n log n and friends • O(n) < O(n log n) < O(n2) • O(n) < O(n log2 n) < O(n2) • O(nk) < O(nklogjn) < O(nk+1) for any fixed k,j CS-2852 Dr. Josiah Yoder Slide style: Dr. Hornick

  3. Java Collections Framework • http://www.javabeginner.com/java-collections/java-collections-framework

  4. Java Collections Framework • http://www.javabeginner.com/java-collections/java-collections-framework

  5. Slides to share CS-2852 Dr. Josiah Yoder Slide style: Dr. Hornick

  6. 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

  7. 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