saswatpadhi / s16_ta_cs131

Notes & HW Solutions for CS 131 (Spring'16, UCLA)

S16_TA_CS131

Discussion Section Notes for CS 131 (Spring'16, UCLA)

Section 1 [Apr 01 2016]

• OCaml
  • System setup: OCaml, Opam, Utop etc.
  • Primitives: bool, int, Lists, Tuples etc.
  • Functions, recursion, currying etc.
  • Pattern Matching

Section 2 [Apr 08 2016]

• Type annotations
• Built-in modules (List)
• Simple user-defined types

Section 3 [Apr 15 2016]

• HW1 solutions
• More on User-defined types
  • Recursive data-types
• Polymorphism
• More on Higher-order functions

Section 4 [Apr 22 2016]

• HW2 solutions
• Exceptions
• Modules & Functors

Section 5 [Apr 29 2016]

• Mid-term solutions
• HW3 hints & clarifications
• Laziness in OCaml

Section 6 [May 06 2016]

• HW3 solutions
• Inheritance
• Sub-type polymorphism
  • vs Parametric polymorphism
• Dynamic dispatch
  • vs Static overload
• Implementation in Java

Section 7 [May 13 2016]

• Generics
  • super and extends
• Exceptions

Section 8 [May 20 2016]

• HW4 solutions
• Java: Pass-by-value vs reference
• Java Streams
  • Terminal vs intermediate functions
  • Short-circuited functions
  • mappers and Function<T,R> sub-type
• Prolog basics