*   next reading assignment:
    Chapter 7 - Analyzing Arguments - in course text
    *   start discussing either Friday or Monday...

=======
for 1st year CNRS students:

*   in Spring 2019, there will be a new 100-level course
    for meeting *Area E* requirements:

    SCI 100 - Math and Computer Science - "Becoming a STEM
        Professional in the 21st Century"

    CRN 26577 - lectures MF 10-10:50
    choose 1 seminar section: CRN 26578 or CRN 26579
                              W 10-10:50 am
========

*   one of the so called "basic structure" of programming
    is BRANCHING, conditional, if-then;

    ...only do something IF something is true;

*   most programming languages have at least one and
    sometimes more branching operations;

    Scheme has at least 2, we are jumping right
    to its cond, or conditional, statement

*   syntax:

    (cond 
        [bool-expr1 result-expr1]
        [bool-expr2 result-expr2]
        ...
        [else else-result-expr]
    )
 
    semantics:
    *   each [... ...] is a branch
    *   Scheme tries EACH branch's bool-expr UNTIL it
        finds a true one --

	when it does, that branch's result is THE result
	for this cond expression, and the expression is
	DONE
	*   (you NEVER reach the other branches)

        *   if none are true, you get the else-result-expr

*   see examples in Scheme posted examples;