SoLA 14

An extra opportunity for all the LAs.

Note: The links to LAs are only available on Gradescope (sorry).

Prior ADT/DS LAs

ADT/DS #1: Lists
ADT/DS #2: Stacks
ADT/DS #3: Queues
ADT/DS #4: Priority queues
ADT/DS #5: Dictionaries
ADT/DS #6: Hash tables
ADT/DS #7: BSTs
ADT/DS #8: Heaps
ADT/DS #9: Graphs
ADT/DS #10: Array-based structures
ADT/DS #11: Linked structures
ADT/DS #12: Design ADTs
ADT/DS #13: Design data structures
ADT/DS #14: Iterators

Prior Algorithms LAs

Algorithms #1: Binary Search
Algorithms #2: Sequential search
Algorithms #3: Insertion sort
Algorithms #4: Selection sort
Algorithms #5: Heap sort
Algorithms #6: Quicksort
Algorithms #7: Merge sort
Algorithms #8: Graph and tree traversal
Algorithms #9: Shortest path
Algorithms #10: Greed
Algorithms #11: Divide and conquer
Algorithms #12: Big-O notation
Algorithms #13: Analysis of iterative algorithms
Algorithms #14: Analysis of recursive algorithms
Algorithms #15: Loop invariants

Prior Development LAs

Development #1: Collaboration
Development #2: Build tools
Development #3: Unit testing
Development #4: IDEs
Development #5: Version control
Development #6: Code reading
Development #7: Documentation
Development #8: Build libraries
Development #9: Use libraries
Development #10: Exceptions
Development #11: Ethical reuse
Development #12: Professional ethics

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 #8: Object design
OOP #9: Mental models

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.