CSCI 162
1.0

Course Notes

  • 1. Introduction
  • 2. Java vs. Python
  • 3. Objects Review
  • 4. Unit Tests
  • 5. Data Structures Review
  • 6. Collections
  • 7. The Stack ADT
  • 8. ArrayStack
  • 9. Unit Testing Collections
  • 10. Links
  • 11. LinkedStack
  • 12. Algorithm Analysis
  • 13. The Queue ADT
  • 14. LinkedQueue
  • 15. ArrayQueue
  • 16. The Bag ADT
  • 17. Inheritance
  • 18. Bag Implementations
  • 19. Iterators
  • 20. Exceptions
  • 21. Memory & The Call Stack
  • 22. Recursion
  • 23. Searching
  • 24. Tree ADT
  • 25. Binary Trees
  • 26. Binary Search Trees
  • 27. Linked Binary Search Trees
  • 28. Sorting
  • 29. Sorting Recursively

Labs

  • 1. Hello World
  • 2. Objects
  • 3. Collections
  • 4. Unit Tests
  • 5. Stacks
  • 6. Linked Structures
  • 7. Queues
  • 8. Sorted Bags
  • 9. Iterators
  • 10. Recursion
  • 11. Binary Trees
  • 12. Heaps
  • 13. Sorting
  • 14. Sorting Recursively

Assignments

  • 1. Playing with Objects is Still Fun
  • 2. Maze Solver — A Path is a Path
  • 3. Maze Solver Too — A Better Path is Also a Path
  • 4. 1100010110111010001110110100111110001001

Getting Started

  • Getting set up

Outline

  • Outline for Computer Science 162 — Programming and Data Structures
CSCI 162
  • »
  • Search

© Copyright 2021, James Hughes & Taras Mychaskiw. Last updated on Oct 01, 2024.

Built with Sphinx using a theme provided by Read the Docs.