CSC111
tags
#cs
Course Roadmap (Ch 13-19)
Notes are basically paraphrased straight from csc110 & csc111 notes
12. Interlude: Nifty Python Features
- 12.1 Python Slicing and Indexing
- 12.2 Python f-strings
- 12.3 Python Optional Parameters
13. Linked Lists
- 13.1 Linked List (Data Structure)
- 13.2 Traversing Linked Lists
- 13.3 Mutating Linked Lists
- 13.5 Linked List Running-Time Analysis
14. Induction and Recursion
- 14.1 Proof by Induction
- 14.2 Recursion (Programming)
- 14.3 Nested Lists
- 14.4 Structural Recursion
- 14.5 Recursive Lists
15. Trees
- 15.1 Tree (Data Structure)
- 15.2 Recursion on Trees
- 15.5 Binary Search Tree (BST)
- 15.7 BST Running Time Analysis
16. Case Study: Abstract Syntax Trees
- 16.1 Abstract Syntax Tree (AST)
- 16.2 Variable Environments
17. Graphs
- 17.1 Graph (Data Structure)
- 17.2 Graph Properties
- 17.4 Graph Traversal (BFS and DFS)
- 17.7 Spanning Trees
18. Sorting
- 18.1 Binary Search
- 18.2 Selection Sort
- 18.3 Insertion Sort
- 18.4 Divide-and-Conquer Algorithms
- 18.5 Mergesort
- 18.6 Quicksort
19. Average-Case Running Time (optional reading)
- 19.1 Average-Case Running Time