Showing 0–0 of 0 results
| # | Exercise Title | Features | Description | Platform | Keywords |
|---|---|---|---|---|---|
| 1 | Call Structure for the Fibonacci Sequence Problem | Algorithm Visualization | Slideshow showing the tree structure for calls by a recursive implementation of the Fibonacci sequence calculation. | OpenDSA | Dynamic Programming, Fibonacci Sequence |
| 2 | Call Structure for the Chained Matrix Multiplication Problem | Algorithm Visualization | Slideshow showing the tree structure for calls by a solution to the chained matrix multiplication problem. | OpenDSA | Dynamic Programming, Chained Matrix Multplication Problem |
| 3 | Functional Programming Visualization: Static vs Dynamic Binding | Algorithm Visualization, Code Tracing Presentation | Slideshow illustrating static vs dynamic binding in a functional programming language. | OpenDSA | Functional Programming |
| 4 | Functional Programming Exercise: Static vs Dynamic Binding | Tracing Exercise | A question related to functional programming languages: static vs. dynamic binding. | OpenDSA | Functional Programming |