Understanding Cs135 W20 Lecture 2
Exploring Cs135 W20 Lecture 2 reveals several interesting facts. Values, functions, basic substitution, debugging, constants, naming, scope.
Key Takeaways about Cs135 W20 Lecture 2
- Boolean expressions, conditional expressions, white box testing.
- Data definitions, templates, recursion on lists and numbers. Fun with factorial.
- Symbols, strings, refactoring, helper functions, syntax, semantics.
- In terms of difficulty of the midterm I was aiming to have the difficulty somewhere between the traditional midterm 1 and midterm
- Substitution rules, intro to lists.
Detailed Analysis of Cs135 W20 Lecture 2
Stepping practice, design recipe, intro to booleans. Hi everyone, this is our second and last tutorial live stream upload for Trees!
Data definitions, templates, recursion.
Stay tuned for more updates related to Cs135 W20 Lecture 2.