Grinnell College Logo CSC 207 (Fall 2024)
  • Syllabus
  • Schedule
  • Eboards
  • LOs
  • MPs
  • Handouts
  • Example Code
  • Teams
  • Gradescope

SoLA 8

In this SoLA, we return to abstract data types and data structures, with a slight detour into one of our few remaining OOP problems.

New ADT/DS LAs

  • ADT/DS 11: Linked structures
  • ADT/DS 12: Design ADTs
  • ADT/DS 13: Design data structures
  • ADT/DS 14: Iterators

New OOP LA

  • OOP 8: Object design

Prior ADT/DS LAs

  • ADT/DS #2: Stacks
  • ADT/DS #3: Queues
  • ADT/DS #10: Array-based structures

Prior Algorithms LAs

  • Algorithms #1: Binary Search
  • Algorithms #2: Sequential search
  • Algorithms #12: Big-O notation
  • Algorithms #13: Analysis of iterative algorithms
  • Algorithms #14: Analysis of recursive algorithms

Prior Development LAs

  • Development #1: Collaboration
  • Development #2: Build tools
  • Development #3: Unit testing
  • Development #4: IDE
  • Development #5: Version control
  • Development #6: Code reading
  • Development #7: Documentation
  • Development #8: Build libraries
  • Development #10: Exceptions

Prior OOP LAs

  • OOP #1: Encapsulation
  • OOP #2: Inheritance
  • OOP #3: Composition
  • OOP #4: Parametric polymorphism
  • OOP #5: Subtype polymorphism
  • OOP #6: Data Abstraction
  • OOP #9: Mental models

Copyright © Samuel A. Rebelsky

Unless specified otherwise elsewhere on this page, this work is licensed under a Creative Commons Attribution 3.0 Unported License. To view a copy of this license, visit http://creativecommons.org/licenses/by-nc/3.0/ or send a letter to Creative Commons, 543 Howard Street, 5th Floor, San Francisco, California, 94105, USA.

This website was built using Jekyll, Twitter Bootstrap, and the Bootswatch Cosmo Theme.